A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Localization and coverage for high density sensor networks
Computer Communications
Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks
IEEE Transactions on Mobile Computing
IEEE Communications Magazine
Efficient algorithm for serial data fusion in wireless sensor networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
Besides of its high efficiency, in particular its scalability, geographic greedy routing is of a memoryless nature (i.e., nodes do not maintain any routing tables) which makes it well suitable for large-scale sensor networks with limited resources. Nevertheless, the occurrence of local minimum phenomenon, especially in networks with many holes, limits considerably the applicability of such routing protocol. The local minimum situations occur when the packet could not be delivered by the current node based only on distance to the destination. This problem has been tackled in previous research works to guarantee packets delivery by routing around the boundaries of the hole but at an excessive consumption of control overheads. In this paper, we propose and study a novel approach that is of memoryless nature and performs better that the state-of-art approaches in terms of guarantying packet delivery and deriving efficient routing paths. We provide in this paper proofs of its correctness (guarantying packet delivery) whereas showing, through simulations, its performance effectiveness in terms of reducing routing paths.