2016
DOI: 10.1109/tcomm.2016.2590436
|View full text |Cite
|
Sign up to set email alerts
|

Accurate Range-Free Localization in Multi-Hop Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
23
0
1

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 60 publications
(28 citation statements)
references
References 32 publications
0
23
0
1
Order By: Relevance
“…The algorithm outcome them in accuracy. In contrast to the latter, they further confirmthatits able to achieve a LEE average and variance of regarding0 when the no of sensors is largersufficient, thereby achieving an unprecedented accuracy performance among range free techniques [8].…”
Section: Literature Surveymentioning
confidence: 64%
“…The algorithm outcome them in accuracy. In contrast to the latter, they further confirmthatits able to achieve a LEE average and variance of regarding0 when the no of sensors is largersufficient, thereby achieving an unprecedented accuracy performance among range free techniques [8].…”
Section: Literature Surveymentioning
confidence: 64%
“…Most popular alternatives suitable for range free localization algorithms are based on analytical algorithms [7,9,29,33] which evaluate theoretically the average hop distance of the network using the statistical characteristics of the network deployment. The obtained average hop distance is locally computable at each sensor node and likewise other range free method, it has to be broadcasted to other sensor nodes.…”
Section: Analytical Geometry Basedmentioning
confidence: 99%
“…The author in [7,9] deals with this problem by calculating the angle of the detoured path between anchor and sensor nodes. Another analytical algorithm [33] argues that average hop distance and number of hops between anchor and sensor nodes are not sufficient to calculate accurate position of the sensor nodes. It also depends on number of forwarding nodes (which forward any data between two nodes).…”
Section: Analytical Geometry Basedmentioning
confidence: 99%
See 1 more Smart Citation
“…It is one of the distributed node localization algorithm "APS", which is proposed by Zaidi and other scholars [1]. Orojloo and Haghighat [2] believed that the first stage of traditional DV-Hop positioning step is: the minimum number of hops between the beacon node and the unknown node is calculated.…”
mentioning
confidence: 99%