Multi mobile agent itinerary planning based on network coverage and multi-objective discrete social spider optimization algorithm

被引:0
作者
Liu Z.-Z. [1 ,2 ]
Li S.-N. [2 ]
机构
[1] School of Electronic Engineering, Xi'an Aeronautical University, Xi'an
[2] School of Computer Science, Northwestern Polytechnical University, Xi'an
来源
Tongxin Xuebao/Journal on Communications | 2017年 / 38卷 / 06期
基金
中国国家自然科学基金;
关键词
Itinerary planning; Mobile agent; Network coverage; Social spider optimization algorithm; Wireless sensor network;
D O I
10.11959/j.issn.1000-436x.2017124
中图分类号
学科分类号
摘要
The multi mobile agent collaboration planning model was constructed based on the mobile agent load balancing and total network energy consumption index. In order to prolong the network lifetime, the network node dormancy mechanism based on WSN network coverage was put forward, using fewer worked nodes to meet the requirements of network coverage. According to the multi mobile agent collaborative planning technical features, the multi-objective discrete social spider optimization algorithm (MDSSO) with Pareto optimal solutions was designed. The interpolation learning and exchange variations particle updating strategy was redefined, and the optimal set size was adjusted dynamically, which helps to improve the accuracy of MDSSO. Simulation results show that the proposed algorithm can quickly give the WSN multi mobile agent path planning scheme, and compared with other schemes, the network total energy consumption has reduced by 15%, and the network lifetime has increased by 23%. © 2017, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码:1 / 9
页数:8
相关论文
共 16 条
  • [1] Xia J., Ling P.L., Yu L.J., Et al., Optimization of wireless sensor network routing based on quantum genetic algorithm, Journal of Tongji University (Natural Science Edition), 43, 7, pp. 1097-1103, (2015)
  • [2] Hou J.J., Zhu M.Q., Liu Y., A WSN target localization algorithm under strong background noise, Journal of Beijing Institute of Technology, 36, 5, pp. 535-540, (2016)
  • [3] Saleem F., Moeen Y., Behzad M., Et al., IDDR: improved density controlled divide-and-rule scheme for energy efficient routing in wireless sensor networks, Procedia Computer Science, 34, pp. 212-219, (2014)
  • [4] Yang T., Yang Q., Tang Y., WSN mobile agent stochastic model and analysis, Journal of University of Electronic Science and Technology, 44, 3, pp. 439-444, (2015)
  • [5] Su J.S., Guo W.Z., Yu Z.L., Et al., Wireless sensor network fault tolerant load balancing aware clustering algorithm, Journal of Computer, 37, 2, pp. 445-456, (2014)
  • [6] Shi X.B., Zhang Y., Zhao S., Et al., Cooperative programming of multiple mobile agents based on discrete multi-objective optimization particle swarm optimization, Journal on Communications, 37, 6, pp. 29-37, (2016)
  • [7] Chen M., Leung V., Mao S.W., Et al., Energy-efficient itinerary planning for mobile agents in wireless sensor networks, IEEE International Conference on Communications (ICC'09), pp. 1-5, (2009)
  • [8] Cai W., Chen M., Hara T., Et al., A genetic algorithm approach to multi-agent itinerary planning in wireless sensor networks, Mobile Networks and Applications, 16, 6, pp. 782-793, (2011)
  • [9] Konstantopoulos C., Mpitziopoulos A., Gavalas D., Et al., Effective determination of mobile agent itineraries for data aggregation on sensor networks, IEEE Transactions on Knowledge and Data Engineering, 22, 12, pp. 1679-1693, (2010)
  • [10] Chen M., Cai W., Gonzalez S., Et al., Balanced itinerary planning for multiple mobile agents in wireless sensor networks, Ad Hoc Networks, pp. 416-428, (2010)