CAJ | 학술논문

近些年来，将优化算法应用到节点定位问题当中成为了一个研究热点。本文假设下一次定位结果为准确坐标，对前后两次定位结果邻居节点之间距离关系进行深度分析和推导，得到一个邻域函数。在此基础上根据贪婪思想，提出了贪婪定位算法。为了达到更精确的定位结果，本文将贪婪定位算法分成两个阶段：第一阶段，根据贪婪迭代优化得到一组初始定位结果；第二阶段将满足一定条件的未知节点升级为锚节点，重新执行第一阶段的过程，重复第二阶段，直到没有未知节点可以升级为锚节点为止。实验结果表明，无论是定位精确度还是算法执行时间，本文所提算法都比当前的一些优化定位算法要好。
근사년래，장우화산법응용도절점정위문제당중성위료일개연구열점。본문가설하일차정위결과위준학좌표，대전후량차정위결과린거절점지간거리관계진행심도분석화추도，득도일개린역함수。재차기출상근거탐람사상，제출료탐람정위산법。위료체도경정학적정위결과，본문장탐람정위산법분성량개계단：제일계단，근거탐람질대우화득도일조초시정위결과；제이계단장만족일정조건적미지절점승급위묘절점，중신집행제일계단적과정，중복제이계단，직도몰유미지절점가이승급위묘절점위지。실험결과표명，무론시정위정학도환시산법집행시간，본문소제산법도비당전적일사우화정위산법요호。
Using optimization algorithm to solve the node localization problem has become a research focus .This paper makes deep analysis on the distance relationship between two successive localization results and designs a neighborhood function , and then proposes the greedy localization algorithm based on greedy idea .The proposed algorithm is divided into two phases .In the first phase ,a set of estimated positions is generated based on the greedy iterative optimization .In the second phase ,some unknown nodes will be elevated to anchor nodes ,and the first phase is executed again .The second phase is repeated until there is no node that can be elevated to an anchor node .Finally ,the experimental results show the proposed algorithm achieves more accurate result and take less time than the existing optimization localization algorithms .