skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Fundamental limits of a dense IoT cell in the uplink
The envisioned Internet of Things (IoT) will involve a massive deployment of objects connected through wireless cells. While commercial solutions are already available, the fundamental limits of such networks in terms of node density, achievable rates or reliability are not known. To address this question, this paper uses a large scale Multiple Access Channel (MAC) to model IoT nodes randomly distributed over the coverage area of a unique base station. The traffic is represented by an information rate spatial density ρ(x). This model, referred to as the Spatial Continuum Multiple Access Channel, is defined as the asymptotic limit of a sequence of discrete MACs. The access capacity region of this channel is defined as the set of achievable information rate spatial densities achievable with vanishing transmission errors and under a sum-power constraint. Simulation results validate the model and show that this fundamental limit theoretically achievable when all nodes transmit simultaneously over an infinite time, may be reached even with a relatively small number of simultaneous transmitters (typically around 20 nodes) which gives credibility to the model. The results also highlight the potential interest of non-orthogonal transmissions for IoT uplink transmissions when compared to an ideal time sharing strategy.  more » « less
Award ID(s):
1647198
PAR ID:
10084861
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
Page Range / eLocation ID:
1 to 6
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. This paper aims to realize a new multiple access technique based on recently proposed millimeter- wave reconfigurable antenna architectures. To this end, first we show that integration of the existing reconfigurable antenna systems with the well-known non-orthogonal multiple access (NOMA) technique causes a significant degradation in sum rate due to the inevitable power division in reconfigurable antennas. To circumvent this fundamental limit, a new multiple access technique is proposed. The technique which is called reconfigurable antenna multiple access (RAMA) transmits only each user's intended signal at the same time/frequency/code, which makes RAMA an inter-user interference-free technique. Two different cases are considered, i.e., RAMA with partial and full channel state information (CSI). In the first case, CSI is not required and only the direction of arrival for a specific user is used. Our analytical results indicate that with partial CSI and for symmetric channels, RAMA outperforms NOMA in terms of sum rate. Further, the analytical result indicates that RAMA for asymmetric channels achieves better sum rate than NOMA when less power is assigned to users that experience better channel quality. In the second case, RAMA with full CSI allocates optimal power to each user which leads to higher achievable rates compared to NOMA for both symmetric and asymmetric channels. The numerical computations demonstrate the analytical findings. 
    more » « less
  2. A new class of structured codes called quasi group codes (QGCs) is introduced. A QGC is a subset of a group code. In contrast with the group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen, such that the size of C C is equal to any number between C and C 2 . We analyze the performance of a specific class of QGCs. This class of QGCs is constructed by assigning single-letter distributions to the indices of the codewords in a group code. Then, the QGC is defined as the set of codewords whose index is in the typical set corresponding to these singleletter distributions. The asymptotic performance limits of this class of QGCs are characterized using single-letter information quantities. Corresponding covering and packing bounds are derived. It is shown that the point-to-point channel capacity and optimal rate-distortion function are achievable using QGCs. Coding strategies based on QGCs are introduced for three fundamental multi-terminal problems: the Körner-Marton problem for modulo prime-power sums, computation over the multiple access channel (MAC), and MAC with distributed states. For each problem, a single-letter achievable rate-region is derived. It is shown, through examples, that the coding strategies improve upon the previous strategies based on the unstructured codes, linear codes, and group codes. Index Terms— Quasi structure 
    more » « less
  3. Cellular networks with D2D links are increasingly being explored for mission-critical applications (e.g., real-time control and AR/VR) which require predictable communication reliability. Thus it is critical to control interference among concurrent transmissions in a predictable manner to ensure the required communication reliability. To this end, we propose a Unified Cellular Scheduling (UCS) framework that, based on the Physical-Ratio-K (PRK) interference model, schedules uplink, downlink, and D2D transmissions in a unified manner to ensure predictable communication reliability while maximizing channel spatial reuse. UCS also provides a simple, effective approach to mode selection that maximizes the communication capacity for each involved communication pair. UCS effectively uses multiple channels for high throughput as well as resilience to channel fading and external interference. Leveraging the availability of base stations (BSes) as well as high-speed, out-of-band connectivity between BSes, UCS effectively orchestrates the functionalities of BSes and user equipment (UE) for light-weight control signaling and ease of incremental deployment and integration with existing cellular standards. We have implemented UCS using the open-source, standards-compliant cellular networking platform OpenAirInterface, and we have validated the UCS design and implementation using the USRP B210 software-defined radios in the ORBIT wireless testbed. We have also evaluated UCS through high-fidelity, at-scale simulation studies; we observe that UCS ensures predictable communication reliability while achieving a higher channel spatial reuse rate than existing mechanisms, and that the distributed UCS framework enables a channel spatial reuse rate statistically equal to that in the state-of-the-art centralized scheduling algorithm iOrder. 
    more » « less
  4. null (Ed.)
    In this paper, we study the problem of minimizing the age of information when a source can transmit status updates over two heterogeneous channels. Our work is motivated by recent developments in 5G mmWave technology, where transmissions may occur over an unreliable but fast (e.g., mmWave) channel or a slow reliable (e.g., sub-6GHz) channel. The unreliable channel is modeled as a time-correlated Gilbert-Elliot channel, where information can be transmitted at a high rate when the channel is in the "ON" state. The reliable channel provides a deterministic but lower data rate. The scheduling strategy determines the channel to be used for transmission with the aim to minimize the time-average age of information (AoI). The optimal scheduling problem is formulated as a Markov Decision Process (MDP), which in our setting poses some significant challenges because e.g., supermodularity does not hold for part of the state space. We show that there exists a multi-dimensional threshold-based scheduling policy that is optimal for minimizing the age. A low-complexity bisection algorithm is further devised to compute the optimal thresholds. Numerical simulations are provided to compare different scheduling policies. 
    more » « less
  5. Analog network coding (ANC) is a throughput increasing technique for the two-way relay channel (TWRC) whereby two end nodes transmit simultaneously to a relay at the same time and band, followed by the relay broadcasting the received sum of signals to the end nodes. Coherent reception under ANC is challenging due to requiring oscillator synchronization for all nodes, a problem further exacerbated by Doppler shift. This work develops a noncoherent M-ary frequency-shift keyed (FSK) demodulator implementing ANC. The demodulator produces soft outputs suitable for use with capacity-approaching channel codes and supports information feedback from the channel decoder. A unique aspect of the formulation is the presence of an infinite summation in the received symbol probability density function. Detection and channel decoding succeed when the truncated summation contains a sufficient number of terms. Bit error rate performance is investigated by Monte Carlo simulation, considering modulation orders two, four and eight, channel coded and uncoded operation, and with and without information feedback from decoder to demodulator. The channel code considered for simulation is the LDPC code defined by the DVB-S2 standard. To our knowledge this work is the first to develop a noncoherent soft-output demodulator for ANC. 
    more » « less