A heuristic approach for K-coverage extension with energy-efficient sleep scheduling in sensor networks

Authors:
Kenji Leibnitz;Indika Suranjith Abeyweera;Naoki Wakamiya;Masayuki Murata
Affiliations:
Osaka University, Suita, Osaka, Japan;Osaka University, Suita, Osaka, Japan;Osaka University, Suita, Osaka, Japan;Osaka University, Suita, Osaka, Japan
Venue:
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Year:
2008

Citing 8
Cited 0

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Self-Organizing Maps

Self-Organizing Maps
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration for energy conservation in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Event-driven sensor deployment using self-organizing maps

International Journal of Sensor Networks
Coverage problems in wireless sensor networks: designs and analysis

International Journal of Sensor Networks
Coverage-Aware sensor engagement in dense sensor networks

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of coverage in a wireless sensor network where nodes already have been previously deployed. Our goal is to design an efficient strategy to add further nodes for achieving a certain target K-coverage throughout the entire monitoring region. A heuristic approach based on a dynamic model resembling gas bubbles is applied to solve this problem. Once the additional coverage has been reached, each node uses a self-organizing mechanism to determine its sleep schedule, depending on the activity of its surrounding nodes.