Freshness–Transmission Trade-offs in Wireless Ad Hoc Communication: An Analysis of Age-Threshold Random Access

Wireless ad hoc monitoring requires access rules that keep received information fresh without excessive contention.Age-threshold random access suppresses recently successful transmitters, but its performance depends on the transmission probability used after the silent interval.This study examines that dependence through renewal analysis and 1,280 reproducible simulation runs covering network size, independent erasures, correlated outages, and unequal link quality.Twenty independent replications are used per configuration.Exact slotted ALOHA and round-robin expressions provide implementation checks; a decoupling approximation links age, throughput, and transmission attempts for threshold access.At 50 peers and an independent erasure probability of 0.2, a silent interval of 50 slots with access probability 0.04 lowers mean age from 168.59 to 140.02 slots, while increasing attempts from 1.00 to 1.45 per slot.A longer silent interval of 100 slots combined with probability 0.08 raises mean age to 398.94 slots.Reducing that probability to 0.04 instead produces 101.46 slots and 0.84 attempts per slot.The results locate a collision-driven reversal that disappears from comparisons reporting only a preferred configuration.Correlated outages and link heterogeneity further show why mean age, deadline violations, and fairness require separate evaluation.The findings support joint threshold-probability selection within an explicit transmission budget.They apply to a synchronized, single collision domain with ideal acknowledgments; spatial reuse and multi-hop forwarding require further analysis.

Authors

Institutions

Publication Details

Journal
International Journal of Wireless and Ad Hoc Communication
Published
2026-11-13
DOI
https://doi.org/10.54216/ijwac.110104
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
NOV
article

Freshness–Transmission Trade-offs in Wireless Ad Hoc Communication: An Analysis of Age-Threshold Random Access

Wadhah Ahmed Muthanna Abdullah
1 links
International Journal of Wireless and Ad Hoc Communication
Age of Information Optimization
article

Freshness–Transmission Trade-offs in Wireless Ad Hoc Communication: An Analysis of Age-Threshold Random Access

Wadhah Ahmed Muthanna Abdullah
article en

Abstract

Wireless ad hoc monitoring requires access rules that keep received information fresh without excessive contention.Age-threshold random access suppresses recently successful transmitters, but its performance depends on the transmission probability used after the silent interval.This study examines that dependence through renewal analysis and 1,280 reproducible simulation runs covering network size, independent erasures, correlated outages, and unequal link quality.Twenty independent replications are used per configuration.Exact slotted ALOHA and round-robin expressions provide implementation checks; a decoupling approximation links age, throughput, and transmission attempts for threshold access.At 50 peers and an independent erasure probability of 0.2, a silent interval of 50 slots with access probability 0.04 lowers mean age from 168.59 to 140.02 slots, while increasing attempts from 1.00 to 1.45 per slot.A longer silent interval of 100 slots combined with probability 0.08 raises mean age to 398.94 slots.Reducing that probability to 0.04 instead produces 101.46 slots and 0.84 attempts per slot.The results locate a collision-driven reversal that disappears from comparisons reporting only a preferred configuration.Correlated outages and link heterogeneity further show why mean age, deadline violations, and fairness require separate evaluation.The findings support joint threshold-probability selection within an explicit transmission budget.They apply to a synchronized, single collision domain with ideal acknowledgments; spatial reuse and multi-hop forwarding require further analysis.

International Journal of Wireless and Ad Hoc CommunicationVol. 11(1)
St Petersburg University (RU)
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