Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
On k-connectivity for a geometric random graph
Random Structures & Algorithms
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
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Combinatorics, Probability and Computing
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
SensorFlock: an airborne wireless sensor network of micro-air vehicles
Proceedings of the 5th international conference on Embedded networked sensor systems
High delivery rate position-based routing algorithms for 3D ad hoc networks
Computer Communications
Emergency guiding and monitoring applications in indoor 3D environments by wireless sensor networks
International Journal of Sensor Networks
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
| Hi-index | 0.00 |
Geographic routing, an attractive routing solution for wireless ad hoc networks, has been studied extensively in two-dimensional environments. However, three-dimensional space has proven to be much more challenging, with only a few existing proposals. In this paper, we present Slab Routing - a novel projection based method that adapts two-dimensional geographic face routing techniques to three-dimensional space, avoiding flooding and preserving route optimality properties. Slab Routing accomplishes this by dynamically creating a space partition, which we call a slab, and executing face routing over the planar projected graph of nodes contained within. While the adaptation does not guarantee delivery, we provide an analysis of the conditions required to achieve a desired delivery probability and verify the results through simulation.