On the design of k-covered wireless sensor networks: Self-versus triggered sensor scheduling

@article{Ammari2009OnTD,
  title={On the design of k-covered wireless sensor networks: Self-versus triggered sensor scheduling},
  author={Habib M. Ammari and Sajal K. Das},
  journal={2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops},
  year={2009},
  pages={1-9}
}
Sensing coverage reflects the quality of surveillance of a field by a wireless sensor network (WSN). This paper investigates the problem of minimum connected k-coverage in WSNs, where each point in a field is covered (or sensed) by at least k active sensors while minimizing the necessary total number of active sensors and ensuring connectivity between them. In this paper, we propose two k-coverage protocols using different scheduling approaches. In the first protocol, called Self-Scheduling… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…