Beyond rigidity: obtain localisability with noisy ranging measurement
by Xiaoping Wang, Zheng Yang, Jun Luo, Changxiang Shen
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 8, No. 1/2, 2011

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.

Online publication date: Thu, 28-Jul-2011

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com