Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks

• Najme Ghanbari
• Mohammad Reza Pourmir

The unreachability problem (i.e., the so-called void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the void problem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption of control overheads. Moreover, the hop count reduction (HCR) scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor’s traffic, while the intersection navigation (IN) mechanism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion. In order to maintain the network requirement of the proposed RUT scheme under the non-UDG networks, the partial UDG construction (PUC) mechanism is proposed to transform the non-UDG into UDG setting for a portion of nodes that facilitate boundary traversal. These three schemes are incorporated within the GAR protocol to further enhance the routing performance with reduced communication overhead. The proofs of correctness for the GAR scheme are also given in this paper.

Select Volume / Issue:

• Volume 1,Issue 2, Nov. 2014

Year:

2014

Type of Publication:

Article

Keywords:

Wireless Sensor Networks; Greedy Routing Algorithms; Hop Count Reduction HCR; Intersection Navigation IN

Journal:

IJASM

Volume:

1

Number:

2

Pages:

57-59

Month:

November