Searcharxiv⌕ Search

arXiv subjects

Symeon Chatzinotas

Publications and source records attributed to Symeon Chatzinotas.

At least 361 records · Page 20Linked to original sources

Multi-Antenna Data-Driven Eavesdropping Attacks and Symbol-Level Precoding Countermeasures

In this work, we consider secure communications in wireless multi-user (MU) multiple-input single-output (MISO) systems with channel coding in the presence of a multi-antenna eavesdropper (Eve). In this setting, we exploit machine learning (ML) tools to design soft and hard decoding schemes by using precoded pilot symbols as training data. In this context, we propose ML frameworks for decoders that allow an Eve to determine the transmitted message with high accuracy. We thereby show that MU-MISO systems are vulnerable to such eavesdropping attacks even when relatively secure transmission techniques are employed, such as symbol-level precoding (SLP). To counteract this attack, we propose two novel SLP-based schemes that increase the bit-error rate at Eve by impeding the learning process. We design these two security-enhanced schemes to meet different requirements regarding complexity, security, and power consumption. Simulation results validate both the ML-based eavesdropping attacks as well as the countermeasures, and show that the gain in security is achieved without affecting the decoding performance at the intended users.

eess.SP↗

Precoding for Satellite Communications: Why, How and What next?

Precoding has stood out as a promising multi-user transmission technique to meet the emerging throughput demand of satellite communication systems while awaiting the technological maturity for exploiting higher bands. Precoding enables the reduction of interference among co-channel beams through spatial processing while promoting aggressive frequency reuse and improving spectral efficiency. Satellite systems offer multitude of system and service configurations, resulting in different precoder design methodologies. This article explores the motivation for the introduction of precoding, offers an insight to their theoretical development in a diverse scenarios and presents some avenues for future development.

eess.SP↗

Resource Optimization with Load Coupling in Multi-cell NOMA

Optimizing non-orthogonal multiple access (NOMA) in multi-cell scenarios is much more challenging than the single-cell case because inter-cell interference must be considered. Most papers addressing NOMA consider a single cell. We take a significant step of analyzing NOMA in multi-cell scenarios. We explore the potential of NOMA networks in achieving optimal resource utilization with arbitrary topologies. Towards this goal, we investigate a broad class of problems consisting in optimizing power allocation and user pairing for any cost function that is monotonically increasing in time-frequency resource consumption. We propose an algorithm that achieves global optimality for this problem class. The basic idea is to prove that solving the joint optimization problem of power allocation, user pair selection, and time-frequency resource allocation amounts to solving a so-called iterated function without a closed form. We prove that the algorithm approaches optimality with fast convergence. Numerically, we evaluate and demonstrate the performance of NOMA for multi-cell scenarios in terms of resource efficiency and load balancing.

cs.IT↗

Performance Analysis of Cell-Free Massive MIMO Systems: A Stochastic Geometry Approach

Cell-free (CF) massive multiple-input-multiple-output (MIMO) has emerged as an alternative deployment for conventional cellular massive MIMO networks. Prior works relied on the strong assumption (quite idealized) that the APs are uniformly distributed, and actually, this randomness was considered during the simulation and not in the analysis. However, in practice, ongoing and future networks become denser and increasingly irregular. Having this in mind, we consider that the AP locations are modeled by means of a Poisson point process (PPP) which is a more realistic model for the spatial randomness than a grid or uniform deployment. In particular, by virtue of stochastic geometry tools, we derive both the downlink coverage probability and achievable rate. Notably, this is the only work providing the coverage probability and shedding light on this aspect of CF massive MIMO systems. Focusing on the extraction of interesting insights, we consider small-cells (SCs) as a benchmark for comparison. Among the findings, CF massive MIMO systems achieve both higher coverage and rate with comparison to SCs due to the properties of favorable propagation, channel hardening, and interference suppression. Especially, we showed for both architectures that increasing the AP density results in a higher coverage which saturates after a certain value and increasing the number of users decreases the achievable rate but CF massive MIMO systems take advantage of the aforementioned properties, and thus, outperform SCs. In general, the performance gap between CF massive MIMO systems and SCs is enhanced by increasing the AP density. Another interesting observation concerns that a higher path-loss exponent decreases the rate while the users closer to the APs affect more the performance in terms of the rate.

cs.IT↗

On Performance Characterization of Cascaded Multiwire-PLC/MIMO-RF Communication System

The flexibility of radio frequency (RF) systems and the omnipresence of power cables potentially make the cascaded power line communication (PLC)/RF system an efficient and cost-effective solution in terms of wide coverage and high-speed transmission. This letter proposes an opportunistic decode-and-forward (DF)-based multi-wire/RF relaying system to exploit the advantages of both techniques. The outage probability, bit error rate, and system channel capacity are correspondingly chosen to analyze the properties of the proposed system, which are derived in closed-form expressions and validated via Monte-Carlo simulations. One can observe that our proposed system outperforms the wireless-only system in terms of coverage and data rate, especially when there exists a non-line-of-sight (NLoS) connection between the transmitter and receiver pair.

cs.IT↗

Enabling and Emerging Technologies for Social Distancing: A Comprehensive Survey and Open Problems

Social distancing plays a pivotal role in preventing the spread of viral diseases illnesses such as COVID-19. By minimizing the close physical contact among people, we can reduce the chances of catching the virus and spreading it across the community. This paper aims to provide a comprehensive survey on how emerging technologies, e.g., wireless and networking, artificial intelligence (AI) can enable, encourage, and even enforce social distancing practice. To that end, we first provide a comprehensive background of social distancing including basic concepts, measurements, models, and propose various practical social distancing scenarios. We then discuss enabling wireless technologies which are especially effective and can be widely adopted in practice to keep distance, encourage, and enforce social distancing in general. After that, other emerging and related technologies such as machine learning, computer vision, thermal, ultrasound, etc., are introduced. These technologies open many new solutions and directions to deal with problems in social distancing, e.g., symptom prediction, detection and monitoring quarantined people, and contact tracing. Finally, we provide important open issues and challenges (e.g., privacy-preserving, scheduling, and incentive mechanisms) in implementing social distancing in practice. As an example, instead of reacting with ad-hoc responses to COVID-19-like pandemics in the future, smart infrastructures (e.g., next-generation wireless systems like 6G, smart home/building, smart city, intelligent transportation systems) should incorporate a pandemic mode in its standard architecture/design.

physics.soc-ph↗

Radio Resource Management Techniques for Multibeam Satellite Systems

Next-generation of satellite communication (SatCom) networks are expected to support extremely high data rates for a seamless integration into future large satellite-terrestrial networks. In view of the coming spectral limitations, the main challenge is to reduce the cost per bit, which can only be achieved by enhancing the spectral efficiency. In addition, the capability to quickly and flexibly assign radio resources according to the traffic demand distribution has become a must for future multibeam broadband satellite systems. This article presents the radio resource management problems encountered in the design of future broadband SatComs and provides a comprehensive overview of the available techniques to address such challenges. Firstly, we focus on the demand-matching formulation of the power and bandwidth assignment. Secondly, we present the scheduling design in practical multibeam satellite systems. Finally, a number of future challenges and the respective open research topics are described.

cs.IT↗

Coverage Probability and Ergodic Capacity of Intelligent Reflecting Surface-Enhanced Communication Systems

This paper studies the performance of a single-input single-output (SISO) system enhanced by the assistance of an intelligent reflecting surface (IRS), which is equipped with a finite number of elements under Rayleigh fading channels. From the instantaneous channel capacity, we compute a closed-form expression of the coverage probability as a function of statistical channel information only. A scaling law of the coverage probability and the number of phase shifts is further obtained. The ergodic capacity is derived, then a simple upper bound to simplify matters of utilizing the symbolic functions and can be applied for a long period of time. Numerical results manifest the tightness and effectiveness of our closed-form expressions compared with Monte-Carlo simulations.

cs.IT↗

System Modelling and Design Aspects of Next Generation High Throughput Satellites

Future generation wireless networks are targeting the convergence of fixed, mobile and broadcasting systems with the integration of satellite and terrestrial systems towards utilizing their mutual benefits. Satellite Communications (Sat- Com) is envisioned to play a vital role to provide integrated services seamlessly over heterogeneous networks. As compared to terrestrial systems, the design of SatCom systems require a different approach due to differences in terms of wave propagation, operating frequency, antenna structures, interfering sources, limitations of onboard processing, power limitations and transceiver impairments. In this regard, this letter aims to identify and discuss important modeling and design aspects of the next generation High Throughput Satellite (HTS) systems. First, communication models of HTSs including the ones for multibeam and multicarrier satellites, multiple antenna techniques, and for SatCom payloads and antennas are highlighted and discussed. Subsequently, various design aspects of SatCom transceivers including impairments related to the transceiver, payload and channel, and traffic-based coverage adaptation are presented. Finally, some open topics for the design of next generation HTSs are identified and discussed.

eess.SP↗

Reconfigurable Intelligent Surfaces for Smart Cities: Research Challenges and Opportunities

The concept of Smart Cities has been introduced as a way to benefit from the digitization of various ecosystems at a city level. To support this concept, future communication networks need to be carefully designed with respect to the city infrastructure and utilization of resources. Recently, the idea of 'smart' environment, which takes advantage of the infrastructure for better performance of wireless networks, has been proposed. This idea is aligned with the recent advances in design of reconfigurable intelligent surfaces (RISs), which are planar structures with the capability to reflect impinging electromagnetic waves toward preferred directions. Thus, RISs are expected to provide the necessary flexibility for the design of the 'smart' communication environment, which can be optimally shaped to enable cost- and energy-efficient signal transmissions where needed. Upon deployment of RISs, the ecosystem of the Smart Cities would become even more controllable and adaptable, which would subsequently ease the implementation of future communication networks in urban areas and boost the interconnection among private households and public services. In this paper, we describe our vision of the application of RISs in future Smart Cities. In particular, the research challenges and opportunities are addressed. The contribution paves the road to a systematic design of RIS-assisted communication networks for Smart Cities in the years to come.

eess.SP↗

Short-Packet Communications for MIMO NOMA Systems over Nakagami-m Fading: BLER and Minimum Blocklength Analysis

Recently, ultra-reliable and low-latency communications (URLLC) using short-packets has been proposed to fulfill the stringent requirements regarding reliability and latency of emerging applications in 5G and beyond networks. In addition, multiple-input multiple-output non-orthogonal multiple access (MIMO NOMA) is a potential candidate to improve the spectral efficiency, reliability, latency, and connectivity of wireless systems. In this paper, we investigate short-packet communications (SPC) in a multiuser downlink MIMO NOMA system over Nakagami-m fading, and propose two antenna-user selection methods considering two clusters of users having different priority levels. In contrast to the widely-used long data-packet assumption, the SPC analysis requires the redesign of the communication protocols and novel performance metrics. Given this context, we analyze the SPC performance of MIMO NOMA systems using the average block error rate (BLER) and minimum blocklength, instead of the conventional metrics such as ergodic capacity and outage capacity. More specifically, to characterize the system performance regarding SPC, asymptotic (in the high signal-to-noise ratio regime) and approximate closed-form expressions of the average BLER at the users are derived. Based on the asymptotic behavior of the average BLER, an analysis of the diversity order, minimum blocklength, and optimal power allocation is carried out. The achieved results show that MIMO NOMA can serve multiple users simultaneously using a smaller blocklength compared with MIMO OMA, thus demonstrating the benefits of MIMO NOMA for SPC in minimizing the transmission latency. Furthermore, our results indicate that the proposed methods not only improve the BLER performance but also guarantee full diversity gains for the respective users.

eess.SP↗

Traffic Simulator for Multibeam Satellite Communication Systems

Assume that a multibeam satellite communication system is designed from scratch to serve a particular area with maximal resource utilization and to satisfactorily accommodate the expected traffic demand. The main design challenge here is setting optimal system parameters such as number of serving beams, beam directions and sizes, and transmit power. This paper aims at developing a tool, multibeam satellite traffic simulator, that helps addressing these fundamental challenges, and more importantly, provides an understanding to the spatial-temporal traffic pattern of satellite networks in large-scale environments. Specifically, traffic demand distribution is investigated by processing credible datasets included three major input categories of information: (i) population distribution for broadband Fixed Satellite Services (FSS), (ii) aeronautical satellite communications, and (iii) vessel distribution for maritime services. This traffic simulator combines this three-dimensional information in addition to time, locations of terminals, and traffic demand. Moreover, realistic satellite beam patterns have been considered in this work, and thus, an algorithm has been proposed to delimit the coverage boundaries of each satellite beam, and then compute the heterogeneous traffic demand at the footprint of each beam. Furthermore, another algorithm has been developed to capture the inherent attributes of satellite channels and the effects of multibeam interference. Data-driven modeling for satellite traffic is crucial nowadays to design innovative communication systems, e.g., precoding and beam hopping, and to devise efficient resource management algorithms.

eess.SP↗

NOMA-Enabled Multi-Beam Satellite Systems: Joint Optimization to Overcome Offered-Requested Data Mismatches

Non-Orthogonal Multiple Access (NOMA) has potentials to improve the performance of multi-beam satellite systems. The performance optimization in satellite-NOMA systems can be different from that in terrestrial-NOMA systems, e.g., considering distinctive channel models, performance metrics, power constraints, and limited flexibility in resource management. In this paper, we adopt a metric, Offered Capacity to requested Traffic Ratio (OCTR), to measure the requested-offered data (or rate) mismatch in multi-beam satellite systems. In the considered system, NOMA is applied to mitigate intra-beam interference while precoding is implemented to reduce inter-beam interference. We jointly optimize power, decoding orders, and terminal-timeslot assignment to improve the max-min fairness of OCTR. The problem is inherently difficult due to the presence of combinatorial and non-convex aspects. We first fix the terminal-timeslot assignment, and develop an optimal fast-convergence algorithmic framework based on Perron-Frobenius theory (PF) for the remaining joint power-allocation and decoding-order optimization problem. Under this framework, we propose a heuristic algorithm for the original problem, which iteratively updates the terminal-timeslot assignment and improves the overall OCTR performance. Numerical results verify that max-min OCTR is a suitable metric to address the mismatch issue, and is able to improve the fairness among terminals. In average, the proposed algorithm improves the max-min OCTR by 40.2% over Orthogonal Multiple Access (OMA).

cs.IT↗

A Novel Heap-based Pilot Assignment for Full Duplex Cell-Free Massive MIMO with Zero-Forcing

This paper investigates the combined benefits of full-duplex (FD) and cell-free massive multiple-input multipleoutput (CF-mMIMO), where a large number of distributed access points (APs) having FD capability simultaneously serve numerous uplink and downlink user equipments (UEs) on the same time-frequency resources. To enable the incorporation of FD technology in CF-mMIMO systems, we propose a novel heapbased pilot assignment algorithm, which not only can mitigate the effects of pilot contamination but also reduce the involved computational complexity. Then, we formulate a robust design problem for spectral efficiency (SE) maximization in which the power control and AP-UE association are jointly optimized, resulting in a difficult mixed-integer nonconvex programming. To solve this problem, we derive a more tractable problem before developing a very simple iterative algorithm based on inner approximation method with polynomial computational complexity. Numerical results show that our proposed methods with realistic parameters significantly outperform the existing approaches in terms of the quality of channel estimate and SE.

eess.SP↗

Energy Minimization in UAV-Aided Networks: Actor-Critic Learning for Constrained Scheduling Optimization

In unmanned aerial vehicle (UAV) applications, the UAV's limited energy supply and storage have triggered the development of intelligent energy-conserving scheduling solutions. In this paper, we investigate energy minimization for UAV-aided communication networks by jointly optimizing data-transmission scheduling and UAV hovering time. The formulated problem is combinatorial and non-convex with bilinear constraints. To tackle the problem, firstly, we provide an optimal relax-and-approximate solution and develop a near-optimal algorithm. Both the proposed solutions are served as offline performance benchmarks but might not be suitable for online operation. To this end, we develop a solution from a deep reinforcement learning (DRL) aspect. The conventional RL/DRL, e.g., deep Q-learning, however, is limited in dealing with two main issues in constrained combinatorial optimization, i.e., exponentially increasing action space and infeasible actions. The novelty of solution development lies in handling these two issues. To address the former, we propose an actor-critic-based deep stochastic online scheduling (AC-DSOS) algorithm and develop a set of approaches to confine the action space. For the latter, we design a tailored reward function to guarantee the solution feasibility. Numerical results show that, by consuming equal magnitude of time, AC-DSOS is able to provide feasible solutions and saves 29.94% energy compared with a conventional deep actor-critic method. Compared to the developed near-optimal algorithm, AC-DSOS consumes around 10% higher energy but reduces the computational time from minute-level to millisecond-level.

eess.SP↗

Trajectory Design for Energy Minimization in UAV-enabled Wireless Communications with Latency Constraints

This paper studies energy-efficient unmanned aerial vehicle (UAV)-enabled wireless communications, where the UAV acts as a flying base station (BS) to serve the ground users (GUs) within some predetermined latency constraints, e.g., requested timeout (RT). Our goal is to design the UAV trajectory to minimize the total energy consumption while satisfying the RT requirement and energy budget, which is accomplished via jointly optimizing the trajectory and UAV's velocities along subsequent hops. The corresponding optimization problem is difficult to solve due to its non-convexity and combinatorial nature. To overcome this difficulty, we solve the original problem via two consecutive steps. Firstly, we propose two algorithms, namely heuristic search, and dynamic programming (DP) to obtain a feasible set of trajectories without violating the GU's RT requirements based on the traveling salesman problem with time window (TSPTW). Then, they are compared with exhaustive search and traveling salesman problem (TSP) used as reference methods. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm exhibits poorer performance with low complexity. As a result, the DP is proposed as a practical trade-off between the exhaustive and heuristic algorithms. Specifically, the DP algorithm results in near-optimal performance at a much lower complexity. Secondly, for given feasible trajectories, we propose an energy minimization problem via a joint optimization of the UAV's velocities along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. ...

cs.IT↗

Joint Forecasting and Interpolation of Graph Signals Using Deep Learning

We tackle the problem of forecasting network-signal snapshots using past signal measurements acquired by a subset of network nodes. This task can be seen as a combination of multivariate time-series prediction and graph-signal interpolation. This is a fundamental problem for many applications wherein deploying a high granularity network is impractical. Our solution combines recurrent neural networks with frequency-analysis tools from graph signal processing, and assumes that data is sufficiently smooth with respect to the underlying graph. The proposed approach outperforms state-of-the-art deep learning techniques, especially when only a small fraction of the graph signals is accessible, considering two distinct real world datasets: temperatures in the US and speed flow in Seattle. The results also indicate that our method can handle noisy signals and missing data, making it suitable to many practical applications.

eess.SP↗

Joint User Grouping, Scheduling, and Precoding for Multicast Energy Efficiency in Multigroup Multicast Systems

This paper studies the joint design of user grouping, scheduling (or admission control) and precoding to optimize energy efficiency (EE) for multigroup multicast scenarios in single-cell multiuser MISO downlink channels. Noticing that the existing definition of EE fails to account for group sizes, a new metric called multicast energy efficiency (MEE) is proposed. In this context, the joint design is considered for the maximization of MEE, EE, and scheduled users. Firstly, with the help of binary variables (associated with grouping and scheduling) the joint design problem is formulated as a mixed-Boolean fractional programming problem such that it facilitates the joint update of grouping, scheduling and precoding variables. Further, several novel optimization formulations are proposed to reveal the hidden difference of convex/ concave structure in the objective and associated constraints. Thereafter, we propose a convex-concave procedure framework based iterative algorithm for each optimization criteria where grouping, scheduling, and precoding variables are updated jointly in each iteration. Finally, we compare the performance of the three design criteria concerning three performance metrics namely MEE, EE, and scheduled users through Monte-Carlo simulations. These simulations establish the need for MEE and the improvement from the system optimization.

eess.SP↗