欢迎访问中国科学院大学学报,今天是
论文

基于二跳生成树的可扩展分簇定位算法

  • 苗付友 ,
  • 熊焰 ,
  • 王新霞
展开
  • 1. 中国科学技术大学计算机系,合肥 23002
    2. 信阳师范学院计算机与信息技术学院,信阳 464000

收稿日期: 2008-12-04

  修回日期: 2009-06-04

  网络出版日期: 2009-11-15

A 2-hop spanning tree based scalable clustered localization algorithm for wireless sensor networks

  • MIAO Fu-You ,
  • XIONG Yan ,
  • WANG Xin-Xia
Expand
  • 1. Department of Computer Science, University of Science and Technology of China, Hefei 230027, China;
    2. Department of Computer Science, Xinyang Normal University, Xinyang 464000, China

Received date: 2008-12-04

  Revised date: 2009-06-04

  Online published: 2009-11-15

摘要

着重设计了一种基于二跳生成树的可扩展分簇定位算法.首先对传感器网络进行分簇、并利用簇头节点构造一个二跳生成树;在此基础上,由簇头计算各簇成员节点的局部坐标;最后,从生成树根节点开始,自顶向下合并各簇,生成所有节点的全局坐标,完成节点的相对定位. 理论分析与实验表明,本算法相对于现有的SDGPSN算法,能够有效提高定位覆盖率和定位精度,减少时间和通信开销,并具有更好的可扩展性.

本文引用格式

苗付友 , 熊焰 , 王新霞 . 基于二跳生成树的可扩展分簇定位算法[J]. 中国科学院大学学报, 2009 , 26(6) : 812 -819 . DOI: 10.7523/j.issn.2095-6134.2009.6.012

Abstract

The proposed localization algorithm first generates clusters and a spanning tree consisting of cluster heads, and then the cluster head computes local coordinates of all member nodes in the cluster. Finally, it generates a global coordinate of all nodes through the above spanning tree. Analysis and simulation show that the proposed algorithm has higher cover rate and precision of localization, lower network traffic, less time consumption, and higher scalability than the existing SDGPSN.

参考文献


[1] Iyengar R, Sikdar B. Scalable and distributed GPS free positioning for sensor networks //IEEE International Conference on Communications(ICC03). Anchorage, AK, USA,2003: 338-342.

[2] Li X, Shi H, Shang Y. A map-growing localization algorithm for ad-hoc wireless sensor networks //Proceedings of the International Conference on Parallel and Distributed Systems-ICPADS. Newport Beach, CA, United States, 2004: 395-402.

[3] Priynatha N B, Balakrishnan H, Demaine E, et al. Anchor-free distributed localization in sensor networks //Proceedings of Conference on Embeded Networked Sensor Systems.Los Angeles, CA, United States,2003: 340-341.

[4] Capkun S, Hamdi M, Hubaux J P. GPS-free positioning in mobile ad-hoc networks //Proceedings of Hawaii International Conference on System Sciences. Maui, HI, United States,2001: 255.

[5] David M, John L, Daniela R,
et al. Robust distributed network localization with noisy range measurements //Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems. ACM: Baltimore, MD, USA, 2004: 50-61.

[6] Shang Y, Ruml W. Improved MDS-based localization //Proceedings of the 23rd Conference of the IEEE Communicatons Society (Infocom 2004). Hong Kong, 2004: 2640-2651.

[7] Kwon O H, Song H J. Localization through map stitching in wireless sensor networks
[J]. Transactions on Parallel and Distributed Systems, 2008, 19(1): 93-105.

[8] Horn B K P, Hilden H M, Negahdaripour S. Closed-form solution of absolute orientation using orthonormal matrices
[J]. Journal of the Optical Society of America A (Optics and Image Science), 1988, 5(7): 1127-1135.

[9] Doucet A, N de Freitas, Gordon N. Sequential Monte Carlo methods in practice
[M]. Germany:Springer,2001.

[10] Kwon O H, Song H J. Stitching orders in patch-and-stitch localization algorithms for wireless sensor networks //Proceedings of 5th Workshop on Positioning, Navigation and Communication 2008. Hannover, Germany,2008: 233-241.

文章导航

/