Analysis ofFlipAmbiguities inDistributed Network Localization
Anushiya A. Kannan, Guoqiang Mao · 2007
istrilateration [4], [11], [12], whereateach(local) stepthe Accurate self-localization capability ishighly desirable in location ofa nodeisestimated using theinformation about itsneighbor nodeswhosepositions orposition estimates are basedwireless sensornetworks.A mocalizajiorpro n tatryiateran available, together withthedistance measurements fromthese basedwireless sensor network localization that mayintroduce negho noes large errors inthelocation estimates isflip ambiguity. RecentlyA ndens thenotion ofrobust quadrilaterals hasbeenintroduced asa loaiatintis whether agiven sensornetwork waytoidentify possible flip ambiguities that otherwise corruptlocalizabeon iethe sensornetworkgeometry localization computations. Inthis paper, weprovide aformal . ' analysisof flipamb tpcorresponding toa given setofinter-sensor distance meageometric analysis offlip ambiguity problems using similarsurements isunique ornot.A particular framework thatis notions. Thetwomainobjectives ofthepaperarefilling some useful foranalyzing andsolving thisproblem, especially in technical gapsintherecent relevant worksanddeveloping a thetrilateration context, isrigid graph theory [1 I]-[14]. Inthis generic formal method forquantifying thelikelihood ofsuf-framework, thesensornetwork tobelocalized ismodelled by fering from flip ambiguities forarbitrary sensorneighborhood agraph, wherevertices ofthegraphrepresent sensor nodes geometries.