一种改进的边界节点检测算法

An Improved Boundary Node Detection Algorithm

无线传感器网络边界节点的检测是传感器应用的一个基础问题。针对降低通信量、提高边界节点检测的准确性两个方面考虑,设计一种改进的边界节点检测算法(AIBNDA),该算法采用竞争方法选取领导节点,利用空洞的大小计算纬度线的条数;当网络中空洞的个数比较多时,构造多个环分别包围网络中的空洞;采用环上节点动态替换方法,把环转换为网络的边界。实验验证了该算法在识别准确率、降低通信量等方面的有效性。

Wireless sensor network boundary node detection is a fundational problem of sensor applications. In order to reduce traffic and improve the accuracy of the boundary node detection, the paper designs an improved boundary node detection algorithm（AIBNDA）. The algorithm uses the competition method to select a leading node and the size of the hole to calculate the number of latitude lines. When the number of holes in the network is large, mang rings are constructed to surround the single hole respectively. The paper introduces the ring node dynamic replacement, then the tings are converted into the boundary of the network. The experiments verify the validity of this algorithm in terms of recognition accuracy ,reduce traffic and so on.