An opportunistic network routing algorithm based on adaptive message replica number adjustment

In order to achieve better network performance for opportunistic network, this paper proposes an opportunistic network routing algorithm based on adaptive message replica number adjustment (AMRNA). The algorithm first sets the update cycle of globally active nodes and determines the globally active nodes in the network based on their network properties. Secondly, after clustering the network, the algorithm will select cluster head nodes for each cluster. When a node has a message that needs to be forwarded, relay nodes will be selected based on whether there are cluster head nodes or globally active nodes among the optional nodes. Finally, in order to reduce the number of replicas of messages in the network, the initial number of replicas of newly generated messages will be set, and the number of message replicas during different global active node update cycles will be adjusted according to the performance of the network. The simulation results show that compared with the epidemic routing algorithm and the spray and wait routing algorithm, the algorithm proposed in this paper can not only improve the delivery ratio but also reduce delay and network overhead.

Authors

Institutions

Publication Details

Journal
Discover Internet of Things
Published
2025-10-28
DOI
https://doi.org/10.1007/s43926-025-00220-7
Primary Topic
Opportunistic and Delay-Tolerant Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An opportunistic network routing algorithm based on adaptive message replica number adjustment

Hezhe Wang, Huiqiang Wang
Discover Internet of Things
Opportunistic and Delay-Tolerant Networks
article

An opportunistic network routing algorithm based on adaptive message replica number adjustment

Hezhe Wang, Huiqiang Wang
article en

Abstract

In order to achieve better network performance for opportunistic network, this paper proposes an opportunistic network routing algorithm based on adaptive message replica number adjustment (AMRNA). The algorithm first sets the update cycle of globally active nodes and determines the globally active nodes in the network based on their network properties. Secondly, after clustering the network, the algorithm will select cluster head nodes for each cluster. When a node has a message that needs to be forwarded, relay nodes will be selected based on whether there are cluster head nodes or globally active nodes among the optional nodes. Finally, in order to reduce the number of replicas of messages in the network, the initial number of replicas of newly generated messages will be set, and the number of message replicas during different global active node update cycles will be adjusted according to the performance of the network. The simulation results show that compared with the epidemic routing algorithm and the spray and wait routing algorithm, the algorithm proposed in this paper can not only improve the delivery ratio but also reduce delay and network overhead.

Discover Internet of ThingsVol. 5(1)
Heilongjiang University of Science and Technology (CN), Harbin Engineering University (CN)
Openalex Percentile: Top 63%
Opportunistic and Delay-Tolerant Networks
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.