期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：6
DOI：10.15680/ijircce.2015.0306232
出版社：S&S Publications
摘要：The unreachability problem (i.e., the so-called void problem) that exists in the greedy routing algorithmshas been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the voidproblem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption ofcontrol overheads.Moreover, the hop count reduction scheme is utilized as a short-cutting technique to reduce the routing hops bylistening to the neighbor’s traffic, while the intersection navigation mechanism is proposed to obtain the best rollingdirection 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 partialUDG construction (PUC) mechanism is proposed to transform the non-UDG into UDG setting for a portion of nodesthat facilitate boundary traversal. These three schemes are incorporated within the GAR protocol to further enhance therouting performance with reduced communication overhead. The proofs of correctness for the GAR scheme are alsogiven in this paper.
