An Mobile Beacon-assisted Localization Algorithm based on Network-Density Clustering for Wireless Sensor Networks

被引:19
作者
Zhao Fang [1 ]
Luo Hai-yong [2 ]
Lin Quan [3 ]
机构
[1] BUPT, Sch Software Engn, Beijing, Peoples R China
[2] Chinese Acad Sci, Inst Comp Tecnol, Beijing, Peoples R China
[3] BUAA, Sch Software Engn, Beijing, Peoples R China
来源
2009 FIFTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS | 2009年
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
wireless sensor networks; mobile beacon-assisted localization; density-based clustering; incremental localization;
D O I
10.1109/MSN.2009.12
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Most existing mobile beacon-assisted localization algorithms do not make effective use of the node distribution information and let the mobile landmark traverse the entire network, which causes large path length and low utilization rate of beacon messages. In order to reduce the path length and use the mobile beacon more effectively, a novel mobile beacon-assisted localization algorithm based on network-density clustering (MBL(ndc)) for wireless sensor networks is presented, which combines node clustering, incremental localization and mobile beacon assisting together. Simulation results demonstrate that the proposed MBL(ndc) algorithm offers comparable localization accuracy as the mobile beacon-assisted localization algorithm with HILBERT trajectory, but with less than 50% path length of the later, which shortens the period of positioning the whole network.
引用
收藏
页码:304 / +
页数:2
相关论文
共 7 条
[1]  
Ester M., 1996, P 2 INT C KNOWLEDGE, P226, DOI DOI 10.5555/3001460.3001507
[2]  
GREFENSTELLE JJ, 1985, P INT C GEN ALG THEI, P359
[3]   Static path planning for mobile beacons to localize sensor networks [J].
Huang, Rui ;
Zaruba, Gergely V. .
FIFTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS, 2007, :323-+
[4]   Path planning of mobile landmarks for localization in wireless sensor networks [J].
Koutsonikolas, Dimitrios ;
Das, Saumitra M. ;
Hu, Y. Charlie .
COMPUTER COMMUNICATIONS, 2007, 30 (13) :2577-2592
[5]  
SHANG Y., 2003, P 4 ACM INT S MOB AD, P201, DOI [DOI 10.1145/778415.778439, 10.1145/ 778415.778439]
[6]  
SICHITIU ML, 2004, P IEEE INT C MOB AD, P174, DOI DOI 10.1109/MAHSS.2004.1392104
[7]  
SRINATH TV, 2006, P 2006 IFIP INT C WI