GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual 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
Pressure routing for underwater sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
A number of geometric routing algorithms have been studied. Most of algorithms are for 2D wireless networks, which cannot be directly applied to 3D wireless networks. In this paper, we study the guaranteed delivery in 3D wireless networks. We propose a series of routing algorithms by the iteration of specific angles on the Delaunay Triangulation network in 3D space, and prove that the proposed routing algorithms guarantee the certainty of data transmission. In our algorithms, the messages only need to carry information of O(1) nodes and each node just keeps 1-hop neighbors' information. Simulation results show that our algorithms outperform Compass Routing I and greedy-random-greedy method in 3D Delaunay Triangulation networks.