Wireless sensor network localisation using new heuristic optimisation algorithms
by Mohammad Sadeghian Kerdabadi; Farhad Parsaie Nejad; Reza Ghazizadeh; Hamid Farrokhi
International Journal of Ultra Wideband Communications and Systems (IJUWBCS), Vol. 3, No. 4, 2018

Abstract: The localisation algorithms for the WSNs can be divided into range-free and range-based algorithms based on whether it is required to know the actual distances between the nodes or the distance is approximated based on the connectivity information. The range-free algorithms usually have higher localisation error compared to the range based algorithms but it is simple to implement. DV-hop is a typical range-free localisation algorithm employing hop-distance estimation. In this paper, we present three improved DV-hop localisation approaches based on imperialist competitive algorithm (ICA-DV-hop), gravitational search algorithm (GSA-DV-Hop) and inclined planes system optimisation (IPO-DV-hop). In other words, the localisation optimisation problem is solved using the heuristic algorithms to enhance the localisation results of DV-hop. The proposed approaches have been compared with particle swarm optimisation (PSO), genetic algorithm (GA) and original DV-hop method. The simulation results indicate that the proposed algorithms can reduce the localisation error and achieve higher positioning accuracy.

Online publication date: Tue, 19-Jun-2018

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 Ultra Wideband Communications and Systems (IJUWBCS):
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