Algorithms for the m-Coverage Problem and k-Connected m-Coverage Problem in Wireless Sensor Networks

Deying Li, Jiannong Cao, Dongsheng Liu, Ying Yu, Hui Sun. Algorithms for the m-Coverage Problem and k-Connected m-Coverage Problem in Wireless Sensor Networks. In Keqiu Li, Chris R. Jesshope, Hai Jin, Jean-Luc Gaudiot, editors, Network and Parallel Computing, IFIP International Conference, NPC 2007, Dalian, China, September 18-21, 2007, Proceedings. Volume 4672 of Lecture Notes in Computer Science, pages 250-259, Springer, 2007. [doi]

@inproceedings{LiCLYS07,
  title = {Algorithms for the m-Coverage Problem and k-Connected m-Coverage Problem in Wireless Sensor Networks},
  author = {Deying Li and Jiannong Cao and Dongsheng Liu and Ying Yu and Hui Sun},
  year = {2007},
  doi = {10.1007/978-3-540-74784-0_26},
  url = {http://dx.doi.org/10.1007/978-3-540-74784-0_26},
  tags = {wireless sensor networks, coverage},
  researchr = {https://researchr.org/publication/LiCLYS07},
  cites = {0},
  citedby = {0},
  pages = {250-259},
  booktitle = {Network and Parallel Computing, IFIP International Conference, NPC 2007, Dalian, China, September 18-21, 2007, Proceedings},
  editor = {Keqiu Li and Chris R. Jesshope and Hai Jin and Jean-Luc Gaudiot},
  volume = {4672},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-74783-3},
}