arXiv subjects

Andrey Belogaev

Publications and source records attributed to Andrey Belogaev.

12 recordsLinked to original sources

arXiv2026

Adaptive Contention-based Random Access for Uplink Reporting in 3GPP Ambient IoT Networks

Ambient Internet of Things (A-IoT) targets energy harvesting (EH), battery-less devices as a simple connectivity solution for extensive ultra-low-power deployments. These devices typically face intermittent energy availability, making uplink reports increasingly susceptible to access collisions and energy outages. In this paper, we build upon the cellular standardization of A-IoT and examine the paging-triggered contention-based random access (CBRA) framework for uplink reporting. We analyze the effects of energy availability and collisions on these systems and introduce an EH-aware access control mechanism. In this mechanism, the reader broadcasts an access probability in the paging message, which helps regulate the number of devices attempting random access. Results show that, unlike the baselines, the proposed method scales well under dense deployments by keeping collisions nearly constant, improving access efficiency, and substantially reducing the number of paging rounds required for successful reporting. These results highlight the importance of lightweight reader-side access control for reliable and resource-efficient reporting in A-IoT environments.

eess.SY↗

arXiv2026

Symbol-Synchronous Communication for Ultra-Low-Power Multi-Hop Ambient IoT Networks

Ambient Internet of Things (A-IoT) devices, as a critical enabler of future green IoT networks, have attracted broad interest from both industry and academia due to their ability to operate without batteries and with low maintenance costs. To accommodate their dynamic and constrained energy budget, an ultra-low-power connectivity protocol is required. Due to the severely limited transmit power of A-IoT devices, multi-hop connectivity is an interesting paradigm to extend their range. However, commonly used protocols for multi-hop communication may not be suitable for A-IoT due to excessive overhead related to channel access procedures, coordinated routing, and tight time synchronization requirements. This paper presents a novel network connectivity protocol based on symbol-synchronous transmissions, which allows battery-less relay nodes to participate in the forwarding process in an ad-hoc manner, without the need for synchronization or coordination. This allows them to adapt their duty cycle to the available harvested energy. Simulation results show that the proposed protocol can ensure high reliability in data packet delivery while significantly reducing the energy consumption of each relay node. We also investigate the relationship between wake-up probability and network density. For example, a 400-node network in a 625 m2 area can achieve a packet error rate below 1 % with an average awake time of 6 % per node, achieving an energy consumption reduction of 88 % compared to the baseline approach.

cs.NI↗

arXiv2026

RF-Zero-Wire: Design and Analysis of Multi-Hop Low-latency Symbol-synchronous RF Communication

The latency gap between wired and wireless networks poses a challenge in the adoption of wireless technologies in latency-sensitive scenarios. The gap is especially notable in multi-hop communication typical for industrial sensor networks and robotic swarms. The main reason behind it is that commonly used wireless protocols rely on store-and-forward routing and costly overhead procedures to avoid interference. This article introduces RF-Zero-Wire, an RF-based symbol-synchronous communication protocol. Instead of relaying the whole frame per hop in a store-and-forward manner, nodes concurrently relay the frame symbol by symbol, without the need for tight time synchronization. Based on data collected in real-world experiments, we reveal that the inevitable carrier frequency offsets (CFOs) introduced by imperfect crystal oscillators cause a beating effect under concurrent symbol transmissions. This is characterized by periodic constructive and destructive interference, which significantly affects reliability. Subsequently, a thorough simulation study shows how the beating problem can be overcome with error correction codes. RF-Zero-Wire allows achieving an end-to-end latency of less than 1ms for a small 4-byte frame transmitted across 5 hops. Moreover, latency is shown to increase only by 0.16% per extra hop for 16-byte frames, which is negligible compared to the over 100% per-hop latency increase observed in store-and-forward protocols. The trade-offs between network reliability and CFO range, communication distance, node density, and achievable data rate are studied in large-scale experiments based on simulation.

cs.NI↗

arXiv2025

Evaluating UORA-Based Polling Mechanism for Latency-Sensitive Uplink Traffic in Wi-Fi Networks

IEEE 802.11ax (Wi-Fi 6) introduced Orthogonal Frequency Division Multiple Access (OFDMA), which enables simultaneous transmissions through centralized resource allocation. However, effective uplink scheduling requires the Access Point (AP) to identify which stations (STAs) have data to transmit. This typically necessitates polling for buffer status reports, a process that becomes increasingly inefficient and unscalable with growing device density. In this paper, we study how the Uplink OFDMA-based Random Access (UORA) feature improves the scalability and delay experienced by latency-sensitive data streams. We show that UORA enables efficient uplink scheduling while opportunistically identifying buffered traffic from unscheduled STAs, striking a balance between coordination and scalability. Performance evaluation of different polling strategies is done by means of simulation in ns-3. The results indicate that UORA-based polling outperforms alternative schemes in densely deployed network environments with heterogeneous uplink traffic patterns. Furthermore, under highly sparse and sporadic traffic conditions, UORA-based polling yields over 40% delay reduction compared to Scheduled Access (SA) OFDMA.

cs.NI↗

arXiv2025

Design and Evaluation of IEEE 802.11ax Uplink Orthogonal Frequency Division Multiple Random Access in ns-3

Wi-Fi networks have long relied on the Enhanced Distributed Channel Access (EDCA) mechanism, allowing stations to compete for transmission opportunities. However, as networks become denser and emerging applications demand lower latency and higher reliability, the limitations of EDCA such as overhead due to contention and collisions have become more pronounced. To address these challenges, Orthogonal Frequency Division Multiple Access (OFDMA) has been introduced in Wi-Fi, enabling more efficient channel utilization through scheduled resource allocation. Furthermore, Wi-Fi 6 defines Uplink Orthogonal Frequency Division Multiple Random Access (UORA), a hybrid mechanism that combines both scheduled and random access, balancing efficiency and responsiveness in resource allocation. Despite significant research on UORA, most studies rely on custom simulators that are not publicly available, limiting reproducibility and preventing validation of the presented results. The only known open-source UORA implementation in the ns-3 simulator exhibits key limitations, such as usage of the same trigger frame (TF) to schedule resources for buffer status reports and data transmissions, and lack of signaling for UORA configuration. In this paper, we present a fully standard-compliant and open source UORA implementation that is compatible with ns-3 version 3.38, addressing these limitations to improve resource allocation efficiency and adaptability. This implementation enables more accurate and flexible evaluation of UORA, fostering future research on Wi-Fi resource allocation strategies.

cs.NI↗

arXiv2025

A2P: A Scalable OFDMA Polling Algorithm for Time-Sensitive Wi-Fi Networks

Over the years, advancements such as increased bandwidth, new modulation and coding schemes, frame aggregation, and the use of multiple antennas have been employed to enhance Wi-Fi performance. Nonetheless, as network density and the demand for low-latency applications increases, contention delays and retransmissions have become obstacles to efficient Wi-Fi deployment in modern scenarios. The introduction of Orthogonal Frequency-Division Multiple Access (OFDMA) in the IEEE 802.11 standard allows simultaneous transmissions to and from multiple users within the same transmission opportunity, thereby reducing the contention. However, the AP must efficiently manage the resource allocation, particularly in uplink scenarios where it lacks prior knowledge of users' buffer statuses, thus making polling a critical bottleneck in networks with a high number of users with sporadic traffic pattern. This paper addresses the polling problem and introduces the A2P algorithm, designed to enable scalable and efficient polling in high-density OFDMA-based time sensitive Wi-Fi networks. Simulation results show that A2P outperforms the alternative schemes by maintaining significantly lower delay and packet loss in dense time-sensitive teleconferencing scenario.

cs.NI↗

arXiv2024

A Primer on AP Power Save in Wi-Fi 8: Overview, Analysis, and Open Challenges

Wi-Fi facilitates the Internet connectivity of billions of devices worldwide, making it an indispensable technology for modern life. Wi-Fi networks are becoming significantly denser, making energy consumption and its effects on operational costs and environmental sustainability crucial considerations. Wi-Fi has already introduced several mechanisms to enhance the energy efficiency of non-Access Point (non-AP) stations (STAs). However, the reduction of energy consumption of APs has never been a priority. Always-on APs operating at their highest capabilities consume significant power, which affects the energy costs of the infrastructure owner, aggravates the environmental impact, and decreases the lifetime of battery-powered APs. IEEE 802.11bn, which will be the basis of Wi-Fi 8, makes a big leap forward by introducing the AP Power Save (PS) framework. In this article, we describe and analyze the main proposals discussed in the IEEE 802.11bn Task Group (TGbn), such as Scheduled Power Save, (Semi-)Dynamic Power Save, and Cross-Link Power Save. We also consider other proposals that are being discussed in TGbn, namely the integration of Wake-up Radios (WuRs) and STA offloading. We then showcase the potential benefits of AP PS in several scenarios, including a deployment of 470 real APs in a university campus. Our numerical analysis reveals that AP power consumption can be decreased on average by up to 28 percent, with further improvement potential. Finally, we outline the open challenges that need to be addressed to optimally integrate AP PS in Wi-Fi and ensure its compatibility with legacy devices.

cs.NI↗

arXiv2024

Low-latency Symbol-Synchronous Communication for Multi-hop Sensor Networks

Wireless sensor networks (WSNs) have received great interest due to their scalability, energy efficiency, and low-cost deployment. By utilizing multi-hop communication, WSNs can cover a wide area using low transmission power without the need for any communication infrastructure. Traditionally, WSNs rely on store-and-forward routing protocols and Time Division Multiple Access (TDMA)-based schedules that avoid interference between different wireless nodes. However, emerging challenging scenarios, such as the industrial Internet of Things (IoT) and robotic swarms, impose strict latency and reliability requirements, which traditional approaches cannot fulfill. In this paper, we propose a novel symbol-synchronous transmission design that provides reliable low-latency communication with a reasonable data rate on classical sub-6GHz RF frequency bands (e.g., the 2.4GHz ISM band). Instead of avoiding overlapping transmissions, the proposed scheme benefits from concurrent transmissions. Using simulation in MATLAB, we prove that the proposed design allows achieving a wire-like delay of 5ms for a 512-bit packet over multiple hops with only a 0.3% latency increase per extra hop and a low bit error rate (BER) of 0.04%. Compared to similar state-of-the-art approaches it can achieve a significantly higher data rate of 100kbps, which is expected to increase further with future improvements of the system.

cs.NI↗

arXiv2024

Dedicated Restricted Target Wake Time for Real-Time Applications in Wi-Fi 7

Real-time applications (RTA) tend to play a crucial role in people's everyday life. Such applications are among the key use cases for the next generations of wireless technologies. RTA applications are characterized by strict guaranteed delay requirements (in the order of a few milliseconds). One of the pillars of enabling RTA in next-generation Wi-Fi standards is Restricted Target Wake Time (R-TWT), which provides Wi-Fi stations exclusive channel access within negotiated service periods (SPs). If each RTA data flow uses dedicated SPs for data transmission, they are completely isolated from each other and do not experience any contention. To ensure the satisfaction of RTA QoS requirements while minimizing the channel airtime consumption, it is important to properly select the R-TWT parameters, namely the duration of SPs and the period between SPs. In this paper, we develop a mathematical model that estimates the delay probability distribution and packet loss probability for a given set of network, traffic and R-TWT parameters. Using this model, the access point can select the optimal R-TWT parameters for the given QoS requirements. The high accuracy of the model is proven by means of simulation.

cs.NI↗

arXiv2021

Adaptive Transmission Parameters Selection Algorithm for URLLC Traffic in Uplink

Ultra-Reliable Low-Latency Communications (URLLC) is a novel feature of 5G cellular systems. To satisfy strict URLLC requirements for uplink data transmission, the specifications of 5G systems introduce the grant-free channel access method. According to this method, a User Equipment (UE) performs packet transmission without requesting channel resources from a base station (gNB). With the grant-free channel access, the gNB configures the uplink transmission parameters in a long-term time scale. Since the channel quality can significantly change in time and frequency domains, the gNB should select robust transmission parameters to satisfy the URLLC requirements. Many existing studies consider fixed robust uplink transmission parameter selection that allows satisfying the requirements even for UEs with poor channel conditions. However, the more robust transmission parameters are selected, the lower is the network capacity. In this paper, we propose an adaptive algorithm that selects the transmission parameters depending on the channel quality based on the signal-to-noise ratio statistics analysis at the gNB. Simulation results obtained with NS-3 show that the algorithm allows meeting the URLLC latency and reliability requirements while reducing the channel resource consumption more than twice in comparison with the fixed transmission parameters selection.

cs.NI↗

arXiv2020

Analytical Study of Incremental Approach for Information Dissemination in Wireless Networks

In many scenarios, control information dissemination becomes a bottleneck, which limits the scalability and the performance of wireless networks. Such a problem is especially crucial in mobile ad hoc networks, dense networks, networks of vehicles and drones, sensor networks. In other words, this problem occurs in any scenario with frequent changes in topology or interference level on one side and with strong requirements on delay, reliability, power consumption, or capacity on the other side. If the control information changes partially, it may be worth sending only differential updates instead of messages containing full information to reduce overhead. However, such an approach needs accurate tuning of dissemination parameters, since it is necessary to guarantee information relevance in error-prone wireless networks. In the paper, we provide a deep study of two approaches for generating differential updates - namely, incremental and cumulative - and compare their efficiency. We show that the incremental approach allows significantly reducing the amount of generated control information compared to the cumulative one, while providing the same level of information relevance. We develop an analytical model for the incremental approach and propose an algorithm which allows tuning its parameters, depending on the number of nodes in the network, their mobility, and wireless channel quality. Using the developed analytical model, we show that the incremental approach is very useful for static dense network deployments and networks with low and medium mobility, since it allows us to significantly reduce the amount of control information compared to the classical full dump approach.

cs.NI↗

arXiv2019

Conservative Link Adaptation for Ultra Reliable Low Latency Communications

Ultra reliable low latency communications (URLLC) is one of the most promising and demanding services in 5G systems. This service requires very low latency of less than $1-10$ ms and very high transmission reliability: the acceptable packet loss ratio is about $10^{-5}$. To satisfy such strict requirements, many issues shall be solved. This paper focuses on the link adaptation problem, i.e., the selection of a modulation and coding scheme (MCS) for transmission based on the received channel quality indicator (CQI) reports. On the one hand, link adaptation should select a robust MCS to provide high reliability. On the other hand, it should select the highest possible MCS to reduce channel resource consumption. The paper shows that even for one URLLC user, link adaptation is still a challenging problem, especially in highly-variant channels. To solve this problem, a conservative link adaptation algorithm is designed. The algorithm estimates the strongest channel degradation at the time moment of the actual packet transmission and selects an MCS taking into account the worst degradation. The obtained results show that the proposed algorithm is efficient in terms of both the packet loss ratio and the channel resource consumption.

cs.NI↗