| 基于二跳生成树的可扩展分簇定位算法 |
| |
| 作者姓名： | 苗付友 熊焰 王新霞 |
| |
| 作者单位： | 1. 中国科学技术大学计算机系,合肥 23002
2. 信阳师范学院计算机与信息技术学院,信阳 464000 |
| |
| 摘 要： | 着重设计了一种基于二跳生成树的可扩展分簇定位算法.首先对传感器网络进行分簇、并利用簇头节点构造一个二跳生成树;在此基础上,由簇头计算各簇成员节点的局部坐标;最后,从生成树根节点开始,自顶向下合并各簇,生成所有节点的全局坐标,完成节点的相对定位. 理论分析与实验表明,本算法相对于现有的SDGPSN算法,能够有效提高定位覆盖率和定位精度,减少时间和通信开销,并具有更好的可扩展性.
|
| 关 键 词： | 无线传感器网络 相对定位 分簇 二跳生成树 |
| 收稿时间： | 2008-12-04 |
| 修稿时间： | 2009-06-04 |
A 2-hop spanning tree based scalable clustered localization algorithm for wireless sensor networks |
| |
| Authors: | MIAO Fu-You XIONG Yan WANG Xin-Xia |
| |
| Institution: | 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 |
| |
| 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. |
| |
| Keywords: | wireless sensor networks relative localization clustering 2 hop spanning tree |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
|
