2,323 research outputs found
On Throughput Maximization of Grant-Free Access with Reliability-Latency Constraints
Enabling autonomous driving and industrial automation with wireless networks
poses many challenges, which are typically abstracted through reliability and
latency requirements. One of the main contributors to latency in cellular
networks is the reservation-based access, which involves lengthy and
resource-inefficient signaling exchanges. An alternative is to use grant-free
access, in which there is no resource reservation. A handful of recent works
investigated how to fulfill reliability and latency requirements with different
flavors of grant-free solutions. However, the resource efficiency, i.e., the
throughput, has been only the secondary focus. In this work, we formulate the
throughput of grant-free access under reliability-latency constraints, when the
actual number of arrived users or only the arrival distribution are known. We
investigate how these different levels of knowledge about the arrival process
influence throughput performance of framed slotted ALOHA with -multipacket
reception, for the Poisson and Beta arrivals. We show that the throughput under
reliability-latency requirements can be significantly improved for the higher
expected load of the access network, if the actual number of arrived users is
known. This insight motivates the use of techniques for the estimation of the
number of arrived users, as this knowledge is not readily available in
grant-free access. We also asses the impact of estimation error, showing that
for high reliability-latency requirements the gains in throughput are still
considerable.Comment: Accepted for publication in ICC'201
Grant-free Radio Access IoT Networks: Scalability Analysis in Coexistence Scenarios
IoT networks with grant-free radio access, like SigFox and LoRa, offer
low-cost durable communications over unlicensed band. These networks are
becoming more and more popular due to the ever-increasing need for ultra
durable, in terms of battery lifetime, IoT networks. Most studies evaluate the
system performance assuming single radio access technology deployment. In this
paper, we study the impact of coexisting competing radio access technologies on
the system performance. Considering \mathpzc K technologies, defined by time
and frequency activity factors, bandwidth, and power, which share a set of
radio resources, we derive closed-form expressions for the successful
transmission probability, expected battery lifetime, and experienced delay as a
function of distance to the serving access point. Our analytical model, which
is validated by simulation results, provides a tool to evaluate the coexistence
scenarios and analyze how introduction of a new coexisting technology may
degrade the system performance in terms of success probability and battery
lifetime. We further investigate solutions in which this destructive effect
could be compensated, e.g., by densifying the network to a certain extent and
utilizing joint reception
Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing Approach
A key challenge of massive MTC (mMTC), is the joint detection of device
activity and decoding of data. The sparse characteristics of mMTC makes
compressed sensing (CS) approaches a promising solution to the device detection
problem. However, utilizing CS-based approaches for device detection along with
channel estimation, and using the acquired estimates for coherent data
transmission is suboptimal, especially when the goal is to convey only a few
bits of data.
First, we focus on the coherent transmission and demonstrate that it is
possible to obtain more accurate channel state information by combining
conventional estimators with CS-based techniques. Moreover, we illustrate that
even simple power control techniques can enhance the device detection
performance in mMTC setups.
Second, we devise a new non-coherent transmission scheme for mMTC and
specifically for grant-free random access. We design an algorithm that jointly
detects device activity along with embedded information bits. The approach
leverages elements from the approximate message passing (AMP) algorithm, and
exploits the structured sparsity introduced by the non-coherent transmission
scheme. Our analysis reveals that the proposed approach has superior
performance compared to application of the original AMP approach.Comment: Submitted to IEEE Transactions on Communication
Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access
Grant-free transmission is an important feature to be supported by future
wireless networks since it reduces the signalling overhead caused by
conventional grant-based schemes. However, for grant-free transmission, the
number of users admitted to the same channel is not caped, which can lead to a
failure of multi-user detection. This paper proposes non-orthogonal
multiple-access (NOMA) assisted semi-grant-free (SGF) transmission, which is a
compromise between grant-free and grant-based schemes. In particular, instead
of reserving channels either for grant-based users or grant-free users, we
focus on an SGF communication scenario, where users are admitted to the same
channel via a combination of grant-based and grant-free protocols. As a result,
a channel reserved by a grant-based user can be shared by grant-free users,
which improves both connectivity and spectral efficiency. Two NOMA assisted SGF
contention control mechanisms are developed to ensure that, with a small amount
of signalling overhead, the number of admitted grant-free users is carefully
controlled and the interference from the grant-free users to the grant-based
users is effectively suppressed. Analytical results are provided to demonstrate
that the two proposed SGF mechanisms employing different successive
interference cancelation decoding orders are applicable to different practical
network scenarios
- …