Research on Balanceable Path planning Method for Mobile Wireless Sensor Network

DOI

10.2991/iiicec-15.2015.221How to use a DOI?

Keywords

Sweep Coverage; Balance Factor; Travel Salesman Problem; Evolutionary Computation Algorithms

Abstract

Path planning problem of low cost effective sweep coverage for mobile wireless sensor network (MWSN) is one MTSP problem and the number of mobile nodes is the number of travel sales man in the MTSP problem. To keep the balance of moving path for each mobile node in sweep coverage of MWSN, features of mobile node’s burden are discussed and balance factor are presented to measure the balance of load for sweep coverage in this paper. Fast balance factor is proposed for evolutionary computation algorithms based path planning. Experimental results show that the balance of moving path planed by our proposed method is better.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhenya Zhang
AU  - Xuewen Yuan
AU  - Weili Wang
AU  - Hongmei Cheng
PY  - 2015/03
DA  - 2015/03
TI  - Research on Balanceable Path planning Method for Mobile Wireless Sensor Network
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 991
EP  - 994
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.221
DO  - 10.2991/iiicec-15.2015.221
ID  - Zhang2015/03
ER  -