DocumentCode :
1802575
Title :
MTSP based solution for minimum mobile node number problem in sweep converge of wireless sensor network
Author :
Zhang, Zhenya ; Chen, Yan ; Cheng, Hongmei ; Fang, Qiansheng
Author_Institution :
Key Lab. of Intell. Building, Anhui Univ. of Archit., Hefei, China
Volume :
3
fYear :
2011
fDate :
24-26 Dec. 2011
Firstpage :
1827
Lastpage :
1830
Abstract :
Environment physical parameters about the energy efficiency status in building can be monitored with wireless sensor network with mobile node. To reduce the cost and complexity of wireless sensor network, sweep coverage for wireless sensor network with mobile node is defined in this paper. To minimize the number of mobile nodes in desired wireless sensor network, the problem for minimum number of mobile nodes and a fast solution based on MTSP for the problem are presented. In our experiment, the MTSP problem is solved with PSO algorithm. Experimental results show that the fast solution based on MTSP can work correctly and quickly.
Keywords :
mobile radio; particle swarm optimisation; wireless sensor networks; MTSP based solution; PSO algorithm; environment physical parameters; minimum mobile node number problem; sweep converge; wireless sensor network; Monitoring; MTSP; PSO algorithm; sweep converge;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Network Technology (ICCSNT), 2011 International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4577-1586-0
Type :
conf
DOI :
10.1109/ICCSNT.2011.6182324
Filename :
6182324
Link To Document :
بازگشت