一种基于网络密度分簇的移动信标辅助定位方法

赵方; 马严; 罗海勇; 林权; 林琳

doi:10.3724/SP.J.1146.2008.01532

一种基于网络密度分簇的移动信标辅助定位方法

doi: 10.3724/SP.J.1146.2008.01532

基金项目:

国家高技术研究发展计划(2006AA10Z253，2007AA12Z321，2009AA011902)和国家自然科学基金(60873244，60772111，60973110)资助课题

计量
- 文章访问数: 3331
- HTML全文浏览量: 90
- PDF下载量: 1029
- 被引次数: 0
出版历程
- 收稿日期: 2008-11-24
- 修回日期: 2009-09-10
- 刊出日期: 2009-12-19

A Mobile Beacon-assisted Node Localization Algorithm Using Network-Density-based Clustering for Wireless Sensor Networks

摘要

摘要: 现有移动信标辅助定位算法未充分利用网络节点分布信息，存在移动路径过长及信标利用率较低等问题。该文把网络节点分簇、增量定位与移动信标辅助相结合，提出了一种基于网络密度分簇的移动信标辅助定位算法(MBL(ndc))。该算法选择核心密度较大的节点作簇头，采用基于密度可达性的分簇机制把整个网络划分为多个簇内密度相等的簇，并联合使用基于遗传算法的簇头全局路径规划和基于正六边形的簇内局部路径规划方法，得到信标的优化移动路径。当簇头及附近节点完成定位后，升级为信标，采用增量定位方式参与网络其它节点的定位。仿真结果表明，该算法定位精度与基于HILBERT路径的移动信标辅助定位算法相当，而路径长度不到后者的50％。
- 无线传感器网络; 移动信标辅助定位; 基于密度分簇; 增量定位
Abstract: All the current mobile beacon-assisted localization algorithms do not make full use of the practical node distribution information and let the mobile landmark travel the entire network, which causes large path length and low beacon utilization ratio. A novel mobile beacon-assisted node localization algorithm using network-density-based clustering (MBL(ndc)) for wireless sensor networks is presented, which combines node clustering, incremental localization and mobile beacon assisting together. It first selects the cluster heads that has highest core density, and then employs density-reachable method to cluster the network into several branches with the same density, and lastly obtains the optimum trajectory of mobile beacon by combining cluster head path planning using genetic algorithm with in-cluster path planning using hexagon trajectory. After the cluster heads and nearby nodes have completed localization, they become beacons, then cooperate with each other to localize the left unknown nodes in an incremental way. 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.

HTML全文

参考文献(1)

Sichitiu M L and Ramadurai V. Localization of wirelesssensor networks with a mobile beacon. Proc. of the IEEE Int'lConf. on Mobile Ad-hoc and Sensor Systems. Fort Lauderdale,Florida, USA, October 24-27, 2004: 174-183.[2]Ssu K F, Ou C H, and Jiau H C. Localization with mobileanchor points in wireless sensor networks[J].IEEE Transactionson Vehicular Technology.2005, 54(3):1187-1197[3]Xia Zhen-jie and Chen Chang-jia. A localization scheme withmobile beacon for wireless sensor networks. Proc. of 6thInternational Conference on ITS Telecommunications.Chengdu, China, June 21-23, 2006: 1017-1020.[4]Kim Kyunghwi and Lee Wonjun. MBAL: A mobilebeacon-assisted localization scheme for wireless sensornetworks. Proc. of 16th International Conference onComputer Communications and Networks. Honolulu, Hawaii,USA, August, 13-16, 2007: 57-62.Lee Sangho, Kim Eunchan, and Kim Chungsan, et al..Localization with a mobile beacon based on geometricconstraints in wireless sensor networks. Proc. of 3rdInternational Conference on Intelligent Sensors, SensorNetworks and Information. Melbourne, Australia, December3-6, 2007: 61-65.Huang R and Zaruba G V. Static path planning for mobilebeacons to localize sensor networks. Proc. of 5th IEEEInternational Conference on Pervasive Computing andCommunications Workshops. White Plains, New York, March19-23, 2007: 323-330.[5]Koutsonikolas D, Das S M, and Hu Y C. Path planning ofmobile landmarks for localization in wireless sensor networks[J].Computer Communications.2007, 30(13):2577-2592[6]Bahi J M, Makhoul A, and Mostefaoui A. Localization andcoverage for high density sensor networks. ComputerCommunications, 2008, 31(4): 770-781.[7]Ester M, Kriegel H P, and Sander J, et al.. A density-basedalgorithm for discovering clusters in large spatial databaseswith noise. Proc. of 2nd Int. Conf. on Knowledge Discoveryand Data Mining. Portland, Oregon, USA, 1996: 226-231.[8]Shang Y.[J].Ruml W, and Zhang Y, et al.. Localization frommere connectivity. Proc. of the 4th ACM Intl Symp. onMobile Ad hoc Networking Computing. Annapolis,Maryland, USA, June 1-.2003,:-[9]Reino V and Andreas S. TASC: topology adaptive spatialclustering for sensor networks. Proc. of the IEEE Int'l Conf.on Mobile Ad-hoc and Sensor Systems. Washington, DC,November 7-10, 2005, 10 pp.-614.-ISBN: 0-7803-9465-8.[10]Grefenstelle J J, Gopal R, and Rosmaita B, et al.. Geneticalgorithms for the traveling salesman. Proc. of InternationalConference of genetic algorithm and their applications.Carnegie-Mellon University, Pittsburgh, Pa, USA, July 24-26,1985: 359-371.

施引文献

资源附件(0)

访问统计