基于阶次序列与凸规划的铀尾矿库监测定位算法  

A localization algorithm of uranium tailings monitoring based on rank sequence and convex programming

作　　者：余修武[1,2] 胡沐芳 周利兴 张可[1] 刘琴[1] 

机构地区：[1]南华大学环境保护与安全工程学院,湖南衡阳421001 [2]金属矿山安全与健康国家重点实验室,安徽马鞍山243000

出　　处：《中国安全生产科学技术》2016年第12期86-91,共6页Journal of Safety Science and Technology

基　　金：湖南省重点研发项目(2015SK2005);湖南省教育厅科研重点项目(15A161)

摘　　要：在铀尾矿库放射性核素泄露污染WSN监测中,针对凸规划定位精度低的问题,提出一种基于阶次序列的凸规划定位算法。通过划分子区域缩小未知节点几何约束范围,建立各子区域的重心坐标到锚节点的阶次序列表,计算未知节点序列与序列表的相关度,并以最大相关度的子区域重心坐标为定位结果。使该改进算法满足低密度条件的定位并能减少其计算量提高定位精度。经过仿真,新算法较凸规划算法在定位精度上提高了14%。For the WSN monitoring of radionuclide leakage and pollution in uranium tailings,aiming at the problem about low localization precision of convex programming,a convex programming localization algorithm based on rank sequence was put forward. The geometric constraint range of unknown node was reduced by dividing the subregion,and the rank sequence table of barycentric coordinate in each subregion to anchor node was established. The correlation degree of unknown node sequence and sequence table was calculated,and the barycentric coordinate of the subregion with the largest correlation degree was taken as the localization result. The improved algorithm can satisfy the localization under low density condition,reduce the amount of calculation,and increase the localization precision. Through the simulation,it showed that the localization precision of new algorithm increased by 14% compared with the convex programming algorithm.

关 键 词：WSN 凸规划 阶次序列 子区域 监测定位 铀尾矿库 

分 类 号：X936[环境科学与工程—安全科学]