通信学报2017，Vol.38Issue(6)：1-9,9.DOI:10.11959/j.issn.1000-436x.2017124
基于网络覆盖和多目标离散群集蜘蛛算法的多移动agent规划
Multi mobile agent itinerary planning based on network coverage and multi-objective discrete social spider optimization algorithm
摘要
Abstract
The multi mobile agent collaboration planning model was constructed based on the mobile agent load balanc-ing 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 dis-crete 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 dynami-cally, 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%.关键词
无线传感器网络/移动代理/网络覆盖/群集蜘蛛优化算法/协作规划Key words
wireless sensor network/mobile agent/network coverage/social spider optimization algorithm/itinerary planning分类
信息技术与安全科学引用本文复制引用
刘洲洲,李士宁..基于网络覆盖和多目标离散群集蜘蛛算法的多移动agent规划[J].通信学报,2017,38(6):1-9,9.基金项目
国家自然科学基金资助项目(No.61601365) （No.61601365）
陕西省教育厅科研计划基金资助项目(No.16JK1395)The National Natural Science Foundation of China (No. 61601365), The Scientific Research Program Funded by Shaanxi Provincial Education Department (No. 16JK1395) （No.16JK1395）
