| 无线传感器网络E-Euclidean集中式定位算法 |
| |
| 引用本文： | 欧阳宇,王潮,施惠昌.无线传感器网络E-Euclidean集中式定位算法[J].上海大学学报(自然科学版),2008,14(1):1-6. |
| |
| 作者姓名： | 欧阳宇 王潮 施惠昌 |
| |
| 作者单位： | 上海大学 通信与信息工程学院，上海 200072 |
| |
| 摘 要： | 针对无线传感器网络特点,在算法初始阶段,增加计算信标点到待定位点Euclidean(欧几里德)距离,用最大似然粗略估计节点位置,根据此初始位置用最小二乘的加权融合思想循环求精.提出多跳Euclidean距离计算方法,对其多解提出解决方案.在对加权矩阵的求解提出新看法的基础上,搜索满足定位条件的待定位节点,定位后的节点升级为辅助信标点.仿真结果表明，在网络连通度为8的条件下，这是一种精度高、覆盖率高的实用性算法.
|
| 关 键 词： | 定位 集中式 无线传感器网络 增强型欧几里德 |
| 文章编号： | 1007-2861（2008）01-0001-06 |
| 收稿时间： | 2006-11-14 |
| 修稿时间： | 2006年11月14 |
E-Euclidean Centralized Localization in Wireless Sensor Networks |
| |
| OUYANG Yu,WANG Chao,SHI Hui-chang.E-Euclidean Centralized Localization in Wireless Sensor Networks[J].Journal of Shanghai University(Natural Science),2008,14(1):1-6. |
| |
| Authors: | OUYANG Yu WANG Chao SHI Hui-chang |
| |
| Institution: | School of Communication and Information Engineering, Shanghai University, Shanghai 200072, China |
| |
| Abstract: | We develop an algorithm that computes the Euclidean distance between beacon node and orphan node, estimates the position of orphan node by maximum likely-hood algorithms, and acquires a more precise position by the WLS calculating iteratively. Three methods are given to solve the problems of multi-hops Euclidean distances. Based on a new opinion over the weighted matrix, the algorithm makes overall plans to look for orphan nodes up to the localization conditions. The orphan node becomes assistant beacon node to aid localization after being localized. Simulation results demonstrate that the average error of positioning is lower and coverage is better when connectivity is 8. |
| |
| Keywords: | wireless sensor networks localization centralized computation E-Euclidean |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《上海大学学报(自然科学版)》下载免费的PDF全文 |
