#### DMCA

## Analysis of flip ambiguities for robust sensor network localization

Venue: | Vehicular Technology, IEEE Transactions on |

Citations: | 5 - 0 self |

### Citations

804 | Dynamic fine-grained localization in ad-hoc networks of sensors
- Savvides, Han, et al.
- 2001
(Show Context)
Citation Context ... Subsequently, G, H , and I will get localized at Ĝ, Ĥ , and Î , respectively. Here, a flip ambiguity in D (and E) caused nodes F , G, H , and I to have large estimation errors. localization [22], =-=[23]-=-, [30]–[32]. A similar explanation of flip-ambiguity effects in a cluster localization followed by stitching/patching [15], [24], [33]–[35] can be found in [18]. For convenience, we call a sensor with... |

457 | GPS-free positioning in mobile ad-hoc networks
- Capkun, Hamdi, et al.
- 2001
(Show Context)
Citation Context ...es F , G, H , and I to have large estimation errors. localization [22], [23], [30]–[32]. A similar explanation of flip-ambiguity effects in a cluster localization followed by stitching/patching [15], =-=[24]-=-, [33]–[35] can be found in [18]. For convenience, we call a sensor with a priori known location or whose location has already been estimated as an anchor or a known sensor node and a sensor with unkn... |

388 | Robust distributed network localization with noisy range measurements.
- Moore, Leonard, et al.
- 2004
(Show Context)
Citation Context ...n locations of some specific sensors and a given set of intersensor distance measurements is unique or not. A particular framework that is useful for analyzing this problem is rigid graph theory [12]–=-=[15]-=-. In this framework, the sensor network to be localized is modeled by a graph called the underlying graph of the sensor network, where the vertices of the graph represent sensor nodes, and all the ver... |

379 | Robust positioning algorithms for distributed ad-hoc wireless sensor networks
- SAVARESE, RABAY, et al.
- 2002
(Show Context)
Citation Context ...quently, G, H , and I will get localized at Ĝ, Ĥ , and Î , respectively. Here, a flip ambiguity in D (and E) caused nodes F , G, H , and I to have large estimation errors. localization [22], [23], =-=[30]-=-–[32]. A similar explanation of flip-ambiguity effects in a cluster localization followed by stitching/patching [15], [24], [33]–[35] can be found in [18]. For convenience, we call a sensor with a pri... |

298 | Relative location estimation in wireless sensor networks
- Patwari, Perkins, et al.
(Show Context)
Citation Context ...if and only if the true distance |XY | ≤ R. In accordance with this disc transmission model, any intersensor distance measurement dXY > R is assumed to be truncated to R. Furthermore, as justified in =-=[36]-=-, this analysis uses a Gaussian distribution with zero mean and a standard deviation of σ as the noise model for the distance measurement errors. Thus, it is possible to state that the absolute value ... |

296 | Distributed localization in wireless sensor networks: a quantitative comparison
- Langendoen, Reijers
- 2003
(Show Context)
Citation Context ...ized algorithms [5]–[8] use a single central processor to collect all distance measurements between neighboring nodes and produce a map of the entire sensor network, while distributed algorithms [5], =-=[9]-=-–[11] rely on the self-localization of each sensor node in a sensor network using the distance measurements they collect from one-hop and multihop neighbors and the a priori known or estimated locatio... |

238 | Location in distributed ad-hoc wireless sensor networks - Savarese, Rabaey, et al. - 2001 |

236 | DV based positioning in ad hoc networks
- NICULESCU, 2003a
(Show Context)
Citation Context .... Designing an efficient distributed algorithm for global rigidity, however, is nontrivial, as neither connectivity nor rigidity can be tested locally by nature [21]. In practice, trilateration [15], =-=[22]-=-–[26] is widely used to localize the unknown sensor nodes, as it is fully distributed and easily implementable. The study in [21] pointed out that wheel graphs are globally rigid and that trilateratio... |

223 | Semidefinite programming for ad hoc wireless sensor network localization
- Biswas, Ye
- 2004
(Show Context)
Citation Context ...ent errors, it may cause erroneous local geometric realizations in those parts of the network.1 This is a major problem affecting the unique realizability of the distance-based localization [4], [6], =-=[7]-=-. One such phenomenon is flip ambiguity, which can prevent unique localization of the sensor network [14]–[17] (in the sense that it differs from other such representations at most by translation, rot... |

202 | Wireless sensor network localization techniques,”
- Mao, Fidan, et al.
- 2007
(Show Context)
Citation Context ... by such sensor nodes, in general, will be useless without determining the locations of these nodes. This makes self-localization capabilities a highly desirable characteristic of sensor networks [1]–=-=[4]-=-. Sensor network-localization algorithms use intersensor measurements, which can be in the form of distance measurements, bearing measurements, time-difference-of-arrival measurements, etc., and the a... |

177 | Improved MDS-Based Localization - Shang, Ruml, et al. - 2004 |

166 | BBayesian filtering for location estimation - Fox, Hightower, et al. - 2003 |

153 | Conditions for unique graph realizations
- HENDRICKSON
- 1992
(Show Context)
Citation Context ...r any vertex pair X,Y ∈ V , which are connected by an edge in E, from being unique (in the sense that it differs from other such representations at most by translation, rotation, or reflection) [15], =-=[16]-=-: flip and discontinuous flex ambiguities. Discontinuous flex ambiguities arise when the removal of an edge or a set of edges allows the remaining part of the graph to be flexed continuously to a diff... |

145 | Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling”, inIEEE INFOCOM
- Ji, Zha
- 2004
(Show Context)
Citation Context ... G, H , and I to have large estimation errors. localization [22], [23], [30]–[32]. A similar explanation of flip-ambiguity effects in a cluster localization followed by stitching/patching [15], [24], =-=[33]-=-–[35] can be found in [18]. For convenience, we call a sensor with a priori known location or whose location has already been estimated as an anchor or a known sensor node and a sensor with unknown lo... |

119 | A theory of network localization
- Aspnes, Eren, et al.
(Show Context)
Citation Context ... known locations of some specific sensors and a given set of intersensor distance measurements is unique or not. A particular framework that is useful for analyzing this problem is rigid graph theory =-=[12]-=-–[15]. In this framework, the sensor network to be localized is modeled by a graph called the underlying graph of the sensor network, where the vertices of the graph represent sensor nodes, and all th... |

111 | Network-based wireless location: challenges faced in developing techniques for accurate wireless location information - Sayed, Tarighat, et al. - 2005 |

108 | Localization from connectivity in sensor networks
- Shang, Ruml, et al.
(Show Context)
Citation Context ...surement errors, it may cause erroneous local geometric realizations in those parts of the network.1 This is a major problem affecting the unique realizability of the distance-based localization [4], =-=[6]-=-, [7]. One such phenomenon is flip ambiguity, which can prevent unique localization of the sensor network [14]–[17] (in the sense that it differs from other such representations at most by translation... |

93 | Nonparametric belief propagation for self-localization of sensor networks
- Ihler, Moses, et al.
- 2005
(Show Context)
Citation Context ... algorithms [5]–[8] use a single central processor to collect all distance measurements between neighboring nodes and produce a map of the entire sensor network, while distributed algorithms [5], [9]–=-=[11]-=- rely on the self-localization of each sensor node in a sensor network using the distance measurements they collect from one-hop and multihop neighbors and the a priori known or estimated locations of... |

92 | Mobile positioning using wireless networks: possibilites and fundamental limitations based on available wireless network measurements - Gustafsson, Gunnarsson - 2005 |

59 | Localization in sparse networks using sweeps
- Goldenberg, Bihler, et al.
- 2006
(Show Context)
Citation Context ... graph realization theory does not account for measurement errors affecting intersensor measurements in real applications [25]. For sparse networks with noisy measurements, the algorithms in [27] and =-=[28]-=- recorded all possible location estimates of each sensor and eliminate the incompatible location estimates whenever possible, which, in the worst case, can result in an exponential space requirement. ... |

57 | Network Localization in Partially Localizable Networks
- Goldenberg, Krishnamurthy, et al.
- 2005
(Show Context)
Citation Context ...or problem affecting the unique realizability of the distance-based localization [4], [6], [7]. One such phenomenon is flip ambiguity, which can prevent unique localization of the sensor network [14]–=-=[17]-=- (in the sense that it differs from other such representations at most by translation, rotation, or reflection). In flip ambiguities, a sensor node (or sensor nodes) with a set of neighbors that are a... |

41 | Beyond trilateration: On the localizability of wireless ad-hoc networks
- Yang, Liu, et al.
(Show Context)
Citation Context ...idity is defined later in Section III-A. Designing an efficient distributed algorithm for global rigidity, however, is nontrivial, as neither connectivity nor rigidity can be tested locally by nature =-=[21]-=-. In practice, trilateration [15], [22]–[26] is widely used to localize the unknown sensor nodes, as it is fully distributed and easily implementable. The study in [21] pointed out that wheel graphs a... |

37 | Resilient localization for sensor networks in outdoor environments
- Kwon, Mechitov, et al.
- 2005
(Show Context)
Citation Context ... , and I to have large estimation errors. localization [22], [23], [30]–[32]. A similar explanation of flip-ambiguity effects in a cluster localization followed by stitching/patching [15], [24], [33]–=-=[35]-=- can be found in [18]. For convenience, we call a sensor with a priori known location or whose location has already been estimated as an anchor or a known sensor node and a sensor with unknown locatio... |

32 |
Generic global rigidity, Discrete Comput
- Connelly
(Show Context)
Citation Context ...raph G = (V,E) and a representation of it, the pair (G, p) is called a framework. A particular graph property associated with the unique realizability of sensor networks is global rigidity [4], [12], =-=[13]-=-, [29]. A framework (G, p) is globally rigid if every framework (G, p1) satisfying ‖p(X)− p(Y )‖ = ‖p1(X)− p1(Y )‖ for any vertex pair X,Y ∈ V , which are connected by an edge in E, also satisfies the... |

31 | 2008. Connectivity-based localization of large scale sensor networks with complex shape
- Lederer, Wang, et al.
(Show Context)
Citation Context ...tion estimation of the sensor nodes. The main aim of these methods is to estimate the locations of the sensor nodes with minimum error. The notions of Voronoi diagrams and Delaunay graphs are used in =-=[19]-=- and [20] to glue the Delaunay triangles in an incremental fashion to achieve unique localization of boundary or landmark sensors. These sensors are then used as anchors to localize the rest of the ne... |

21 | Simulated Annealing based Wireless Sensor Network Localization with Flip Ambiguity Mitigation
- Kannan, Mao, et al.
- 2006
(Show Context)
Citation Context ...rocessing the distance measurements, distance-based localization algorithms can be categorized into two main classes [5]: centralized algorithms and distributed algorithms. Centralized algorithms [5]–=-=[8]-=- use a single central processor to collect all distance measurements between neighboring nodes and produce a map of the entire sensor network, while distributed algorithms [5], [9]–[11] rely on the se... |

19 | Graphical properties of easily localizable sensor networks
- Anderson, Belhumeur, et al.
(Show Context)
Citation Context ... ∈ V is uniquely associated with a sensor node sX in the network, and each edge (X,Y ) ∈ E uniquely corresponds to a sensor node pair (sX , sY ) for which the intersensor distance is known [12]–[17], =-=[29]-=-. The graph G(V,E) is called the underlying graph of the network. The planar location information about the sensor nodes corresponds to a 2-D representation of the representative graph, which is a map... |

13 |
The Distributed Construction of a Global Coordinate System in a Network of Static Computational Nodes from
- Meertens, Fitzpatrick
(Show Context)
Citation Context ...ly, G, H , and I will get localized at Ĝ, Ĥ , and Î , respectively. Here, a flip ambiguity in D (and E) caused nodes F , G, H , and I to have large estimation errors. localization [22], [23], [30]–=-=[32]-=-. A similar explanation of flip-ambiguity effects in a cluster localization followed by stitching/patching [15], [24], [33]–[35] can be found in [18]. For convenience, we call a sensor with a priori k... |

11 | 2009. Connectivity-based sensor network localization with incremental delaunay refinement method
- Wang, Lederer, et al.
(Show Context)
Citation Context ...mation of the sensor nodes. The main aim of these methods is to estimate the locations of the sensor nodes with minimum error. The notions of Voronoi diagrams and Delaunay graphs are used in [19] and =-=[20]-=- to glue the Delaunay triangles in an incremental fashion to achieve unique localization of boundary or landmark sensors. These sensors are then used as anchors to localize the rest of the network. Su... |

7 |
Signal processing techniques in network-aided positioning: a survey of state-of-the-art positioning designs
- Guolin, Jie, et al.
- 2005
(Show Context)
Citation Context ...ered by such sensor nodes, in general, will be useless without determining the locations of these nodes. This makes self-localization capabilities a highly desirable characteristic of sensor networks =-=[1]-=-–[4]. Sensor network-localization algorithms use intersensor measurements, which can be in the form of distance measurements, bearing measurements, time-difference-of-arrival measurements, etc., and t... |

4 |
Robust distributed sensor network localization based on analysis of flip ambiguities
- Kannan, Fidan, et al.
- 2008
(Show Context)
Citation Context ...scription of flip ambiguities and the resulting avalanche error-propagation effects are given in Sections III and IV. An empirical study on the frequency of flip-ambiguity occurrences is presented in =-=[18]-=-. This study shows that with an increasing number of neighbors of a location-unknown sensor node, the frequency of flipped realizations reduces (but never gets to zero). Moreover, at the initial stage... |

3 | Localization of sensor networks using sweeps - Fang, Cao, et al. - 2006 |

2 |
Analysis of flip ambiguities in distributed network localization
- Kannan, Fidan, et al.
- 2007
(Show Context)
Citation Context ...igning an efficient distributed algorithm for global rigidity, however, is nontrivial, as neither connectivity nor rigidity can be tested locally by nature [21]. In practice, trilateration [15], [22]–=-=[26]-=- is widely used to localize the unknown sensor nodes, as it is fully distributed and easily implementable. The study in [21] pointed out that wheel graphs are globally rigid and that trilateration is ... |

1 |
Sensor network localization
- Mao, Fidan, et al.
- 2006
(Show Context)
Citation Context ... chosen using (26). For a sensor network with a large number of sensor nodes, it is reasonable to assume the sensor distribution to be uniform, and such an assumption has widely been used in the area =-=[5]-=-–[7], [15], [22], [33]. Changing the sensor distribution method may only affect the frequency of collinear placement of sensor nodes. The focus of this paper is on identifying possible flip ambiguitie... |

1 |
Robust localization for wireless sensor networks
- Sittile, Spirito
(Show Context)
Citation Context ...ensate the need for global rigidity in some graph structure [4]. Moreover, the graph realization theory does not account for measurement errors affecting intersensor measurements in real applications =-=[25]-=-. For sparse networks with noisy measurements, the algorithms in [27] and [28] recorded all possible location estimates of each sensor and eliminate the incompatible location estimates whenever possib... |