2nd International IEEE Conference on Communication System Software and Middleware

Research Article

Efficient Scheduling of Sensor Activity for Information Coverage in Wireless Sensor Networks

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1109/COMSWA.2007.382425,
    author={Amar P. Azad and A. Chockalingam and Sumit Vashistha},
    title={Efficient Scheduling of Sensor Activity for Information Coverage in Wireless Sensor Networks},
    proceedings={2nd International IEEE Conference on Communication System Software and Middleware},
    publisher={IEEE},
    proceedings_a={COMSWARE},
    year={2007},
    month={7},
    keywords={Sensor activity scheduling  information coverage  network lifetime  physical coverage},
    doi={10.1109/COMSWA.2007.382425}
}
  • Amar P. Azad
    A. Chockalingam
    Sumit Vashistha
    Year: 2007
    Efficient Scheduling of Sensor Activity for Information Coverage in Wireless Sensor Networks
    COMSWARE
    IEEE
    DOI: 10.1109/COMSWA.2007.382425
Amar P. Azad1, A. Chockalingam1, Sumit Vashistha1
  • 1: Department of ECE, Indian Institute of Science, Bangalore-560012

Abstract

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain disjoint set of information covers (DSIC), which achieves longer network life compared to the set of covers obtained using an exhaustive-greedy-equalized heuristic (EGEH) algorithm proposed in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Keywords
Sensor activity scheduling information coverage network lifetime physical coverage
Published
2007-07-09
Publisher
IEEE
Modified
2011-07-26
http://dx.doi.org/10.1109/COMSWA.2007.382425
Copyright © 2007–2022 IEEE