期刊文献+

基于网络覆盖和多目标离散群集蜘蛛算法的多移动agent规划 被引量:5

Multi mobile agent itinerary planning based on network coverage and multi-objective discrete social spider optimization algorithm
下载PDF
导出
摘要 以agent负载能耗均衡度和网络总能耗为指标构建多移动agent协作规划模型,为了尽可能延长网络生存周期,给出基于网络覆盖率的节点休眠机制,在满足WSN网络覆盖率要求的同时,采用较少节点处于工作状态。根据多移动agent协作规划技术特点,设计融合Pareto最优解多目标离散群集蜘蛛算法(MDSSO),重新定义插值学习和变异交换粒子更新策略,并动态调整最优解集规模,以提高MDSSO算法多目标求解精度。实验仿真结果表明,该方法能够快速合理给出WSN多移动agent规划路径,而且与其他传统算法相比,网络总能耗降低了约15%,生存期提高了约23%。 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%.
作者 刘洲洲 李士宁 LIU Zhou-zhou LI Shi-ning(School of Electronic Engineering,Xi'an Aeronautical University,Xi'an 710077,China School of Computer Science,Northwestem Polytechnical University,Xi'an 710072,China)
出处 《通信学报》 EI CSCD 北大核心 2017年第6期1-9,共9页 Journal on Communications
基金 国家自然科学基金资助项目(No.61601365) 陕西省教育厅科研计划基金资助项目(No.16JK1395)~~
关键词 无线传感器网络 移动代理 网络覆盖 群集蜘蛛优化算法 协作规划 wireless sensor network, mobile agent, network coverage, social spider optimization algorithm, itinerary planning
  • 相关文献

参考文献9

二级参考文献95

共引文献149

同被引文献42

引证文献5

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部