MTSP based solution for minimum mobile node number problem in sweep converge of wireless sensor network
暂无分享,去创建一个
[1] Ian F. Akyildiz,et al. Wireless mesh networks: a survey , 2005, Comput. Networks.
[2] Lan Lin,et al. Distributed algorithms for dynamic coverage in sensor networks , 2007, PODC '07.
[3] Ian F. Akyildiz,et al. Sensor Networks , 2002, Encyclopedia of GIS.
[4] Ai Chen,et al. Designing localized algorithms for barrier coverage , 2007, MobiCom '07.
[5] M. N. Giriprasad,et al. ENERGY EFFICIENT COVERAGE PROBLEMS IN WIRELESS Ad Hoc SENSOR NETWORKS , 2011 .
[6] József Balogh,et al. On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.
[7] Anish Arora,et al. Barrier coverage with wireless sensors , 2005, MobiCom '05.
[8] Yu-Chee Tseng,et al. The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.
[9] Gaurav S. Sukhatme,et al. Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.
[10] TsengYu-Chee,et al. The coverage problem in a wireless sensor network , 2005 .
[11] Ian F. Akyildiz,et al. Wireless sensor networks: a survey , 2002, Comput. Networks.
[12] Gaurav S. Sukhatme,et al. Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .