移动无线传感网的移动感知路径选择算法

摘要

In order to solve the area full coverage problem and data transmission problem of mobile sensor nodes in sparse network environment,a mobile sensing path selection algorithm for mobile wireless sensor networks(MSPS) is proposed. In MSPS algorithm,mathematical formulae are used to represent parameters such as neighbor grid set, area coverage rate,data transmission delay and average energy consumption of nodes. The opportunistic routing algorithm is adopted for data transmission and a movement path selection optimization model which can guarantee full coverage of monitoring area and is trade-off of data transmission delay,data transmission rate and average energy consumption is established. The path finding method of target grid, initial chromosome determination method and chromosome fitness value calculation method are proposed. Finally,modified multi-population genetic algorithm is proposed to solve the optimization model,and optimal movement scheme of mobile sensor nodes is obtained. The simulation results show that regardless of whether there are obstacles in the monitoring area,MSPS algorithm improves data transmission rate and reduces data transmission delay and total discarded data amount of nodes. Under certain conditions,MSPS algorithm is better than SGA,TCM_M,RAND_D and RAND algorithms.%为解决稀疏网络环境下移动传感节点的区域全覆盖和数据传输问题,提出一种移动无线传感网的移动感知路径选择算法(MSPS).在MSPS算法中,用数学公式表示邻居网格集合、区域覆盖率、数据传输时延、节点平均能耗等参数.采用机会路由算法进行数据传输,并建立能保证全覆盖监测区域且权衡数据传输时延、数据传输率和节点平均能耗的移动路径选择优化模型.提出到目标网格的路径寻找方法、初始染色体的确定方法和染色体适应度值计算方法.最终提出修正的多种群遗传算法求解优化模型,获得移动传感节点的最优移动方案.仿真结果表明:不管监测区域内是否存在障碍物,MSPS算法都能提高数据传输率,降低数据传输时延和节点丢弃的总数据量.在一定的条件下,MSPS算法比SGA、TCM_M、RAND_D和RAND算法更优.