GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Hello Protocols for Ad-Hoc Networks: Overhead and Accuracy Tradeoffs
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
| Hi-index | 0.00 |
The void problem causing the routing failure is the main challenge of the greedy routing in the wireless sensor networks. The current research work still can not fully deal with the void problem since the excessive control overheads should be consumed so as to guarantee the delivery of packets. In our previous work, 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 rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node under the UDG network. However, the realization of the GAR scheme is not trivial since there can be considerable efforts required in order to realize the continuous rolling ball mechanism of the RUT scheme. In this paper, the boundary map (BM) and the indirect map searching (IMS) scheme are therefore proposed as efficient algorithms for the realization of the RUT technique. After the realization of the GAR protocol, the extensive simulations are conducted and compared with the existing localized routing algorithms. The simulation results show that the proposed GAR protocol can provide better routing efficiency.