An Opportunistic Networks Load Distribution Model Based on Forwarding Assistance

Active nodes in opportunistic networks have a greater mobility range and undertake more message-forwarding tasks. This leads to issues of uneven traffic load and delayed cache space release in opportunistic networks. This paper proposes a load distribution model based on forwarding assistance (LDMFA) which integrates the node delivery prediction value and traffic idleness index to mitigate the blind selection of relay nodes and reduce message forwarding delay. To identify a selfish node, the message throughput rate of the node is selected as the evaluation index. The most appropriate relay node is selected by comparing the traffic idle index of neighbour nodes and calculating their forwarding assistance. This paper also introduces a cache optimization mechanism to address network performance degradation due to overloaded node traffic. Simulation results show that, compared with the prevailing opportunistic routing algorithms, the model improves the message delivery success ratio by 20%.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/msn63567.2024.00016
Primary Topic
Opportunistic and Delay-Tolerant Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Opportunistic Networks Load Distribution Model Based on Forwarding Assistance

Yuan Cheng, Winston K.G. Seah, Xiaodong Xu, Xing Wang et al.
Opportunistic and Delay-Tolerant Networks
article

An Opportunistic Networks Load Distribution Model Based on Forwarding Assistance

Yuan Cheng, Winston K.G. Seah, Xiaodong Xu, Xing Wang, Gang Xu
article en

Abstract

Active nodes in opportunistic networks have a greater mobility range and undertake more message-forwarding tasks. This leads to issues of uneven traffic load and delayed cache space release in opportunistic networks. This paper proposes a load distribution model based on forwarding assistance (LDMFA) which integrates the node delivery prediction value and traffic idleness index to mitigate the blind selection of relay nodes and reduce message forwarding delay. To identify a selfish node, the message throughput rate of the node is selected as the evaluation index. The most appropriate relay node is selected by comparing the traffic idle index of neighbour nodes and calculating their forwarding assistance. This paper also introduces a cache optimization mechanism to address network performance degradation due to overloaded node traffic. Simulation results show that, compared with the prevailing opportunistic routing algorithms, the model improves the message delivery success ratio by 20%.

Inner Mongolia University (CN), Victoria University of Wellington (NZ)
National Natural Science Foundation of China
Openalex Percentile: Top 64%
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.