TY - JOUR
T1 - Mobile element assisted cooperative localization for wireless sensor networks with obstacles
AU - Chen, Hongyang
AU - Shi, Qingjiang
AU - Tan, Rui
AU - Poor, H. Vincent
AU - Sezaki, Kaoru
N1 - Funding Information:
ACKNOWLEDGEMENT This work was supported by the CREST Advanced Integrated Sensing Technology project of the Japan Science and Technology Agency. Part of this work was presented at the 20th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2009), Tokyo, Japan, Sept. 2009 [27]. The authors would like to thank the editor and anonymous reviewers for their helpful and constructive comments.
PY - 2010/3
Y1 - 2010/3
N2 - In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobilityassisted 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 rangefree 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.
AB - In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobilityassisted 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 rangefree 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.
KW - Convex localization algorithm
KW - Mobile elements
KW - Mobility-assisted wireless sensor networks
KW - Optimal movement scheduling
UR - http://www.scopus.com/inward/record.url?scp=77949555401&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77949555401&partnerID=8YFLogxK
U2 - 10.1109/TWC.2010.03.090706
DO - 10.1109/TWC.2010.03.090706
M3 - Article
AN - SCOPUS:77949555401
SN - 1536-1276
VL - 9
SP - 956
EP - 963
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 3
M1 - 5427426
ER -