检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吕春峰[1] 朱建平[1] 陶正苏[2] LU Chun-feng;ZHU Jian-ping;TAO Zheng-su(College of Engineering Science and Technology,Shanghai Ocean University,Shanghai 201306,China;School of Electronic Information & Electrical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
机构地区:[1]上海海洋大学工程学院,上海201306 [2]上海交通大学电子信息与电气工程学院,上海200240
出 处:《传感器与微系统》2018年第10期28-31,共4页Transducer and Microsystem Technologies
基 金:国家自然科学基金资助项目(61362017)
摘 要:针对传统的蒙特卡洛(MC)移动定位方法迭代次数较多、样本数量易衰减、观测值多样性差等缺点,提出了改进的群蒙特卡洛定位(PMCL)机制:采用两重限制手段降低迭代次数;采用蒙特卡洛群对重采样进行精确匹配。基于节点密度、锚节点分布比例、样本数量等参数,对PMCL机制进行理论分析和实验仿真。PMCL机制与其他的基于序列蒙特卡洛(SMC)机制进行性能比较。结果表明:PMCL机制的延时性能得到了较大提高,且在节点移动速度较低、节点密度较大的情况下,其定位准确度也优于其他的定位机制。Aiming at shortcomings of more iterative times,sample size tends to decay and diversity of observed values is poor of traditional Monte Carlo( MC) mobile localization,an improved localization method for mobile wireless sensor networks( WSNs) based on population MC localization( PMCL) method is proposed. Two-constrains are proposed to decrease iterative times and PMC is introduced to match resampling precisely. Based on node density,anchor node distribution proportion and sample number and other parameters,theoretical analysis and experimental simulation on PMCL scheme are carried out. Performance comparisons of PMCL with other sequential Monte Carlo( SMC)-based schemes are carried out. Simulation results show that delay of PMCL scheme has some superiority to those of other schemes,and accuracy is improved in some cases of lower node moving velocity and larger node density.
关 键 词:无线传感器网络 移动定位机制 隐藏终端耦合机制 群蒙特卡洛定位机制
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.151