DocumentCode
2789587
Title
Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks
Author
Doohan, Nitika Vats ; Mishra, Durgesh Kumar ; Tokekar, Sanjiv
Author_Institution
S.D. Bansal Coll. of Technol., Indore, India
fYear
2011
fDate
4-6 Nov. 2011
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
routing protocols; transport protocols; wireless sensor networks; SPRP; TCP/IP; WSN; data centric wireless sensor networks; shortest path routing protocol; Complexity theory; Energy efficiency; Floods; Routing; Wireless sensor networks; Dijkstra´s Algorithm; NLT; OSPF; RIP; SPRP; WSNs;
fLanguage
English
Publisher
ieee
Conference_Titel
Internet (AH-ICI), 2011 Second Asian Himalayas International Conference on
Conference_Location
Kathmandu
ISSN
2157-0647
Print_ISBN
978-1-4577-1087-2
Type
conf
DOI
10.1109/AHICI.2011.6113925
Filename
6113925
Link To Document