邻域搜索蚁群算法在无线传感器网络数据融合中的应用

Application of Ant Algorithm Based on Neighborhood Serach in Wireless Sensor Networks Data Aggregation

为了减少网络中的数据传输量,提高数据融合率,降低网络延时,针对无线传感器网络数据融合问题的研究,提出了一种邻域搜索蚁群算法;首先利用蚁群算法寻找最短路径的优势,构造最短路径;为了避免蚁群算法的早熟收敛和收敛速度慢的问题,当达到一定的迭代次数后,运用具有可变邻域搜索的变异算子对搜索结果进行优化;算法不但考虑了无线传感器网络节点能量消耗也考虑了数据传输的网络延时问题;实验结果表明,该算法减少了网络能耗,降低了网络延时,稳定性更好,性能更优。

In order to reduce the amount of network data transmission and improve the efficiency of data integration and reduce network delay, a hybrid ant algorithm based on neighborhood search is proposed for wireless sensor networks data aggregation. First, Making use of the advantages of ant algorithm in searching for the shortest path, the algorithm construct the shortest path. To overcome the disadvantages of prematurity and the slow rate of convergence in ant algorithm, at the same time, a variable neighborhood search mutation operator is ap- plied to optimize search results, when iterrations number is achieved. Not only the energy consumption is considered , but also the data transmission delay is considered. Experiment results show that the algorithm which reduce energy consumption and network delay , is more stable and has better performing.