A distributed algorithmic framework for coverage problems in wireless sensor networks-Reference-Cited by-同舟云学术

A distributed algorithmic framework for coverage problems in wireless sensor networks

Published:2009-08 Issue:4 Volume:24 Page:331-348
ISSN:1744-5760
Container-title:International Journal of Parallel, Emergent and Distributed Systems
language:en
Short-container-title:International Journal of Parallel, Emergent and Distributed Systems

Author:

Dhawan Akshaye,Prasad Sushil K.

Publisher

Informa UK Limited

Subject

Computer Networks and Communications,Software

Link

http://www.tandfonline.com/doi/pdf/10.1080/17445760902720008

Reference26 articles.

1. Z. Abrams, A. Goel, and S. Plotkin, Set k-cover algorithms for energy efficient monitoring in wireless sensor networks, in Third International Symposium on Information Processing in Sensor Networks, 2004, pp. 424–432

2. A survey on sensor networks

3. D. Brinza and A. Zelikovsky, Deeps: Deterministic energy-efficient protocol for sensor networks, in Proceedings of the International Workshop on Self-Assembling Wireless Networks (SAWN), 2006, pp. 261–266

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum Lifetime Target Coverage in Wireless Sensor Networks;Wireless Personal Communications;2019-11-18

2. Shadowing and Fading Environmental Effects on Lifetime Extension of Ad Hoc Wireless Networks;2019 International Conference on Electrical and Computing Technologies and Applications (ICECTA);2019-11

3. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges;Algorithmica;2013-11-28

4. hetADEEPS: ADEEPS for Heterogeneous Wireless Sensor Networks;International Journal of Future Generation Communication and Networking;2013-10-31

5. References;Wireless Ad Hoc and Sensor Networks;2013-07-22