Routing Protocol For Wireless Sensor Networks

There have been several geographic routing protocols proposed for disseminating data in Wireless Sensor Networks. In these protocols, routing is based on the location of neighboring nodes and the selection of the next hop is done based on a direction based or a location based strategy. In this paper, a novel routing protocol that makes use of this direction based strategy to disseminate data in the shortest possible time is proposed. The protocol uses minimal amount of storage to determine the next hop in the shortest amount of time possible. Simulation results obtained using the Castalia simulator show the efficiency of the proposed protocol over the standard geographic protocol GPSR. The past decade has witnessed a growing interest in sensor Networks. There have been many applications in growing nwnber of domains for WSN. Some of these applications are eminently critical and require delay aware mechanisms. Some of them are military, health, surveillance, monitoring etc. But some of the limited resources like low battery power, relatively low processor capability, small antenna height etc are challenges to be considered while proposing an mechanism for WSN There have been routing protocols designed keeping these challenges in mind, but special emphasis has been paid to reduce energy conswnption. This has lead to approaches like tree construction, sleep/awake schedules and probabilistic forwarding, all of which can prove to be costly in terms of delay. But in contrast to these approaches, geographic routing protocols take decisions locally based on the location of their neighbors. They are generally robust to topology changes and energy efficient. There are two approaches to geographic routing, namely distance based approach and direction based approach. The former selects the next hop as the neighbor closest to the sink, whereas the latter approach selects the node with the minimwn deviation angle from the line connecting that node and the sink or the required destination node. The proposed work is based on the direction based strategy. Generally protocols using the distance based strategy fail in the presence of voids. The usual recovery procedure is the right hand rule, which is very costly in terms of delay. Hence DAMGPSR is proposed which stores a minimal amount of