Mission-oriented k-coverage in mobile wireless sensor networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A genetic algorithm for constructing a reliable MCDS in probabilistic wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Transactions on Sensor Networks (TOSN)
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
| Hi-index | 0.00 |
Coverage is an essential task in sensor deployment for the design of wireless sensor networks. While most existing studies on coverage consider homogeneous sensors, the deployment of heterogeneous sensors represents more accurately the network design for real-world applications. In this paper, we focus on the problem of connected k-coverage in heterogeneous wireless sensor networks. Precisely, we distinguish two deployment strategies, where heterogeneous sensors are either randomly or pseudo-randomly distributed in a field. While the first deployment approach considers a single layer of heterogeneous sensors, the second one proposes a multi-tier architecture of heterogeneous sensors to better address the problems introduced by pure randomness and heterogeneity.