首页 / 资料库 / 文献详情

A 3D <i>K</i>-Barrier Coverage Algorithm Based on Improved Ant Colony Algorithm

DANG Xiaochao, LI Yuexia, HAO Zhanjun, ZHANG Tong

2020DOAJ (DOAJ: Directory of Open Access Journals)Computer Science被引 1

出版方页面 →

摘要

To address the <i>K</i>-barrier coverage problem of Wireless Sensor Network (WSN) in 3D environment,this paper proposes the 3D-ACO,an improved ant colony optimization algorithm.The 3D surface is mapped to a 2D plane for meshing generation.The spatial weight and deployment direction angle are introduced by mesh gradient to improve the ant colony algorithm,thus finding the shortest path to construct the barrier.The mobile nodes are used to fill the gaps between the barriers,so as to ensure the constructed barriers are strong barriers.Experimental results show that compared with the strong optimal and strong greedy algorithms,the proposed algorithm can effectively improve the utilization of nodes while reducing the energy consumption of nodes.Besides,the barrier coverage constructed in 3D environment has strong adaptability.

引用本文(GB/T 7714)

DANG Xiaochao, LI Yuexia, HAO Zhanjun, ZHANG Tong. A 3D <i>K</i>-Barrier Coverage Algorithm Based on Improved Ant Colony Algorithm[J]. DOAJ (DOAJ: Directory of Open Access Journals), 2020.

引文网络

参考文献与被引分析加载中…

DOI:https://doi.org/10.19678/j.issn.1000-3428.0053812

本站仅收录题录与摘要供学习参考,全文版权归属出版方;如有侵权请联系我们删除。