Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing for wireless networks
Geographic routing for wireless networks
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
A geographic routing hybrid approach for void resolution in wireless sensor networks
Journal of Systems and Software
| Hi-index | 0.00 |
Geographic routing is an attractive choice for routing data in wireless sensor networks because of lightweight and scalable characteristics. Most geographic routing approaches combine a greedy forwarding scheme and a void resolution method to detour a void area that has no active sensor. The previous solutions, including the well-known GPSR protocol, commonly use the right-hand rule for void resolution. However, the detour path produced by the right-hand rule is not energy-efficient in many cases. In this paper, we propose a new void resolution method, called void resolution-forwarding, which can overcome voids in the sensor network energy-efficiently. It exploits the quadrant-level right-hand rule to select the next hop for the current node during circumventing a void area. We show by experiments that the proposed method is efficient and scalable with respect to the various voids and network density and that it outperforms the GPSR protocol significantly.