检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京科技大学信息工程学院135信箱,北京100083 [2]中国海洋大学工程学院,山东青岛266100
出 处:《小型微型计算机系统》2009年第6期1082-1088,共7页Journal of Chinese Computer Systems
基 金:国家“八六三”计划基金项目(2006AA09Z115)资助
摘 要:提出一种WSN节点定位的新算法.算法依据无线信号能量衰减的对数常态分布模型及正态分布的"3σ"法则建立接收信号强度与距离的区间映射关系.未知节点根据接收信号强度判断自己所处的能量区间,进而判定所处信标节点的射程区间.将射程区间信息转化为几何距离约束条件画弧,得到包围此未知节点的"目标环段区域",其中心作为未知节点的估计位置.仿真实验表明,本文算法在节点布放区域边长与无线射程接近或小于无线射程的条件下比Centroid、APIT、Bounding-Box、MLE算法具有更高的定位精度.A novel localization algorithm for wireless sensor network is presented. It established an interval mapping between the received signal power and the transmission range on the basis of the log-normal shadowing model and the "3a" principle of normal distribution. With this interval mapping technique, an unknown node got the energy intervals through received signal strengths (RSS), and then determined which distance intervals of the transmission range it was located in from beacons. By transforming those intervals information into distance constraints, this algorithm drew arcs and thus formed several annulussegment areas. Their intersection, named "the target annulus-segment region", is the minimum area by which the unknown node is hemmed in, and its center position is applied to estimate the location of the unknown node. Compared with other RF- based localization algorithms such as Centroid, Bounding-Box, APIT and MLE, our algorithm performs better when the side length of the nodes distribution area is approximate to or shorter than the transmission range of the sensor nodes.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229