Beyond rigidity: obtain localisability with noisy ranging measurement

  • Authors:
  • Xiaoping Wang;Zheng Yang;Jun Luo;Changxiang Shen

  • Affiliations:
  • School of Computer Science, National University of Defense Technology, Changsha, Hunan 410073, China.;Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon 999077, Hong Kong.;School of Computer Science, National University of Defense Technology, Changsha, Hunan 410073, China.;School of Computer Science, National University of Defense Technology, Changsha, Hunan 410073, China

  • Venue:
  • International Journal of Ad Hoc and Ubiquitous Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.