A New Approach for Beaconless Geographical Routing in Wireless Sensor Networks
International journal of computer networks and communications security
Lately geographic routing algorithms applicable for large scaled in sensor network. In existing geographic routing algorithms, the packet is sent to neighbor that closest to destination by using a greedy forwarding scheme. Whereas to access the neighbor's position requires that a mechanism beaconing periodically. So in the sensor network with highly dynamic topology the communication overhead is increased. Therefore, many beaconless geographic routing has been introduced recently. In this paper
... a novel approach for beaconless geographic routing (NBGR) is proposed. NBGR acts in two modes: a main mode and recovery mode. In the main mode three kinds of control message RTS, CTS and SELECT is used. Thus a forwarder node broadcast an RTS and sets a timer. The neighbors in the positive progress area (PPA) that receive the RTS set a timer with appropriate delay function independently. So that the closest neighbor to destination responds first. This process is continued until the packet has received to node that don't have any neighbor in its PPA, then routing shifted into recovery mode. In Recovery mode the packet is sent to the destination by traversing on the face of planar graph such as a relative neighborhood graph (RNG) or Gabriel graph (GG). We show in NBGR the packet delivery ratio is improved than same algorithms such as BLR and CBF as well, according to the new delay function the energy of nodes are applied in a balanced way and the possibility of collision of CTS send back the forwarder node is decreased considerably. Also in NBGR the based on the selections from the suitable forwarding area the probability of the void area problem is minimized.