二元探测传感器网络的递推加权质心目标定位算法  

A recursive weighted-centroid algorithm for object location in binary sensor networks

作　　者：李煜[1] 程远国[1,2] 杨露菁[1] 

机构地区：[1]海军工程大学电子工程学院,武汉430033 [2]华中科技大学计算机科学与技术学院,武汉430074

出　　处：《海军工程大学学报》2008年第5期42-45,70,共5页Journal of Naval University of Engineering

基　　金：湖北省自然科学基金资助项目(2007ABA299)

摘　　要：为进一步降低二元探测传感器网络质心定位算法的计算复杂度和通信量、提高定位精度,推导出一种质心算法的递推公式,使用该递推公式可以大大减少定位的计算、存储和通信量;在递推质心公式的基础上,提出了一种基于节点探测到目标的次数的递推加权质心定位算法,从而提高了定位精度。对递推公式和加权质心算法进行了模拟仿真,结果验证了递推公式和加权递推质心算法的有效性。In order to decrease the complex computation and communication load, and improve the locating accuracy of the centroid locating algorithm in binary sensor networks, the following tasks were carried out. A recursive computing formula for centroid algorithm was deduced, which could greatly decrease computation, storage and communication load of object locating; a recursive weighted centroid algorithm was further presented based on the recursive centroid formula, which was employed for a node to detect an object as a weight of this node in centroid algorithm, and thus enhanced the locating accuracy. Simulations were also made and the results prove the validity of the recursive formula and locating algorithm.

关 键 词：无线传感器 目标定位 二元探测 质心算法 

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