One center-three benchmark self-localization algorithm for wireless sensor networks

被引：0

作者：

Zhang, Donghong ^{[1
]}

Li, Kejie ^{[1
]}

Wu, Deqiong ^{[2
]}

机构：

[1] Beijing Inst Technol, Sch Mechatron Engn, Beijing 100081, Peoples R China

[2] Artillery Acd PLA, Dept 3, Hefei 230031, Peoples R China

来源：

2007 INTERNATIONAL CONFERENCE ON INFORMATION ACQUISITION, VOLS 1 AND 2 | 2007年

关键词：

wireless sensor networks; center node; self-localization algorithm; the shortest route;

D O I：

10.1109/ICIA.2007.4295692

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

One Center-Three Benchmark (OCTB) is different from other Localization Algorithms. There is a high-power center node in the WSN, which can cover with the whole networks. In addition, there are three anchor nodes act as benchmarks. All free nodes may compute the distance to the center node according to the RSSI of the center node. At the same time, they compute the distance to their neighbors. The information of distance and neighbors is transmitted to the Base-station, where the coordinate position of all free nodes will be figured out. The algorithm improves the precision of free nodes' position and reduces demanding of nodes distributing density (connectivity) greatly, but also, saves traffic and power. The cost of hardware is hardly increased.

引用

页码：34 / +

页数：2