Bilateral localisation algorithm for wireless sensor networks with communication holes Online publication date: Thu, 05-Jan-2017
by Vahid Tavakolpour; Hadi Tabatabaee Malazi; Farshad Eshghi
International Journal of Sensor Networks (IJSNET), Vol. 23, No. 2, 2017
Abstract: Localisation is one of the vital services for many protocols and applications in wireless sensor networks. Although in most of the range base localisation algorithms an unknown node requires at least three anchor nodes to localise itself, some bilateration approaches can perform the task with only two anchors. These approaches lose their accuracy in cases when there is sparsity of nodes at some spot in the field. A communication hole is a problem that localisation algorithms face, causing their performance reduction. In this paper, we devise a new recursive approach, called non-directed bilateration position estimation (NBPE) that uses only two anchor nodes to calculate two possible positions and prune one of them using a specific criterion. To decrease error propagation a precedence mechanism is applied to select the proper anchors, which results in higher accuracy in networks with communication holes. NBPE is evaluated through simulation under various noise conditions and network densities.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Sensor Networks (IJSNET):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook