A Heuristic Approach for K-Coverage Extension with Energy-Efficient Sleep Scheduling in Sensor Networks

Kenji Leibnitz; Indika Suranjith Abeyweera; Naoki Wakamiya; Masayuki Murata

1st International ICST Workshop on Technologies for Ambient Information Society

Research Article

A Heuristic Approach for K-Coverage Extension with Energy-Efficient Sleep Scheduling in Sensor Networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/ICST.BIONETICS2008.4716,
    author={Kenji Leibnitz and Indika Suranjith Abeyweera and Naoki Wakamiya and Masayuki Murata},
    title={A Heuristic Approach for K-Coverage Extension with Energy-Efficient Sleep Scheduling in Sensor Networks},
    proceedings={1st International ICST Workshop on Technologies for Ambient Information Society},
    publisher={ACM},
    proceedings_a={TAIS},
    year={2010},
    month={5},
    keywords={Sensor network deployment K-coverage sleep scheduling},
    doi={10.4108/ICST.BIONETICS2008.4716}
}

Kenji Leibnitz
Indika Suranjith Abeyweera
Naoki Wakamiya
Masayuki Murata
Year: 2010
A Heuristic Approach for K-Coverage Extension with Energy-Efficient Sleep Scheduling in Sensor Networks
TAIS
ICST
DOI: 10.4108/ICST.BIONETICS2008.4716

Kenji Leibnitz¹^,*, Indika Suranjith Abeyweera¹^,*, Naoki Wakamiya¹^,*, Masayuki Murata²^,*

1: Osaka University, Graduate School of Information Science and Technology, 1-5 Yamadaoka, Suita, Osaka, 565-0871 Japan.
2: Osaka University, Graduate School of Information Science and Technology 1-5 Yamadaoka, Suita, Osaka, 565-0871 Japan

*Contact email: leibnitz@ist.osaka-u.ac.jp, a-indika@ist.osaka-u.ac.jp, wakamiya@ist.osaka-u.ac.jp, murata@ist.osaka-u.ac.jp

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.

Keywords: Sensor network deployment K-coverage sleep scheduling

Published: 2010-05-16
Publisher: ACM
Modified: 2010-05-16

: http://dx.doi.org/10.4108/ICST.BIONETICS2008.4716