Skip to content
Open access

Performance Analysis for Random Network Access Delay of Single Hop Ad Hoc Network Under Saturation Conditions

2026 · IEEE Access · Vol 14, pp. 101573-101585 · 0 citations · 25 references
Computer Science

TL;DR

This paper provides a thorough performance analysis of the R-NAD protocol under saturation conditions, deriving key metrics such as transmission rate, loss probability, and average delay, and proposes a practical and simplified formula for determining the minimum value of the maximum retransmission count required to satisfy a specific target loss probability.

Abstract

For military wireless communications, the MIL-STD-188-220 standard utilizes various Network Access Delay (NAD) mechanisms to efficiently allocate transmission slots within a shared medium. Among these, the random NAD (R-NAD) protocol is widely adopted for dynamic traffic environments. To evaluate the fundamental capacity and performance limits of single-hop ad hoc networks where all nodes operate within a direct radio range, a rigorous analysis under saturation conditions is essential. Despite its critical importance, a comprehensive theoretical framework that analyzes R-NAD performance under saturation and determines the maximum number of retransmissions required to guarantee specific packet delivery targets has been lacking. To address this issue, this paper provides a thorough performance analysis of the R-NAD protocol under saturation conditions, deriving key metrics such as transmission rate, loss probability, and average delay. Based on these analytical results, we propose a practical and simplified formula for determining the minimum value of the maximum retransmission count required to satisfy a specific target loss probability. Extensive simulations demonstrate that our theoretical derivations are exceptionally well-matched with simulation data. Furthermore, we show that selecting the precise maximum number of retransmissions that meets the target loss probability effectively prevents unnecessary average delay while strictly satisfying the network’s loss requirements, thereby providing a practical guideline for effective system configuration.

Read PDF

Similar papers

Open access 2026

MAC and Routing Protocols Design in Multi-Hop Terahertz Networks

This work proposes a joint Medium Access Control and Network layer design, centered on a distributed Table-Based (TB) routing protocol that removes control-plane signaling by leveraging only user-plane data transmissions for route discovery and maintenance, and extends TB with a decentralized Multi-Agent Deep Reinforce...

Sara Cavallero, Lorenzo Mario Amorosa, Giampaolo Cuozzo et al. · 0 citations
Open access Aug 2026

Analytical Evaluation of VANETs Routing Strategies

The proposed SPN model enables system architects to compare routing configurations, identify performance bottlenecks, and size infrastructure components without requiring physical deployment, and enables the identification of communication bottlenecks without requiring physical deployment.

José Miquéias Araújo, L. Lopes, Luiz Nelson Lima et al. · 0 citations
Review Open access 2021

A survey on opportunistic routing and channel assignment scheme in cognitive radio ad hoc networks

Different routing methods for cognitive sensor networks are looked at, including drop ratio, which will assist in lowering the cost of living and guarantee that the data can be handled by nodes with a low dropping ratio.

G. B. V. Padmanad, P. K. Krishna Raja, J. Murthy · 0 citations
Preprint Sep 2026

Joint Effects of Node Density, Propagation, Wi-Fi Generation, and Transport Protocol on WLAN Performance: An ns-3 Study

Wireless local area network (WLAN) performance is jointly shaped by medium contention, propagation, Wi-Fi configuration, and transport-layer behavior. This study evaluates IEEE 802.11g and IEEE 802.11ax in a single-access-point uplink topology, comparing UDP and TCP under Friis, LogDistance, and cascaded Friis-Nakagami...

Leonel Olimpio Silima · 0 citations
Open access Sep 2026

Fairness-aware resource allocation for FSO/RF non-terrestrial networks

Results show that near-optimal capacity can be maintained without user disconnection, even under severe fading, and the Fairness-Aware Geometric Water-Filling algorithm achieves performance close to GWF while ensuring user connectivity under SNR constraints, mitigating user outage under severe fading with marginal perf...

Mahran Ghanem, R. Nordin, Athirah Mohd Ramly et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.