GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Extremal Properties of Three-Dimensional Sensor Networks with Applications
IEEE Transactions on Mobile Computing
Three-dimensional routing in underwater acoustic sensor networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Coverage and connectivity in three-dimensional 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
VBF: vector-based forwarding protocol for underwater sensor networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Energy-efficient restricted greedy routing for three dimensional random wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we investigate how to design greedy routing to guarantee packet delivery in a three-dimensional (3D) network. In 2D networks, many position-based routing protocols apply face routing on planar routing structure as a backup method to guarantee packet delivery when greedy routing fails at local minimum. However, in 3D networks, no planar topology can be constructed anymore. Even worse, a recent result [6] showed that there is no deterministic localized routing algorithm that guarantees the delivery of packets in 3D networks. Therefore, we propose to set up the transmission radius large enough to eliminate local minimum in the 3D network. In particular, we study the asymptotic critical transmission radius for greedy routing to ensure the packet delivery in randomly deployed 3D networks. Using similar techniques in [12], we theoretically prove that for a 3D network, formed by nodes that are produced by a Poisson point process of density nover a convex compact region of unit volume, $\sqrt[3] {\frac{3\beta_0 \ln n}{4\pi n}}$ is asymptotically almost surely (abbreviated by a.a.s.) the threshold of the critical transmission radius for 3D greedy routing, where β0= 3.2. We also conduct extensive simulations to confirm our theoretical results.