arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

At least 217 records · Page 12Linked to original sources

arXiv2022

Energy-Efficient Trajectory Design of a Multi-IRS Assisted Portable Access Point

In this work, we propose a framework for energy-efficient trajectory design of an unmanned aerial vehicle (UAV)-based portable access point (PAP) deployed to serve a set of ground nodes (GNs). In addition to the PAP and GNs, the system consists of a set of intelligent reflecting surfaces (IRSs) mounted on man-made structures to increase the number of bits transmitted per Joule of energy consumed measured as the global energy efficiency (GEE). The GEE trajectory for the PAP is designed by considering the UAV propulsion energy consumption and the Peukert effect of the PAP battery, which represents an accurate battery discharge profile as a non-linear function of the UAV power consumption profile. The GEE trajectory design problem is solved in two phases: in the first, a path for the PAP and feasible positions for the IRS modules are found using a multi-tier circle packing method, and the required IRS phase shift values are calculated using an alternate optimization method that considers the interdependence between the amplitude and phase responses of an IRS element; in the second phase, the PAP flying velocity and user scheduling are calculated using a novel multilap trajectory design algorithm. Numerical evaluations show that: neglecting the Peukert effect overestimates the available flight time of the PAP; after a certain threshold, increasing the battery size reduces the available flight time of the PAP; the presence of IRS modules improves the GEE of the system compared to other baseline scenarios; the multi-lap trajectory saves more energy compared to a single-lap trajectory developed using a combination of sequential convex programming and Dinkelbach algorithm.

eess.SP↗

arXiv2022

Cost-Efficient Deployment of a Reliable Multi-UAV Unmanned Aerial System

In this work, we study the trade-off between the reliability and the investment cost of an unmanned aerial system (UAS) consisting of a set of unmanned aerial vehicles (UAVs) carrying radio access nodes, called portable access points (PAPs)), deployed to serve a set of ground nodes (GNs). Using the proposed algorithm, a given geographical region is equivalently represented as a set of circular regions, where each circle represents the coverage region of a PAP. Then, the steady-state availability of the UAS is analytically derived by modelling it as a continuous time birth-death Markov decision process (MDP). Numerical evaluations show that the investment cost to guarantee a given steady-state availability to a set of GNs can be reduced by considering the traffic demand and distribution of GNs.

eess.SP↗

arXiv2022

Boosting 5G on Smart Grid Communication: A Smart RAN Slicing Approach

Fifth-generation (5G) and beyond systems are expected to accelerate the ongoing transformation of power systems towards the smart grid. However, the inherent heterogeneity in smart grid services and requirements pose significant challenges towards the definition of a unified network architecture. In this context, radio access network (RAN) slicing emerges as a key 5G enabler to ensure interoperable connectivity and service management in the smart grid. This article introduces a novel RAN slicing framework which leverages the potential of artificial intelligence (AI) to support IEC 61850 smart grid services. With the aid of deep reinforcement learning, efficient radio resource management for RAN slices is attained, while conforming to the stringent performance requirements of a smart grid self-healing use case. Our research outcomes advocate the adoption of emerging AI-native approaches for RAN slicing in beyond-5G systems, and lay the foundations for differentiated service provisioning in the smart grid.

eess.SP↗

arXiv2022

Timely Monitoring of Dynamic Sources with Observations from Multiple Wireless Sensors

Age of Information (AoI) has recently received much attention due to its relevance in IoT sensing and monitoring applications. In this paper, we consider the problem of minimizing the AoI in a system in which a set of sources are observed by multiple sensors in a many-to-many relationship, and the probability that a sensor observes a source depends on the state of the source. This model represents many practical scenarios, such as the ones in which multiple cameras or microphones are deployed to monitor objects moving in certain areas. We formulate the scheduling problem as a Markov Decision Process, and show how the age-optimal scheduling policy can be obtained. We further consider partially observable variants of the problem, and devise approximate policies for large state spaces. Our evaluations show that the approximate policies work well in the considered scenarios, and that the fact that sensors can observe multiple sources is beneficial, especially when there is high uncertainty of the source states.

cs.IT↗

arXiv2022

Predictive Rate Selection for Ultra-Reliable Communication using Statistical Radio Maps

This paper proposes exploiting the spatial correlation of wireless channel statistics beyond the conventional received signal strength maps by constructing statistical radio maps to predict any relevant channel statistics to assist communications. Specifically, from stored channel samples acquired by previous users in the network, we use Gaussian processes (GPs) to estimate quantiles of the channel distribution at a new position using a non-parametric model. This prior information is then used to select the transmission rate for some target level of reliability. The approach is tested with synthetic data, simulated from urban micro-cell environments, highlighting how the proposed solution helps to reduce the training estimation phase, which is especially attractive for the tight latency constraints inherent to ultra-reliable low-latency (URLLC) deployments.

eess.SP↗

arXiv2022

Fairness Based Energy-Efficient 3D Path Planning of a Portable Access Point: A Deep Reinforcement Learning Approach

In this work, we optimize the 3D trajectory of an unmanned aerial vehicle (UAV)-based portable access point (PAP) that provides wireless services to a set of ground nodes (GNs). Moreover, as per the Peukert effect, we consider pragmatic non-linear battery discharge for the battery of the UAV. Thus, we formulate the problem in a novel manner that represents the maximization of a fairness-based energy efficiency metric and is named fair energy efficiency (FEE). The FEE metric defines a system that lays importance on both the per-user service fairness and the energy efficiency of the PAP. The formulated problem takes the form of a non-convex problem with non-tractable constraints. To obtain a solution, we represent the problem as a Markov Decision Process (MDP) with continuous state and action spaces. Considering the complexity of the solution space, we use the twin delayed deep deterministic policy gradient (TD3) actor-critic deep reinforcement learning (DRL) framework to learn a policy that maximizes the FEE of the system. We perform two types of RL training to exhibit the effectiveness of our approach: the first (offline) approach keeps the positions of the GNs the same throughout the training phase; the second approach generalizes the learned policy to any arrangement of GNs by changing the positions of GNs after each training episode. Numerical evaluations show that neglecting the Peukert effect overestimates the air-time of the PAP and can be addressed by optimally selecting the PAP's flying speed. Moreover, the user fairness, energy efficiency, and hence the FEE value of the system can be improved by efficiently moving the PAP above the GNs. As such, we notice massive FEE improvements over baseline scenarios of up to 88.31%, 272.34%, and 318.13% for suburban, urban, and dense urban environments, respectively.

eess.SP↗

arXiv2022

Power Minimization of Downlink Spectrum Slicing for eMBB and URLLC Users

5G technology allows heterogeneous services to share the wireless spectrum within the same radio access network. In this context, spectrum slicing of the shared radio resources is a critical task to guarantee the performance of each service. We analyze a downlink communication serving two types of traffic: enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC). Due to the nature of low-latency traffic, the base station knows the channel state information (CSI) of the eMBB users while having statistical CSI for the URLLC users. We study the power minimization problem employing orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) schemes. Based on this analysis, we propose a lookup table-based approach and a block coordinated descent (BCD) algorithm. We show that the BCD is optimal for the URLLC power allocation. The numerical results show that NOMA leads to lower power consumption than OMA, except when the average channel gain of the URLLC user is very high. For the latter case, the optimal approach depends on the channel condition of the eMBB user. Even when OMA attains the best performance, the gap with NOMA is negligible, showing the capability of NOMA to reduce power consumption in practically every condition.

cs.IT↗

arXiv2022

Floor Map Reconstruction Through Radio Sensing and Learning By a Large Intelligent Surface

Environmental scene reconstruction is of great interest for autonomous robotic applications, since an accurate representation of the environment is necessary to ensure safe interaction with robots. Equally important, it is also vital to ensure reliable communication between the robot and its controller. Large Intelligent Surface (LIS) is a technology that has been extensively studied due to its communication capabilities. Moreover, due to the number of antenna elements, these surfaces arise as a powerful solution to radio sensing. This paper presents a novel method to translate radio environmental maps obtained at the LIS to floor plans of the indoor environment built of scatterers spread along its area. The usage of a Least Squares (LS) based method, U-Net (UN) and conditional Generative Adversarial Networks (cGANs) were leveraged to perform this task. We show that the floor plan can be correctly reconstructed using both local and global measurements.

eess.SP↗

arXiv2022

Multiband Massive IoT: A Learning Approach to Infrastructure Deployment

We consider a novel ultra-narrowband (UNB) low-power wide-area network (LPWAN) architecture design for uplink transmission of a massive number of Internet of Things (IoT) devices over multiple multiplexing bands. An IoT device can randomly choose any of the multiplexing bands to transmit its packet. Due to hardware constraints, a base station (BS) is able to listen to only one multiplexing band. Our main objective is to maximize the packet decoding probability (PDP) by optimizing the placement of the BSs and frequency assignment of BSs to multiplexing bands. We develop two online approaches that adapt to the environment based on the statistics of (un)successful packets at the BSs. The first approach is based on a predefined model of the environment, while the second approach is measurement-based model-free approach, which is applicable to any environment. The benefit of the model-based approach is a lower training complexity, at the risk of a poor fit in a model-incompatible environment. The simulation results show that our proposed approaches to band assignment and BS placement offer significant improvement in PDP over baseline random approaches and perform closely to the theoretical upper bound.

eess.SP↗

arXiv2022

Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access

Massive random access plays a central role in supporting the Internet of Things (IoT), where a subset of a large population of users simultaneously transmit small packets to a central base station. While there has been much research on the design of protocols for massive access in the uplink, the problem of providing message acknowledgments back to the users has been somewhat neglected. Reliable communication needs to rely on two-way communication for acknowledgement and retransmission. Nevertheless, because of the many possible subsets of active users, providing acknowledgments requires a significant amount of bits. Motivated by this, we define the problem of massive ARQ (Automatic Retransmission reQuest) protocol and introduce efficient methods for joint encoding of multiple acknowledgements in the downlink. The key idea towards reducing the number of bits used for massive acknowledgements is to allow for a small fraction of false positive acknowledgments. We analyze the implications of this approach and the impact of acknowledgment errors in scenarios with massive random access. Finally, we show that these savings can lead to a significant increase in the reliability when retransmissions are allowed since it allows the acknowledgment message to be transmitted more reliably using a much lower rate.

cs.IT↗

arXiv2022

A Contribution-based Device Selection Scheme in Federated Learning

In a Federated Learning (FL) setup, a number of devices contribute to the training of a common model. We present a method for selecting the devices that provide updates in order to achieve improved generalization, fast convergence, and better device-level performance. We formulate a min-max optimization problem and decompose it into a primal-dual setup, where the duality gap is used to quantify the device-level performance. Our strategy combines \emph{exploration} of data freshness through a random device selection with \emph{exploitation} through simplified estimates of device contributions. This improves the performance of the trained model both in terms of generalization and personalization. A modified Truncated Monte-Carlo (TMC) method is applied during the exploitation phase to estimate the device's contribution and lower the communication overhead. The experimental results show that the proposed approach has a competitive performance, with lower communication overhead and competitive personalization performance against the baseline schemes.

cs.LG↗

arXiv2022

Scheduling for Ground-Assisted Federated Learning in LEO Satellite Constellations

Distributed training of machine learning models directly on satellites in low Earth orbit (LEO) is considered. Based on a federated learning (FL) algorithm specifically targeted at the unique challenges of the satellite scenario, we design a scheduler that exploits the predictability of visiting times between ground stations (GS) and satellites to reduce model staleness. Numerical experiments show that this can improve the convergence speed by a factor three.

eess.SP↗

arXiv2022

Rate-Splitting Multiple Access and its Interplay with Intelligent Reflecting Surfaces

Rate-splitting multiple access (RSMA) has recently appeared as a powerful technique for improving the downlink performance of multiple-input multiple-output (MIMO) systems. By flexibly managing interference, RSMA can deliver high spectral and energy efficiency, as well as robustness to imperfect channel state information (CSI). In another development, an intelligent reflecting surface (IRS) has emerged as a method to control the wireless environment through software-configurable, near-passive, sub-wavelength reflecting elements. This article presents the potential of synergy between IRS and RSMA. Three important improvements achievable by IRS-RSMA schemes are identified, supported by insightful numerical examples, and mapped to beyond-5G use cases, along with future research directions.

eess.SP↗

arXiv2022

User Clustering for Rate Splitting using Machine Learning

Hierarchical Rate Splitting (HRS) schemes proposed in recent years have shown to provide significant improvements in exploiting spatial diversity in wireless networks and provide high throughput for all users while minimising interference among them. Hence, one of the major challenges for such HRS schemes is the necessity to know the optimal clustering of these users based only on their Channel State Information (CSI). This clustering problem is known to be NP hard and, to deal with the unmanageable complexity of finding an optimal solution, in this work a scalable and much lighter clustering mechanism based on Neural Network (NN) is proposed. The accuracy and performance metrics show that the NN is able to learn and cluster the users based on the noisy channel response and is able to achieve a rate comparable to other more complex clustering schemes from the literature.

eess.SP↗

arXiv2022

User Localization using RF Sensing: A Performance comparison between LIS and mmWave Radars

Since electromagnetic signals are omnipresent, Radio Frequency (RF)-sensing has the potential to become a universal sensing mechanism with applications in localization, smart-home, retail, gesture recognition, intrusion detection, etc. Two emerging technologies in RF-sensing, namely sensing through Large Intelligent Surfaces (LISs) and mmWave Frequency-Modulated Continuous-Wave (FMCW) radars, have been successfully applied to a wide range of applications. In this work, we compare LIS and mmWave radars for localization in real-world and simulated environments. In our experiments, the mmWave radar achieves 0.71 Intersection Over Union (IOU) and 3cm error for bounding boxes, while LIS has 0.56 IOU and 10cm distance error. Although the radar outperforms the LIS in terms of accuracy, LIS features additional applications in communication in addition to sensing scenarios.

eess.SP↗

arXiv2022

A Perspective on Time towards Wireless 6G

With the advent of 5G technology, the notion of latency got a prominent role in wireless connectivity, serving as a proxy term for addressing the requirements for real-time communication. As wireless systems evolve towards 6G, the ambition to immerse the digital into the physical reality will increase. Besides making the real-time requirements more stringent, this immersion will bring the notions of time, simultaneity, presence, and causality to a new level of complexity. A growing body of research points out that latency is insufficient to parameterize all real-time requirements. Notably, one such requirement that received a significant attention is information freshness, defined through the Age of Information (AoI) and its derivatives. The objective of this article is to investigate the general notion of timing in wireless communication systems and networks and its relation to effective information generation, processing, transmission, and reconstruction at the senders and receivers. We establish a general statistical framework of timing requirements in wireless communication systems, which subsumes both latency and AoI. The framework is made by associating a timing component with the two basic statistical operations, decision and estimation. We first use the framework to present a representative sample of the existing works that deal with timing in wireless communication. Next, it is shown how the framework can be used with different communication models of increasing complexity, starting from the basic Shannon one-way communication model and arriving to communication models for consensus, distributed learning, and inference. Overall, this paper fills an important gap in the literature by providing a systematic treatment of various timing measures in wireless communication and sets the basis for design and optimization for the next-generation real-time systems.

cs.IT↗

arXiv2022

Statistical Characterization of Closed-Loop Latency at the Mobile Edge

The stringent timing and reliability requirements in mission-critical applications require a detailed statistical characterization of the latency. Teleoperation is a representative use case, in which a human operator (HO) remotely controls a robot by exchanging command and feedback signals. We present a framework to analyze the latency of a closed-loop teleoperation system consisting of three entities: HO, robot located in remote environment, and a Base Station (BS) with Mobile edge Computing (MEC) capabilities. A model of each component of the system is used to analyze the closed-loop latency and decide upon the optimal compression strategy. The closed-form expression of the distribution of the closed-loop latency is difficult to estimate, such that suitable upper and lower bounds are obtained. We formulate a non-convex optimization problem to minimize the closed-loop latency. Using the obtained upper and lower bound on the closed-loop latency, a computationally efficient procedure to optimize the closed-loop latency is presented. The simulation results reveal that compression of sensing data is not always beneficial, while system design based on average performance leads to under-provisioning and may cause performance degradation. The applicability of the proposed analysis is much wider than teleoperation, for systems whose latency budget consists of many components.

cs.NI↗

arXiv2022

Scheduling of Sensor Transmissions Based on Value of Information for Summary Statistics

The optimization of Value of Information (VoI) in sensor networks integrates awareness of the measured process in the communication system. However, most existing scheduling algorithms do not consider the specific needs of monitoring applications, but define VoI as a generic Mean Square Error (MSE) of the whole system state regardless of the relevance of individual components. In this work, we consider different summary statistics, i.e., different functions of the state, which can represent the useful information for a monitoring process, particularly in safety and industrial applications. We propose policies that minimize the estimation error for different summary statistics, showing significant gains by simulation.

cs.NI↗