Title
Coverage and connectivity in three-dimensional underwater sensor networks
Abstract
Unlike a terrestrial network, an underwater sensor network can have significant height which makes it a three-dimensional network. There are many important sensor network design problems where the physical dimensionality of the network plays a significant role. One such problem is determining how to deploy minimum number of sensor nodes so that all points inside the network is within the sensing range of at least one sensor and all sensor nodes can communicate with each other, possibly over a multi-hop path. The solution to this problem depends on the ratio of the communication range and the sensing range of each sensor. Under sphere-based communication and sensing model, placing a node at the center of each virtual cell created by truncated octahedron-based tessellation solves this problem when this ratio is greater than 1.7889. However, for smaller values of this ratio, the solution depends on how much communication redundancy the network needs. We provide solutions for both limited and full communication redundancy requirements. Copyright © 2008 John Wiley & Sons, Ltd.
Year
DOI
Venue
2008
10.1002/wcm.v8:8
Wireless Communications and Mobile Computing
Keywords
Field
DocType
three dimensional,polyhedron,connectivity,coverage
Sensor node,Key distribution in wireless sensor networks,Computer science,Visual sensor network,Sensor array,Brooks–Iyengar algorithm,Redundancy (engineering),Mobile wireless sensor network,Wireless sensor network,Distributed computing
Journal
Volume
Issue
ISSN
8
8
1530-8669
Citations 
PageRank 
References 
21
1.05
10
Authors
2
Name
Order
Citations
PageRank
S. M. Nazrul Alam11577.81
Zygmunt J. Haas25034607.63