无线传感器网络中继节点布居算法的研究

本文表述的是在该应用背景下引入多约束条件, 并采用枚举法与贪婪寻优算法相结合的方法, 解决了在可以作为中继节点设置位置的预设中继节点位置集合内, 合理选择中继节点设置位置以及既存网络因添加新传感器节点所引起的中继节点追加的问题. 仿真实验表明, 本文提出的中继节点布居与追加优化算法能够保证多约束条件下网络的容错性. 同时提出的基于最小网络距离因子评价标准, 有效提高了中继节点布居算法的能效性.

Relay node placement and addition algorithms in wireless sensor networks

The node placement is the foundation of network operation in wireless sensor networks. In many applications, the positions of gateway node and sensor node are relatively fixed. To guarantee network connectivity and reliability, some relay nodes must be reasonably placed between the gateway node and the sensor node. In the context of the above applications, we introduce many constraint conditions into the existing placement model, and adopt a hybrid placement method based on enumeration and greedy optimization algorithms to determine relay node positions from their candidate location sets, and we finally achieve the relay node initial placement and follow-up adjustment strategies, owing to new sensor nodes joining the current network. The simulation results demonstrate that our operable and optimized relay node placement algorithm can ensure multi-restricted fault-tolerant relay node placement, and the presented new evaluation standard based on the minimum distance factor can significantly improve the energy-efficiency of relay node placement algorithm.