Run to potential: Sweep coverage in wireless sensor networks

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2009, Pages 50-57

  Xi, Min ^a   Wu, Kui ^b   Qi, Yong ^a   Zhao, Jizhong ^a   Liu, Yunhao ^c   Li, Mo ^c  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF VICTORIA   (Canada)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL RESULTS; COVERAGE PROBLEM; DISTRIBUTED ALGORITHM; INFORMATION ACCESS; LOCAL GRADIENTS; MOBILE NODES; ON DYNAMICS; PHYSICAL WORLD; POINTS OF INTEREST; PROCESSING CENTER; RENDEZVOUS POINT; SENSOR COVERAGE;

SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 77951453414     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2009.43     Document Type: Conference Paper

References (22)

1. I. T. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," Computer Networks, vol. 38, no. 4, pp. 393-422, 2002.
2. M. Wu, J. Xu, X. Tang, and W.-C. Lee, "Top-k monitoring in wireless sensor networks," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 6, pp. 962-976, 2007.
3. X. Liu, Q. Wang, L. Sha, and W. He, "Optimal qos sampling frequency assignment for real-time wireless sensor networks," 2003, in Proceedings of the 24th Real-Time Systems Symposium.
4. M. Cardei and D. Z. Du, "Improving wireless sensor network lifetime through power aware organization," ACM Wireless Networks, no. 11, pp. 333-340, 2005.
5. X. Bai, D. Xuan, Z. Yun, T. H. Lai, and W. Jia, "Complete optimal deployment patterns for full-coverage and k-connectivity (k=6) wireless sensor networks." ACM New York, NY, USA, 2008, pp. 401-410, proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing.
6. S. Kumar, T. H. Lai, and J. Balogh, "On k-coverage in a mostly sleeping sensor network," in Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking, Philadelphia, Pennsylvania, USA, 2004.
7. X. Y. Li and Y. Wang, "Simple approximation algorithms and ptass for various problems in wireless ad hoc networks," Journal of Parallel and Distributed Computing, vol. 66, no. 4, pp. 515-530, 2006.
8. S. Chellappan, W. Gu, X. Bai, D. Xuan, B. Ma, and K. Zhang, "Deploying wireless sensor networks under limited mobility constraints," IEEE Transactions on Mobile Computing, vol. 6, no. 10, pp. 1142-1157, 2007.
9. D.Wang, J. Liu, and Q. Zhang, "Field coverage using a hybrid network of static and mobile sensors," in Proceedings of IEEE IWQoS, 2007.
10. S. Kumar, T. H. Lai, and A. Arora, "Barrier coverage with wireless sensors," Wireless Networks, vol. 13, no. 6, pp. 817-834, 2007.
11. A. Chen, S. Kumar, and T. H. Lai, "Designing localized algorithms for barrier coverage," in Proceedings of the 13th annual ACM international conference on Mobile computing and networking, 2007, pp. 63-74.
12. P. Balister, B. Bollobas, A. Sarkar, and S. Kumar, "Reliable density estimates for coverage and connectivity in thin strips of finite length," in Proceedings of the 13th annual ACM international conference on Mobile computing and networking, 2007, pp. 75-86.
13. A. Howard and M. J. Mataric, "Cover me! a self-deployment algorithm for mobile sensor networks," in 2002 International Conference on Robotics and Automations, Washington DC, May, 2002.
14. I. M. Rekleitis, A. P. New, and H. Choset, "Distributed coverage of unknown/unstructured environments by mobile sensor networks," in 3rd International NRL Workshop on Multi-Robot Systems, A. C. Schultz, L. E. Parker, and F. Schneider, Eds. Washington, D.C.: Kluwer, 2005, pp. 145-155.
15. S. C. Wong and B. A. MacDonald, "A topological coverage algorithm for mobile robots," in Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 2, 2003.
16. M. A. Batalin and G. S. Sukhatme, "Multi-robot dynamic coverage of a planar bounded environment," in IEEE/RSJ International Conference on Intelligent Robots and Systems, 2002.
17. A. Muhammad and A. Jadbabaie, "Dynamic coverage verification in mobile sensor networks via switched higher order laplacians," Robotics: Science and Systems, 2007.
18. J. Faruque and A. Helmy, "Rugged: Routing on fingerprint gradients in sensor networks," in IEEE International Conference on Pervasive Services, 2004.
19. J. Liu, F. Zhao, and D. Petrovic, "Information-directed routing in ad hoc sensor networks," in Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, 2003, pp. 88-97.
20. H. Lin, M. Lu, S. Stonybrook, N. Milosavljevic, J. Gao, and L. J. Guibas, "Composable information gradients in wireless sensor networks," in Proceedings of IEEE International Conference on Information Processing in Sensor Networks, 2008, pp. 121-132.
21. W. Cheng, M. Li, K. Liu, Y. Liu, X. Li, and X. Liao, "SweeT coverage with mobile sensors," in Proceedings of IEEE International Symposium on Parallel and Distributed Processing, Miami, FL, 2008, pp. 1-9.
22. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.