On optimal space tessellation with deterministic deployment for coverage in three-dimensional wireless sensor networks

Authors:
Manas Kumar Mishra;M. M. Gore
Affiliations:
Department of Computer Science S Engineering, Motilal Nehru National Institute of Technology, Allahabad, India;Department of Computer Science S Engineering, Motilal Nehru National Institute of Technology, Allahabad, India
Venue:
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Year:
2010

Citing 9
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
On k-coverage in a mostly sleeping sensor network

Proceedings of the 10th annual international conference on Mobile computing and networking
Probabilistic Coverage in Wireless Sensor Networks

LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Coverage and connectivity in three-dimensional networks

Proceedings of the 12th annual international conference on Mobile computing and networking
3D Wireless Sensor Network Modeling and Simulation

SENSORCOMM '07 Proceedings of the 2007 International Conference on Sensor Technologies and Applications
Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
Promoting Heterogeneity, Mobility, and Energy-Aware Voronoi Diagram in Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Coverage and connectivity in three-dimensional underwater sensor networks

Wireless Communications & Mobile Computing - Underwater Sensor Networks: Architectures and Protocols
Clustering-based minimum energy wireless m-connected k-covered sensor networks

EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coverage is one of the fundamental issues in Wireless Sensor Networks. It reflects how well the service volume is monitored or tracked by its participant sensors. Sensing ranges of nodes are assumed to be of spherical shape, which do not tessellate space. To address this problem, we need to model the sensing range of nodes as space tessellating polyhedra. In this paper, we analyze four such polyhedra, the Cube, Hexagonal Prism, Rhombic Dodecahedron, and Truncated Octahedron based on the number of nodes needed for tessellation, amount of overlapping achieved, and symmetry of lattice. We defined a trade off ratio between the amount of overlapping achieved and the number of nodes deployed. We used this ratio to identify Rhombic Dodecahedron as the polyhedron model for optimal 1-coverage. We also show the scalability of this polyhedron model for K-coverage with deterministic deployment.