Searcharxiv⌕ Search

arXiv subjects

Cedomir Stefanovic

Publications and source records attributed to Cedomir Stefanovic.

At least 73 records · Page 4Linked to original sources

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↗

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↗

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↗

Finite-Length Analysis of Frameless ALOHA with Multi-User Detection

In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming approach, and employed to optimize the scheme's performance. We also assess the optimized performance as function of k. Finally, we verify the presented results through Monte Carlo simulations.

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↗

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↗

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 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↗

Massive Machine-type Communications in 5G: Physical and MAC-layer solutions

Machine-type communications (MTC) are expected to play an essential role within future 5G systems. In the FP7 project METIS, MTC has been further classified into "massive Machine-Type Communication" (mMTC) and "ultra-reliable Machine-Type Communication" (uMTC). While mMTC is about wireless connectivity to tens of billions of machine-type terminals, uMTC is about availability, low latency, and high reliability. The main challenge in mMTC is scalable and efficient connectivity for a massive number of devices sending very short packets, which is not done adequately in cellular systems designed for human-type communications. Furthermore, mMTC solutions need to enable wide area coverage and deep indoor penetration while having low cost and being energy efficient. In this article, we introduce the physical (PHY) and medium access control (MAC) layer solutions developed within METIS to address this challenge.

cs.IT↗

Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs

In this paper we treat the problem of identification of a subset of active users in a set of a large number of potentially active users. The users from the subset are activated randomly, such that the access point (AP) does not know the subset or its size a priori. The active users are contending to report their activity to the AP over a multiple access channel. We devise a contention algorithm that assumes a combination of physical-layer network coding and K-out-of-N signature coding, allowing for multiple detection of up to K users at the access point. In addition, we rely on the principles of coded slotted ALOHA (CSA) and use of successive interference cancellation to enable subsequent resolution of the collisions that originally featured more than K users. The objective is to identify the subset of active users such that the target performance, e.g., probability of active user resolution and/or throughput is reached, which implies that the duration of the contention period is also not known a priori. In contrast to standard CSA approaches, in the proposed algorithm each user, active or not, has a predefined schedule of slots in which it sends its signature. We analyze the performance of the proposed algorithm both in the asymptotic and non-asymptotic settings. We also derive an estimator that, based on the observation of collision multiplicities, estimates how many users are active and thereby enables tuning of the length of the contention period.

cs.IT↗

Multiuser Communication through Power Talk in DC MicroGrids

Power talk is a novel concept for communication among control units in MicroGrids (MGs), carried out without a dedicated modem, but by using power electronics that interface the common bus. The information is transmitted by modulating the parameters of the primary control, incurring subtle power deviations that can be detected by other units. In this paper, we develop power talk communication strategies for DC MG systems with arbitrary number of control units that carry out all-to-all communication. We investigate two multiple access strategies: 1) TDMA, where only one unit transmits at a time, and 2) full duplex, where all units transmit and receive simultaneously. We introduce the notions of signaling space, where the power talk symbol constellations are constructed, and detection space, where the demodulation of the symbols is performed. The proposed communication technique is challenged by the random changes of the bus parameters due to load variations in the system. To this end, we employ a solution based on training sequences, which re-establishes the signaling and detection spaces and thus enables reliable information exchange. The presented results show that power talk is an effective solution for reliable communication among units in DC MG systems.

cs.IT↗

Power Talk in DC Micro Grids: Constellation Design and Error Probability Performance

Power talk is a novel concept for communication among units in a Micro Grid (MG), where information is sent by using power electronics as modems and the common bus of the MG as a communication medium. The technique is implemented by modifying the droop control parameters from the primary control level. In this paper, we consider power talk in a DC MG and introduce a channel model based on Thevenin equivalent. The result is a channel whose state that can be estimated by both the transmitter and the receiver. Using this model, we present design of symbol constellations of arbitrary order and analyze the error probability performance. Finally, we also show how to design adaptive modulation in the proposed communication framework, which leads to significant performance benefits.

cs.IT↗

Probabilistic Handshake in All-to-all Broadcast Coded Slotted ALOHA

We propose a probabilistic handshake mechanism for all-to-all broadcast coded slotted ALOHA. We consider a fully connected network where each user acts as both transmitter and receiver in a half-duplex mode. Users attempt to exchange messages with each other and to establish one-to-one handshakes, in the sense that each user decides whether its packet was successfully received by the other users: After performing decoding, each user estimates in which slots the resolved users transmitted their packets and, based on that, decides if these users successfully received its packet. The simulation results show that the proposed handshake algorithm allows the users to reliably perform the handshake. The paper also provides some analytical bounds on the performance of the proposed algorithm which are in good agreement with the simulation results.

cs.IT↗

Power Talk: How to Modulate Data over a DC Micro Grid Bus using Power Electronics

We introduce a novel communication strategy for DC Micro Grids (MGs), termed power talk, in which the devices communicate by modulating the power levels in the DC bus. The information is transmitted by varying the parameters that the MG units use to control the level of the common bus voltage, while it is received by processing the bus measurements that units perform. This communication is challenged by the fact that the voltage level is subject to random disturbances, as the state of the MG changes with random load variations. We develop a corresponding communication model and address the random voltage fluctuations by using coding strategies that transform the MG into some well-known communication channels. The performance analysis shows that it is possible to mitigate the random voltage level variations and communicate reliably over the MG bus.

cs.IT↗

Massive M2M Access with Reliability Guarantees in LTE Systems

Machine-to-Machine (M2M) communications are one of the major drivers of the cellular network evolution towards 5G systems. One of the key challenges is on how to provide reliability guarantees to each accessing device in a situation in which there is a massive number of almost-simultaneous arrivals from a large set of M2M devices. The existing solutions take a reactive approach in dealing with massive arrivals, such as non-selective barring when a massive arrival event occurs, which implies that the devices cannot get individual reliability guarantees. In this paper we propose a proactive approach, based on a standard operation of the cellular access. The access procedure is divided into two phases, an estimation phase and a serving phase. In the estimation phase the number of arrivals is estimated and this information is used to tune the amount of resources allocated in the serving phase. Our results show that the proactive approach is instrumental in delivering high access reliability to the M2M devices.

cs.IT↗

Sign-Compute-Resolve for Random Access

We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users. For each user this information consists of the data that the user wants to communicate as well as the user's signature. As long as no more than $K$ users collide, their identities can be recovered from the sum of their signatures. A splitting protocol is used to deal with the case that more than $K$ users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted, but are reused in successive interference cancellation.

cs.IT↗

Characterization of Coded Random Access with Compressive Sensing based Multi-User Detection

The emergence of Machine-to-Machine (M2M) communication requires new Medium Access Control (MAC) schemes and physical (PHY) layer concepts to support a massive number of access requests. The concept of coded random access, introduced recently, greatly outperforms other random access methods and is inherently capable to take advantage of the capture effect from the PHY layer. Furthermore, at the PHY layer, compressive sensing based multi-user detection (CS-MUD) is a novel technique that exploits sparsity in multi-user detection to achieve a joint activity and data detection. In this paper, we combine coded random access with CS-MUD on the PHY layer and show very promising results for the resulting protocol.

cs.IT↗