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.

Localization in sparse networks using sweeps

Thumbnail Image

Date

2006

Authors

Goldenberg, David K
Bihler, Pascal
Cao, Ming
Fang, J
Anderson, Brian
Morse, A Stephen
Yang, Yang Richard

Journal Title

Journal ISSN

Volume Title

Publisher

Association for Computing Machinery Inc (ACM)

Abstract

Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density higher than required for unique localizability. In this paper, we describe a

Description

Keywords

Keywords: Controlled mobility; Global rigidity; Localization; Sweeps; Algorithms; Angle measurement; Computer simulation; Wireless telecommunication systems; Mobile computing Controlled mobility; Global rigidity; Localization; Sweeps

Citation

URI

http://hdl.handle.net/1885/29743

Collections

ANU Research Publications

Source

Proceedings of the 12th annual international conference on mobile computing and networking

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Goldenberg_Localization_in_sparse_2006.pdf (286.14 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd