CAJ | 학술논문

提出一种基于距离和信号到达角信息的无线传感器网络节点自身定位算法.在所有节点的坐标轴方向都是未知的假定下,用信号到达角信息来计算信号到达角度差,然后将定位问题转化为一个凸集优化问题,节点间的几何关系也相应地转化成为线性或二次约束条件.当距离和角度测量值足够精确时,该算法是一个线性规划问题.考虑测量误差时,通过引入辅助变量,该算法可以转化为二次规划问题.通过仿真分析证明了该定位算法的有效性,并对距离和角度误差量对定位精度的影响进行了定量分析.仿真结果表明,在距离和角度误差为5%的时候,该定位算法可以满足定位精度要求.
제출일충기우거리화신호도체각신식적무선전감기망락절점자신정위산법.재소유절점적좌표축방향도시미지적가정하,용신호도체각신식래계산신호도체각도차,연후장정위문제전화위일개철집우화문제,절점간적궤하관계야상응지전화성위선성혹이차약속조건.당거리화각도측량치족구정학시,해산법시일개선성규화문제.고필측량오차시,통과인입보조변량,해산법가이전화위이차규화문제.통과방진분석증명료해정위산법적유효성,병대거리화각도오차량대정위정도적영향진행료정량분석.방진결과표명,재거리화각도오차위5%적시후,해정위산법가이만족정위정도요구.
A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences between two nodes viewed by the third one. Then, localization problems are formulated as convex optimization ones and all geometric relationships among different nodes in the communication range are transformed into linear or quadratic constraints. If all measurements are accurate, the localization problem can be formulated as linear programming(LP). Otherwise, by incorporating auxiliary variables, it can be regarded as quadratic programming(QP). Simulations show the effectiveness of the proposed algorithm.