A Robust Machine Learning Approach for Path Loss Prediction in 5G Networks with Nested Cross Validation

• URL: http://arxiv.org/abs/2310.01030v1
• Date: Mon, 2 Oct 2023 09:21:58 GMT
• Title: A Robust Machine Learning Approach for Path Loss Prediction in 5G Networks with Nested Cross Validation
• Authors: Ibrahim Yaz{\i}c{\i}, and Emre Gures
• Abstract summary: We utilize machine learning (ML) methods, which overcome conventional path loss prediction models, for path loss prediction in a 5G network system. First, we acquire a dataset obtained through a comprehensive measurement campaign conducted in an urban macro-cell scenario located in Beijing, China. We deploy Support Vector Regression (SVR), CatBoost Regression (CBR), eXtreme Gradient Boosting Regression (XGBR), Artificial Neural Network (ANN), and Random Forest (RF) methods to predict the path loss, and compare the prediction results in terms of Mean Absolute Error (MAE) and Mean Square Error (MSE)
• Score: 0.6138671548064356
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The design and deployment of fifth-generation (5G) wireless networks pose significant challenges due to the increasing number of wireless devices. Path loss has a landmark importance in network performance optimization, and accurate prediction of the path loss, which characterizes the attenuation of signal power during transmission, is critical for effective network planning, coverage estimation, and optimization. In this sense, we utilize machine learning (ML) methods, which overcome conventional path loss prediction models drawbacks, for path loss prediction in a 5G network system to facilitate more accurate network planning, resource optimization, and performance improvement in wireless communication systems. To this end, we utilize a novel approach, nested cross validation scheme, with ML to prevent overfitting, thereby getting better generalization error and stable results for ML deployment. First, we acquire a publicly available dataset obtained through a comprehensive measurement campaign conducted in an urban macro-cell scenario located in Beijing, China. The dataset includes crucial information such as longitude, latitude, elevation, altitude, clutter height, and distance, which are utilized as essential features to predict the path loss in the 5G network system. We deploy Support Vector Regression (SVR), CatBoost Regression (CBR), eXtreme Gradient Boosting Regression (XGBR), Artificial Neural Network (ANN), and Random Forest (RF) methods to predict the path loss, and compare the prediction results in terms of Mean Absolute Error (MAE) and Mean Square Error (MSE). As per obtained results, XGBR outperforms the rest of the methods. It outperforms CBR with a slight performance differences by 0.4 % and 1 % in terms of MAE and MSE metrics, respectively. On the other hand, it outperforms the rest of the methods with clear performance differences.

Related papers

• Residual-based Adaptive Huber Loss (RAHL) -- Design of an improved Huber loss for CQI prediction in 5G networks [0.7499722271664144]
  We propose a novel loss function, named Residual-based Adaptive Huber Loss (RAHL) RAHL balances robustness against outliers while preserving inlier data precision. Results affirm the superiority of RAHL, offering a promising avenue for enhanced CQI prediction in 5G networks.
  arXiv  Detail & Related papers  (2024-08-27T00:58:32Z)
• PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection [65.24854366973794]
  Node-level graph anomaly detection (GAD) plays a critical role in identifying anomalous nodes from graph-structured data in domains such as medicine, social networks, and e-commerce. We introduce a simple method termed PREprocessing and Matching (PREM for short) to improve the efficiency of GAD. Our approach streamlines GAD, reducing time and memory consumption while maintaining powerful anomaly detection capabilities.
  arXiv  Detail & Related papers  (2023-10-18T02:59:57Z)
• SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning [9.60349706518775]
  This study addresses the challenge of inaccurate gradients in computing the empirical Fisher Information Matrix during neural network pruning. We introduce SWAP, a formulation of Entropic Wasserstein regression (EWR) for pruning, capitalizing on the geometric properties of the optimal transport problem. Our proposed method achieves a gain of 6% improvement in accuracy and 8% improvement in testing loss for MobileNetV1 with less than one-fourth of the network parameters remaining.
  arXiv  Detail & Related papers  (2023-10-07T21:15:32Z)
• A Novel Approach for Machine Learning-based Load Balancing in High-speed Train System using Nested Cross Validation [0.6138671548064356]
  Fifth-generation (5G) mobile communication networks have recently emerged in various fields, including highspeed trains. We model system performance of a high-speed train system with a novel machine learning (ML) approach that is nested cross validation scheme.
  arXiv  Detail & Related papers  (2023-10-02T09:24:10Z)
• Towards Energy-Aware Federated Traffic Prediction for Cellular Networks [2.360352205004026]
  We propose a novel sustainability indicator that allows assessing the feasibility of machine learning (ML) models. We evaluate state-of-the-art deep learning (DL) architectures in a federated scenario using real-world measurements from base station (BS) sites in the area of Barcelona, Spain. Our findings indicate that larger ML models achieve marginally improved performance but have a significant environmental impact in terms of carbon footprint.
  arXiv  Detail & Related papers  (2023-09-19T14:28:09Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• Multi-agent Reinforcement Learning with Graph Q-Networks for Antenna Tuning [60.94661435297309]
  The scale of mobile networks makes it challenging to optimize antenna parameters using manual intervention or hand-engineered strategies. We propose a new multi-agent reinforcement learning algorithm to optimize mobile network configurations globally. We empirically demonstrate the performance of the algorithm on an antenna tilt tuning problem and a joint tilt and power control problem in a simulated environment.
  arXiv  Detail & Related papers  (2023-01-20T17:06:34Z)
• Efficient Graph Neural Network Inference at Large Scale [54.89457550773165]
  Graph neural networks (GNNs) have demonstrated excellent performance in a wide range of applications. Existing scalable GNNs leverage linear propagation to preprocess the features and accelerate the training and inference procedure. We propose a novel adaptive propagation order approach that generates the personalized propagation order for each node based on its topological information.
  arXiv  Detail & Related papers  (2022-11-01T14:38:18Z)
• Switching in the Rain: Predictive Wireless x-haul Network Reconfiguration [17.891837432766764]
  Wireless x-haul networks rely on microwave and millimeter-wave links between 4G and/or 5G base-stations to support ultra-high data rate and ultra-low latency. precipitation may cause severe signal attenuation, which significantly degrades the network performance. We develop a Predictive Network Reconfiguration framework that uses historical data to predict the future condition of each link and then prepares the network ahead of time for imminent disturbances.
  arXiv  Detail & Related papers  (2022-03-07T13:40:38Z)
• On Topology Optimization and Routing in Integrated Access and Backhaul Networks: A Genetic Algorithm-based Approach [70.85399600288737]
  We study the problem of topology optimization and routing in IAB networks. We develop efficient genetic algorithm-based schemes for both IAB node placement and non-IAB backhaul link distribution. We discuss the main challenges for enabling mesh-based IAB networks.
  arXiv  Detail & Related papers  (2021-02-14T21:52:05Z)
• 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)

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.