基于贪婪算法无线传感器网络中继节点布局的研究

为实现远距离的无线通信, 在网络中添加中继节点, 采用多跳路由传输数据。对于中继节点的布局问题, 依据线性结构使网络整体能量消耗最小的特征, 提出一种中继节点贪婪布局算法。该算法通过最近贪婪策略、中继节点通信容量、传感器节点数据转发跳数等约束方法限制中继节点的布局位置。理论分析和实验验证了该算法能够有效减少能量消耗, 延长网络寿命。

Research on relay node placement based on greedy algorithm in wireless sensor networks

To realize the long-distance wireless communication, relay nodes were added in wireless sensor network (WSN), and multi-hop routing was adopted to transmit the data. For the problem of relay node placement, this paper presented a relay node greedy placement algorithm on the basis of the characteristic of linear structure, which could make overall energy consumption of the network minimal. The algorithm used constraints methods, such as greedy strategy, relay node communication capacity and data forwarding hop count of sensor nodes, to astrict the locations of relay nodes. The theory and experiment verify the greedy algorithm can effectively reduce the energy consumption and extend the network lifetime.