Name
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 class of algorithms for fine-grained localization called Sweeps. Sweeps correctly finitely localizes all nodes in bilateration networks. Sweeps also handles angle measurements and noisy measurements. We demonstrate the practicality of our algorithm through extensive simulations on a large number of networks, upon which it consistently localizes one-thousand-node networks of average degree less than five in less than two minutes on a consumer PC. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1161089.1161103 | MobiCom |
Keywords | Field | DocType |
angle measurement,next-generation network functionalities,finitely localizes,bilateration network,sparse network,consumer pc,average degree,previous localization algorithm,localizes one-thousand-node network,network density,fine-grained localization,next generation network,computer simulation,algorithms,localization | Computer science,Correctness,Network density,Distributed computing | Conference |
ISBN | Citations | PageRank |
1-59593-286-0 | 108 | 4.59 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David K. Goldenberg | 1 | 379 | 18.81 |
| Pascal Bihler | 2 | 142 | 10.08 |
| Ming Cao | 3 | 2343 | 249.61 |
| Jia Fang | 4 | 134 | 7.49 |
| Brian D. O. Anderson | 5 | 3727 | 471.00 |
| A. Stephen Morse | 6 | 4285 | 588.67 |
| Richard Yang | 7 | 3502 | 203.15 |