Ad Hoc网络中基于骨干网的相对定位算法研究.pdf

ISSN 计算机研究与发展 1000—12391CN11—17771TP of Researchand JournalComputer Development Ad Hoe网络中基于骨干网的相对定位算法研究 田明军 赵 丹 王靖轩 严 伟 (北京大学计算机科学与技术系 北京 100871) (tmj@net．pku．edu．cn) Backbone-BasedRelative inAdHocNetworks Positioning Tian un，Zhao YanWei Mingj Dan，WangJingxuan，and Scienceand 100871) (DepartmentofComputer Technology，PekingUniversity，Beijing AbstractRelative isahot inadhocnetwork．Andself isan positioningtopic positioningalgorithm essentialworkinthisfield．AfterSPAwas havedonealotofworksinorderto proposed，people get better while thecommunicationcOSt．Mostoftheseworksretainthemain accuracyreducing architectureof ofthemnamedclusterbased decreasesthecommunicationcostof SPA．One approach in of tWO local SPA ithas terms successfully．Butbigproblems accuracy．Whenmergingneighboring lOW in coordinate resultsareambitious．Andit thuscauses systems。the accuracypositioning whenthereisa node in is anewrelative especially large number．Proposedpaper positioning is backbone—based．Thebackbone—basedcontains three algorithm，BBA，which algorithm mainly ofnodesisselectedtoestablishabackbone nodeonthe network，then steps：firstly，apart every backbonebuildsa localcoordinate thelocalcoordinateare toa