Simulation of a Secure Efficient Dynamic Routing In Wireless Sensor Network
Shobha.K1, Mamatha Jadhav.V2
1Mrs. Shobha. K, P.G Student Department of Computer Science at Msrit Bangalore, India.
2Prof. Mamatha Jadhav. V, Assistant Professor Department of Computer Science at Msrit Bangalore, India.
Manuscript received on May 14, 2013. | Revised Manuscript received on June 03, 2013. | Manuscript published on June 30, 2013. | PP: 258-263 | Volume-2, Issue-5, June 2013. | Retrieval Number: E1783062513/2013©BEIESP

Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Wireless Sensor networks have features like low cost, flexibility, fault tolerance, high sensing fidelity, creating many new and exciting application areas for remote sensing. So, wireless sensor network has emerged as a promising tool for monitoring the physical world with wireless sensor that can sense, process and communicate. There are many issues of wireless sensor network which need to be addressed .So took up one of the idea to use OSPF for secure efficient dynamic routing in wireless sensor network. The protocols that are being used till date are not efficient enough in matter of the time taken for the transferring the message from one node to another. So this project provides secure efficient dynamic routing in wireless sensor network. The protocols that are being used just provide a data packet transfer without any proper time. With the implementation of open shortest path first protocol we can get a better routing path for with least cost path. Thus the implementation of this can give a better view in the data packet transferring. The Simulation of Secure Efficient Dynamic Routing in Wireless sensor network has been implemented using dijkstra’s algorithm for finding shortest path between the nodes. For providing security to the messages DES algorithm is used. The messages are encrypted and decrypted using this algorithm in order to provide security. User can be able to create number of nodes in the network. User can be able to send the packets using shortest path so that it reaches fast. User can also able to view the Routing Table at each node. User can also be able to view different nodes placed with their Node location and Node id. So from the Implementation it can be conclude that the proposed technique is very cost effective, secure and simpler to configure. From the performance Analysis it is clear that OSPF Routing in Wireless Sensor Networks is Very cost effective and more number of packets can be sent.
Keywords: Open Shortest Path First (OSPF), Link-State Packets, Backbone Area of OSPF, Area Border Routers (ABRs).