Abstract
For 3D sensor networks to monitor the ocean, forest and aerosphere, etc., sensors can forward their data to the base station by greedy routing. It is critical to quantitatively greedy routing’s deliverability for evaluating network’s functionality and performance. The probability that all sensors can successfully send their data to the base station by greedy routing is usually modeled as the probability of guaranteed delivery. For a typical spherical cap 3D sensor network deployment scenario where nodes follow a homogeneous Poisson point process, the relationship between the sensor transmission radius and the probability of guaranteed delivery is studied, and a tight analytical upper bound on the sensor transmission radius to ensure the designed deliverability probability is derived in this paper. The correctness and tightness of the derived upper bound are verified by extensive simulations.
Similar content being viewed by others
References
Akyildiz I F, Pompili D, Melodia T. Underwater acoustic sensor networks: research challenges. Ad Hoc Netw, 2005, 3: 257–279
Vasilescu I, Kotay K, Rus D, et al. Data collection, storage, and retrieval with an underwater sensor network. In: Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems. New York: ACM, 2005. 154–165
Partan J, Kurose J, Levine B N. A survey of practical issues in underwater networks. In: Proceedings of the 1st ACM International Workshop on Underwater Networks. New York: ACM, 2007. 17–24
Syed A A, Ye W, Heidemann J. T-lohi: A new class of mac protocols for underwater acoustic sensor networks. In: Proceedings of the 27th Conference on Computer Communications, Phoenix, 2008. 231–235
Hsu C C, Lai K F, Chou C F, et al. St-mac: Spatial-temporal mac scheduling for underwater sensor networks. In: Proceedings of the 28th Conference on Computer Communications, Rio de Janeiro, 2009. 1827–1835
Lee U, Wang P, Noh Y, et al. Pressure routing for underwater sensor networks. In: Proceedings of the 29th Conference on Computer Communications, San Diego, 2010. 1–9
Petrioli C, Petroccia R, Shusta J, et al. From underwater simulation to at-sea testing using the ns-2 network simulator. In: OCEANS 2011, Santander, 2011. 1–9
Zhou Z, Cui J H, Zhou S L. Efficient localization for large-scale underwater sensor networks. Ad Hoc Netw, 8, 2010: 267–279
Zhou Z, Peng Z, Cui J-H, et al. Scalable localization with mobility prediction for underwater sensor networks. IEEE Trans Mob Comput, 2011, 10: 335–348
Frey H, Stojmenovic I. On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking. New York: ACM, 2006. 390–401
Durocher S, Kirkpatrick D, Narayanan L. On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wirel Netw, 2010, 1: 227–235
Xing G L, Lu C Y, Pless R, et al. On greedy geographic routing algorithms in sensing-covered networks. In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM, 2004. 31–42
Wan P J, Yi C W, Yao F, et al. Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. In: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM, 2006. 25–36
Wang L X, Yi C W, Yao F. Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM, 2008. 131–138
Yang Y L, Li Y J, Hou M S. Many-to-one deliverability of greedy routing in 2-d wireless sensor networks. In: Proceedings of the 30th Conference on Computer Communications, Shanghai, 2011. 2777–2785
Wang Y, Yi C W, Li F. Delivery guarantee of greedy routing in three dimensional wireless networks. In: Proceedings of the 3rd International Conference on Wireless Algorithms, Systems, and Applications, Dallas, 2008. 4–16
Li Y J, Yang Y L. Deliverability of greedy routing in underwater sensor networks. In: Proceedings of the 2nd International Conference on Computer Engineering and Technology, Vol. 2, Chengdu, 2010. 130–134
Ross S M. Introduction to Probability Models. 9th ed. Academic Press, 2006
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hou, M., Yang, Y. & Li, Y. Deliverability analysis of greedy routing in the spherical cap 3D sensor networks. Sci. China Inf. Sci. 56, 1–12 (2013). https://doi.org/10.1007/s11432-013-4811-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-013-4811-z