期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：4
出版社：S.S. Mishra
摘要：In this paper the solution to the void problem is taken up as the issue. This situation which exists in the currently existing greedy routing algorithms has been studied for the wireless sensor networks. The GAR protocol is a new protocol proposed here to guarantee the delivery of packets and excessive consumption of control overheads is resolved. This protocol is a combination of the GF algorithm and the RUT scheme. In RUT scheme the usage of Boundary Map concept increases the speed and efficiency in finding the nodes which will aid for a faster and a guaranteed delivery. To enhance this protocol's functionality we g o in for three mechanisms that can also be implemented in this project. 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, the intersection navigation (IN) mechan ism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion. 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 Project.
关键词：Greedy routing; void problem; unit disk graph; localized algorithm; wireless sensor network
