GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
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
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
A Comparison of Wireless Sensor Network Routing Protocols on an Experimental Testbed
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops - Volume 02
Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Context-aware geographic routing for sensor networks with routing holes
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Hi-index | 0.24 |
As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms to fail. In this paper, we introduce a novel concept: virtual position to address this issue. A virtual position is the middle position of all direct neighbors of a node. Such virtual position reflects the neighborhood of a sensor node, as well as the tendency of further forwarding. Instead of comparing nodes' real geographic positions, virtual positions are compared when selecting the next hop. For sparsely-deployed networks, this technique increases success rate of packet routing without introducing significant overhead. We here present an algorithm using this foundation concept and then design several enhanced versions to improve success rate of packet routing in sensor networks. We also conduct complexity analysis of the algorithms and support our claims of the algorithms' superiority with extensive simulation results.