Title: Bilateral localisation algorithm for wireless sensor networks with communication holes

Authors: Vahid Tavakolpour; Hadi Tabatabaee Malazi; Farshad Eshghi

Addresses: Department of Information Tech., Islamic Azad University, Kermanshah branch, Kermanshah 6718997551, Iran ' Faculty of Computer Science and Engineering, GC, Shahid Beheshti University, Tehran 1983963113, Iran ' Faculty of Engineering, Electrical and Computer Engineering Department, Kharazmi University, Tehran 3197937551, Iran

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.

Keywords: node localisation; prune base algorithm; NBPE algorithm; wireless sensor networks; WSNs; bilateral localisation; communication holes; simulation.

DOI: 10.1504/IJSNET.2017.081329

International Journal of Sensor Networks, 2017 Vol.23 No.2, pp.73 - 86

Received: 23 Aug 2014
Accepted: 20 May 2015

Published online: 05 Jan 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article