Searcharxiv⌕ Search

arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

At least 397 records · Page 22Linked to original sources

On a User-Centric Base Station Cooperation Scheme for Reliable Communications

In this paper, we describe CoMP2flex, a user-centric base station (BS) cooperation scheme that provides improvements in reliability of both uplink (UL) and downlink (DL) communications of wireless cellular networks. CoMP2flex supports not only cooperation of two BSs with same direction of traffic but also cooperation of two BSs serving bidirectional traffic. The reliability performance of CoMP2flex is shown with numerical simulations and analytical expressions. We quantify and numerically validate the performance of the greedy BS pairing algorithm by comparing maximum weight matching methods, implemented as the Edmonds matching algorithm for weighted graphs.

cs.IT↗

A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in the Massive MIMO context and develop a reengineered protocol, termed strongest-user collision resolution (SUCRe). An accessing UE asks for a dedicated pilot by sending an uncoordinated random access pilot, with a risk that other UEs send the same pilot. The favorable propagation of Massive MIMO channels is utilized to enable distributed collision detection at each UE, thereby determining the strength of the contenders' signals and deciding to repeat the pilot if the UE judges that its signal at the receiver is the strongest. The SUCRe protocol resolves the vast majority of all pilot collisions in crowded urban scenarios and continues to admit UEs efficiently in overloaded networks.

cs.IT↗

Secure and Robust Authentication for DC MicroGrids based on Power Talk Communication

We propose a novel framework for secure and reliable authentication of Distributed Energy Resources to the centralized secondary/tertiary control system of a DC MicroGrid (MG), networked using the IEEE 802.11 wireless interface. The key idea is to perform the authentication using power talk, which is a powerline communication technique executed by the primary control loops of the power electronic converters, without the use of a dedicated hardware for its modem. In addition, the scheme also promotes direct and active participation of the control system in the authentication process, a feature not commonly encountered in current networked control systems for MicroGrids. The PLECS-based simulations verifies the viability of our scheme.

eess.SY↗

Anti-Jamming Strategy for Distributed Microgrid Control based on Power Talk Communication

In standard implementations of distributed secondary control for DC MicroGrids (MGs), the exchange of local measurements among neighboring control agents is enabled via off-the-shelf wireless solutions, such as IEEE 802.11. However, Denial of Service (DoS) attacks on the wireless interface through jamming prevents the secondary control system from performing its main tasks, which might compromise the stability of the MG. In this paper, we propose novel, robust and secure secondary control reconfiguration strategy, tailored to counteract DoS attacks. Specifically, upon detecting the impairment of the wireless interface, the jammed secondary control agent notifies its peers via a secure, low-rate powerline channel based on Power Talk communication. This triggers reconfiguration of the wireless communication graph through primary control mode switching, where the jammed agents leave the secondary control by switching to current source mode, and are replaced by nonjammed current sources that switch to voltage source mode and join the secondary control. The strategy fits within the software-defined networking framework, where the network control is split from the data plane using reliable and secure side power talk communication channel, created via software modification of the MG primary control loops. The simulation results illustrate the feasibility of the solution and prove that the MG resilience and performance can be indeed improved via software-defined networking approaches.

cs.IT↗

Performance Limits of Energy Detection Systems with Massive Receiver Arrays

Energy detection (ED) is an attractive technique for symbol detection at receivers equipped with a large number of antennas, for example in millimeter wave communication systems. This paper investigates the performance bounds of ED with pulse amplitude modulation (PAM) in large antenna arrays under single stream transmission and fast fading assumptions. The analysis leverages information-theoretic tools and semi-numerical approach to provide bounds on the information rate, which are shown to be tight in the low and high signal-to-noise ratio (SNR) regimes, respectively. For a fixed constellation size, the impact of the number of antennas and SNR on the achievable information rate is investigated. Based on the results, heuristics are provided for the choice of the cardinality of the adaptive modulation scheme as a function of the SNR and the number of antennas.

cs.IT↗

Wirelessly Powered Communication Networks with Short Packets

Wirelessly powered communications will entail short packets due to naturally small payloads, low-latency requirements and/or insufficient energy resources to support longer transmissions. In this paper, a wirelessly powered communication system is investigated where an energy harvesting transmitter, charged by one or more power beacons via wireless energy transfer, attempts to communicate with a receiver over a noisy channel. Under a save-then-transmit protocol, the system performance is characterized using metrics such as the energy supply probability at the transmitter, and the achievable rate at the receiver for the case of short packets. Leveraging the framework of finite-length information theory, tractable analytical expressions are derived for the considered metrics in terms of system parameters such as the harvest blocklength, the transmit blocklength, the harvested power and the transmit power. The analysis provides several useful design guidelines. Though using a small transmit power or a small transmit blocklength helps avoid energy outages, the consequently smaller signal-to-noise ratio or the fewer coding opportunities may cause an information outage. Scaling laws are derived to capture this inherent trade-off between the harvest and transmit blocklengths. Moreover, the asymptotically optimal transmit power is derived in closed-form. Numerical results reveal that power control is essential for improving the achievable rate of the system in the finite blocklength regime. The asymptotically optimal transmit power yields nearly optimal performance in the finite blocklength regime.

cs.IT↗

Estimation of Received Signal Strength Distribution for Smart Meters with Biased Measurement Data Set

This letter presents an experimental study and a novel modelling approach of the wireless channel of smart utility meters placed in basements or sculleries. The experimental data consist of signal strength measurements of consumption report packets. Since such packets are only registered if they can be decoded by the receiver, the part of the signal strength distribution that falls below the receiver sensitivity threshold is not observable. We combine a Rician fading model with a bias function that captures the cut-off in the observed signal strength measurements. Two sets of experimental data are analysed. It is shown that the proposed method offers an approximation of the distribution of the signal strength measurements that is better than a naïve Rician fitting.

cs.IT↗

Delay Minimization in Real-time Communications with Joint Buffering and Coding

We present a closed-form expression for the minimal delay that is achievable in a setting that combines a buffer and an erasure code, used to mitigate the packet delay variance. The erasure code is modeled according to the recent information-theoretic results on finite block length codes. Evaluations reveal that accurate knowledge of the network parameters is essential for optimal operation. Moreover, it is shown that, when the network packet delay variance is large, the buffer delay becomes negligible. Therefore, in this case the delay budget should be spent mainly on the erasure code.

cs.IT↗

Power Talk for Multibus DC MicroGrids: Creating and Optimizing Communication Channels

We study a communication framework for nonlinear multibus DC MicroGrids based on a deliberate modification of the parameters of the primary control and termed power talk. We assess the case in which the information is modulated in the deviations of reference voltages of the primary control loops and show that the outputs of the power talk communication channels can be approximated through linear combinations of the respective inputs. We show that the coefficients of the linear combinations, representing equivalent channel gains, depend on the virtual resistances of the primary control loops, implying that they can be modified such that effective received signal-to-noise ratio (SNR) is increased. On the other hand, we investigate the constraints that power talk incurs on the supplied power deviations. We show that these constraints translate into constraints on the reference voltages and virtual resistances that are imposed on all units in the system. In this regard, we develop an optimization approach to find the set of controllable virtual resistances that maximize SNR under the constraints on the supplied power deviations.

cs.IT↗

Decoupled Uplink and Downlink in a Wireless System with Buffer-Aided Relaying

The paper treats a multiuser relay scenario where multiple user equipments (UEs) have a two-way communication with a common Base Station (BS) in the presence of a buffer-equipped Relay Station (RS). Each of the uplink (UL) and downlink (DL) transmission can take place over a direct or over a relayed path. Traditionally, the UL and the DL path of a given two-way link are coupled, that is, either both are direct links or both are relayed links. By removing the restriction for coupling, one opens the design space for a decoupled two-way links. Following this, we devise two protocols: orthogonal decoupled UL/DL buffer-aided (ODBA) relaying protocol and non-orthogonal decoupled UL/DL buffer-aided (NODBA) relaying protocol. In NODBA, the receiver can use successive interference cancellation (SIC) to extract the desired signal from a collision between UL and DL signals. For both protocols, we characterize the transmission decision policies in terms of maximization of the average two-way sum rate of the system. The numerical results show that decoupling association and non-orthogonal radio access lead to significant throughput gains for two-way traffic.

cs.IT↗

On the Impact of Wireless Jamming on the Distributed Secondary Microgrid Control

The secondary control in direct current microgrids (MGs) is used to restore the voltage deviations caused by the primary droop control, where the latter is implemented locally in each distributed generator and reacts to load variations. Numerous recent works propose to implement the secondary control in a distributed fashion, relying on a communication system to achieve consensus among MG units. This paper shows that, if the system is not designed to cope with adversary communication impairments, then a malicious attacker can apply a simple jamming of a few units of the MG and thus compromise the secondary MG control. Compared to other denial-of-service attacks that are oriented against the tertiary control, such as economic dispatch, the attack on the secondary control presented here can be more severe, as it disrupts the basic functionality of the MG.

eess.SY↗

On Buffer-Aided Multiple-Access Relay Channel

The paper treats uplink scenario where M user equipments (UEs) send to a Base Station (BS), possibly via a common Relay Station (RS) that is equipped with a buffer. This is a multiple-access relay channel (MARC) aided by a buffer. We devise a protocol in which the transmission mode is selected adaptively, using the buffer at the RS in order to maximize the average system throughput. We consider the general case in which the RS and the BS can have limits on the maximal number of transmitters that can be received over the multiple access channel. In each slot there are three type possible actions: (A1) multiple UEs transmit at rates that enable BS to decode them (A2) multiple UEs transmit, the BS can only decode the messages partially, while the RS completely; (A3) RS forwards the side information to BS about the partially decoded messages, which are going to be combined and decoded entirely at the BS, while simultaneously a number of UEs sends new messages to the BS. The results show that the adaptive selection of direct and buffer-aided relay transmissions leads to significant average throughput gains.

cs.IT↗

On Wirelessly Powered Communications with Short Packets

Wireless-powered communications will entail short packets due to naturally small payloads, low latency requirements and/or insufficient energy resources to support longer transmissions. In this paper, a wireless-powered communication system is investigated where an energy harvesting transmitter, charged by a power beacon via wireless energy transfer, attempts to communicate with a receiver over a noisy channel. Leveraging the framework of finite-length information theory, the system performance is analyzed using metrics such as the energy supply probability at the transmitter, and the achievable rate at the receiver. The analysis yields useful insights into the system behavior in terms of key parameters such as the harvest blocklength, the transmit blocklength, the average harvested power and the transmit power. Closed-form expressions are derived for the asymptotically optimal transmit power. Numerical results suggest that power control is essential for improving the achievable rate of the system in the finite blocklength regime.

cs.IT↗

Coded Network Function Virtualization: Fault Tolerance via In-Network Coding

Network Function Virtualization (NFV) prescribes the instantiation of network functions on general-purpose network devices, such as servers and switches. While yielding a more flexible and cost-effective network architecture, NFV is potentially limited by the fact that commercial off-the-shelf hardware is less reliable than the dedicated network elements used in conventional cellular deployments. The typical solution for this problem is to duplicate network functions across geographically distributed hardware in order to ensure diversity. In contrast, this letter proposes to leverage channel coding in order to enhance the robustness on NFV to hardware failure. The proposed approach targets the network function of uplink channel decoding, and builds on the algebraic structure of the encoded data frames in order to perform in-network coding on the signals to be processed at different servers. The key principles underlying the proposed coded NFV approach are presented for a simple embodiment and extensions are discussed. Numerical results demonstrate the potential gains obtained with the proposed scheme as compared to the conventional diversity-based fault-tolerant scheme in terms of error probability.

cs.IT↗

Modemless Multiple Access Communications over Powerlines for DC Microgrid Control

We present a communication solution tailored specifically for DC microgrids (MGs) that exploits: (i) the communication potential residing in power electronic converters interfacing distributed generators to powerlines and (ii) the multiple access nature of the communication channel presented by powerlines. The communication is achieved by modulating the parameters of the primary control loop implemented by the converters, fostering execution of the upper layer control applications. We present the proposed solution in the context of the distributed optimal economic dispatch, where the generators periodically transmit information about their local generation capacity, and, simultaneously, using the properties of the multiple access channel, detect the aggregate generation capacity of the remote peers, with an aim of distributed computation of the optimal dispatch policy. We evaluate the potential of the proposed solution and illustrate its inherent trade-offs.

cs.IT↗

Distributed Estimation of the Operating State of a Single-Bus DC MicroGrid without an External Communication Interface

We propose a decentralized Maximum Likelihood solution for estimating the stochastic renewable power generation and demand in single bus Direct Current (DC) MicroGrids (MGs), with high penetration of droop controlled power electronic converters. The solution relies on the fact that the primary control parameters are set in accordance with the local power generation status of the generators. Therefore, the steady state voltage is inherently dependent on the generation capacities and the load, through a non-linear parametric model, which can be estimated. To have a well conditioned estimation problem, our solution avoids the use of an external communication interface and utilizes controlled voltage disturbances to perform distributed training. Using this tool, we develop an efficient, decentralized Maximum Likelihood Estimator (MLE) and formulate the sufficient condition for the existence of the globally optimal solution. The numerical results illustrate the promising performance of our MLE algorithm.

stat.ML↗

Random Access in C-RAN for User Activity Detection with Limited-Capacity Fronthaul

Cloud-Radio Access Network (C-RAN) is characterized by a hierarchical structure in which the baseband processing functionalities of remote radio heads (RRHs) are implemented by means of cloud computing at a Central Unit (CU). A key limitation of C-RANs is given by the capacity constraints of the fronthaul links connecting RRHs to the CU. In this letter, the impact of this architectural constraint is investigated for the fundamental functions of random access and active User Equipment (UE) identification in the presence of a potentially massive number of UEs. In particular, the standard C-RAN approach based on quantize-and-forward and centralized detection is compared to a scheme based on an alternative CU-RRH functional split that enables local detection. Both techniques leverage Bayesian sparse detection. Numerical results illustrate the relative merits of the two schemes as a function of the system parameters.

cs.IT↗

Random Access for Machine-Type Communication based on Bloom Filtering

We present a random access method inspired on Bloom filters that is suited for Machine-Type Communications (MTC). Each accessing device sends a \emph{signature} during the contention process. A signature is constructed using the Bloom filtering method and contains information on the device identity and the connection establishment cause. We instantiate the proposed method over the current LTE-A access protocol. However, the method is applicable to a more general class of random access protocols that use preambles or other reservation sequences, as expected to be the case in 5G systems. We show that our method utilizes the system resources more efficiently and achieves significantly lower connection establishment latency in case of synchronous arrivals, compared to the variant of the LTE-A access protocol that is optimized for MTC traffic. A dividend of the proposed method is that it allows the base station (BS) to acquire the device identity and the connection establishment cause already in the initial phase of the connection establishment, thereby enabling their differentiated treatment by the BS.

cs.IT↗