Abstract | ||
---|---|---|
Location awareness is crucial for wireless networks, attracting many research efforts in recent years. One of the fundamental problems of localisation is to determine whether or not a network is uniquely localisable. To address this problem, existing approaches often adopt the rigidity theory, which assumes accurate inter-node distance measurements. Considering the measurement errors, we introduce the concept of strong localisability and propose an algorithm, called LAS, to identify and locate a kind of strongly localisable networks. Besides, we further conduct extensive simulations to show the performance of LAS design. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1504/IJAHUC.2011.041627 | IJAHUC |
Keywords | Field | DocType |
location awareness,las design,rigidity theory,localisable network,measurement error,research effort,extensive simulation,fundamental problem,recent year,accurate inter-node distance measurement,wireless networks,simulation | Rigidity (psychology),Wireless network,Computer science,Theoretical computer science,Ranging,Artificial intelligence,Rigidity theory,Observational error,Location awareness,Distributed computing | Journal |
Volume | Issue | ISSN |
8 | 1/2 | 1743-8225 |
Citations | PageRank | References |
6 | 0.47 | 0 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xiaoping Wang | 1 | 72 | 7.21 |
Zheng Yang | 2 | 2341 | 108.35 |
Jun Luo | 3 | 196 | 12.79 |
Changxiang Shen | 4 | 127 | 14.57 |