A Novel Centralized Range-Free Static Node Localization Algorithm with Memetic Algorithm and Lévy Flight.

Jin Yang,Deyu Tang,Zhen Liu,Yongming Cai

doi:10.3390/s19143242

Abstract

Node localization, which is formulated as an unconstrained NP-hard optimization problem, is considered as one of the most significant issues of wireless sensor networks (WSNs). Recently, many swarm intelligent algorithms (SIAs) were applied to solve this problem. This study aimed to determine node location with high precision by SIA and presented a new localization algorithm named LMQPDV-hop. In LMQPDV-hop, an improved DV-Hop was employed as an underground mechanism to gather the estimation distance, in which the average hop distance was modified by a defined weight to reduce the distance errors among nodes. Furthermore, an efficient quantum-behaved particle swarm optimization algorithm (QPSO), named LMQPSO, was developed to find the best coordinates of unknown nodes. In LMQPSO, the memetic algorithm (MA) and Lévy flight were introduced into QPSO to enhance the global searching ability and a new fast local search rule was designed to speed up the convergence. Extensive simulations were conducted on different WSN deployment scenarios to evaluate the performance of the new algorithm and the results show that the new algorithm can effectively improve position precision.

Highlights

The sensed data gathered by sensor nodes is only useful when the location information of these sensors is known in a variety of emerging applications of wireless sensor networks (WSNs) [1]
To validate the LMQPDV-hop, we compared it to some classic rang-free localization algorithms along with the localization algorithms based on swarm intelligent algorithms (SIAs) (i.e., WPDV-hop [16], PSOPF [17], CuckooDV-hop [28] and MMQPDV-hop [27]) in terms of location
To validate the LMQPDV-hop, we compared it to some classic rang-free localization algorithms along with the localization algorithms based on SIAs (i.e., WPDV-hop [16], PSOPF [17], CuckooDV-hop [28] and MMQPDV-hop [27]) in terms of location errors and convergence speeds

Summary

Introduction

The sensed data gathered by sensor nodes is only useful when the location information of these sensors is known in a variety of emerging applications of WSNs [1]. Most nodes in WSNs are deployed in an ad-hoc manner without any prior knowledge of their location information. How to determine the location of an unknown node is an essential issue. Equipping each node with a global positioning system (GPS) receiver seems to be a simple and effective solution, but this scheme is unrealistic due to its high cost and energy consumption, especially for large-scale WSNs. the poor performance of GPS inside an indoor environment makes GPS an impractical scheme. The more reasonable solution is to assume that only a small number of nodes (called anchors) own their position, while the others (called unknown nodes) can estimate their position according to the anchors

Objectives

Results

Conclusion