无线传感器网络中多日冕分割定位算法的设计

Design of Multi-Corona Division Localization Algorithm in WSN

无线传感器网络中结点定位一直是研究热点。提出了一种新的基于多日冕分割的定位技术来计算节点的位置。利用跳数形成的日冕来划分传感器网络,并将非锚节点锁定在一个日冕层中,当多个锚节点的日冕相交时,重叠相交区域被认定为非锚节点可能所在的位置。随着锚节点数量的增加,更多的日冕层将逐渐缩小至交叉点区域来进行结点定位。仿真结果表明,本算法在较少锚节点的情况下就可以达到较高的定位精度。还设计了一种快速计算相交区域的算法,在很大程度上减少了计算量,便于在传感器节点中应用。最后,将多日冕分割定位算法与LSVM、DV-Hop和CAB进行了比较,实验结果表明多日冕分割定位算法的定位精度明显优于LSVM和DV-Hop,在噪声环境下也优于CAB。

Localization continues to be an important and challenging issue in today’s wireless sensor networks(WSNs).A novel localization technique based on multi-corona division(MCD)is proposed to estimate the location of sensor node.Corona formed by hops is employed to divide the sensor field,and the non-anchor nodes are locked within layer of corona.When the sensor field are divided by several coronas,intersection region is delimited where non-anchor nodes possibly locate.With the increase of the number of anchor nodes,the multiple coronas’division will successively downsize the intersection region.Simulation illustrats that high localization can be reached with few anchor nodes compared with previous techniques.A fast algorithm is also designed to calculate intersection region,which largely reduces computationed complexity and can be easily applied in sensor node.Finally,the proposed technique of MCD is compared with LSVM,DV-Hop and CAB.Simulation demonstrates that MCD outperforms LSVM and DV-hop,and under noise circumstance it also exceeds CAB.