IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v14y2020i1p1-15.html
   My bibliography  Save this article

Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors

Author

Listed:
  • Amanpreet Kaur

    (Jaypee Institute of Information Technology, Uttar Pradesh, India)

  • Padam Kumar

    (Jaypee Institute of Information Technology, Uttar Pradesh, India)

  • Govind P. Gupta

    (National Institute of Technology Raipur, Raipur, India)

Abstract

Localization problem has gained a significant attention in the field of wireless sensor networks in order to support location-based services or information such as supporting geographic routing protocols, tracking events, targets, and providing security protection techniques. A number of variants of DV-Hop-based localization algorithms have been proposed and their performance is measured in terms of localization error. In all these algorithms, while determining the location of a non-anchor node, all the anchor nodes are taken into consideration. However, if only the anchors close to the node are considered, it will be possible to reduce the localization error significantly. This paper explores the effect of the close anchors in the performance of the DV-Hop-based localization algorithms and an improvement is proposed by considering only the closest anchors. The simulation results show that considering closest anchors for estimation of the location reduces localization error significantly as compared to considering all the anchors.

Suggested Citation

  • Amanpreet Kaur & Padam Kumar & Govind P. Gupta, 2020. "Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 14(1), pages 1-15, January.
    • Handle: RePEc:igg:jisp00:v:14:y:2020:i:1:p:1-15
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.2020010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jisp00:v:14:y:2020:i:1:p:1-15. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.