arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

At least 379 records · Page 21Linked to original sources

arXiv2017

Small-Signal Analysis of the Microgrid Secondary Control Considering a Communication Time Delay

This paper presents a small-signal analysis of an islanded microgrid composed of two or more voltage source inverters connected in parallel. The primary control of each inverter is integrated through internal current and voltage loops using PR compensators, a virtual impedance, and an external power controller based on frequency and voltage droops. The frequency restoration function is implemented at the secondary control level, which executes a consensus algorithm that consists of a load-frequency control and a single time delay communication network. The consensus network consists of a time-invariant directed graph and the output power of each inverter is the information shared among the units, which is affected by the time delay. The proposed small-signal model is validated through simulation results and experimental results. A root locus analysis is presented that shows the behavior of the system considering control parameters and time delay variation.

eess.SY↗

arXiv2017

Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols

The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access, in which the structure of the access protocol can be mapped to a structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacy ALOHA system using the ideas of coded random access.

cs.NI↗

arXiv2017

User Activity Detection in Massive Random Access: Compressed Sensing vs. Coded Slotted ALOHA

Machine-type communication services in mobile cel- lular systems are currently evolving with an aim to efficiently address a massive-scale user access to the system. One of the key problems in this respect is to efficiently identify active users in order to allocate them resources for the subsequent transmissions. In this paper, we examine two recently suggested approaches for user activity detection: compressed-sensing (CS) and coded slotted ALOHA (CSA), and provide their comparison in terms of performance vs resource utilization. Our preliminary results show that CS-based approach is able to provide the target user activity detection performance with less overall system resource utilization. However, this comes at a price of lower energy- efficiency per user, as compared to CSA-based approach.

cs.IT↗

arXiv2017

A Pseudo-Bayesian Approach to Sign-Compute-Resolve Slotted ALOHA

Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling simultaneous resolution of up to K users contending for access, where K >= 1. We optimise the slot access probability such that the expected throughput is maximised. In particular, the slot access probability is chosen in line with an estimate of the number of users in the system that is obtained relying on the pseudo-Bayesian approach by Rivest, which we generalise for the case that K > 1. Under the assumption that this estimate reflects the actual number of users, we show that our approach achieves throughput 1 in the limit of large K.

cs.IT↗

arXiv2017

Minimizing Data Distortion of Periodically Reporting IoT Devices with Energy Harvesting

Energy harvesting is a promising technology for the Internet of Things (IoT) towards the goal of self-sustainability of the involved devices. However, the intermittent and unreliable nature of the harvested energy demands an intelligent management of devices' operation in order to ensure a sustained performance of the IoT application. In this work, we address the problem of maximizing the quality of the reported data under the constraints of energy harvesting, energy consumption and communication channel impairments. Specifically, we propose an energy-aware joint source-channel coding scheme that minimizes the expected data distortion, for realistic models of energy generation and of the energy spent by the device to process the data, when the communication is performed over a Rayleigh fading channel. The performance of the scheme is optimized by means of a Markov Decision Process framework.

cs.IT↗

arXiv2017

Reliable and Efficient Access for Alarm-initiated and Regular M2M Traffic in IEEE 802.11ah Systems

EEE 802.11ah is a novel WiFi-based protocol, aiming to provide an access solution for the machine-to-machine (M2M) communications. In this paper, we propose an adaptive access mechanism that can be seamlessly incorporated into IEEE 802.11ah protocol operation and that supports all potential M2M reporting regimes, which are periodic, on-demand We show that it is possible to both efficiently and reliably resolve all reporting stations in the cell, within the limits of the allowed deadlines. As a side result, we also provide a rationale for modeling the inter-arrival time in alarm events by using the Beta distribution, a model that is considered in the 3GPP standardization.

cs.IT↗

arXiv2017

Compressive Coded Random Access for Massive MTC Traffic in 5G Systems

Massive MTC support is an important future market segment, but not yet efficiently supported in cellular systems. In this paper we follow-up on recent concepts combining advanced MAC protocols with Compressed Sensing (CS) based multiuser detection. Specifically, we introduce a concept for sparse joint activity, channel and data detection in the context of the Coded ALOHA (FDMA) protocol. We will argue that a simple sparse activity and data detection is not sufficient (as many papers do) because control resources are in the order of the data. In addition, we will improve on the performance of such protocols in terms of the reduction of resources required for the user activity, channel estimation and data detection. We will mathematically analyze the system accordingly and provide expressions for the capture probabilities of the underlying sparse multiuser detector. Finally, we will provide structured CS algorithms for the joint estimation scheme and evaluate its performance.

cs.IT↗

arXiv2017

Joint Retransmission, Compression and Channel Coding for Data Fidelity under Energy Constraints

We consider a monitoring application where sensors periodically report data to a common receiver in a time division multiplex fashion. The sensors are constrained by the limited and unpredictable energy availability provided by Energy Harvesting (EH), and by the channel impairments. To maximize the quality of the reported data, the packets transmitted contain newly generated data blocks together with up to $r - 1$ previously unsuccessfully delivered ones, where $r$ is a design parameter; such blocks are compressed, concatenated and encoded with a channel code. The scheme applies lossy compression, such that the fidelity of the individual blocks is traded with the reliability provided by the channel code. We show that the proposed strategy outperforms the one in which retransmissions are not allowed. We also investigate the tradeoff between the value of $r$, the compression and coding rates, under the constraints of the energy availability, and, once $r$ has been decided, use a Markov Decision Process (MDP) to optimize the compression/coding rates. Finally, we implement a reinforcement learning algorithm, through which devices can learn the optimal transmission policy without knowing a priori the statistics of the EH process, and show that it indeed reaches the performance obtained via MDP.

cs.IT↗

arXiv2017

Coverage and Rate of Downlink Sequence Transmissions with Reliability Guarantees

Real-time distributed control is a promising application of 5G in which communication links should satisfy certain reliability guarantees. In this letter, we derive closed-form maximum average rate when a device (e.g. industrial machine) downloads a sequence of n operational commands through cellular connection, while guaranteeing a certain signal-to-interference ratio (SIR) coverage for all n messages. The result is based on novel closed-form n-successive SIR coverage bounds. The proposed bounds provide simple approximations that are increasingly accurate in the high reliability region.

cs.IT↗

arXiv2017

Distributed Proportional-Fairness Control in MicroGrids via Blockchain Smart Contracts

Residential microgrids (MGs) may host a large number of Distributed Energy Resources (DERs). The strategy that maximizes the revenue for each individual DER is the one in which the DER operates at capacity, injecting all available power into the grid. However, when the DER penetration is high and the consumption low, this strategy may lead to power surplus that causes voltage increase over recommended limits. In order to create incentives for the DER to operate below capacity, we propose a proportional-fairness control strategy in which (i) a subset of DERs decrease their own power output, sacrificing the individual revenue, and (ii) the DERs in the subset are dynamically selected based on the record of their control history. The trustworthy implementation of the scheme is carried out through a custom-designed blockchain mechanism that maintains a distributed database trusted by all DERs. In particular, the blockchain is used to stipulate and store a smart contract that enforces proportional fairness. The simulation results verify the potential of the proposed framework.

cs.MA↗

arXiv2017

Stochastic Geometric Coverage Analysis in mmWave Cellular Networks with a Realistic Channel Model

Millimeter-wave (mmWave) bands have been attracting growing attention as a possible candidate for next-generation cellular networks, since the available spectrum is orders of magnitude larger than in current cellular allocations. To precisely design mmWave systems, it is important to examine mmWave interference and SIR coverage under large-scale deployments. For this purpose, we apply an accurate mmWave channel model, derived from experiments, into an analytical framework based on stochastic geometry. In this way we obtain a closed-form SIR coverage probability in large-scale mmWave cellular networks.

cs.NI↗

arXiv2017

A Novel Receiver Design with Joint Coherent and Non-Coherent Processing

In this paper, we propose a novel splitting receiver, which involves joint processing of coherently and non-coherently received signals. Using a passive RF power splitter, the received signal at each receiver antenna is split into two streams which are then processed by a conventional coherent detection (CD) circuit and a power-detection (PD) circuit, respectively. The streams of the signals from all the receiver antennas are then jointly used for information detection. We show that the splitting receiver creates a three-dimensional received signal space, due to the joint coherent and non-coherent processing. We analyze the achievable rate of a splitting receiver, which shows that the splitting receiver provides a rate gain of $3/2$ compared to either the conventional (CD-based) coherent receiver or the PD-based non-coherent receiver in the high SNR regime. We also analyze the symbol error rate (SER) for practical modulation schemes, which shows that the splitting receiver achieves asymptotic SER reduction by a factor of at least $\sqrt{M}-1$ for $M$-QAM compared to either the conventional (CD-based) coherent receiver or the PD-based non-coherent receiver.

cs.IT↗

arXiv2017

Delivery Latency Trade-Offs of Heterogeneous Contents in Fog Radio Access Networks

A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via the caching of popular content at edge nodes (ENs) and cloud processing. The existing information-theoretic analyses of F-RAN systems, and special cases thereof, make the assumption that all requests should be guaranteed the same delivery latency, which results in identical latency for all files in the content library. In practice, however, contents may have heterogeneous timeliness requirements depending on the applications that operate on them. Given per-EN cache capacity constraint, there exists a fundamental trade-off among the delivery latencies of different users' requests, since contents that are allocated more cache space generally enjoy lower delivery latencies. For the case with two ENs and two users, the optimal latency trade-off is characterized in the high-SNR regime in terms of the Normalized Delivery Time (NDT) metric. The main results are illustrated by numerical examples.

cs.IT↗

arXiv2017

Secure and Resilient Low-Rate Connectivity for Smart Energy Applications through Power Talk in DC Microgrids

The future smart grid is envisioned as a network of interconnected microgrids (MGs) - small-scale local power networks comprising generators, storage capacities and loads. MGs bring unprecedented modularity, efficiency, sustainability, and resilience to the power grid as a whole. Due to the high share of renewable generation, MGs require innovative concepts for control and optimization, giving rise to a novel class of smart energy applications, in which communications represent an integral part. In this paper, we review power talk, a communication technique specifically developed for direct current MGs, which exploits the communication potential residing within the MG power equipment. Depending on the smart energy application, power talk can be used either as a primary communication enabler, or an auxiliary communication system that provides resilient and secure operation. The key advantage of power talk is that it derives its availability, reliability, and security from the very MG elements, outmatching standard, off-the shelf communication solutions.

eess.SY↗

arXiv2017

Random Access Protocols for Massive MIMO

5G wireless networks are expected to support new services with stringent requirements on data rates, latency and reliability. One novel feature is the ability to serve a dense crowd of devices, calling for radically new ways of accessing the network. This is the case in machine-type communications, but also in urban environments and hotspots. In those use cases, the high number of devices and the relatively short channel coherence interval do not allow per-device allocation of orthogonal pilot sequences. This article motivates the need for random access by the devices to pilot sequences used for channel estimation, and shows that Massive MIMO is a main enabler to achieve fast access with high data rates, and delay-tolerant access with different data rate levels. Three pilot access protocols along with data transmission protocols are described, fulfilling different requirements of 5G services.

cs.IT↗

arXiv2017

Massive Machine-Type Communication (mMTC) Access with Integrated Authentication

We present a connection establishment protocol with integrated authentication, suited for Massive Machine-Type Communications (mMTC). The protocol is contention-based and its main feature is that a device contends with a unique signature that also enables the authentication of the device towards the network. The signatures are inspired by Bloom filters and are created based on the output of the MILENAGE authentication and encryption algorithm set, which is used in the authentication and security procedures in the LTE protocol family. We show that our method utilizes the system resources more efficiently, achieves lower latency of connection establishment for Poisson arrivals and allows a $87\%$ signalling overhead reduction. An important conclusion is that the mMTC traffic benefits profoundly from integration of security features into the connection establishment/access protocols, instead of addressing them post-hoc, which has been a common practice.

cs.IT↗

arXiv2017

Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy

In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals from multiple remote radio heads are processed in a centralized baseband unit (BBU) pool. This architecture allows network operators to adapt the BBU's computational resources to the aggregate access load experienced at the BBU, which can change in every air-interface access frame. The degree of savings that can be achieved by adapting the resources is a tradeoff between savings, adaptation frequency, and increased queuing time. If the time scale for adaptation of the resource multiplexing is greater than the access frame duration, then this may result in additional access latency and limit the energy savings. In this paper we investigate the tradeoff by considering two extreme time-scales for the resource multiplexing: (i) long-term, where the computational resources are adapted over periods much larger than the access frame durations; (ii) short-term, where the adaption is below the access frame duration. We develop a general C-RAN queuing model that describes the access latency and show, for Poisson arrivals, that long-term multiplexing achieves savings comparable to short-term multiplexing, while offering low implementation complexity.

cs.IT↗

arXiv2017

Revisiting Frequency Reuse towards Supporting Ultra-Reliable Ubiquitous-Rate Communication

One of the goals of 5G wireless systems stated by the NGMN alliance is to provide moderate rates (50+ Mbps) everywhere and with very high reliability. We term this service Ultra-Reliable Ubiquitous-Rate Communication (UR2C). This paper investigates the role of frequency reuse in supporting UR2C in the downlink. To this end, two frequency reuse schemes are considered: user-specific frequency reuse (FRu) and BS-specific frequency reuse (FRb). For a given unit frequency channel, FRu reduces the number of serving user equipments (UEs), whereas FRb directly decreases the number of interfering base stations (BSs). This increases the distance from the interfering BSs and the signal-to-interference ratio (SIR) attains ultra-reliability, e.g. 99% SIR coverage at a randomly picked UE. The ultra-reliability is, however, achieved at the cost of the reduced frequency allocation, which may degrade overall downlink rate. To fairly capture this reliability-rate tradeoff, we propose ubiquitous rate defined as the maximum downlink rate whose required SIR can be achieved with ultra-reliability. By using stochastic geometry, we derive closed-form ubiquitous rate as well as the optimal frequency reuse rules for UR2C.

cs.IT↗