التحسين التكيفي لعمر المعلومات في الشبكات اللاسلكية متعددة القفزات باستخدام جدولة قائمة على Fresh-CSMA

The rapid growth of wireless communications and the Internet of Things (IoT) has increased the need for timely information. Traditional metrics, such as delay and throughput, do not fully capture information freshness, motivating the use of Age of Information (AoI). Maintaining freshness is particularly challenging in multi-hop wireless networks, where updates traverse intermediate nodes before reaching their destination. This paper proposes an adaptive scheduling mechanism inspired by Fresh-CSMA to improve AoI in these environments. The mechanism dynamically prioritizes packets according to their age, expected contribution to reducing destination AoI, remaining hops, and network congestion. A discrete-time simulation model developed in Python (version 3.4) evaluates the proposed scheduler against First-In First-Out (FIFO), Random scheduling, and Latest Generated First (LGF). The simulation results show that the adaptive scheduler reduces Average AoI and Peak AoI, with a slight decrease in Packet Delivery Ratio (PDR), while achieving lower delays and improving the freshness of received updates.

Authors

Institutions

Publication Details

Journal
Humanitarian and Natural Sciences Journal
Published
2026-11-01
DOI
https://doi.org/10.53796/hnsj711/38
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

التحسين التكيفي لعمر المعلومات في الشبكات اللاسلكية متعددة القفزات باستخدام جدولة قائمة على Fresh-CSMA

Essa Shaban Essa
1 links
Humanitarian and Natural Sciences Journal
Age of Information Optimization
article

التحسين التكيفي لعمر المعلومات في الشبكات اللاسلكية متعددة القفزات باستخدام جدولة قائمة على Fresh-CSMA

Essa Shaban Essa
article en

Abstract

The rapid growth of wireless communications and the Internet of Things (IoT) has increased the need for timely information. Traditional metrics, such as delay and throughput, do not fully capture information freshness, motivating the use of Age of Information (AoI). Maintaining freshness is particularly challenging in multi-hop wireless networks, where updates traverse intermediate nodes before reaching their destination. This paper proposes an adaptive scheduling mechanism inspired by Fresh-CSMA to improve AoI in these environments. The mechanism dynamically prioritizes packets according to their age, expected contribution to reducing destination AoI, remaining hops, and network congestion. A discrete-time simulation model developed in Python (version 3.4) evaluates the proposed scheduler against First-In First-Out (FIFO), Random scheduling, and Latest Generated First (LGF). The simulation results show that the adaptive scheduler reduces Average AoI and Peak AoI, with a slight decrease in Packet Delivery Ratio (PDR), while achieving lower delays and improving the freshness of received updates.

Humanitarian and Natural Sciences JournalVol. 7(11)
Ministry of Education (IQ)
Openalex Percentile: Top 13%
Age of Information Optimization
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.

Laika access coming soon