Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
IEEE Transactions on Computers
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
On k-coverage in a mostly sleeping sensor network
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
Energy Efficient Differentiable Coverage Service Protocols for Wireless Sensor Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
IEEE Transactions on Computers
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
On the upper bound of α-lifetime for large sensor networks
ACM Transactions on Sensor Networks (TOSN)
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Coverage by randomly deployed wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The coverage problem in a wireless sensor network
Mobile Networks and Applications
MoteTrack: a robust, decentralized approach to RF-based location tracking
Personal and Ubiquitous Computing
Movement-assisted sensor redeployment scheme for network lifetime increase
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Relay sensor placement in wireless sensor networks
Wireless Networks
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
IEEE Transactions on Parallel and Distributed Systems
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Unreliable sensor grids: coverage, connectivity and diameter
Ad Hoc Networks
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
Sensor network coverage restoration
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
Energy-efficient deployment of Intelligent Mobile sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks
ACM Transactions on Sensor Networks (TOSN)
Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks
IEEE Journal on Selected Areas in Communications
Autonomous deployment of heterogeneous mobile sensors
ICNP '09 Proceedings of the 2009 17th IEEE International Conference on Network Protocols. ICNP 2009
| Hi-index | 0.00 |
The problem of coverage is a fundamental issue in wireless sensor networks. In this article, we consider two subproblems: k-coverage contour evaluation and k-coverage rate deployment. The former aims to evaluate, up to k, the coverage level of any location inside a monitored area, while the latter aims to determine the locations of a given set of sensors to guarantee the maximum increment of k-coverage rate when they are deployed into the area. For the k-coverage contour evaluation problem, a nonuniform-grid-based approach is proposed. We prove that the computation cost of our approach is at most the square root of existing solutions. Based on our k-coverage contour evaluation scheme, a greedy k-coverage rate deployment scheme (k-CRD) is proposed, which is shown to be an order faster than existing studies for k-coverage rate deployment. The k-CRD can incorporate two different heuristics to further reduce its running time. Simulation results show that k-CRD with these heuristics can be significantly more time efficient without causing much degradation in the coverage rate of final deployment.