Hamming Distance Based Duplicate Address Detection in IPv6 Network

ABSTRACT Ensuring the uniqueness of Unicast IPv6 addresses prior to allocation is crucial in Internet of Things networks with constrained resources. Self‐configured nodes often allocate IPv6 addresses using SLAAC and produce its own preliminary IPv6 addresses. Since the Duplicate Address Detection (DAD) protocol in SLAAC broadcasts the potential address over the network, it is vulnerable to a variety of attacks. This vulnerability is exploited by malicious nodes that can stop new nodes from joining the network by constantly claiming the tentative address. Several solutions have been proposed, yet they come with limitations. This work presents the modified DAD protocol (Hamming‐DAD) that aims to solve these issues by being scalable, trustworthy, and compliant with industry standards. The preliminary IPv6 address in Hamming‐DAD is broadcast in a way that hides the real address from any node in the network, new or existing one. This makes it far more difficult for a malicious node to obtain this preliminary address. The results of the experiments show that this method performs better in respect of ASR, overhead, and energy usage, and it effectively mitigates DoS assaults. By contrasting Hamming‐DAD with other state‐of‐art solutions including Hidden‐DAD, O‐DAD, Secure‐DAD, and Improved‐DAD protocols, this strategy lowers energy usage and communication overhead around 4%, 5%, 7%, and 12%, respectively.

Authors

Institutions

Publication Details

Journal
International Journal of Communication Systems
Published
2025-05-26
DOI
https://doi.org/10.1002/dac.70135
Citations
1
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hamming Distance Based Duplicate Address Detection in IPv6 Network

Bijendra Kumar, Pragya
1 citations
International Journal of Communication Systems
Network Security and Intrusion Detection
1.49
article

Hamming Distance Based Duplicate Address Detection in IPv6 Network

Bijendra Kumar, Pragya
article en
1 citations

Abstract

ABSTRACT Ensuring the uniqueness of Unicast IPv6 addresses prior to allocation is crucial in Internet of Things networks with constrained resources. Self‐configured nodes often allocate IPv6 addresses using SLAAC and produce its own preliminary IPv6 addresses. Since the Duplicate Address Detection (DAD) protocol in SLAAC broadcasts the potential address over the network, it is vulnerable to a variety of attacks. This vulnerability is exploited by malicious nodes that can stop new nodes from joining the network by constantly claiming the tentative address. Several solutions have been proposed, yet they come with limitations. This work presents the modified DAD protocol (Hamming‐DAD) that aims to solve these issues by being scalable, trustworthy, and compliant with industry standards. The preliminary IPv6 address in Hamming‐DAD is broadcast in a way that hides the real address from any node in the network, new or existing one. This makes it far more difficult for a malicious node to obtain this preliminary address. The results of the experiments show that this method performs better in respect of ASR, overhead, and energy usage, and it effectively mitigates DoS assaults. By contrasting Hamming‐DAD with other state‐of‐art solutions including Hidden‐DAD, O‐DAD, Secure‐DAD, and Improved‐DAD protocols, this strategy lowers energy usage and communication overhead around 4%, 5%, 7%, and 12%, respectively.

International Journal of Communication SystemsVol. 38(10)
Netaji Subhas University of Technology (IN)
Openalex Percentile: Top 17%
Network Security and Intrusion Detection
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.