Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks

• Published in: 2011 Second Asian Himalayas International Conference on Internet (AH-ICI) pp. 1 - 4
• Main Authors: Doohan, N. V., Mishra, D. K., Tokekar, S.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2011
• Subjects: Complexity theory; Dijkstra's Algorithm; Energy efficiency; Floods; NLT; OSPF; RIP; Routing; SPRP; Wireless sensor networks; WSNs
• ISBN: 9781457710872; 1457710870
• ISSN: 1089-7801; 1941-0131
• DOI: 10.1109/AHICI.2011.6113925

Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach "Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)" which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstra's algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.