贪婪寻优算法在中继节点布局中的应用

Relay Nodes Placement Based on Greedy Optimization Algorithm

针对目前中继节点布局算法所忽视的布局完成后网络整体能耗的问题,提出了基于最小通信网络距离因子的布局算法评价新标准,同时将中继节点布局禁区、通信路径不可逆等约束条件。解决方法上,采用了基于贪婪寻优算法的中继节点布局算法,实现了无线传感器网络中继节点的多约束容错性布局。仿真实验表明,提出的基于贪婪寻优算法的中继节点布局算法与常规中继节点布局算法相比,在降低通信网络整体能耗以及保证能耗均衡性方面具有明显的优势。

Aimed at the current algorithms always ignore the problem of energy consumption of the entire networks,this paper presented a new evaluation standard based on the minimum distance factor of communication network.At the same time,it took the forbidden relay node placement region and the irreversible factor in the forwarding paths into the existing model of fault-tolerant relay node placement.A relay node placement algorithm was implemented in solutions based on greedy optimization algorithm.The simulation results demonstrate that the new algorithm can limit the communication capacity of relay nodes conveniently.Compared with other placement algorithms,improvement of energy-efficiencies and energy-equalization is obvious in this algorithm.