基于元胞自动机的移动sink路径规划算法  

Mobile Sink Path Planning Algorithm Based on Cellular Automata

作　　者：吕安琪 李翠然[1] 谢健骊[1] LYU Anqi;LI Cuiran;XIE Jianli(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)

机构地区：[1]兰州交通大学电子与信息工程学院,兰州730070

出　　处：《兰州交通大学学报》2023年第6期44-49,共6页Journal of Lanzhou Jiaotong University

基　　金：国家自然科学基金(62161016);甘肃省科技计划资助(20JR10RA273)。

摘　　要：为降低无线传感器网络中移动sink数据收集时延,提出一种基于元胞自动机的移动sink路径规划算法。首先,利用网格划分获得移动sink备选驻留点;然后,基于元胞自动机搜索获得移动sink驻留点集合,采用Von Neumann元胞邻居模型计算备选驻留点预估密度,根据备选驻留点预估密度与备选驻留点至移动sink间距离选择驻留点;最后,使用蚁群算法优化经过所有驻留点的移动sink路径。仿真结果表明:所提算法可以减少驻留点数目,缩短移动sink路径长度,从而降低数据收集时延。In order to reduce the data collection delay of mobile sink in wireless sensor networks,a mobile sink path planning algorithm based on cellular automata is proposed.First,candidate rendezvous points are obtained using grid division.Then the rendezvous point set is obtained based on cellular automata search.The estimated density of candidate rendezvous points are calculated using Von Neumann cellular neighbor model.The rendezvous point is selected according to the estimated density of candidate rendezvous points and the distance between the candidate rendezvous point and the mobile sink.Finally,the ant colony algorithm is used to optimize the mobile sink path through all rendezvous points.The simulation results show that the proposed algorithm can reduce the rendezvous points number,shorten the mobile sink path length,and effectively reduce the data collection delay.

关 键 词：无线传感器网络 移动SINK 元胞自动机 蚁群算法 时延 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]