Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Extremal Properties of Three-Dimensional Sensor Networks with Applications
IEEE Transactions on Mobile Computing
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
Lower and Upper Bounds for Minimum Energy Broadcast and Sensing Problems in Sensor Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Maintaining differentiated coverage in heterogeneous sensor networks
EURASIP Journal on Wireless Communications and Networking
Self Distributed Query Region Covering in Sensor Networks
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Application Oriented Multi Criteria Optimization in WSNs Using on AHP
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Connectivity and sensing coverage are two fundamental concepts in the design of wireless sensor networks (WSNs). In this paper, we investigate the relationship between coverage and connectivity for k-covered WSNs (kCWSN), where every point in a field of interest is covered by at least k sensors. Furthermore, we compute the connectivity of kCWSN based on the degree of sensing coverage. We also propose measures of fault tolerance for kCWSN based on network connectivity and sensing coverage. Random distributions of the sensors in a field have been widely used in most of sensor networking protocols, in spite of the fact that these deployment techniques do not always provide complete, void-free coverage. On the contrary, we consider both deterministic and random sensor deployment strategies to meet coverage degree requirements of sensing applications. Using our Augmented Equilateral Triangle (AET) model, we prove that if the sensing coverage degree is k and R ≥ 2 × r , the network connectivity is higher than k. Precisely, our analysis of the geometric properties of deterministic sensor deployment strategies, demonstrates that sensing k-coverage and R ≥ √3 × r yield kCWSN connectivity that is higher than k. These findings are of practical use for network designers to build up sensing applications with prescribed degrees of sensing coverage, network connectivity and fault tolerance.