Mobile Element Assisted Cooperative Localization for Wireless Sensor Networks with Obstacles

被引：100

作者：

Chen, Hongyang ^{[1
]}

Shi, Qingjiang ^{[2
]}

Tan, Rui ^{[3
]}

Poor, H. Vincent ^{[4
]}

Sezaki, Kaoru ^{[1
]}

机构：

[1] Univ Tokyo, Inst Ind Sci, Tokyo, Japan

[2] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200030, Peoples R China

[3] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China

[4] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA

来源：

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | 2010年 / 9卷 / 03期

基金：

日本科学技术振兴机构;

关键词：

Mobility-assisted wireless sensor networks; mobile elements; convex localization algorithm; optimal movement scheduling; BEACON;

D O I：

10.1109/TWC.2010.03.090706

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobility-assisted wireless sensor networks (WSNs). An optimal movement scheduling method with mobile elements (MEs) is proposed to address limitations of static WSNs in node localization. In this scheme, a mobile anchor node cooperates with static sensor nodes and moves actively to refine location performance. It takes advantage of cooperation between MEs and static sensors while, at the same time, taking into account the relay node availability to make the best use of beacon signals. For achieving high localization accuracy and coverage, a novel convex position estimation algorithm is proposed, which can effectively solve the problem when infeasible points occur because of the effects of radio irregularity and obstacles. This method is the only range-free based convex method to solve the localization problem when the feasible set of localization inequalities is empty. Simulation results demonstrate the effectiveness of this algorithm.

引用

页码：956 / 963

页数：8

共 26 条

[1]

Biswas P, 2006, ACM T SENSOR NETWORK, V2

[2] A simple cooperative diversity method based on network path selection [J].