Computational intelligence based localization of moving target nodes using single anchor node in wireless sensor networks

Parulpreet Singh (), Arun Khosla (), Anil Kumar () and Mamta Khosla ()
Additional contact information
Parulpreet Singh: Dr. B.R. Ambedkar National Institute of Technology
Arun Khosla: Dr. B.R. Ambedkar National Institute of Technology
Anil Kumar: Chandigarh College of Engineering and Technology
Mamta Khosla: Dr. B.R. Ambedkar National Institute of Technology

Telecommunication Systems: Modelling, Analysis, Design and Management, 2018, vol. 69, issue 3, No 10, 397-411

Abstract: Abstract Wireless Sensor Networks (WSNs) have tremendous ability to interact and collect data from the physical world. The main challenges for WSNs regarding performance are data computation, prolong lifetime, routing, task scheduling, security, deployment and localization. In recent years, many Computational Intelligence (CI) based solutions for above mentioned challenges have been proposed to accomplish the desired level of performance in WSNs. Application of CI provides independent and robust solutions to ascertain accurate node position (2D/3D) with minimum hardware requirement (position finding device, i.e., GPS enabled device). The localization of static target nodes can be determined more accurately. However, in the case of moving target nodes, accurate position of each node in network is a challenging problem. In this paper, a novel concept of projecting virtual anchor nodes for localizing the moving target node is proposed using applications of Particle Swarm Intelligence, H-Best Particle Swarm Optimization, Biogeography Based Optimization and Firefly Algorithm separately. The proposed algorithms are implemented for range-based, distributed, non-collaborative and isotropic WSNs. Only single anchor node is used as a reference node to localize the moving target node in the network. Once a moving target node comes under the range of a anchor node, six virtual anchor nodes with same range are projected in a circle around the anchor node and two virtual anchor nodes (minimum three anchor nodes are required for 2D position) in surrounding (anchor and respective moving target node) are selected to find the 2D position. The performance based results on experimental mobile sensor network data demonstrate the effectiveness of the proposed algorithms by comparing the performance in terms of the number of nodes localized, localization accuracy and scalability. In proposed algorithms, problem of Line of Sight is minimized due to projection of virtual anchor nodes.

Keywords: Wireless sensor networks (WSNs); Localization; Particle swarm optimization (PSO); Biogeography based optimization (BBO); H-best particle swarm optimization (HPSO); Firefly algorithm (FA) (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s11235-018-0444-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:69:y:2018:i:3:d:10.1007_s11235-018-0444-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-018-0444-2

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().