Derivation of flip ambiguity probabilities to facilitate robust sensor network localization

Kannan, AA; Fidan, B; Mao, G

Derivation of flip ambiguity probabilities to facilitate robust sensor network localization

Kannan, AA Fidan, B Mao, G

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Wireless Communications and Networking Conference, WCNC, 2009
Issue Date:: 2009-09-22

Closed Access

	Filename	Description	Size
	2013001586OK.pdf		454 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Kannan, AA	en_US
dc.contributor.author	Fidan, B	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.date.issued	2009-09-22	en_US
dc.identifier.citation	IEEE Wireless Communications and Networking Conference, WCNC, 2009	en_US
dc.identifier.isbn	9781424429486	en_US
dc.identifier.issn	1525-3511	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29481
dc.description.abstract	Erroneous local geometric realizations in some parts of the network due to their sensitivity to certain distance measurement errors is a major problem in wireless sensor network localization. This may in turn affect the localization of either the entire network or a large portion of it. This phenomenon is well-described using the notion of "flip ambiguity" in rigid graph theory. In this paper we analytically derive an expression for the flip ambiguity probabilities of arbitrary neighborhoods in two dimensional sensor networks. This probability can be used to mitigate flip ambiguities in two ways: 1) If an unknown sensor finds the probability of flip ambiguity on its location estimate larger than a predefined threshold, it may choose not to localize itself 2) Every known neighbor can be assigned with a confidence factor to its estimated location, reflecting the probability of flip ambiguity; a sensor with an initially unknown location can then choose only those known neighbors with a confidence factor greater than a predefined threshold. A recent study by co-authors have shown that the performance of sequential and cluster based localization schemes in the literature can be significantly improved by correctly identifying and removing neighborhoods with possible flip ambiguities from the localization process. One motivation of this paper is to enhance the performance of the robustness criterion presented in that study by accurately identifying the flip ambiguity probabilities of arbitrary neighborhoods. The various simulations done in this study show that our analytical calculations of the probability of flip ambiguity matches with the simulated detection of the probability very accurately. © 2009 IEEE.	en_US
dc.relation.ispartof	IEEE Wireless Communications and Networking Conference, WCNC	en_US
dc.relation.isbasedon	10.1109/WCNC.2009.4917661	en_US
dc.title	Derivation of flip ambiguity probabilities to facilitate robust sensor network localization	en_US
dc.type	Conference Proceeding
utslib.for	1006 Computer Hardware	en_US
dc.location.activity	Budapest	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

Erroneous local geometric realizations in some parts of the network due to their sensitivity to certain distance measurement errors is a major problem in wireless sensor network localization. This may in turn affect the localization of either the entire network or a large portion of it. This phenomenon is well-described using the notion of "flip ambiguity" in rigid graph theory. In this paper we analytically derive an expression for the flip ambiguity probabilities of arbitrary neighborhoods in two dimensional sensor networks. This probability can be used to mitigate flip ambiguities in two ways: 1) If an unknown sensor finds the probability of flip ambiguity on its location estimate larger than a predefined threshold, it may choose not to localize itself 2) Every known neighbor can be assigned with a confidence factor to its estimated location, reflecting the probability of flip ambiguity; a sensor with an initially unknown location can then choose only those known neighbors with a confidence factor greater than a predefined threshold. A recent study by co-authors have shown that the performance of sequential and cluster based localization schemes in the literature can be significantly improved by correctly identifying and removing neighborhoods with possible flip ambiguities from the localization process. One motivation of this paper is to enhance the performance of the robustness criterion presented in that study by accurately identifying the flip ambiguity probabilities of arbitrary neighborhoods. The various simulations done in this study show that our analytical calculations of the probability of flip ambiguity matches with the simulated detection of the probability very accurately. © 2009 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/29481