IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v69y2018i3d10.1007_s11235-018-0444-2.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Parulpreet Singh & Arun Khosla & Anil Kumar & Mamta Khosla, 2018. "Computational intelligence based localization of moving target nodes using single anchor node in wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 69(3), pages 397-411, November.
    • Handle: RePEc:spr:telsys:v:69:y:2018:i:3:d:10.1007_s11235-018-0444-2
    DOI: 10.1007/s11235-018-0444-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-018-0444-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-018-0444-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hilary I. Okagbue & Muminu O. Adamu & Timothy A. Anake & Ashiribo S. Wusu, 2019. "Nature inspired quantile estimates of the Nakagami distribution," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 72(4), pages 517-541, December.
    2. Shilpi & Arvind Kumar, 2023. "A localization algorithm using reliable anchor pair selection and Jaya algorithm for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 82(2), pages 277-289, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:69:y:2018:i:3:d:10.1007_s11235-018-0444-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.