CAJ | 학술논문

针对LAEP算法存在相邻节点的定位位置相同(或相近)的问题，提出一种基于节点前进跳距期望的定位求精算法( RLAEP )。该算法在LAEP算法的基础上，首先根据每个节点的前进跳距期望挖掘出节点与其邻居节点的距离估计信息，称之为“伪测距距离”；然后计算两节点在网络中的定位位置之间的距离，称之为“计算距离”；最后以减小当前节点间“计算距离”与“伪测距距离”的偏差为目的迭代修正未知节点的定位位置。仿真结果表明，RLAEP算法的定位精度明显高于LAEP算法。
침대LAEP산법존재상린절점적정위위치상동(혹상근)적문제，제출일충기우절점전진도거기망적정위구정산법( RLAEP )。해산법재LAEP산법적기출상，수선근거매개절점적전진도거기망알굴출절점여기린거절점적거리고계신식，칭지위“위측거거리”；연후계산량절점재망락중적정위위치지간적거리，칭지위“계산거리”；최후이감소당전절점간“계산거리”여“위측거거리”적편차위목적질대수정미지절점적정위위치。방진결과표명，RLAEP산법적정위정도명현고우LAEP산법。
In the localization algorithm using expected hop progress( LAEP ),adjacent nodes may be located at the same or close locations.In order to solve this problem,a refinement localization algorithm based on nodes’ expected hop progress(RLAEP)has been put forward in this paper.Firstly,the estimated distances(called virtual range)be-tween each node and its neighbors are obtained according to each node’s expected hop progress.Secondly,this algo-rithm calculates the distances( called computed distances) between two nodes’ estimated locations. Finally,with the purpose of decreasing the deviation of computed distances and the virtual range,the estimated locations of unknown nodes are iteratively corrected.Simulation results show that RLAEP has obviously higher positioning precision than LAEP .