2015 Third International Symposium on Computing and Networking (CANDAR) 2015
DOI: 10.1109/candar.2015.99
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Localization Algorithm in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The coordinates of a known node k are x k , y k , and there are n nodes with known coordinates. The location of this unknown node is calculated as [50]:…”
Section: If σ Imentioning
confidence: 99%
“…The coordinates of a known node k are x k , y k , and there are n nodes with known coordinates. The location of this unknown node is calculated as [50]:…”
Section: If σ Imentioning
confidence: 99%
“…In [47] Shikai Shen et al proposed an improved DV-Hop localization algorithm to ensure the accuracy of localization. this localization algorithm first employs distortion function to select the beacon nodes that can estimate average hop distance and then adopt two-dimensional hyperbolic function instead of the classic trilateration/least square method to determine the locations of unknown nodes, which are very close to their actual locations.…”
Section: Related Workmentioning
confidence: 99%
“…In [11] Shikai Shen et al proposed an improved DV-Hop localization algorithm to ensure the accuracy of localization. This localization algorithm first employs distortion function to select the beacon nodes that can estimate average hop distance and then adopt two-dimensional hyperbolic function instead of the classic trilateration/least square method to determine the locations of unknown nodes, which are very close to their actual locations.…”
Section: Introductionmentioning
confidence: 99%