arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

At least 307 records · Page 17Linked to original sources

arXiv2020

Antenna Selection for Improving Energy Efficiency in XL-MIMO Systems

We consider the recently proposed extra-large scale massive multiple-input multiple-output (XL-MIMO) systems, with some hundreds of antennas serving a smaller number of users. Since the array length is of the same order as the distance to the users, the long-term fading coefficients of a given user vary with the different antennas at the base station (BS). Thus, the signal transmitted by some antennas might reach the user with much more power than that transmitted by some others. From a green perspective, it is not effective to simultaneously activate hundreds or even thousands of antennas, since the power-hungry radio frequency (RF) chains of the active antennas increase significantly the total energy consumption. Besides, a larger number of selected antennas increases the power required by linear processing, such as precoding matrix computation, and short-term channel estimation. In this paper, we propose four antenna selection (AS) approaches to be deployed in XL-MIMO systems aiming at maximizing the total energy efficiency (EE). Besides, employing some simplifying assumptions, we derive a closed-form analytical expression for the EE of the XL-MIMO system, and propose a straightforward iterative method to determine the optimal number of selected antennas able to maximize it. The proposed AS schemes are based solely on long-term fading parameters, thus, the selected antennas set remains valid for a relatively large time/frequency intervals. Comparing the results, we find that the genetic-algorithm based AS scheme usually achieves the best EE performance, although our proposed highest normalized received power AS scheme also achieves very promising EE performance in a simple and straightforward way.

eess.SP↗

arXiv2020

Intelligent Reflecting Surface Operation under Predictable Receiver Mobility: A Continuous Time Propagation Model

The operation of an intelligent reflecting surface (IRS) under predictable receiver mobility is investigated. We develop a continuous time system model for multipath channels and discuss the optimal IRS configuration with respect to received power, Doppler spread, and delay spread. It is shown that the received power can be maximized without adding Doppler spread to the system. In a numerical case study, we show that an IRS having the size of just two large billboards can improve the link budget of ground to Low Earth Orbit (LEO) satellite links by up to 6 dB. It also adds a second, almost equivalently strong, communication path that improves the link reliability.

cs.IT↗

arXiv2020

Traffic Prediction Based Fast Uplink Grant for Massive IoT

This paper presents a novel framework for traffic prediction of IoT devices activated by binary Markovian events. First, we consider a massive set of IoT devices whose activation events are modeled by an On-Off Markov process with known transition probabilities. Next, we exploit the temporal correlation of the traffic events and apply the forward algorithm in the context of hidden Markov models (HMM) in order to predict the activation likelihood of each IoT device. Finally, we apply the fast uplink grant scheme in order to allocate resources to the IoT devices that have the maximal likelihood for transmission. In order to evaluate the performance of the proposed scheme, we define the regret metric as the number of missed resource allocation opportunities. The proposed fast uplink scheme based on traffic prediction outperforms both conventional random access and time division duplex in terms of regret and efficiency of system usage, while it maintains its superiority over random access in terms of average age of information for massive deployments.

cs.IT↗

arXiv2020

Capacity of Remote Classification Over Wireless Channels

Wireless connectivity creates a computing paradigm that merges communication and inference. A basic operation in this paradigm is the one where a device offloads classification tasks to the edge servers. We term this remote classification, with a potential to enable intelligent applications. Remote classification is challenged by the finite and variable data rate of the wireless channel, which affects the capability to transfer high-dimensional features and thus limits the classification resolution. We introduce a set of metrics under the name of classification capacity that are defined as the maximum number of classes that can be discerned over a given communication channel while meeting a target classification error probability. The objective is to choose a subset of classes from a library that offers satisfactory performance over a given channel. We treat two cases of subset selection. First, a device can select the subset by pruning the class library until arriving at a subset that meets the targeted error probability while maximizing the classification capacity. Adopting a subspace data model, we prove the equivalence of classification capacity maximization to Grassmannian packing. The results show that the classification capacity grows exponentially with the instantaneous communication rate, and super-exponentially with the dimensions of each data cluster. This also holds for ergodic and outage capacities with fading if the instantaneous rate is replaced with an average rate and a fixed rate, respectively. In the second case, a device has a preference of class subset for every communication rate, which is modeled as an instance of uniformly sampling the library. Without class selection, the classification capacity and its ergodic and outage counterparts are proved to scale linearly with their corresponding communication rates instead of the exponential growth in the last case.

cs.IT↗

arXiv2020

Spectrum Sharing for Massive Access in Ultra-Narrowband IoT Systems

Ultra-narrowband (UNB) communications has become a signature feature for many emerging low-power wide-area (LPWA) networks. Specifically, using extremely narrowband signals helps the network connect more Internet-of-things (IoT) devices within a given band. It also improves robustness to interference, extending the coverage of the network. In this paper, we study the coexistence capability of UNB networks and their scalability to enable massive access. To this end, we develop a stochastic geometry framework to analyze and model UNB networks on a large scale. The framework captures the unique characteristics of UNB communications, including the asynchronous time-frequency access, signal repetition, and the absence of base station (BS) association. Closed-form expressions of the transmission success probability and network connection density are presented for several UNB protocols. We further discuss multiband access for UNB networks, proposing a low-complexity protocol. Our analysis reveals several insights on the geographical diversity achieved when devices do not connect to a single BS, the optimal number of signal repetitions, and how to utilize multiple bands without increasing the complexity of BSs. Simulation results are provided to validate the analysis, and they show that UNB communications enables a single BS to connect thousands of devices even when the spectrum is shared with other networks.

eess.SP↗

arXiv2020

Information Freshness of Updates Sent over LEO Satellite Multi-Hop Networks

Low Earth Orbit (LEO) satellite constellations are bringing the Internet of Things (IoT) to the space arena, also known as non-terrestrial networks. Several IoT satellite applications for tracking ships and cargo can be seen as exemplary cases of intermittent transmission of updates whose main performance parameter is the information freshness. This paper analyzes the Age of Information (AoI) of a satellite network with multiple sources and destinations that are very distant and therefore require several consecutive multi-hop transmissions. A packet erasure channel and different queueing policies are considered. We provide closed-form bounds and tight approximations of the average AoI, as well as an upper bound of the Peak Age of Information (PAoI) distribution as a worst-case metric for the system design. The performance evaluation reveals complex trade-offs among age, load, and packet losses. The optimal operational point is found when the combination of arrival rates and packet losses is such that the system load can ensure fresh information at the receiver; nevertheless, achieving this is highly dependent on the mesh topology. Moreover, the potential of an age-aware scheduling strategy is investigated and the fairness among users discussed. The results show the need to identify the bottleneck nodes for the age, as improving the rate and reliability of those critical links will highly impact on the overall performance. The model is general enough to represent other multi-hop mesh networks.

cs.NI↗

arXiv2020

How URLLC can Benefit from NOMA-based Retransmissions

Among the new types of connectivity unleashed by the emerging 5G wireless systems, Ultra-Reliable Low Latency Communication (URLLC) is perhaps the most innovative, yet challenging one. Ultra-reliability requires high levels of diversity, however, the reactive approach based on packet retransmission in HARQ protocols should be applied carefully to conform to the stringent latency constraints. The main premise of this paper is that the NOMA principle can be used to achieve highly efficient retransmissions by allowing concurrent use of wireless resources in the uplink. We introduce a comprehensive solution that accommodates multiple intermittently active users, each with its own HARQ process. The performance is investigated under two different assumptions about the Channel State Information (CSI) availability: statistical and instantaneous. The results show that NOMA can indeed lead to highly efficient system operation compared to the case in which all HARQ processes are run orthogonally.

cs.IT↗

arXiv2020

Outage Analysis of Downlink URLLC in Massive MIMO systems with Power Allocation

Massive MIMO is seen as a main enabler for low latency communications, thanks to its high spatial degrees of freedom. The channel hardening and favorable propagation properties of Massive MIMO are particularly important for multiplexing several URLLC devices. However, the actual utility of channel hardening and spatial multiplexing is dependent critically on the accuracy of channel knowledge. When several low latency devices are multiplexed, the cost for acquiring accurate knowledge becomes critical, and it is not evident how many devices can be served with a latency-reliability requirement and how many pilot symbols should be allocated. This paper investigates the trade-off between achieving high spectral efficiency and high reliability in the downlink, by employing various power allocation strategies, for maximum ratio and minimum mean square error precoders. The results show that using max-min SINR power allocation achieves the best reliability, at the expense of lower sum spectral efficiency.

cs.IT↗

arXiv2020

Optimizing Information Freshness via Multiuser Scheduling with Adaptive NOMA/OMA

This paper considers a wireless network with a base station (BS) conducting timely status updates to multiple clients via adaptive non-orthogonal multiple access (NOMA)/orthogonal multiple access (OMA). Specifically, the BS is able to adaptively switch between NOMA and OMA for the downlink transmission to optimize the information freshness of the network, characterized by the Age of Information (AoI) metric. If the BS chooses OMA, it can only serve one client within each time slot and should decide which client to serve; if the BS chooses NOMA, it can serve more than one client at the same time and needs to decide the power allocated to the served clients. For the simple two-client case, we formulate a Markov Decision Process (MDP) problem and develop the optimal policy for the BS to decide whether to use NOMA or OMA for each downlink transmission based on the instantaneous AoI of both clients. The optimal policy is shown to have a switching-type property with obvious decision switching boundaries. A near-optimal policy with lower computation complexity is also devised. For the more general multi-client scenario, inspired by the proposed near-optimal policy, we formulate a nonlinear optimization problem to determine the optimal power allocated to each client by maximizing the expected AoI drop of the network in each time slot. We resolve the formulated problem by approximating it as a convex optimization problem. We also derive the upper bound of the gap between the approximate convex problem and the original nonlinear, nonconvex problem. Simulation results validate the effectiveness of the adopted approximation. The performance of the adaptive NOMA/OMA scheme by solving the convex optimization is shown to be close to that of max-weight policy solved by exhaustive search...

cs.IT↗

arXiv2020

Reliability-Latency Performance of Frameless ALOHA with and without Feedback

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational complexity. The analysis is then extended to derive continuous approximations of its key parameters, which, apart from providing an insight into the decoding process, make it possible to estimate the packet error rate with very low computational complexity. Finally, a feedback scheme is presented in which the slot access scheme is dynamically adapted according to the approximate analysis in order to minimize the packet error rate. The results indicate that the introduction of feedback can substantially improve the performance of frameless ALOHA

cs.IT↗

arXiv2020

Review of the State-of-the-Art on Adaptive Protection for Microgrids based on Communications

The dominance of distributed energy resources in microgrids and the associated weather dependency require flexible protection. They include devices capable of adapting their protective settings as a reaction to (potential) changes in system state. Communication technologies have a key role in this system since the reactions of the adaptive devices shall be coordinated. This coordination imposes strict requirements: communications must be available and ultra-reliable with bounded latency in the order of milliseconds. This paper reviews the state-of-the-art in the field and provides a thorough analysis of the main related communication technologies and optimization techniques. We also present our perspective on the future of communication deployments in microgrids, indicating the viability of 5G wireless systems and multi-connectivity to enable adaptive protection.

eess.SY↗

arXiv2020

Latency and timeliness in multi-hop satellite networks

The classical definition of network delay has been recently augmented by the concept of information timeliness, or Age of Information (AoI). We analyze the network delay and the AoI in a multi-hop satellite network that relays status updates from satellite 1, receiving uplink traffic from ground devices, to satellite K, using K-2 intermediate satellite nodes. The last node, K, is the closest satellite with connectivity to a ground station. The satellite formation is modeled as a queue network of M/M/1 systems connected in series. The scenario is then generalized for the case in which all satellites receive uplink traffic from ground, and work at the same time as relays of the packets from the previous nodes. The results show that the minimum average AoI is experienced at a decreasing system utilization when the number of nodes is increased. Furthermore, unloading the first nodes of the chain reduces the queueing time and therefore the average AoI. These findings provide insights for designing multi-hop satellite networks for latency-sensitive applications.

cs.IT↗

arXiv2020

Fog-Based Detection for Random-Access IoT Networks with Per-Measurement Preambles

Internet of Things (IoT) systems may be deployed to monitor spatially distributed quantities of interests (QoIs), such as noise or pollution levels. This paper considers a fog-based IoT network, in which active IoT devices transmit measurements of the monitored QoIs to the local edge node (EN), while the ENs are connected to a cloud processor via limited-capacity fronthaul links. While the conventional approach uses preambles as metadata for reserving communication resources, here we consider assigning preambles directly to measurement levels across all devices. The resulting Type-Based Multiple Access (TBMA) protocol enables the efficient remote detection of the QoIs, rather than of the individual payloads. The performance of both edge and cloud-based detection or hypothesis testing is evaluated in terms of error exponents. Cloud-based hypothesis testing is shown theoretically and via numerical results to be advantageous when the inter-cell interference power and the fronthaul capacity are sufficiently large.

cs.IT↗

arXiv2020

Witness-based Approach for Scaling Distributed Ledgers to Massive IoT Scenarios

Distributed Ledger Technologies (DLTs) are playing a major role in building security and trust in Internet of Things (IoT) systems. However, IoT deployments with a large number of devices, such as in environment monitoring applications, generate and send massive amounts of data. This would generate vast number of transactions that must be processed within the distributed ledger. In this work, we first demonstrate that the Proof of Work (PoW) blockchain fails to scale in a sizable IoT connectivity infrastructure. To solve this problem, we present a lightweight distributed ledger scheme to integrate PoW blockchain into IoT. In our scheme, we classify transactions into two types: 1) global transactions, which must be processed by global blockchain nodes and 2) local transactions, which can be processed locally by entities called witnesses. Performance evaluation demonstrates that our proposed scheme improves the scalability of integrated blockchain and IoT monitoring systems by processing a fraction of the transactions, inversely proportional to the number of witnesses, locally. Hence, reducing the number of global transactions.

cs.NI↗

arXiv2020

Machine Learning Methods for Monitoring of Quasi-Periodic Traffic in Massive IoT Networks

One of the central problems in massive Internet of Things (IoT) deployments is the monitoring of the status of a massive number of links. The problem is aggravated by the irregularity of the traffic transmitted over the link, as the traffic intermittency can be disguised as a link failure and vice versa. In this work we present a traffic model for IoT devices running quasi-periodic applications and we present both supervised and unsupervised machine learning methods for monitoring the network performance of IoT deployments with quasi-periodic reporting, such as smart-metering, environmental monitoring and agricultural monitoring. The unsupervised methods are based on the Lomb-Scargle periodogram, an approach developed by astronomers for estimating the spectral density of unevenly sampled time series.

cs.NI↗

arXiv2020

Risk-Aware Optimization of Age of Information in the Internet of Things

Minimization of the expected value of age of information (AoI) is a risk-neutral approach, and it thus cannot capture rare, yet critical, events with potentially large AoI. In order to capture the effect of these events, in this paper, the notion of conditional value-at-risk (CVaR) is proposed as an effective coherent risk measure that is suitable for minimization of AoI for real-time IoT status updates. In the considered monitoring system, an IoT device monitors a physical process and sends the status updates to a remote receiver with an updating cost. The optimal status update process is designed to jointly minimize the AoI at the receiver, the CVaR of the AoI at the receiver, and the energy cost. This stochastic optimization problem is formulated as an infinite horizon discounted risk-aware Markov decision process (MDP), which is computationally intractable due to the time inconsistency of the CVaR. By exploiting the special properties of coherent risk measures, the risk-aware MDP is reduced to a standard MDP with an augmented state space, for which we derive the optimal stationary policy using dynamic programming. In particular, the optimal history-dependent policy of the risk-aware MDP is shown to depend on the history only through the augmented system states and can be readily constructed using the optimal stationary policy of the augmented MDP. The proposed solution is shown to be computationally tractable and able to minimize the AoI in real-time IoT monitoring systems in a risk-aware manner.

cs.IT↗

arXiv2020

Risk-Based Optimization of Virtual Reality over Terahertz Reconfigurable Intelligent Surfaces

In this paper, the problem of associating reconfigurable intelligent surfaces (RISs) to virtual reality (VR) users is studied for a wireless VR network. In particular, this problem is considered within a cellular network that employs terahertz (THz) operated RISs acting as base stations. To provide a seamless VR experience, high data rates and reliable low latency need to be continuously guaranteed. To address these challenges, a novel risk-based framework based on the entropic value-at-risk is proposed for rate optimization and reliability performance. Furthermore, a Lyapunov optimization technique is used to reformulate the problem as a linear weighted function, while ensuring that higher order statistics of the queue length are maintained under a threshold. To address this problem, given the stochastic nature of the channel, a policy-based reinforcement learning (RL) algorithm is proposed. Since the state space is extremely large, the policy is learned through a deep-RL algorithm. In particular, a recurrent neural network (RNN) RL framework is proposed to capture the dynamic channel behavior and improve the speed of conventional RL policy-search algorithms. Simulation results demonstrate that the maximal queue length resulting from the proposed approach is only within 1% of the optimal solution. The results show a high accuracy and fast convergence for the RNN with a validation accuracy of 91.92%.

cs.IT↗

arXiv2020

Optimal Centralized Dynamic-Time-Division-Duplex

In this paper, we derive the optimal centralized dynamic-time-division-duplex (D-TDD) scheme for a wireless network comprised of $K$ full-duplex nodes impaired by self-interference and additive white Gaussian noise. As a special case, we also provide the optimal centralized D-TDD scheme when the nodes are half-duplex as well as when the wireless network is comprised of both half-duplex and full-duplex nodes. Thereby, we derive the optimal adaptive scheduling of the reception, transmission, simultaneous reception and transmission, and silence at every node in the network in each time slot such that the rate region of the network is maximized. The performance of the optimal centralized D-TDD can serve as an upper-bound to any other TDD scheme, which is useful in qualifying the relative performance of TDD schemes. The numerical results show that the proposed centralized D-TDD scheme achieves significant rate gains over existing centralized D-TDD schemes.

cs.IT↗