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
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 12th annual international conference on Mobile computing and networking
Coverage and connectivity in three-dimensional networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Protocol Design for Dynamic Delaunay Triangulation
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Rendered path: range-free localization in anisotropic sensor networks with holes
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Practical 3D geographic routing for wireless sensor networks
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Greedy Distance Vector Routing
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Almost all geographic routing protocols have been designed for 2D. We present a novel geographic routing protocol, named MDT, for 2D, 3D, and higher dimensions with these properties: (i) guaranteed delivery for any connected graph of nodes and physical links, and (ii) low routing stretch from efficient forwarding of packets out of local minima. The guaranteed delivery property holds for node locations specified by accurate, inaccurate, or arbitrary coordinates. The MDT protocol suite includes a packet forwarding protocol together with protocols for nodes to construct and maintain a distributed MDT graph for routing. We present the performance of MDT protocols in 3D and 4D as well as performance comparisons of MDT routing versus representative geographic routing protocols for nodes in 2D and 3D. Experimental results show that MDT provides the lowest routing stretch in the comparisons. Furthermore, MDT protocols are specially designed to handle churn, i.e., dynamic topology changes due to addition and deletion of nodes and links. Experimental results show that MDT's routing success rate is close to 100% during churn and node states converge quickly to a correct MDT graph after churn.