ترغب بنشر مسار تعليمي؟ اضغط هنا

Spatio-temporal Modeling for Massive and Sporadic Access

68   0   0.0 ( 0 )
 نشر من قبل Yi Zhong
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The vision for smart city imperiously appeals to the implementation of Internet-of-Things (IoT), some features of which, such as massive access and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support its integration. Rigorous theoretical analysis is indispensable to obtain constructive insight for the networking design of massive access. In this paper, we propose and define the notion of massive and sporadic access (MSA) to quantitatively describe the massive access of IoT devices. We evaluate the temporal correlation of interference and successful transmission events, and verify that such correlation is negligible in the scenario of MSA. In view of this, in order to resolve the difficulty in any precise spatio-temporal analysis where complex interactions persist among the queues, we propose an approximation that all nodes are moving so fast that their locations are independent at different time slots. Furthermore, we compare the original static network and the equivalent network with high mobility to demonstrate the effectiveness of the proposed approximation approach. The proposed approach is promising for providing a convenient and general solution to evaluate and design the IoT network with massive and sporadic access.

قيم البحث

اقرأ أيضاً

This paper investigates artificial noise injection into the temporal and spatial dimensions of a legitimate wireless communication system to secure its transmissions from potential eavesdropping. We consider a multiple-input single-output (MISO) orth ogonal frequency division multiplexing (OFDM) system in the presence of a single-antenna passive eavesdropper and derive both the secrecy rate and average secrecy rate of the legitimate system. It is assumed that the legitimate transmitter knows the full channel information of the legitimate transceivers but does not know the instantaneous channel state information of the passive eavesdropper. Closed-form expressions for the secrecy rate and average secrecy rate are derived for the asymptotic case with a large number of transmit antennas. We also investigate 1) the power allocation between the data and the AN; 2) the power allocation between the spatial and the temporal AN. Computer simulations are carried out to evaluate the performance of our proposed artificial noise scheme.
The gains afforded by cloud radio access network (C-RAN) in terms of savings in capital and operating expenses, flexibility, interference management and network densification rely on the presence of high-capacity low-latency fronthaul connectivity be tween remote radio heads (RRHs) and baseband unit (BBU). In light of the non-uniform and limited availability of fiber optics cables, the bandwidth constraints on the fronthaul network call, on the one hand, for the development of advanced baseband compression strategies and, on the other hand, for a closer investigation of the optimal functional split between RRHs and BBU. In this chapter, after a brief introduction to signal processing challenges in C-RAN, this optimal function split is studied at the physical (PHY) layer as it pertains to two key baseband signal processing steps, namely channel estimation in the uplink and channel encoding/ linear precoding in the downlink. Joint optimization of baseband fronthaul compression and of baseband signal processing is tackled under different PHY functional splits, whereby uplink channel estimation and downlink channel encoding/ linear precoding are carried out either at the RRHs or at the BBU. The analysis, based on information-theoretical arguments, and numerical results yields insight into the configurations of network architecture and fronthaul capacities in which different functional splits are advantageous. The treatment also emphasizes the versatility of deterministic and stochastic successive convex approximation strategies for the optimization of C-RANs.
This paper presents the first Network-Coded Multiple Access (NCMA) system with multiple users adopting different signal modulations, referred to as rate-diverse NCMA. A distinguishing feature of NCMA is the joint use of physical-layer network coding (PNC) and multiuser decoding (MUD) to boost throughput of multipacket reception systems. In previous NCMA systems, users adopt the same modulation regardless of their individual channel conditions. This leads to suboptimal throughput for many practical scenarios, especially when different users have widely varying channel conditions. A rate-diverse NCMA system allows different users to use modulations that are commensurate with their channel conditions. A key challenge is the design of the PNC mapping and decoding mechanisms in NCMA when different users adopt different modulations. While there have been past work on non-channel-coded rate-diverse PNC, this paper is the first attempt to design channel-coded rate-diverse PNC to ensure the reliability of the overall NCMA system. Specifically, we put forth a symbol-splitting channel coding and modulation design so that PNC/NCMA can work over different modulations. We implemented our rate-diverse NCMA system on software-defined radios. Experimental results show that the throughput of rate-diverse NCMA can outperform the state-of-the-art rate-homogeneous NCMA by 80%. Overall, the introduction of rate diversity significantly boosts the NCMA system throughput in practical scenarios.
This paper investigates practical 5G strategies for power-balanced non-orthogonal multiple access (NOMA). By allowing multiple users to share the same time and frequency, NOMA can scale up the number of served users and increase spectral efficiency c ompared with existing orthogonal multiple access (OMA). Conventional NOMA schemes with successive interference cancellation (SIC) do not work well when users with comparable received powers transmit together. To allow power-balanced NOMA (more exactly, near power-balanced NOMA), this paper investigates a new NOMA architecture, named Network-Coded Multiple Access (NCMA). A distinguishing feature of NCMA is the joint use of physical-layer network coding (PNC) and multiuser decoding (MUD) to boost NOMA throughputs. We first show that a simple NCMA architecture in which all users use the same modulation, referred to as rate-homogeneous NCMA, can achieve substantial throughput improvement over SIC-based NOMA under near power-balanced scenarios. Then, we put forth a new NCMA architecture, referred to as rate-diverse NCMA, in which different users may adopt different modulations commensurate with their relative SNRs. A challenge for rate-diverse NCMA is the design of a channel-coded PNC system. This paper is the first attempt to design channel-coded rate-diverse PNC. Experimental results on our software-defined radio prototype show that the throughput of rate-diverse NCMA can outperform the state-of-the-art rate-homogeneous NCMA by 80%. Overall, rate-diverse NCMA is a practical solution for near power-balanced NOMA.
Timeliness is an emerging requirement for many Internet of Things (IoT) applications. In IoT networks, where a large-number of nodes are distributed, severe interference may incur during the transmission phase which causes age of information (AoI) de gradation. It is therefore important to study the performance limit of AoI as well as how to achieve such limit. In this paper, we aim to optimize the AoI in random access Poisson networks. By taking into account the spatio-temporal interactions amongst the transmitters, an expression of the peak AoI is derived, based on explicit expressions of the optimal peak AoI and the corresponding optimal system parameters including the packet arrival rate and the channel access probability are further derived. It is shown that with a given packet arrival rate (resp. a given channel access probability), the optimal channel access probability (resp. the optimal packet arrival rate), is equal to one under a small node deployment density, and decrease monotonically as the spatial deployment density increases due to the severe interference caused by spatio-temproal coupling between transmitters. When joint tuning of the packet arrival rate and channel access probability is performed, the optimal channel access probability is always set to be one. Moreover, with the sole tuning of the channel access probability, it is found that the optimal peak AoI performance can be improved with a smaller packet arrival rate only when the node deployment density is high, which is contrast to the case of the sole tuning of the packet arrival rate, where a higher channel access probability always leads to better optimal peak AoI regardless of the node deployment density. In all the cases of optimal tuning of system parameters, the optimal peak AoI linearly grows with the node deployment density as opposed to an exponential growth with fixed system parameters.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا