Searcharxiv⌕ Search

arXiv subjects

Symeon Chatzinotas

Publications and source records attributed to Symeon Chatzinotas.

At least 379 records · Page 21Linked to original sources

Federated Learning Meets Contract Theory: Energy-Efficient Framework for Electric Vehicle Networks

In this paper, we propose a novel energy-efficient framework for an electric vehicle (EV) network using a contract theoretic-based economic model to maximize the profits of charging stations (CSs) and improve the social welfare of the network. Specifically, we first introduce CS-based and CS clustering-based decentralized federated energy learning (DFEL) approaches which enable the CSs to train their own energy transactions locally to predict energy demands. In this way, each CS can exchange its learned model with other CSs to improve prediction accuracy without revealing actual datasets and reduce communication overhead among the CSs. Based on the energy demand prediction, we then design a multi-principal one-agent (MPOA) contract-based method. In particular, we formulate the CSs' utility maximization as a non-collaborative energy contract problem in which each CS maximizes its utility under common constraints from the smart grid provider (SGP) and other CSs' contracts. Then, we prove the existence of an equilibrium contract solution for all the CSs and develop an iterative algorithm at the SGP to find the equilibrium. Through simulation results using the dataset of CSs' transactions in Dundee city, the United Kingdom between 2017 and 2018, we demonstrate that our proposed method can achieve the energy demand prediction accuracy improvement up to 24.63% and lessen communication overhead by 96.3% compared with other machine learning algorithms. Furthermore, our proposed method can outperform non-contract-based economic models by 35% and 36% in terms of the CSs' utilities and social welfare of the network, respectively.

cs.NI↗

Random Access based Reliable Uplink Communication and Power Transfer using Dynamic Power Splitting

Large communication networks, e.g. Internet of Things (IoT), are known to be vulnerable to co-channel interference. One possibility to address this issue is the use of orthogonal multiple access (OMA) techniques. However, due to a potentially very long duty cycle, OMA is not well suited for such schemes. Instead, random medium access (RMA) appears more promising. An RMA scheme is based on transmission of short data packets with random scheduling, which is typically unknown to the receiver. The received signal, which consists of the overlapping packets, can be used for energy harvesting and powering of a relay device. Such an energy harvesting relay may utilize the energy for further information processing and uplink transmission. In this paper, we address the design of a simultaneous information and power transfer scheme based on randomly scheduled packet transmissions and reliable symbol detection. We formulate a prediction problem with the goal to maximize the harvested power for an RMA scenario. In order to solve this problem, we propose a new prediction method, which shows a significant performance improvement compared to the straightforward baseline scheme. Furthermore, we investigate the complexity of the proposed method and its vulnerability to imperfect channel state information.

cs.IT↗

Joint Bit Allocation and Hybrid Beamforming Optimization for Energy Efficient Millimeter Wave MIMO Systems

In this paper, we aim to design highly energy efficient end-to-end communication for millimeter wave multiple-input multiple-output systems. This is done by jointly optimizing the digital-to-analog converter (DAC)/analog-to-digital converter (ADC) bit resolutions and hybrid beamforming matrices. The novel decomposition of the hybrid precoder and the hybrid combiner to three parts is introduced at the transmitter (TX) and the receiver (RX), respectively, representing the analog precoder/combiner matrix, the DAC/ADC bit resolution matrix and the baseband precoder/combiner matrix. The unknown matrices are computed as a solution to the matrix factorization problem where the optimal fully digital precoder or combiner is approximated by the product of these matrices. A novel and efficient solution based on the alternating direction method of multipliers is proposed to solve these problems at both the TX and the RX. The simulation results show that the proposed solution, where the DAC/ADC bit allocation is dynamic during operation, achieves higher energy efficiency when compared with existing benchmark techniques that use fixed DAC/ADC bit resolutions.

eess.SP↗

Towards Power-Efficient Aerial Communications via Dynamic Multi-UAV Cooperation

Aerial base stations (BSs) attached to unmanned aerial vehicles (UAVs) constitute a new paradigm for next-generation cellular communications. However, the flight range and communication capacity of aerial BSs are usually limited due to the UAVs' size, weight, and power (SWAP) constraints. To address this challenge, in this paper, we consider dynamic cooperative transmission among multiple aerial BSs for power-efficient aerial communications. Thereby, a central controller intelligently selects the aerial BSs navigating in the air for cooperation. Consequently, the large virtual array of moving antennas formed by the cooperating aerial BSs can be exploited for low-power information transmission and navigation, taking into account the channel conditions, energy availability, and user demands. Considering both the fronthauling and the data transmission links, we jointly optimize the trajectories, cooperation decisions, and transmit beamformers of the aerial BSs for minimization of the weighted sum of the power consumptions required by all BSs. Since obtaining the global optimal solution of the formulated problem is difficult, we propose a low-complexity iterative algorithm that can efficiently find a Karush-Kuhn-Tucker (KKT) solution to the problem. Simulation results show that, compared with several baseline schemes, dynamic multi-UAV cooperation can significantly reduce the communication and navigation powers of the UAVs to overcome the SWAP limitations, while requiring only a small increase of the transmit power over the fronthauling links.

cs.IT↗

On the Spectral and Energy Efficiencies of Full-Duplex Cell-Free Massive MIMO

In-band full-duplex (FD) operation is practically more suited for short-range communications such as WiFi and small-cell networks, due to its current practical limitations on the self-interference cancellation. In addition, cell-free massive multiple-input multiple-output (CF-mMIMO) is a new and scalable version of MIMO networks, which is designed to bring service antennas closer to end user equipments (UEs). To achieve higher spectral and energy efficiencies (SE-EE) of a wireless network, it is of practical interest to incorporate FD capability into CF-mMIMO systems to utilize their combined benefits. We formulate a novel and comprehensive optimization problem for the maximization of SE and EE in which power control, access point-UE (AP-UE) association and AP selection are jointly optimized under a realistic power consumption model, resulting in a difficult class of mixed-integer nonconvex programming. To tackle the binary nature of the formulated problem, we propose an efficient approach by exploiting a strong coupling between binary and continuous variables, leading to a more tractable problem. In this regard, two low-complexity transmission designs based on zero-forcing (ZF) are proposed. Combining tools from inner approximation framework and Dinkelbach method, we develop simple iterative algorithms with polynomial computational complexity in each iteration and strong theoretical performance guaranteed. Furthermore, towards a robust design for FD CF-mMIMO, a novel heap-based pilot assignment algorithm is proposed to mitigate effects of pilot contamination. Numerical results show that our proposed designs with realistic parameters significantly outperform the well-known approaches (i.e., small-cell and collocated mMIMO) in terms of the SE and EE. Notably, the proposed ZF designs require much less execution time than the simple maximum ratio transmission/combining.

eess.SP↗

Full-Duplex Enabled Mobile Edge Caching: From Distributed to Cooperative Caching

Mobile edge caching (MEC) has received much attention as a promising technique to overcome the stringent latency and data hungry requirements in the future generation wireless networks. Meanwhile, full-duplex (FD) transmission can potentially double the spectral efficiency by allowing a node to receive and transmit in the same time/frequency block simultaneously. In this paper, we investigate the delivery time performance of full-duplex enabled MEC (FD-MEC) systems, in which the users are served by distributed edge nodes (ENs), which operate in FD mode and are equipped with a limited storage memory. Firstly, we analyse the FD-MEC with different levels of cooperation among the ENs and take into account a realistic model of self-interference cancellation. Secondly, we propose a framework to minimize the system delivery time of FD-MEC under both linear and optimal precoding designs}. Thirdly, to deal with the non-convexity of the formulated problems, two iterative optimization algorithms are proposed based on the inner approximation method, whose convergence is analytically guaranteed. Finally, the effectiveness of the proposed designs are demonstrated via extensive numerical results. {It is shown that the cooperative scheme mitigates inter-user and self interference significantly better than the distributed scheme at an expense of inter-EN cooperation. In addition, we show that minimum mean square error (MMSE)-based precoding design achieves the best performance-complexity trade-off, compared with the zero-forcing and optimal designs.

cs.IT↗

Towards Tactile Internet in Beyond 5G Era: Recent Advances, Current Issues and Future Directions

Tactile Internet (TI) is envisioned to create a paradigm shift from the content-oriented communications to steer/control-based communications by enabling real-time transmission of haptic information (i.e., touch, actuation, motion, vibration, surface texture) over Internet in addition to the conventional audiovisual and data traffics. This emerging TI technology is expected to create numerous opportunities for technology markets in a wide variety of applications ranging from teleoperation systems and AR/VR to automotive safety and eHealthcare towards addressing the complex problems of human society. However, the realization of TI over wireless media in the upcoming 5G and beyond networks creates various non-conventional communication challenges and stringent requirements. To this end, this paper aims to provide a holistic view on wireless TI along with a thorough review of the existing literature, to identify and analyze the involved technical issues, to highlight potential solutions and to propose future research directions. First, starting with the vision of TI and recent advances and a review of related survey/overview articles, we present a generalized framework for wireless TI in the Beyond 5G Era including a TI architecture, main technical requirements, key application areas and potential enabling technologies. Subsequently, we provide a comprehensive review of the existing TI works by broadly categorizing them into three main paradigms; namely, haptic communications, wireless AR/VR, and autonomous, intelligent and cooperative mobility systems. Next, potential enabling technologies across physical/MAC and network layers are identified and discussed in detail. Also, security and privacy issues of TI applications are discussed along with some promising enablers. Finally, we present some open research challenges and recommend promising future research directions.

cs.NI↗

Interference Exploitation via Symbol-Level Precoding: Overview, State-of-the-Art and Future Directions

Interference is traditionally viewed as a performance limiting factor in wireless communication systems, which is to be minimized or mitigated. Nevertheless, a recent line of work has shown that by manipulating the interfering signals such that they add up constructively at the receiver side, known interference can be made beneficial and further improve the system performance in a variety of wireless scenarios, achieved by symbol-level precoding (SLP). This paper aims to provide a tutorial on interference exploitation techniques from the perspective of precoding design in a multi-antenna wireless communication system, by beginning with the classification of constructive interference (CI) and destructive interference (DI). The definition for CI is presented and the corresponding mathematical characterization is formulated for popular modulation types, based on which optimization-based precoding techniques are discussed. In addition, the extension of CI precoding to other application scenarios as well as for hardware efficiency is also described. Proof-of-concept testbeds are demonstrated for the potential practical implementation of CI precoding, and finally a list of open problems and practical challenges are presented to inspire and motivate further research directions in this area.

eess.SP↗

A Feature-Based Bayesian Method for Content Popularity Prediction in Edge-Caching Networks

Edge-caching is recognized as an efficient technique for future wireless cellular networks to improve network capacity and user-perceived quality of experience. Due to the random content requests and the limited cache memory, designing an efficient caching policy is a challenge. To enhance the performance of caching systems, an accurate content request prediction algorithm is essential. Here, we introduce a flexible model, a Poisson regressor based on a Gaussian process, for the content request distribution in stationary environments. Our proposed model can incorporate the content features as side information for prediction enhancement. In order to learn the model parameters, which yield the Poisson rates or alternatively content popularities, we invoke the Bayesian approach which is very robust against over-fitting. However, the posterior distribution in the Bayes formula is analytically intractable to compute. To tackle this issue, we apply a Monte Carlo Markov Chain (MCMC) method to approximate the posterior distribution. Two types of predictive distributions are formulated for the requests of existing contents and for the requests of a newly-added content. Finally, simulation results are provided to confirm the accuracy of the developed content popularity learning approach.

eess.SP↗

RLS Precoding for Massive MIMO Systems with Nonlinear Front-End

To keep massive MIMO systems cost-efficient, power amplifiers with rather small output dynamic ranges are employed. They may distort the transmit signal and degrade the performance. This paper proposes a distortion aware precoding scheme for realistic scenarios in which RF chains have nonlinear characteristics. The proposed scheme utilizes the method of regularized least-squares (RLS) to jointly compensate the channel impacts and the distortion imposed by the RF chains. To construct the designed transmit waveform with low computational complexity, an iterative algorithm based on approximate message passing is developed. This algorithm is shown to track the achievable average signal distortion of the proposed scheme tightly, even for practical system dimensions. The results demonstrate considerable enhancement compared to the state of the art.

eess.SP↗

Carrier Aggregation in Multi-Beam High Throughput Satellite Systems

Carrier Aggregation (CA) is an integral part of current terrestrial networks. Its ability to enhance the peak data rate, to efficiently utilize the limited available spectrum resources and to satisfy the demand for data-hungry applications has drawn large attention from different wireless network communities. Given the benefits of CA in the terrestrial wireless environment, it is of great interest to analyze and evaluate the potential impact of CA in the satellite domain. In this paper, we study CA in multibeam high throughput satellite systems. We consider both inter-transponder and intra-transponder CA at the satellite payload level of the communication stack, and we address the problem of carrier-user assignment assuming that multiple users can be multiplexed in each carrier. The transmission parameters of different carriers are generated considering the transmission characteristics of carriers in different transponders. In particular, we propose a flexible carrier allocation approach for a CA-enabled multibeam satellite system targeting a proportionally fair user demand satisfaction. Simulation results and analysis shed some light on this rather unexplored scenario and demonstrate the feasibility of the CA in satellite communication systems.

cs.IT↗

Precoded Cluster Hopping in Multi-Beam High Throughput Satellite Systems

Beam-Hopping (BH) and precoding are two trending technologies for the satellite community. While BH enables flexibility to adapt the offered capacity to the heterogeneous demand, precoding aims at boosting the spectral efficiency. In this paper, we consider a high throughput satellite (HTS) system that employs BH in conjunction with precoding. In particular, we propose the concept of Cluster-Hopping (CH) that seamlessly combines the BH and precoding paradigms and utilize their individual competencies. The cluster is defined as a set of adjacent beams that are simultaneously illuminated. In addition, we propose an efficient time-space illumination pattern design, where we determine the set of clusters that can be illuminated simultaneously at each hopping event along with the illumination duration. We model the CH time-space illumination pattern design as an integer programming problem which can be efficiently solved. Supporting results based on numerical simulations are provided which validate the effectiveness of the proposed CH concept and time-space illumination pattern design.

cs.IT↗

Nuts and Bolts of a Realistic Stochastic Geometric Analysis of mmWave HetNets: Hardware Impairments and Channel Aging

Motivated by heterogeneous networks (HetNets) design in improving coverage and by millimeter-wave (mmWave) transmission offering an abundance of extra spectrum, we present a general analytical framework shedding light to the downlink of realistic mmWave HetNets consisting of $K$ tiers of randomly located base stations (BSs). Specifically, we model, by virtue of stochastic geometry tools, the \textit{multi-tier} \textit{multi-user multiple-input multiple-output (MU-MIMO) mmWave} network degraded by the inevitable \textit{residual additive transceiver hardware impairments (RATHIs)} and \textit{channel aging}. Given this setting, we derive the coverage probability and the area spectral efficiency (ASE), and we subsequently evaluate the impact of residual transceiver hardware impairments (RTHIs) and channel aging on these metrics. Different path-loss laws for line-of-sight (LOS) and non-line-of-sight (NLOS) are accounted for the analysis, which are among the distinguishing features of mmWave systems. Among the findings, we show that the RATHIs have a meaningful impact at the high signal-to-noise ratio (SNR) regime, while the transmit additive distortion degrades further than the receive distortion the system performance. Moreover, serving fewer users proves to be preferable, and the more directive the mmWaves are, the higher the ASE becomes.

cs.IT↗

A Bayesian Poisson-Gaussian Process Model for Popularity Learning in Edge-Caching Networks

Edge-caching is recognized as an efficient technique for future cellular networks to improve network capacity and user-perceived quality of experience. To enhance the performance of caching systems, designing an accurate content request prediction algorithm plays an important role. In this paper, we develop a flexible model, a Poisson regressor based on a Gaussian process, for the content request distribution. The first important advantage of the proposed model is that it encourages the already existing or seen contents with similar features to be correlated in the feature space and therefore it acts as a regularizer for the estimation. Second, it allows to predict the popularities of newly-added or unseen contents whose statistical data is not available in advance. In order to learn the model parameters, which yield the Poisson arrival rates or alternatively the content \textit{popularities}, we invoke the Bayesian approach which is robust against over-fitting. However, the resulting posterior distribution is analytically intractable to compute. To tackle this, we apply a Markov Chain Monte Carlo (MCMC) method to approximate this distribution which is also asymptotically exact. Nevertheless, the MCMC is computationally demanding especially when the number of contents is large. Thus, we employ the Variational Bayes (VB) method as an alternative low complexity solution. More specifically, the VB method addresses the approximation of the posterior distribution through an optimization problem. Subsequently, we present a fast block-coordinate descent algorithm to solve this optimization problem. Finally, extensive simulation results both on synthetic and real-world datasets are provided to show the accuracy of our prediction algorithm and the cache hit ratio (CHR) gain compared to existing methods from the literature.

eess.SP↗

Learning-Based Physical Layer Communications for Multi-agent Collaboration

Consider a collaborative task carried out by two autonomous agents that are able to communicate over a noisy channel. Each agent is only aware of its own state, while the accomplishment of the task depends on the value of the joint state of both agents. As an example, both agents must simultaneously reach a certain location of the environment, while only being aware of their respective positions. Assuming the presence of feedback in the form of a common reward to the agents, a conventional approach would apply separately: (i) an off-the-shelf coding and decoding scheme in order to enhance the reliability of the communication of the state of one agent to the other; and (ii) a standard multi-agent reinforcement learning strategy to learn how to act in the resulting environment. In this work, it is demonstrated that the performance of the collaborative task can be improved if the agents learn jointly how to communicate and to act, even in the presence of a delay in the communication channel.

cs.IT↗

A Joint Solution for Scheduling and Precoding in Multiuser MISO Downlink Channels

The long-term average performance of the MISO downlink channel, with a large number of users compared to transmit antennas of the BS, depends on the interference management which necessitates the joint design problem of scheduling and precoding. Unlike the previous works which do not offer a truly joint design, this paper focuses on formulating a problem amenable for the joint update of scheduling and precoding. Novel optimization formulations are investigated to reveal the hidden difference of convex/ concave structure for three classical criteria (weighted sum rate, max-min SINR, and power minimization) and associated constraints are considered. Thereafter, we propose a convex-concave procedure framework based iterative algorithm where scheduling and precoding variables are updated jointly in each iteration. Finally, we show the superiority in performance of joint solution over the state-of-the-art designs through Monte-Carlo simulations.

eess.SP↗

Blockchain-based Content Delivery Networks: Content Transparency Meets User Privacy

Blockchain is a merging technology for decentralized management and data security, which was first introduced as the core technology of cryptocurrency, e.g., Bitcoin. Since the first success in financial sector, blockchain has shown great potentials in various domains, e.g., internet of things and mobile networks. In this paper, we propose a novel blockchain-based architecture for content delivery networks (B-CDN), which exploits the advances of the blockchain technology to provide a decentralized and secure platform to connect content providers (CPs) with users. On one hand, the proposed B-CDN will leverage the registration and subscription of the users to different CPs, while guaranteeing the user privacy thanks to virtual identity provided by the blockchain network. On the other hand, the B-CDN creates a public immutable database of the requested contents (from all CPs), based on which each CP can better evaluate the user preference on its contents. The benefits of B-CDN are demonstrated via an edge-caching application, in which a feature-based caching algorithm is proposed for all CPs. The proposed caching algorithm is verified with the realistic Movielens dataset. A win-win relation between the CPs and users is observed, where the B-CDN improves user quality of experience and reduces cost of delivering content for the CPs.

cs.NI↗

SDN-enabled MIMO Heterogeneous Cooperative Networks with Flexible Cell Association

Small-cell densification is a strategy enabling the offloading of users from macro base stations (MBSs), in order to alleviate their load and increase the coverage, especially, for cell-edge users. In parallel, as the network increases in density, the BS cooperation emerges as an efficient design method towards the demands for drastic improvement of the system performance against the detrimental overall interference. In addition, the tiers are enhanced with cell association policies by introducing the concept of the association probability. Above this and motivated by the advantages of cooperation among BSs, the small base stations (SBSs) are enriched with this property in their design. SBS cooperation allows shedding light into its impact on the cell selection rules in multi-antenna HetNets. Under these settings, software-defined networking (SDN) is introduced smoothly to play the leading role in the orchestration of the network. {In particular, heavy operations such as the coordination and the cell association are undertaken by virtue of an SDN controller performing and managing efficiently the corresponding computations due to its centralized adaptability and dynamicity towards the enhancement and potential scalability of the network}. In this context, we derive the coverage probability and the mean achievable rate. Not only we show the outperformance of BS cooperation over uncoordinated BSs, but we also demonstrate that the SBS cooperation enables the admittance of more users from the macro-cell BSs (MBSs). Moreover, we investigate the performance of different transmission techniques, and we identify the optimal bias in each case when SBSs cooperate. Finally, we depict that the SBS densification is beneficial until a specific density value since a further increase does not increase the coverage probability.

cs.IT↗