Localization in sparse networks using sweeps
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
|Collections||ANU Research Publications|
|Source:||Proceedings of the 12th annual international conference on mobile computing and networking|
|01_Goldenberg_Localization_in_sparse_2006.pdf||286.14 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.