Abstract
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 n over 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdallah, A., Fevens, T., Opatrny, J.: Power-aware 3D position-based routing algorithm for ad hoc networks. In: Proc. of IEEE ICC (2007)
Akyildiz, I.F., Pompili, D., Melodia, T.: Underwater acoustic sensor networks: research challenges. Ad Hoc Networks 3(3), 257–279 (2005)
Alam, S.M.N., Haas, Z.J.: Coverage and connectivity in three-dimensional networks. In: Proc. of ACM Mobicom (2006)
Baccelli, F., Bremaud, P.: Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences. Springer, Heidelberg (2003)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. ACM/Kluwer Wireless Networks 7(6) (2001)
Durocher, S., Kirkpatrick, D., Narayanan, L.: On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 546–557. Springer, Heidelberg (2008)
Kao, G., Fevens, T., Opatrny, J.: Position-based routing on 3D geometric graphs in mobile ad hoc networks. In: Proc. of CCCG 2005 (2005)
Karp, B., Kung, H.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proc. of the ACM Int’l Conf. on Mobile Computing and Networking (2000)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In: Proc. of ACM MobiHoc (2003)
Pompili, D., Melodia, T.: Three-dimensional routing in underwater acoustic sensor networks. In: Proceedings of ACM PE-WASUN 2005, Montreal, Canada (October 2005)
Ravelomanana, V.: Extremal properties of three-dimensional sensor networks with applications. IEEE Transactions on Mobile Computing 3(3), 246–257 (2004)
Wan, P.-J., Yi, C.-W., Yao, F., Jia, X.: Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. In: Proc. of ACM Mobihoc (2006)
Wang, Y., Li, F., Dahlberg, T.: Power efficient 3-dimensional topology control for ad hoc and sensor networks. In: Proc. of IEEE GlobeCom (2006)
Xie, P., Cui, J.-H., Lao, L.: VBF: Vector-based forwarding protocol for underwater sensor networks. In: Proceedings of IFIP Networking 2006 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Yi, CW., Li, F. (2008). Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)