A modified DV-hop localization algorithm based on communication radius dynamic adjustment

Zhang, Jing; Zhang, Linghua

doi:10.1109/icait.2017.8388926

Cited by 3 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The NTLDV-HOP illustrated good performance under low anchor node density. Correspondingly, AHS is redressed by weighted value that based on multiple communication radius in paper [27]. However, employed more communication radius will greatly increase energy consumption.…”

Section: Based On Weighted Optimization Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

et al. 2020

View full text Add to dashboard Cite

Location information is prerequisite for wireless sensor networks (WSNs) monitoring and control applications, since there is no meaning without position information for collected data. Distance vector hop (DV-Hop) localization algorithm as the typical range-free algorithm that has been widely applied in various applications. Nowadays, the research on range-free localization for WSNs is mostly based on two-dimensional (2D) space. Hence, there are few surveys concentrated on range-free localization in three-dimensional (3D) WSNs. This motivated us to present an extensive overview of enhanced DV-Hop localization algorithms in 3D WSNs. This paper focused on critical challenge between 2D and 3D in localization model, representative range-free 3D localization technique surveys. Moreover, a comprehensive taxonomy of most essential enhanced methods applied in 3D DV-Hop is illustrated. A considerable comparison in term of localization error, computational complexity and node type is given. Future research directions dealing with localization under 3D DV-Hop is also discussed.

show abstract

Section: Based On Weighted Optimization Algorithmmentioning

confidence: 99%

“…Table 3 [26], hyperbolic location method [28], assistant mo-bile beacon node [29]. Besides, it is adopted to correct hop count by multiple communication range [27], selected high quality beacon node [30][31], which will increase communication cost at some degree.…”

Section: Based On Weighted Optimization Algorithmmentioning

confidence: 99%

A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

DV-Hop Localization Algorithm Based on Minimum Mean Square Error in Internet of Things

Zhao

et al. 2019

Procedia Computer Science

View full text Add to dashboard Cite

Connectivity Based DV-Hop Localization for Internet of Things

Gui

Xiao

Zhou

et al. 2020

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

A modified DV-hop localization algorithm based on communication radius dynamic adjustment

Cited by 3 publications

References 7 publications

A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

DV-Hop Localization Algorithm Based on Minimum Mean Square Error in Internet of Things

Connectivity Based DV-Hop Localization for Internet of Things

Contact Info

Product

Resources

About