2014 International Conference on Next Generation Networks and Services (NGNS) 2014
DOI: 10.1109/ngns.2014.6990273
|View full text |Cite
|
Sign up to set email alerts
|

An improved DV-Hop localization algorithm for wireless sensor networks

Abstract: Wireless sensor networks have attracted great interest in the last decade, and have provided solutions in a growing number of applications. The location of sensors is a major issue in these networks. Many localization algorithms have been proposed and can be categorized into two families: range-based and range-free algorithms. In this paper, the localization algorithm DV-Hop is improved in order to minimize the estimation error and thus obtain better localization accuracy of sensor nodes. Simulations have been… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…They also presented the mobility of nodes for coverage optimization, connectivity, and analysis. Hadir et al [19] presented a localization technique in WSNs using an effective distance vector hop scheme. They also discuss the average hop size and localization accuracy by exploiting the information.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…They also presented the mobility of nodes for coverage optimization, connectivity, and analysis. Hadir et al [19] presented a localization technique in WSNs using an effective distance vector hop scheme. They also discuss the average hop size and localization accuracy by exploiting the information.…”
Section: Related Workmentioning
confidence: 99%
“…This algorithm was first identified by [2]. The distance vector localization scheme is a range-free strategy [19] with a series of steps in Table 2.…”
Section: Cluster Formation and Data Aggregationmentioning
confidence: 99%
See 1 more Smart Citation
“…In [34], this algorithm was discovered for the first time. Here are the steps of the range-free distance vector localization scheme [35]: 4.2.1. Routing Initialization.…”
Section: Selection Of Miner Node and Localization Processmentioning
confidence: 99%
“…The beacon node transmits a message to all sensor nodes. As soon as it enters the network, the hop count associated with its position data is set to 0 [35]. A node that gets such a message will determine where the beacon node is located, append its own identifier to the message, and then broadcast it to its neighbours while increasing the hop count [36].…”
Section: Selection Of Miner Node and Localization Processmentioning
confidence: 99%