Welcome to the InfoSci Platform
Reference Hub10
An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks

An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks

Shrawan Kumar, D. K. Lobiyal
Copyright: © 2012 |Volume: 2 |Issue: 2 |Pages: 20
ISSN: 2155-6261|EISSN: 2155-627X|EISBN13: 9781466614826|DOI: 10.4018/ijwnbt.2012040102
Cite Article Cite Article

MLA

Kumar, Shrawan, and D. K. Lobiyal. "An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks." IJWNBT vol.2, no.2 2012: pp.16-35. http://doi.org/10.4018/ijwnbt.2012040102

APA

Kumar, S. & Lobiyal, D. K. (2012). An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks. International Journal of Wireless Networks and Broadband Technologies (IJWNBT), 2(2), 16-35. http://doi.org/10.4018/ijwnbt.2012040102

Chicago

Kumar, Shrawan, and D. K. Lobiyal. "An Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks," International Journal of Wireless Networks and Broadband Technologies (IJWNBT) 2, no.2: 16-35. http://doi.org/10.4018/ijwnbt.2012040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Obtaining precise location of sensor nodes at low energy consumption, less hardware requirement, and little computation is a challenging task. As one of the well-known range-free localization algorithm, DV-Hop can be simply implemented in wireless sensor networks, but it provides poor localization accuracy. Therefore, in this paper, the authors propose an enhanced DV-Hop localization algorithm that provides good localization accuracy without requiring additional hardware and communication messages in the network. The first two steps of proposed algorithm are similar to the respective steps of the DV-Hop algorithm. In the third step, they first separate error terms (correction factors) of the estimated distance between unknown node and anchor node. The authors then minimize these error terms by using linear programming to obtain better location accuracy. Furthermore, they enhance location accuracy of nodes by introducing weight matrix in the objective function of linear programming problem formulation. Simulation results show that the performance of our proposed algorithm is superior to DV-Hop algorithm and DV-Hop–based algorithms in all considered scenarios.

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.