Predicting Wireless Channel Quality by means of Moving Averages and
Regression Models
- URL: http://arxiv.org/abs/2306.08634v1
- Date: Wed, 14 Jun 2023 16:55:24 GMT
- Title: Predicting Wireless Channel Quality by means of Moving Averages and
Regression Models
- Authors: Gabriele Formis, Stefano Scanzio, Gianluca Cena, Adriano Valenzano
- Abstract summary: Knowing in advance how much channel behavior may change can speed up procedures for adaptively selecting the best channel.
A simple technique based on a linear combination of outcomes from different techniques was presented and analyzed.
We found that the best model is the exponential moving average, which managed to predict the frame delivery ratio with a 2.10% average error.
- Score: 4.626261940793027
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The ability to reliably predict the future quality of a wireless channel, as
seen by the media access control layer, is a key enabler to improve performance
of future industrial networks that do not rely on wires. Knowing in advance how
much channel behavior may change can speed up procedures for adaptively
selecting the best channel, making the network more deterministic, reliable,
and less energy-hungry, possibly improving device roaming capabilities at the
same time.
To this aim, popular approaches based on moving averages and regression were
compared, using multiple key performance indicators, on data captured from a
real Wi-Fi setup. Moreover, a simple technique based on a linear combination of
outcomes from different techniques was presented and analyzed, to further
reduce the prediction error, and some considerations about lower bounds on
achievable errors have been reported. We found that the best model is the
exponential moving average, which managed to predict the frame delivery ratio
with a 2.10\% average error and, at the same time, has lower computational
complexity and memory consumption than the other models we analyzed.
Related papers
- Modeling of Time-varying Wireless Communication Channel with Fading and Shadowing [0.0]
We propose a new approach that combines a deep learning neural network with a mixture density network model to derive the conditional probability density function of receiving power.
Experiments on Nakagami fading channel model and Log-normal shadowing channel model with path loss and noise show that the new approach is more statistically accurate, faster, and more robust than the previous deep learning-based channel models.
arXiv Detail & Related papers (2024-05-13T21:30:50Z) - A Multi-Channel Spatial-Temporal Transformer Model for Traffic Flow Forecasting [0.0]
We propose a multi-channel spatial-temporal transformer model for traffic flow forecasting.
It improves the accuracy of the prediction by fusing results from different channels of traffic data.
Experimental results on six real-world datasets demonstrate that introducing a multi-channel mechanism into the temporal model enhances performance.
arXiv Detail & Related papers (2024-05-10T06:37:07Z) - Linear Combination of Exponential Moving Averages for Wireless Channel
Prediction [2.34863357088666]
In this work, prediction models based on the exponential moving average (EMA) are investigated in depth.
A new model that we called EMA linear combination (ELC) is introduced, explained, and evaluated experimentally.
arXiv Detail & Related papers (2023-12-13T07:44:05Z) - Low Complexity Channel estimation with Neural Network Solutions [1.0499453838486013]
We deploy a general residual convolutional neural network to achieve channel estimation in a downlink scenario.
Compared with other deep learning methods for channel estimation, our results suggest improved mean squared error computation.
arXiv Detail & Related papers (2022-01-24T19:55:10Z) - Parameter Efficient Deep Probabilistic Forecasting [0.0]
We introduce a novel Bidirectional Temporal Convolutional Network (BiTCN), which requires an order of magnitude less parameters than a common Transformer-based approach.
Our method performs on par with four state-of-the-art probabilistic forecasting methods, including a Transformer-based approach and WaveNet.
We demonstrate that our method requires significantly less parameters than Transformer-based methods, which means the model can be trained faster with significantly lower memory requirements.
arXiv Detail & Related papers (2021-12-06T10:09:39Z) - CATRO: Channel Pruning via Class-Aware Trace Ratio Optimization [61.71504948770445]
We propose a novel channel pruning method via Class-Aware Trace Ratio Optimization (CATRO) to reduce the computational burden and accelerate the model inference.
We show that CATRO achieves higher accuracy with similar cost or lower cost with similar accuracy than other state-of-the-art channel pruning algorithms.
Because of its class-aware property, CATRO is suitable to prune efficient networks adaptively for various classification subtasks, enhancing handy deployment and usage of deep networks in real-world applications.
arXiv Detail & Related papers (2021-10-21T06:26:31Z) - Learning to Perform Downlink Channel Estimation in Massive MIMO Systems [72.76968022465469]
We study downlink (DL) channel estimation in a Massive multiple-input multiple-output (MIMO) system.
A common approach is to use the mean value as the estimate, motivated by channel hardening.
We propose two novel estimation methods.
arXiv Detail & Related papers (2021-09-06T13:42:32Z) - Low-Latency Federated Learning over Wireless Channels with Differential
Privacy [142.5983499872664]
In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server.
In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement.
arXiv Detail & Related papers (2021-06-20T13:51:18Z) - SignalNet: A Low Resolution Sinusoid Decomposition and Estimation
Network [79.04274563889548]
We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples.
We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions.
In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
arXiv Detail & Related papers (2021-06-10T04:21:20Z) - Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs.
Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
arXiv Detail & Related papers (2020-04-06T15:51:00Z) - Wireless Power Control via Counterfactual Optimization of Graph Neural
Networks [124.89036526192268]
We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium.
To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture.
We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
arXiv Detail & Related papers (2020-02-17T07:54:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.