Noisy network localization via optimal measurement refinement part 2: Distance-only network localization

Shames, I; Bishop, AN

Noisy network localization via optimal measurement refinement part 2: Distance-only network localization

Shames, I Bishop, AN

Permalink

Publication Type:: Conference Proceeding
Citation:: IFAC Proceedings Volumes (IFAC-PapersOnline), 2011, 44 (1 PART 1), pp. 8848 - 8853
Issue Date:: 2011-01-01

Closed Access

	Filename	Description	Size
	1-s2.0-S1474667016450317-main.pdf	Published version	377.77 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	Shames, I	en_US
dc.contributor.author	Bishop, AN https://orcid.org/0000-0001-8581-8562	en_US
dc.date.issued	2011-01-01	en_US
dc.identifier.citation	IFAC Proceedings Volumes (IFAC-PapersOnline), 2011, 44 (1 PART 1), pp. 8848 - 8853	en_US
dc.identifier.isbn	9783902661937	en_US
dc.identifier.issn	1474-6670	en_US
dc.identifier.uri	http://hdl.handle.net/10453/119675
dc.description.abstract	In this paper we review some results on the problem of noisy localization and review the characteristics of networks labeled as easily localizable networks. We then present a more general result on such networks before moving to the main problem of interest in this paper. That is, proposing computationally efficient algorithms to refine noisy distance measurements in easily localizable networks. © 2011 IFAC.	en_US
dc.relation.ispartof	IFAC Proceedings Volumes (IFAC-PapersOnline)	en_US
dc.relation.isbasedon	10.3182/20110828-6-IT-1002.01291	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Noisy network localization via optimal measurement refinement part 2: Distance-only network localization	en_US
dc.type	Conference Proceeding
utslib.citation.volume	1 PART 1	en_US
utslib.citation.volume	44	en_US
utslib.for	0906 Electrical and Electronic Engineering	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 Biomedical Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CHT - Health Technologies
utslib.copyright.status	closed_access	*
pubs.issue	1 PART 1	en_US
pubs.publication-status	Published	en_US
pubs.volume	44	en_US

Abstract:

In this paper we review some results on the problem of noisy localization and review the characteristics of networks labeled as easily localizable networks. We then present a more general result on such networks before moving to the main problem of interest in this paper. That is, proposing computationally efficient algorithms to refine noisy distance measurements in easily localizable networks. © 2011 IFAC.

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

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