Abstract
Sensor node coverage problem should be considered in 3D-space with the WSN deployed in atmosphere and underwater. In this paper, we focus on the effective coverage algorithm of sensor nodes in 3D networks, the analysis of the space-filling polyhedrons indicated that space-filling based on truncated octahedral is most effective. By the structure characteristics of filling space by Hexagonal Prism, Rhombic Dodecahedron and truncated octahedral, we provided the improved algorithm of cumulating the coordinate of nodes based on 3D mesh and simulated by MATLAB which confirmed there need least nodes by the coverage based on truncated octahedral. Meanwhile, the simulation results shows that the proposed algorithm is faster compared with the traditional calculating coordinate method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fan Gao-juan, Wang Ru-chuan, Huang Hai-ping et al (2011) Tolerable coverage area based node scheduling algorithm in wireless sensor networks[J]. Acta Electronica Sinica 39(1):89–94
Zhanglihong, Chenshuqian (2011) Simulation of coverage algorithm in wireless sensor networks. Comput Simulat 28(4):119–122
Wuyongan, Yinjianping, Limin, Zhuen, Caizhiping (2008) Algorithms for the minimal connected k-coverage set problem under probabilistic sensing models in directional sensor networks. Comput Eng Sci 30(12):19–22
Akyildiz IF, Pompili D, Melodia T (2005) Underwater acoustic sensor networks: research challenges. Ad Hoc Networks J 3:257–279
John Heidemann, Wei Ye, Jack Wills, Affan Yuan Li (2006) Research challenges and applications for underwater sensor networking. IEEE communications and networking conference. Las Vegas, Nevada, USA
Jiejun Kong, Jun-hong Cui, Dapeng Wu, Mario Gerla (2005) Building underwater ad-hoc networks and sensor networks for large scale real-time aquatic applications. IEEE military communications conference (MILCOM’05), 17–20 Oct., Atlantic City, NJ, USA
Nazrul Alam SM, Haas ZJ (2006) Coverage and connectivity in three-dimensional networks. MobiCom’06, September 23–29, Los Angeles, California, USA
Weyl H (1952) Symmetry. Princeton University Press, Princeton, NJ
Thomson, Sir William (Lord Kelvin) (1887) On the division of space with minimum partition area. Philosophical Magazine, 24:503–514. http://zapatopi.net/kelvin/papers/on_the_division_of_space.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Tang, M., Wan, Q., Li, J., Xiang, Y. (2014). A Three-Dimensional Space Coverage Algorithm in Wireless Sensor Networks. In: Zhang, B., Mu, J., Wang, W., Liang, Q., Pi, Y. (eds) The Proceedings of the Second International Conference on Communications, Signal Processing, and Systems. Lecture Notes in Electrical Engineering, vol 246. Springer, Cham. https://doi.org/10.1007/978-3-319-00536-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-00536-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00535-5
Online ISBN: 978-3-319-00536-2
eBook Packages: EngineeringEngineering (R0)