期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2011
卷号：2
期号：5
页码：1881-1886
出版社：TechScience Publications
摘要：In wireless networks comprised of numerous mobile stations, the routing problem of finding paths from a traffic source to a destination through a series of intermediate forwarding nodes is particularly challenging. Some of the current research works cannot fully resolve the void problem, while there exists other schemes that can guarantee the delivery of packets with the excessive consumption of control overhead. The unreachability problem (i.e. the so called void problem) that exists in the greedy routing algorithm in wireless sensor networks. In this paper, a greedy anti void routing (GAR) protocol is proposed to solve the void problem with increased routing efficiency by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed RUT is employed to completely guarantee the delivery of packets from source to destination node under the UDG network. The Boundary Mapping (BM) and Indirect Map Searching (IMS) schemes are proposed as efficient algorithms for the realization of the RUT technique. Comparing with the existing localized routing algorithms the simulation result shows that the proposed GAR based protocols can provide better routing efficiency
