Node localization algorithm based on kernel function and Markov chains
|更新时间:2024-10-14
|
Node localization algorithm based on kernel function and Markov chains
Vol. 31, Issue 11, Pages: 195-204(2010)
作者机构:
1. 北京邮电大学软件学院
2. 中国科学院计算技术研究所普适计算研究中心
3. 中航工业综合技术研究所
4. 北京邮电大学信息网络中心
作者简介:
基金信息:
DOI:
CLC:TP301.6
Published:2010
稿件说明:
移动端阅览
ZHAO Fang1, LUO Hai-yong2, LIN Quan3, et al. Node localization algorithm based on kernel function and Markov chains[J]. 2010, 31(11): 195-204.
DOI:
ZHAO Fang1, LUO Hai-yong2, LIN Quan3, et al. Node localization algorithm based on kernel function and Markov chains[J]. 2010, 31(11): 195-204.DOI:
Node localization algorithm based on kernel function and Markov chains
摘要
基于贝叶斯滤波框架
提出了基于核函数法及马尔可夫链的节点定位算法
该算法采用射频指纹匹配技术
使用核函数构建似然函数
充分利用观测与多个训练样本之间的相似性
避免使用先验确定型信号分布模型产生的误差。此外
为提高移动目标的定位精度和定位实时性
该算法还使用马尔可夫链
通过利用目标的历史状态和环境布局等信息对匹配定位的网格搜索空间进行限制
剔除目标移动过程中不可能发生的位置跳变。实验证明
与高斯分布模型相比
所提定位算法具有更高的定位正确率和定位精度。
Abstract
To position indoor objects accurately and robustly
a novel node localization based on kernel function and Markov chains was presented
which employs Bayesian filter framework and radio fingerprinting technology.It uses kernel function to construct likelihood function to take full advantage of the similarity between observation and several training samples
which avoids the error brought by employing a priori determined distribution model.Furthermore
the proposed algorithm uses Markov chains to improve the localization accuracy and shorten the positioning time.It limits the search space of the matching grids with object’s previous state and the environment layout
and refuses the object’s impossible position jump during the moving process.Experiments confirm that the proposed localization outperforms the algorithm with Gaussian distribution model.