Using potential to guide mobile nodes in wireless sensor networks

Ad-Hoc and Sensor Wireless Networks

Volumn 12, Issue 3-4, 2011, Pages 229-251

  Xi, Min ^a   Qi, Yong ^a   Wu, Kui ^b   Zhao, Jizhong ^a   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

Potential; Sweep coverage; Wireless sensor network

Indexed keywords

EID: 79958739564     PISSN: 15519899     EISSN: 15520633     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. http://www.greenorbs.org.
2. P. Balister, B. Bollobas, A. Sarkar, and S. Kumar. (2007). 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, pages 75-86.
3. M. A. Batalin and G. S. Sukhatme. (2002). Sensor coverage using mobile robots and stationary nodes. In SPIE Conference on Scalability and Traffic Control in IP Networks II (Disaster Recovery Networks), volume 4868, pages 269-276.
4. M. Cardei and Mtylw Wu. (2005). Energy-efficient target coverage in wireless sensor networks. In Procedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies, volume 3.
5. Weifang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xiangyang Li, and Xiangke Liao. (2008). Sweep coverage with mobile sensors. In Proceedings of IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), pages 1-9, Miami, FL.
6. Tian Di and Nicolas D. Georganas. (2002). A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, pages 32-41. ACM Press.
7. D. Wang, J. Liu, and Q. Zhang. (2007). Field coverage using a hybrid network of static and mobile sensors. In Proceedings of IEEE IWQoS.
8. Mohamed Hefeeda. (2007). Randomized k-coverage algorithms for dense sensor networks. In Proceedings of INFOCOM 2007 Minisymposium.
9. A. Howard and M. J. Mataric. (2002). Cover me! a self-deployment algorithm for mobile sensor networks. In 2002 International Conference on Robotics and Automations, Washington DC, May.
10. C. S. Kong, N. A. Peng, and I. Rekleitis. (2006). Distributed coverage with multirobot system. In Proceedings of the 2006 IEEE International Conference on Robotics and Automation Orlando, Florida-May.
11. S. Kumar, T. H. Lai, and A. Arora. (2007). Barrier coverage with wireless sensors. Wireless Networks, 13(6):817-834.
12. S. Kumar, T. H. Lai, and J. Balogh. (2004). On k-coverage in a mostly sleeping sensor network. In Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking (MobiCom 2004), Philadelphia, Pennsylvania, USA.
13. S. Li, Y. Liu, and X.Y. Li. (2008). Capacity of large scale wireless networks under Gaussian channel model. In Proceedings of the 14th ACM international conference on Mobile computing and networking(MobiCom), pages 140-151. ACM.
14. J. Lian, Y. Liu, K. Naik, and L. Chen. (2009). Virtual surrounding face geocasting in wireless ad hoc and sensor networks. IEEE/ACM Transactions on Networking (TON), 17(1):200-211.
15. H. Lin, M. Lu, S. Stonybrook, N. Milosavljevic, J. Gao, and L. J. Guibas. (2008). Composable information gradients in wireless sensor networks. In Proceedings of IEEE International Conference on Information Processing in Sensor Networks (IPSN '08), pages 121-132.
16. B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley. (2005). Mobility improves coverage of sensor networks. In Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing, pages 300-308.
17. Y. Liu, Z. Yang, X. Wang, and L. Jian. (2010). Location, localization, and localizability. Journal of Computer Science and Technology (JCST), 25(2):274-297.
18. M. Mitzenmacher and E. Upfal. (2005). Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.
19. A. Muhammad and A. Jadbabaie. (2007). Dynamic coverage verification in mobile sensor networks via switched higher order laplacians. Robotics: Science and Systems.
20. L.M. Ni, Y. Liu, Y.C. Lau, and A.P. Patil. (2004). LANDMARC: indoor location sensing using active RFID. Wireless Networks, 10(6):701-710.
21. Ioannis M. Rekleitis, Ai Peng New, and Howie Choset. (2005). Distributed coverage of unknown/unstructured environments by mobile sensor networks. In Alan C. Schultz, Lynne E. Parker, and Frank Schneider, editors, 3rd International NRLWorkshop on Multi-Robot Systems, pages 145-155,Washington, D.C. Kluwer.
22. Megerian Seapahn, Koushanfar Farinaz, Potkonjak Miodrag, and B. Srivastava Mani. (2005). Worst and best-case coverage in sensor networks. IEEE Transactions on Mobile Computing, 4:84-92.
23. S. C. Wong and B. A. MacDonald. (2003). A topological coverage algorithm for mobile robots. In Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003)., volume 2.
24. Guoliang Xing, Chenyang Lu, Robert Pless, and Qingfeng Huang. (2006). Impact of sensing coverage on greedy geographic routing algorithms. IEEE Transaction on Parallel and Distributed Systems, 17:348-360.
25. Z.Yang and Y. Liu. (2010). Quality of trilateration: Confidence-based iterative localization. IEEE Transactions on Parallel and Distributed Systems(TPDS), 21(5):631-640.
26. F. Ye, G. Zhong, S. Lu, and L. Zhang. (2002). Peas: a robust energy conserving protocol for long-lived sensor networks. In Proceedings of 10th IEEE International Conference on Network Protocols, pages 200-201.
27. Honghai. Zhang and J. C. Hou. (2005). Maintaining sensing coverage and connectivity in large sensor networks. Wireless Ad Hoc and Sensor Networks: An International Journal, 1(1-2):89-123.