检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北农业大学理学院,黑龙江哈尔滨150030 [2]积成电子股份有限公司,山东济南250100
出 处:《传感器与微系统》2014年第8期127-130,共4页Transducer and Microsystem Technologies
摘 要:针对合作传感器网络的定位问题,提出在未知节点周转时间(TATs)条件下估计多个目标节点位置的方案。在该方案中,每个目标节点能与多个锚节点、其他目标节点通信,并测量它们间的双向到达时间(TW-TOA)值,其包括在信道终端的处理时延。基于这些测量值,对目标节点位置和TATs进行最大似然估计(MLE),而这产生了非凸优问题,为此,将其近似转化为非线性最小二乘问题。最后,通过欧氏距离矩阵(EDM)对多个目标节点位置和TATs的值进行估计。仿真结果表明:提出的方案具有良好的定位精度。在不同的场景下,提出的方案的均方根误差逼近克莱姆—拉奥下限(CRLB)。Aiming at localization problem of cooperative sensor network, propose scheme to estimate multiple nodes positions in the presence of unknown turn-around times (TATs). In the adopted scheme, each target node can communicate with several anchor nodes and other target nodes, and two-way times-of-arrival between them are measured,which includes processing delays at both channel endpoints. The maximum likelihood estimates (MLE) of positions of target node and turn-around times(TATs) is carded out based on those measurement value, which generate non-convex optimization problem, it is approximated transform to nonlinear least squares problem. Finally, positions and TATs of multiple target nodes are estimated jointly by solving Euclidean distance matrix. Simulation result show that the proposed method has good localization precision,under different scenes, RMSE of the proposed scheme approach the Cramer-Rao lower bound (CRLB).
关 键 词:合作传感器网络 定位 周转时间 双向到达时间 欧氏距离矩阵 克莱姆—拉奥下限
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28