A localization algorithm for DV-Hop wireless sensor networks based on manhattan distance

Xiaohu Huang (), Dezhi Han (), Tien-Hsiung Weng (), Zhongdai Wu (), Bing Han (), Junxiang Wang (), Mingming Cui () and Kuan-Ching Li ()
Additional contact information
Xiaohu Huang: Shanghai Maritime University
Dezhi Han: Shanghai Maritime University
Tien-Hsiung Weng: Providence University
Zhongdai Wu: Shanghai Ship and Shipping Research Institute Co., Ltd.,
Bing Han: Shanghai Ship and Shipping Research Institute Co., Ltd.,
Junxiang Wang: COSCO Shipping Technology Co., Ltd.,
Mingming Cui: Shanghai Maritime University
Kuan-Ching Li: Providence University

Telecommunication Systems: Modelling, Analysis, Design and Management, 2022, vol. 81, issue 2, No 3, 207-224

Abstract: Abstract WSNs (Wireless Sensor Networks) are critical components of the Internet of Things (IoT). With the internationalization of the IoT and the widespread use of apps, it is crucial to increase WSNs localization algorithms' accuracy and their flexibility to dynamic and changing surroundings. To this end, it is proposed in this article a wireless sensor network location algorithm based on Manhattan distance (MDV-Hop) to solve many existing problems encountered in the wireless sensor network location algorithm. The MDV-Hop localization algorithm improves over present algorithms regarding frequency hopping, length, and least-squares of nodes to enhance the WSNs nodes' location accuracy and algorithm's adaptability in multi-variable environments. Manhattan distance has the characteristics of the sum of the projection distance of the line segment between two points on the coordinate axis in Euclidean space. The Manhattan distance measurement method is combined with Euclidean distance to determine the second minimum frequency hopping between beacon nodes, which substantially increases the DV-Hop algorithm's localization performance. On this foundation, the multi-objective genetics (NSGA-II) algorithm is employed to refine the outcomes of the least-squares approach to increase the suggested algorithm's localization accuracy, as it succeeds the simplicity and flexibility of the original DV-Hop method. Extensive simulations are performed in network scenarios with sparse and unevenly distributed anisotropic sensor nodes, and experimental results show that the MDV-Hop method outperforms the current WSNs node localization techniques in terms of performance and precision.

Keywords: WSNs; IoT; DV-Hop; Manhattan distance; The second minimum frequency hopping; NSGA-II (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-022-00943-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:81:y:2022:i:2:d:10.1007_s11235-022-00943-w

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-022-00943-w

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().