Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Rigidity, Computation, and Randomization in Network Localization

Simple item page
dc.contributor.authorEren, Tolga
dc.contributor.authorGoldenberg, David K
dc.contributor.authorWhiteley, Walter
dc.contributor.authorYang, Yang Richard
dc.contributor.authorMorse, A Stephen
dc.contributor.authorAnderson, Brian
dc.contributor.authorBelhumeur, Peter N
dc.coverage.spatialHong Kong
dc.date.accessioned2015-12-13T22:38:56Z
dc.date.available2015-12-13T22:38:56Z
dc.date.createdMarch 7 2004
dc.date.issued2004
dc.date.updated2016-02-24T09:48:51Z
dc.description.abstractIn this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.
dc.identifier.isbn0743-166X
dc.identifier.urihttp://hdl.handle.net/1885/77583
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesAnnual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004)
dc.sourceProceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies
dc.subjectKeywords: Geometric-aware routing; Grounded graphs; Network localization problem; Sensor networks; Computational complexity; Computer simulation; Global positioning system; Graph theory; Problem solving; Sensors; Set theory; Telecommunication networks
dc.titleRigidity, Computation, and Randomization in Network Localization
dc.typeConference paper
local.bibliographicCitation.lastpage2684
local.bibliographicCitation.startpage2673
local.contributor.affiliationEren, Tolga, Columbia University
local.contributor.affiliationGoldenberg, David K, Yale University
local.contributor.affiliationWhiteley, Walter, York University
local.contributor.affiliationYang, Yang Richard, Yale University
local.contributor.affiliationMorse, A Stephen, Yale University
local.contributor.affiliationAnderson, Brian, College of Engineering and Computer Science, ANU
local.contributor.affiliationBelhumeur, Peter N, Columbia University
local.contributor.authoruidAnderson, Brian, u8104642
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080503 - Networking and Communications
local.identifier.ariespublicationMigratedxPub6416
local.identifier.doi10.1109/INFCOM.2004.1354686
local.identifier.scopusID2-s2.0-8344261381
local.type.statusPublished Version

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS