Provided by: The International Journal of Innovative Research in Computer and Communication Engineering
Topic: Enterprise Software
Date Added: Jun 2015
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 paper 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 scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor's traffic, while the intersection navigation mechanism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion.