Welcome to the InfoSci Platform
Reference Hub5
Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors

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

Amanpreet Kaur, Padam Kumar, Govind P. Gupta
Copyright: © 2020 |Volume: 14 |Issue: 1 |Pages: 15
ISSN: 1930-1650|EISSN: 1930-1669|EISBN13: 9781799805359|DOI: 10.4018/IJISP.2020010101
Cite Article Cite Article

MLA

Kaur, Amanpreet, et al. "Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors." IJISP vol.14, no.1 2020: pp.1-15. http://doi.org/10.4018/IJISP.2020010101

APA

Kaur, A., Kumar, P., & Gupta, G. P. (2020). Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors. International Journal of Information Security and Privacy (IJISP), 14(1), 1-15. http://doi.org/10.4018/IJISP.2020010101

Chicago

Kaur, Amanpreet, Padam Kumar, and Govind P. Gupta. "Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors," International Journal of Information Security and Privacy (IJISP) 14, no.1: 1-15. http://doi.org/10.4018/IJISP.2020010101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.