17 July 2017 in IEEE Communications Surveys & Tutorials
In this paper, a survey of the literature of the past 15 years involving machine learning (ML) algorithms applied to self-organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of self-organizing networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this paper also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future.
10 February 2023 in IEEE Transactions on Vehicular Technology
Vital societal and industrial autonomous components are increasingly interconnected through communication networks to complete critical tasks cooperatively. However, as the reliability and trust requirements for connected autonomous systems continue to grow, the centralized communication and decision approaches that are in use today are reaching their limits. Focusing on autonomous driving applications, this paper proposes a resilient and trustworthy framework on wireless distributed consensus networks, where the communication links are less reliable or are even in the presence of incorrect local sensor readings/decisions. To accomplish that, a novel three stages consensus mechanism is proposed based on the practical Byzantine fault tolerance (PBFT), where the veto collection and gossip stages are designed to meet the stringent and complex requirements for a vehicle's maneuvers. A plan tree synthesis is also proposed to make consensus on a series of decisions while adopting network members' decision preferences. A detailed protocol including the distributed consensus, plan tree synthesis, dynamic grouping, etc. is proposed. Simulation results show that the proposed consensus mechanism is able to be reached and propagated through the network under poor wireless communication conditions and the presence of faulty vehicles with incorrect sensor readings. The result can be extended to other autonomous systems to significantly enhance safety in critical industrial applications.
14 March 2023 in Distributed Ledger Technologies: Research and Practice
Recent data leak scandals, together with the under-utilization of collected data (estimated that around 90% of data never leaves a device’s local storage), limits the applicability and potential of novel data driven applications. Thus, novel ways to treat data, in which users are guaranteed control, usability, and privacy over their generated data are needed. In this paper we propose a novel privacy-preserving blockchain framework for a data sharing marketplace. The proposed framework allows users (such as sensors and devices) that generate data to store it in external servers, while the blockchain is utilized to record buy and sell transactions between parties, as well as perform access control by generating access sequences whenever trades are performed. A novel perspective over data ownership is presented, in which whoever generates the data has completed ownership and control over it and the blockchain transactions are only utilized to guarantee temporary access to it. The proposed blockchain framework also supports different types of data and provides, via the distributed and openness of the framework, quality, timeliness and similarity control over the data stored in the marketplace. In this context, different types of applications that can benefit from this framework are presented and open problems are discussed.
14 May 2019 in IEEE Transactions on Wireless Communications
With the advent of network densification and the development of other radio interface technologies, the major bottleneck of future cellular networks is shifting from the radio access network to the backhaul. The future networks are expected to handle a wide range of applications and users with different requirements. In order to tackle the problem of downlink user-cell association, and allocate users to the best cell, an intelligent solution based on reinforcement learning is proposed. A distributed solution based on Q-Learning is developed in order to determine the best cell range extension offsets (CREOs) for each small cell (SC) and the best weights of each user requirement to efficiently allocate users to the most appropriate SC, based on both backhaul constraints and user demands. By optimizing both CREOs and user weights, a user-specific allocation can be achieved, resulting in a better overall quality of service. The results show that the proposed algorithm outperforms current solutions by achieving better user satisfaction, mitigating the total number of users in outage, and minimizing user dissatisfaction when satisfaction is not possible.
6 March 2024 in IEEE Transactions on Vehicular Technology
In this paper, we propose a new channel tracking method to track the time fluctuations of millimeter-wave (mmWave) channels over multiple subcarriers with few training overheads and low complexity. In essence, channel tracking is formulated as a compressive sensing problem with the proposed sensing matrix over the delay domain, which enables low complexity irrespective of the number of available subcarriers, resulting in a new tracking algorithm based on the exact top- $k$ feature selection. To elaborate, the proposed method is based on a novel sensing matrix that exploits the time evolution models of angle of arrivals (AoAs) and angle of departures (AoDs), where the time-varying channel is effectively approximated with a few discrete AoA and AoD candidates. Moreover, the proposed tracking algorithm is refined by introducing multiple sub-sensing subsets, which further improve the tracking performance. Numerical results and complexity analyses in terms of floating operations (FLOPs) confirm that the proposed approaches achieve better trade-offs between complexity and tracking gain than the conventional Bayesian estimator approaches.
18 August 2025 in IEEE Transactions on Wireless Communications
This paper proposes a joint channel and data estimation (JCDE) algorithm for uplink multiuser extremely large-scale multiple-input-multiple-output (XL-MIMO) systems. The initial channel estimation is formulated as a sparse reconstruction problem based on the angle and distance sparsity under the near-field propagation condition. This problem is solved using non-orthogonal pilots through an efficient low complexity two-stage compressed sensing algorithm. Furthermore, the initial channel estimates are refined by employing a JCDE framework driven by both non-orthogonal pilots and estimated data. The JCDE problem is solved by sequential expectation propagation (EP) algorithms, where the channel and data are alternately updated in an iterative manner. In the channel estimation phase, integrating Bayesian inference with a model-based deterministic approach provides precise estimations to effectively exploit the near-field characteristics in the beam-domain. In the data estimation phase, a linear minimum mean square error (LMMSE)-based filter is designed at each sub-array to address the correlation due to energy leakage in the beam-domain arising from the near-field effects. Numerical simulations reveal that the proposed initial channel estimation and JCDE algorithm outperforms the state-of-the-art approaches in terms of channel estimation, data detection, and computational complexity.