摘要
根据未知节点必定处于周围一跳锚节点通信半径范围内重叠区域内的基本事实,提出了基于非测距定位的分布式Inter-section-Grid-Sector(IGS)定位算法。IGS算法以锚节点通信半径的10%作为网格大小来获取重叠区域,并把重叠区域的每个网格坐标求质心作为未知节点估计坐标的方法。仿真结果表明比Bounding Box精度明显提高,比经典质心提高近20%。
The novel grid-based distributed localization algorithm for wireless sensor networks is introduced,which is called Intersection-Grid-Sector(IGS) for range-free localization.The IGS can obtain intersection grid coordinates through grid unit of one hop area intersection of every anchor around unknown node,which is divided into grid unit based on 10% of anchor node radius.Then,IGS calculates the Center Of Gravity(COG) of the intersection grid coordinates in which a node resides to determine its estimated position.Simulation shows that IGS algorithm estimation error compared with Bounding Box is significantly improved and compared with classical Centroid ascends about 20%.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第29期83-85,共3页
Computer Engineering and Applications
关键词
网格定位
节点定位
无线传感器网络
grid localization
node localization
wireless sensor networks