Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Hi-index | 0.00 |
Routing is the foremost issue in mobile ad hoc networks (MANETs) and sensor networks. To guarantee delivery and improve performance, most position-based routing protocols are based on face routing, which requires the underlying network to be a planar graph. Localized planar graph construction requires the radio model to be a unit disk graph and it is only applicable to two-dimensional networks. This paper presents an efficient force-based geometric routing algorithm which is applicable to general network models and has a worst-case bound for arbitrary three-dimensional networks.