一种基于MCB的自适应和声搜索定位算法  

A self-adaptive harmony search localization algorithm based on MCB

作　　者：孙崇[1] 孙子文[1] 

机构地区：[1]江南大学物联网工程学院,江苏无锡214122

出　　处：《传感器与微系统》2015年第4期119-122,共4页Transducer and Microsystem Technologies

基　　金：国家自然科学基金资助项目(61174032);江苏省自然科学基金面上项目(BK20131107)

摘　　要：针对无线传感器网络锚节点稀疏条件下节点定位中存在的翻转现象和定位精度问题,提出了一种基于MCB的自适应和声搜索定位算法。通过引入MCB算法中的采样思想,随机产生网络拓扑约束下的未知节点的坐标,引入自适应的和声保留概率和音调调节概率,达到提高搜索能力和定位精度目的。仿真结果表明:算法能有效解决翻转现象,提高定位精度,提出的算法在定位精度和计算量方面优于对比算法。Aiming at problem of flip ambiguity and localization precision, a self-adaptive harmony search algorithm for wireless sensor networks （WSNs） node localization is proposed. Based on the Sampling Theory of Monte Carlo localization boxed （ MCB）, the coordinates of unknown nodes are generated randomly under the restriction of the network topology constraints, in order to improve the search ability and the localization precision, introduce adaptive harmony memory considering rate （HMCR） and pitch adjusting rate （PAR）. Simulation results show that the algorithm can effectively address the flip ambiguity and improve the localization precision, and the algorithm outperforms,in terms of localization precision and computational complexity compared with otherst.

关 键 词：无线传感器网络 定位 翻转现象 自适应 和声搜索算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]