In this work, we investigate the stability region, the throughput performance, and the queueing delay of an asymmetric relay-assisted cooperative random access wireless network with multipacket reception (MPR) capabilities. We consider a network of @math saturated source users that transmit packets to a common destination node with the cooperation of two relay nodes. The relays are equipped with infinite capacity buffers, and assist the users by forwarding the packets that failed to reach the destination. Moreover, the relays have also packets of their own to transmit to the destination. We assume random access of the medium and slotted time. With the relay-assisted cooperation, the packets originated by each user can be transmitted to the destination through multiple relaying paths formed by the relays. We assume that the relays employ an adaptive retransmission control mechanism. In particular, a relay node is aware of the status of the other relay, and accordingly adapts its transmission probability. Such a protocol is towards self-aware networks and leads to substantial performance gains in terms of delay. We investigate the stability region and the throughput performance for the full MPR model. Moreover, for the two-user, two-relay case we derive the generating function of the stationary joint queue-length distribution at the relays by solving a Riemann-Hilbert boundary value problem. Finally, for the symmetric case we obtain explicit expressions for the average queueing delay in a relay node without the need of solving a boundary value problem. Numerical examples are presented providing insights on the system performance.
In addition, random access recently re-gained interest due to the increased number of communicating devices in 5G networks, and the need for massive uncoordinated access @cite_28 . Random access and alternatives schemes and their effect on the operation of LTE and LTE-A are presented in @cite_28 , @cite_13 , @cite_23 . In @cite_15 , the effect of random access in Cloud-Radio Access Network is considered.
@cite_28 @cite_15 @cite_13 @cite_23
2116633494 2963418374 2141804605 2148565706
The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the random access method employed in LTE, we propose a novel approach that is able to sustain a wide random access load range, while preserving the physical layer unchanged and incurring minor changes in the medium access control layer. The proposed scheme increases the amount of available contention resources, without resorting to the increase of system resources, such as contention sub-frames and preambles. This increase is accomplished by expanding the contention space to the code domain, through the creation of random access codewords. Specifically, in the proposed scheme, users perform random access by transmitting one or none of the available LTE orthogonal preambles in multiple random access sub-frames, thus creating access codewords that are used for contention. In this way, for the same number of random access sub-frames and orthogonal preambles, the amount of available contention resources is drastically increased, enabling the support of an increased number of MTC users. We present the framework and analysis of the proposed code-expanded random access method and show that our approach supports load regions that are beyond the reach of current systems. Future 5G cellular networks supporting delay-sensitive, low-latency communications could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless communication system where multiple devices transmit payloads of a given fixed size in a random access fashion over shared radio resources to a common receiver. We allow retransmissions and assume Chase combining at the receiver. The radio resources are partitioned in the time and frequency dimensions, and we determine the optimal partition granularity to maximize throughput, subject to given constraints on latency and outage. In the regime of high and low signal-to-noise ratio (SNR), we derive explicit expressions for the granularity and throughput, first using a Shannon capacity approximation and then using finite block length analysis. Numerical results show that the throughput scaling results are applicable over a range of SNRs. The proposed analytical framework can provide insights for resource allocation strategies in reliable and delay-sensitive random access systems and in specific 5G use cases for massive, short packet uplink access. The 3GPP has raised the need to revisit the design of next generations of cellular networks in order to make them capable and efficient to provide M2M services. One of the key challenges that has been identified is the need to enhance the operation of the random access channel of LTE and LTE-A. The current mechanism to request access to the system is known to suffer from congestion and overloading in the presence of a huge number of devices. For this reason, different research groups around the globe are working towards the design of more efficient ways of managing the access to these networks in such circumstances. This paper aims to provide a survey of the alternatives that have been proposed over the last years to improve the operation of the random access channel of LTE and LTE-A. A comprehensive discussion of the different alternatives is provided, identifying strengths and weaknesses of each one of them, while drawing future trends to steer the efforts over the same shooting line. In addition, while existing literature has been focused on the performance in terms of delay, the energy efficiency of the access mechanism of LTE will play a key role in the deployment of M2M networks. For this reason, a comprehensive performance evaluation of the energy efficiency of the random access mechanism of LTE is provided in this paper. The aim of this computer-based simulation study is to set a baseline performance upon which new and more energy-efficient mechanisms can be designed in the near future. In multihop packet radio networks with randomly distributed terminals, the optimal transmission radii to maximize the expected progress of packets in desired directions are determined with a variety of transmission protocols and network configurations. It is shown that the FM capture phenomenon with slotted ALOHA greatly improves the expected progress over the system without capture due to the more limited area of possibly interfering terminals around the receiver. The (mini)slotted nonpersistent carrier-sense-multiple-access (CSMA) only slightly outperforms ALOHA, unlike the single-hop case (where a large improvement is available), because of a large area of "hidden" terminals and the long vulnerable period generated by them. As an example of an inhomogeneous terminal distribution, the effect of a gap in an otherwise randomly distributed terminal population on the expected progress of packets crossing the gap is considered. In this case, the disadvantage of using a large transmission radius is demonstrated.