多贪婪准则条件下中继节点布局算法

Relay Node Placement Algorithm under the Condition of Multi Greedy Criterion

为解决无线传感器网络中继节点设置位置不合理而导致的网络构建成本高、网络整体寿命低等问题,提出了一种基于贪婪准则的中继节点布局算法.该算法采用能耗均衡率和网络总能耗等性能评价标准,分别对最近贪婪准则、定向贪婪准则和角度最小贪婪准则进行了多角度的对比分析,并引入数据流向限制、通信容量和数据最大转送次数,对节点数据传输路径进行约束及优化.实验结果表明,最近贪婪准则能耗少,网络中各个节点的能耗均衡,可给出合理的中继节点布设位置,有效降低网络的整体能耗.

In order to solve the problem of high cost of network construction and low lifetime of network,it is a problem to solve the problem of high cost of network construction and low network lifetime of relay nodes in wireless sensor network,this article proposed a new relay node placement algorithm based on the greedy criterion. By adopting the performance evaluation criteria of the balanced energy consumption rate and the total energy consumption of the network,the algorithm contrasts the recent greedy criterion,the directional greedy criterion and the minimum angle of greedy criterion respectively,and then constrains and optimizes the data transmission path of node by introducing data flow restriction,communication capacity and maximum data transfer times. Experiments show that,the recent greedy criterion has less energy consumption,and can balance the energy consumption of each node in the network. Moreover,this recent greedy criterion can not only give proper location of each node,but also reduce the energy consumption of the whole network effectively.