arXiv subjects

Anshan Yuan

Publications and source records attributed to Anshan Yuan.

5 recordsLinked to original sources

arXiv2026

Optimal Packetization Towards Low Latency in Random Access Networks (extended version)

As the demand for low-latency services grows, ensuring the delay performance of random access (RA) networks has become a priority. Existing studies on the queueing delay of the Aloha model universally treat packets as atomic transmission units, focusing on delay measured in time slots. However, the impact of packetization on queueing delay has been overlooked, particularly for the mean queueing delay measured in seconds. Here, packetization refers to the process of determining the number of bits assembled into a packet. This paper establishes the mathematical relationship between packetization and mean queueing delay in seconds for connection-free and connection-based Aloha schemes, and explores the optimal packetization to minimize the queueing delay. We identify the optimal packetization and its corresponding minimum mean queueing delay via numerical methods, and analyze the influence of various network parameters. We further use simulations to investigate the impact of packetization on jitter of queueing delay. We then apply our analysis to re-evaluate the trade-off between the connection-free and connection-based schemes through the perspective of packetization. Furthermore, we apply the analysis to Random Access-Based Small Data Transmission (RA-SDT) in Non-Terrestrial Network (NTN) scenarios as a case study.

cs.NI↗

arXiv2026

Throughput Optimization for Multi-AP IEEE P802.11bq Networks Based on Combinatorial Multi-Armed Bandits

This paper addresses distributed throughput optimization for dense multi-AP IEEE P802.11bq networks. We develop a packet-level model that jointly captures cross-link carrier-sense multiple access with collision avoidance (CSMA/CA), sub-7GHz RTS/CTS exchange, beam-training overhead, directional mmWave interference, signal-to-interference-plus-noise-ratio (SINR)-based MCS selection, and retransmissions. The resulting configuration problem is formulated as a multi-group combinatorial multi-armed bandit (CMAB), where each AP selects its contention window, clear-channel assessment threshold, beamwidth, and MCS reservation margin from finite candidate sets. Inspired by combinatorial successive accept-reject methods, we propose a group-wise feasible CSAR variant that uses Hadamard-guided feasible exploration to estimate empirical ranking scores and eliminate low-performing candidates within each parameter group. Simulations show that the proposed scheme improves aggregate and per-AP throughput over the considered Thompson-sampling baseline across most AP densities and reduces throughput stabilization time by approximately 49$\%$ under the evaluated settings. The learned configurations reveal that high throughput requires a balance among control-channel aggressiveness, mmWave spatial reuse, beam-training cost, and MCS robustness, rather than simply minimizing collisions or maximizing the PHY rate.

cs.NI↗

arXiv2025

Timely and Energy-Efficient Information Delivery in Heterogeneous Correlated Random Access Networks

This paper characterizes and jointly optimizes Age of Information (AoI) and energy efficiency in heterogeneous correlated random access networks, where each sensor adopts a distinct transmission probability and its observations are correlated with those of other sensors. An analytical model is proposed to analyze AoI and energy efficiency for each sensor. Closed-form expressions for long-term average AoI and energy efficiency are derived, explicitly accounting for spatial correlation and state-dependent power consumption. By constraining sensors to adopt the same transmission probability, three unified transmission strategies are derived: the age-optimal strategy (q_A^), the energy-efficiency optimal strategy (q_E^), and the Pareto-optimal strategy (q^), which jointly optimizes AoI and energy efficiency. A bounded exhaustive search with O(1/(n q_epsilon)) complexity guarantees efficient computation of q^. Theoretically, the correlation gain is proven to significantly enhance both metrics under spatial correlation. To exploit sensor heterogeneity, a gradient-based iterative algorithm, Multi-Start Projected Adaptive Moment Estimation (MS-PAdam), is proposed to jointly optimize all sensors' transmission probabilities, efficiently converging to the optimal AoI-energy-efficiency tradeoff. Crucially, MS-PAdam adaptively suppresses transmissions where marginal gains are outweighed by correlated neighbors' contributions, substantially alleviating competition. Numerical results show MS-PAdam outperforms unified strategies, achieving harmonious operation that mitigates AoI/energy degradation in contention-intensive scenarios.

cs.NI↗

arXiv2025

Harmonious Coexistence between Aloha and CSMA: Novel Dual-channel Modeling and Throughput Optimization

The scarcity of the licensed spectrum is forcing emerging Internet of Things (IoT) networks to operate within the unlicensed spectrum. Yet there has been extensive observation indicating that performance deterioration and significant unfairness would arise, when newly deployed Aloha-based networks coexist with incumbent Carrier Sense Multiple Access (CSMA)-based WiFi networks, especially without proper adjustment of packet transmission times. Therefore, ensuring harmonious cohabitation between Aloha and CSMA networks is of paramount importance. How to properly tune system parameters to guarantee harmonious coexistence between these two networks, nevertheless, remains largely unexplored. To address the above open issue, this paper proposed a novel dual-channel analytical framework to characterize the throughput performance of the cohabitation between slotted Aloha and CSMA networks. To achieve harmonious coexistence, the total throughput of the coexisting network under a given desired throughput proportion is optimized by tuning the packet transmission time of CSMA nodes and transmission probabilities. The optimization results indicate that the packet transmission time of CSMA nodes should be set slightly less than that of Aloha nodes. The proposed framework is further applied to enhance the network throughput and fairness of the cohabitation of LTE Unlicensed and WiFi networks.

cs.NI↗

arXiv2024

Energy-Aware Random Access Networks: Connection-Based versus Packet-Based

Characterizing and comparing the optimal energy efficiency in energy-aware machine-to-machine (M2M) random access networks remains a challenge due to the distributed nature of the access behavior of nodes. To address this issue, this letter focuses on the energy efficiency limits of two typical random access schemes, i.e., connection-based Aloha and packet-based Aloha, based on which we conducted a performance comparison. Specifically, by integrating limited energy constraints and network throughput, the lifetime throughput can be derived, and further optimized with a guarantee of targeted lifetime via selecting the transmission probability. Then we present a comparative study on the optimal lifetime throughput of packet-based Aloha and connection-based Aloha to characterize criteria for beneficial connection establishment.

cs.NI↗