An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks

24Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

Cite

CITATION STYLE

APA

Kumar, G., Rai, M. K., Saha, R., & Kim, H. J. (2018). An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks. International Journal of Distributed Sensor Networks, 14(1). https://doi.org/10.1177/1550147718755636

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free