Searcharxiv⌕ Search

arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

At least 343 records · Page 19Linked to original sources
arXiv2019

Analysis of LoRaWAN Uplink with Multiple Demodulating Paths and Capture Effect

Low power wide area networks (LPWANs), such as the ones based on the LoRaWAN protocol, are seen as enablers of large number of IoT applications and services. In this work, we assess the scalability of LoRaWAN by analyzing the frame success probability (FSP) of a LoRa frame while taking into account the capture effect and the number of parallel demodulation paths of the receiving gateway. We have based our model on the commonly used {SX1301 gateway chipset}, which is capable of demodulating {up to} eight frames simultaneously; however, the results of the model can be generalized to architectures with arbitrary number of demodulation paths. We have also introduced and investigated {three} policies for Spreading Factor (SF) allocation. Each policy is evaluated in terms of coverage {probability}, {FSP}, and {throughput}. The overall conclusion is that the presence of multiple demodulation paths introduces a significant change in the analysis and performance of the LoRa random access schemes.

cs.NI↗
arXiv2019

Stochastic Geometric Coverage Analysis in mmWave Cellular Networks with Realistic Channel and Antenna Radiation Models

Millimeter-wave (mmWave) bands will play an important role in 5G wireless systems. The system performance can be assessed by using models from stochastic geometry that cater for the directivity in the desired signal transmissions as well as the interference, and by calculating the signal-to-interference-plus-noise ratio (SINR) coverage. Nonetheless, the correctness of the existing coverage expressions derived through stochastic geometry may be questioned, as it is not clear whether they capture the impact of the detailed mmWave channel and antenna features. In this study, we propose an SINR coverage analysis framework that includes realistic channel model (from NYU) and antenna element radiation patterns (with isotropic/directional radiation). We first introduce two parameters, aligned gain and misaligned gain, associated with the desired signal beam and the interfering signal beam, respectively. We provide the distributions of the aligned and misaligned gains through curve fitting of system-simulation results. The distribution of these gains is used to determine the distribution of the SINR. We compare the obtained analytical SINR coverage with the corresponding SINR coverage calculated via system-level simulations. The results show that both aligned and misaligned gains can be modeled as exponential-logarithmically distributed random variables with the highest accuracy, and can further be approximated as exponentially distributed random variables with reasonable accuracy. These approximations are thus expected to be useful to evaluate the system performance under ultra-reliable and low-latency communication (URLLC) and evolved mobile broadband (eMBB) scenarios, respectively.

cs.NI↗
arXiv2018

Non-Orthogonal Multiplexing of Ultra-Reliable and Broadband Services in Fog-Radio Architectures

The fifth generation (5G) of cellular systems is introducing Ultra-Reliable Low-Latency Communications (URLLC) services alongside more conventional enhanced Mobile BroadBand (eMBB) traffic. Furthermore, the 5G cellular architecture is evolving from a base station-centric deployment to a fog-like set-up that accommodates a flexible functional split between cloud and edge. In this paper, a novel solution is proposed that enables the non-orthogonal coexistence of URLLC and eMBB services by processing URLLC traffic at the Edge Nodes (ENs), while eMBB communications are handled centrally at a cloud processor as in a Cloud-Radio Access Network (C-RAN) system. This solution guarantees the low-latency requirements of the URLLC service by means of edge processing, e.g., for vehicle-to-cellular use cases, as well as the high spectral efficiency for eMBB traffic via centralized baseband processing. Both uplink and downlink are analyzed by accounting for the heterogeneous performance requirements of eMBB and URLLC traffic and by considering practical aspects such as fading, lack of channel state information for URLLC transmitters, rate adaptation for eMBB transmitters, finite fronthaul capacity, and different coexistence strategies, such as puncturing.

cs.NI↗
arXiv2018

Delay and Communication Tradeoffs for Blockchain Systems with Lightweight IoT Clients

The emerging blockchain protocols provide a decentralized architecture that is suitable of supporting Internet of Things (IoT) interactions. However, keeping a local copy of the blockchain ledger is infeasible for low-power and memory-constrained devices. For this reason, they are equipped with lightweight software implementations that only download the useful data structures, e.g. state of accounts, from the blockchain network, when they are updated. In this paper, we consider and analyze a novel scheme, implemented by the nodes of the blockchain network, which aggregates the blockchain data in periodic updates and further reduces the communication cost of the connected IoT devices. We show that the aggregation period should be selected based on the channel quality, the offered rate, and the statistics of updates of the useful data structures. The results, obtained for the Ethereum protocol, illustrate the benefits of the aggregation scheme in terms of a reduced duty cycle of the device, particularly for low signal-to-noise ratios, and the overall reduction of the amount of information transmitted in downlink (e.g., from the wireless base station to the IoT device). A potential application of the proposed scheme is to let the IoT device request more information than actually needed, hence increasing its privacy, while keeping the communication cost constant. In conclusion, our work is the first to provide rigorous guidelines for the design of lightweight blockchain protocols with wireless connectivity.

cs.DC↗
arXiv2018

Wireless Access in Ultra-Reliable Low-Latency Communication (URLLC)

The future connectivity landscape and, notably, the 5G wireless systems will feature Ultra-Reliable Low Latency Communication (URLLC). The coupling of high reliability and low latency requirements in URLLC use cases makes the wireless access design very challenging, in terms of both the protocol design and of the associated transmission techniques. This paper aims to provide a broad perspective on the fundamental tradeoffs in URLLC as well as the principles used in building access protocols. Two specific technologies are considered in the context of URLLC: massive MIMO and multi-connectivity, also termed interface diversity. The paper also touches upon the important question of the proper statistical methodology for designing and assessing extremely high reliability levels.

cs.IT↗
arXiv2018

A Statistical Learning Approach to Ultra-Reliable Low Latency Communication

Mission-critical applications require Ultra-Reliable Low Latency (URLLC) wireless connections, where the packet error rate (PER) goes down to $10^{-9}$. Fulfillment of the bold reliability figures becomes meaningful only if it can be related to a statistical model in which the URLLC system operates. However, this model is generally not known and needs to be learned by sampling the wireless environment. In this paper we treat this fundamental problem in the simplest possible communication-theoretic setting: selecting a transmission rate over a dynamic wireless channel in order to guarantee high transmission reliability. We introduce a novel statistical framework for design and assessment of URLLC systems, consisting of three key components: (i) channel model selection; (ii) learning the model using training; (3) selecting the transmission rate to satisfy the required reliability. As it is insufficient to specify the URLLC requirements only through PER, two types of statistical constraints are introduced, Averaged Reliability (AR) and Probably Correct Reliability (PCR). The analysis and the evaluations show that adequate model selection and learning are indispensable for designing consistent physical layer that asymptotically behaves as if the channel was known perfectly, while maintaining the reliability requirements in URLLC systems.

cs.IT↗
arXiv2018

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Stop Feedback

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. For the point-to-point case, Polyanskiy et al. (2011) demonstrated that variable-length coding combined with stop-feedback significantly increases the speed of convergence of the maximum coding rate to capacity. This speed-up manifests itself in the absence of a square-root penalty in the asymptotic expansion of the maximum coding rate for large blocklengths, i.e., zero dispersion. In this paper, we present nonasymptotic achievability and converse bounds on the maximum coding rate of the common-message K-user discrete memoryless broadcast channel, which strengthen and generalize the ones reported in Trillingsgaard et al. (2015) for the two-user case. An asymptotic analysis of these bounds reveals that zero dispersion cannot be achieved for certain common-message broadcast channels (e.g., the binary symmetric broadcast channel). Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order. Through numerical evaluations, we illustrate that our second-order expansions approximate accurately the maximum coding rate and that the speed of convergence to capacity is indeed slower than for the point-to-point case.

cs.IT↗
arXiv2018

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Full Feedback

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds. An asymptotic analysis of these bounds reveals that feedback improves the second-order term compared to the no-feedback case. In particular, for a certain class of antisymmetric broadcast channels, we show that the dispersion is halved. For the variable-length-code setup, we demonstrate that the channel dispersion is zero.

cs.IT↗
arXiv2018

5G Wireless Network Slicing for eMBB, URLLC, and mMTC: A Communication-Theoretic View

The grand objective of 5G wireless technology is to support three generic services with vastly heterogeneous requirements: enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable low-latency communications (URLLC). Service heterogeneity can be accommodated by network slicing, through which each service is allocated resources to provide performance guarantees and isolation from the other services. Slicing of the Radio Access Network (RAN) is typically done by means of orthogonal resource allocation among the services. This work studies the potential advantages of allowing for non-orthogonal sharing of RAN resources in uplink communications from a set of eMBB, mMTC and URLLC devices to a common base station. The approach is referred to as Heterogeneous Non-Orthogonal Multiple Access (H-NOMA), in contrast to the conventional NOMA techniques that involve users with homogeneous requirements and hence can be investigated through a standard multiple access channel. The study devises a communication-theoretic model that accounts for the heterogeneous requirements and characteristics of the three services. The concept of reliability diversity is introduced as a design principle that leverages the different reliability requirements across the services in order to ensure performance guarantees with non-orthogonal RAN slicing. This study reveals that H-NOMA can lead, in some regimes, to significant gains in terms of performance trade-offs among the three generic services as compared to orthogonal slicing.

cs.NI↗
arXiv2018

Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things

The next wave of wireless technologies will proliferate in connecting sensors, machines, and robots for myriad new applications, thereby creating the fabric for the Internet of Things (IoT). A generic scenario for IoT connectivity involves a massive number of machine-type connections. But in a typical application, only a small (unknown) subset of devices are active at any given instant, thus one of the key challenges for providing massive IoT connectivity is to detect the active devices first and then to decode their data with low latency. This article outlines several key signal processing techniques that are applicable to the problem of massive IoT access, focusing primarily on advanced compressed sensing technique and its application for efficient detection of the active devices. We show that massive multiple-input multiple-output (MIMO) is especially well-suited for massive IoT connectivity in the sense that the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station goes to infinity by using the multiple-measurement vector (MMV) compressed sensing techniques. The paper also provides a perspective on several related important techniques for massive access, such as embedding of short messages onto the device activity detection process and the coded random access.

cs.IT↗
arXiv2018

Latency-Energy Tradeoff based on Channel Scheduling and Repetitions in NB-IoT Systems

Narrowband IoT (NB-IoT) is the latest IoT connectivity solution presented by the 3GPP. NB-IoT introduces coverage classes and introduces a significant link budget improvement by allowing repeated transmissions by nodes that experience high path loss. However, those repetitions necessarily increase the energy consumption and the latency in the whole NB-IoT system. The extent to which the whole system is affected depends on the scheduling of the uplink and downlink channels. We address this question, not treated previously, by developing a tractable model of NB-IoT access protocol operation, comprising message exchanges in random-access, control, and data channels, both in the uplink and downlink. The model is then used to analyze the impact of channel scheduling as well as the interaction of coexisting coverage classes, through derivation of the expected latency and battery lifetime for each coverage class. These results are subsequently employed in investigation of latency-energy tradeoff in NB-IoT channel scheduling as well as determining the optimized operation points. Simulations results show validity of the analysis and confirm that there is a significant impact of channel scheduling on latency and lifetime performance of NBIoT devices.

cs.IT↗
arXiv2018

Joint Configuration of Transmission Direction and Altitude in UAV-based Two-Way Communication

When considering unidirectional communication for unmanned aerial vehicles (UAVs) as flying Base Stations (BSs), either uplink or downlink, the system is limited through the co-channel interference that takes place over line-of-sight (LoS) links. This paper considers two-way communication and takes advantage of the fact that the interference among the ground devices takes place through non-line-of-sight (NLoS) links. UAVs can be deployed at the high altitudes to have larger coverage, while the two-way communication allows to configure the transmission direction. Using these two levers, we show how the system throughput can be maximized for a given deployment of the ground devices.

cs.IT↗
arXiv2018

Sign-Compute-Resolve for Tree Splitting Random Access

We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e. compute, the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user's signature, as well as the data that the user wants to communicate. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. This framework for creating and transmitting packets can be used as a fundamental building block in random access algorithms, since it helps to deal efficiently with the uncertainty of the set of contending terminals. In this paper we show how to apply the framework in conjunction with a tree-splitting algorithm, which is required to deal with the case that more than K users collide. We demonstrate that our approach achieves throughput that tends to 1 rapidly as K increases. We also present results on net data-rate of the system, showing the impact of the overheads of the constituent elements of the proposed protocol. We compare the performance of our scheme with an upper bound that is obtained under the assumption that the active users are a priori known. Also, we consider an upper bound on the net data-rate for any PLNC based strategy in which one linear equation per slot is decoded. We show that already at modest packet lengths, the net data-rate of our scheme becomes close to the second upper bound, i.e. the overhead of the contention resolution algorithm and the signature codes vanishes.

cs.IT↗
arXiv2018

Coexistence of URLLC and eMBB services in the C-RAN Uplink: An Information-Theoretic Study

The performance of orthogonal and non-orthogonal multiple access is studied for the multiplexing of enhanced Mobile BroadBand (eMBB) and Ultra-Reliable Low-Latency Communications (URLLC) users in the uplink of a multi-cell Cloud Radio Access Network (C-RAN) architecture. While eMBB users can operate over long codewords spread in time and frequency, URLLC users' transmissions are random and localized in time due to their low-latency requirements. These requirements also call for decoding of their packets to be carried out at the edge nodes (ENs), whereas eMBB traffic can leverage the interference management capabilities of centralized decoding at the cloud. Using information-theoretic arguments, the performance trade-offs between eMBB and URLLC traffic types are investigated in terms of rate for the former, and rate, access latency, and reliability for the latter. The analysis includes non-orthogonal multiple access (NOMA) with different decoding architectures, such as puncturing and successive interference cancellation (SIC). The study sheds light into effective design choices as a function of inter-cell interference, signal-to-noise ratio levels, and fronthaul capacity constraints.

cs.NI↗
arXiv2018

Towards Massive Connectivity Support for Scalable mMTC Communications in 5G networks

The fifth generation of cellular communication systems is foreseen to enable a multitude of new applications and use cases with very different requirements. A new 5G multiservice air interface needs to enhance broadband performance as well as provide new levels of reliability, latency and supported number of users. In this paper we focus on the massive Machine Type Communications (mMTC) service within a multi-service air interface. Specifically, we present an overview of different physical and medium access techniques to address the problem of a massive number of access attempts in mMTC and discuss the protocol performance of these solutions in a common evaluation framework.

cs.IT↗
arXiv2018

Minimizing Latency to Support VR Social Interactions over Wireless Cellular Systems via Bandwidth Allocation

Immersive social interactions of mobile users are soon to be enabled within a virtual space, by means of virtual reality (VR) technologies and wireless cellular systems. In a VR mobile social network, the states of all interacting users should be updated synchronously and with low latency via two-way communications with edge computing servers. The resulting end-to-end latency depends on the relationship between the virtual and physical locations of the wireless VR users and of the edge servers. In this work, the problem of analyzing and optimizing the end-to-end latency is investigated for a simple network topology, yielding important insights into the interplay between physical and virtual geometries.

cs.IT↗
arXiv2018

Decentralized DC MicroGrid Monitoring and Optimization via Primary Control Perturbations

We treat the emerging power systems with direct current (DC) MicroGrids, characterized with high penetration of power electronic converters. We rely on the power electronics to propose a decentralized solution for autonomous learning of and adaptation to the operating conditions of the DC Mirogrids; the goal is to eliminate the need to rely on an external communication system for such purpose. The solution works within the primary droop control loops and uses only local bus voltage measurements. Each controller is able to estimate (i) the generation capacities of power sources, (ii) the load demands, and (iii) the conductances of the distribution lines. To define a well-conditioned estimation problem, we employ decentralized strategy where the primary droop controllers temporarily switch between operating points in a coordinated manner, following amplitude-modulated training sequences. We study the use of the estimator in a decentralized solution of the Optimal Economic Dispatch problem. The evaluations confirm the usefulness of the proposed solution for autonomous MicroGrid operation.

eess.SY↗