Time-of-arrival-based retransmission scheduling for unslotted random access channels

In many communication systems, the stronger of two or more overlapping packets might capture the receiver and thus be received without error. The effect of capture on collision-resolution algorithms in a slotted ALOHA type broadcasting network is investigated here. Extensions to the algorithms are suggested for both the situations in which the receiver can or cannot distinguish between success slots and capture slots. In particular, we present a class of retransmission schemes for packets that have been transmitted during capture slots but have not been received correctly. The performance analysis is confined to a simplified model in which the nodes of the network are divided into two groups and only packets sent by the nodes of one of them might be captured. For this simplified model and for each extended algorithm, explicit recursive equations are given, from which the average conditional collision-resolution interval length, as well as the maximal throughput, can be determined. As expected, we show that in the presence of capture, the performance of the network is improved and the maximal attainable throughput is increased. Extensions of the simplified model such as dividing the nodes into K groups instead of two, or considering the situation that capture depends on relative distances and transmission powers, are also discussed. For the latter situation we give simulation results.

This paper presents a set of simple and intuitive robot collision detection algorithms that show substantial scaling improvements for high geometric complexity and large numbers of collision queries by leveraging hardware-accelerated ray tracing on GPUs. It is the first leveraging hardware-accelerated ray-tracing for direct volume mesh-to-mesh discrete collision detection and applying it to continuous collision detection. We introduce two methods: Ray-Traced Discrete-Pose Collision Detection for exact robot mesh to obstacle mesh collision detection, and Ray-Traced Continuous Collision Detection for robot sphere representation to obstacle mesh swept collision detection, using piecewise-linear or quadratic B-splines. For robot link meshes totaling 24k triangles and obstacle meshes of over 190k triangles, our methods were up to 2.8 times faster in batched discrete-pose queries than a state-of-the-art GPU-based method using a sphere robot representation. For the same obstacle mesh scene, our sphere-robot continuous collision detection was up to 7 times faster depending on trajectory batch size. We also performed detailed measurements of the volume coverage accuracy of various sphere/mesh pose/path representations to provide insight into the tradeoffs between speed and accuracy of different robot collision detection methods.

We study a binary decision fusion scheme which employs a common channel for detector-DFC communication. Unlike most parallel fusion schemes, which use a dedicated communication channel between every local detector (LD) and the data fusion center (DFC), our scheme uses a single shared, time-slotted communication link for all LDs to transmit decisions to the DFC. Two window-based methods are presented for managing traffic over this channel. The first allows simultaneous messages to collide. The DFC uses the statistics of the channel states (i.e., the number of successful transmissions, idle slots, and collisions during a specified time period) to make its global decision. The second method uses a simple collision resolution algorithm (CRA), similar to slotted-ALOHA with dynamically updated retransmission probability. With this scheme, the DFC makes its decision based on data transmitted successfully within a specified time window. Over-all performance of the systems are presented and compared. Simple rules are developed for assessing the conditions under which each one of the schemes is preferred.

This paper presents the optimum random access channel (RACH) structure in terms of the number of control signaling bits accommodated and the transmission bandwidth based on the link budget in order to satisfy the coverage requirement for the single-carrier (SC)-FDMA based E-UTRA uplink. First, we propose grouping of the RACH purposes to reduce the number of control signaling bits to be conveyed by the RACH. By employing the proposed purpose-grouping scheme, only a four-bit random ID and a two-bit purpose grouping index for the non-synchronized RACH are required. Simulation evaluations including a system-level simulation show that the non-synchronized RACH comprising a 0.5-msec preamble signature sequence can convey the aforementioned 6-bit control signal at the cell edge when the inter-site distance (ISD) is 500 m under full channel load conditions with one-cell frequency reuse. It is also shown, however, that a RACH longer than one-sub-frame, e.g., 1.0 msec, is necessary to support the ISD of 1732 m assuming the same conditions. We also show that although there is no distinct difference in the transmission bandwidth from 1.25 to 5 MHz from the viewpoint of the misdetection probability, a 1.25-MHz transmission bandwidth for the RACH is suitable from the viewpoints of flexible resource assignment in the time domain and small number of option in the transmission bandwidth.

We perform a new analysis of the performance of the wideband code-division multiple access (W-CDMA) randomized slotted-offset random access channel (RAC) with Nakagami-m fading and compare it with that of a comparable randomized slotted-ALOHA-based RAC. Previously, it was shown that the W-CDMA RAC is fast, robust and simple to implement (see Esmailzadeh, R. and Gustafsson, M., Proc. 1997 IEEE ICUPC Conf, p.43-7, 1997). However, it was assumed that any random access packet arrival events involving multiple packets from cochannel mobile stations would result in lost packets. Closed-form equations are developed for the collision process of the arriving random access packets in slotted-offset and slotted-ALOHA RACs. An analysis is developed of the signal-to-interference-and-noise ratio of a packet involved in a multipacket DS-CDMA collision with a generalized Nakagami fading channel and diversity reception at the base station. A closed-form equation is developed for the bit error rate and packet throughput of the slotted-offset- and slotted-ALOHA-based RACs. The results of the analysis show that considerable improvement in the RAC performance can be achieved when multiple arrival collisions, on the same timeslot and with the same signature code, are partially resolved. The results also show the RAC's sensitivity to fading severity, packet E/sub b//N/sub 0/, spreading gain and number of base station receive selection diversity antennas. Compared to the randomized slotted-ALOHA designs, W-CDMA RAC performs as well in light fading conditions and slightly worse in severe fading conditions.

Collision detection is an enabling technology for many virtual environments, games, and virtual prototyping applications containing some kind of physically-based simulation (such as rigid bodies, cloth, surgery, etc.). The persistent interest in collision detection by both academia and industry is due to the large variety of applications as well as new challenges in new application domains, such as virtual clothes fitting. This tutorial will give an overview of the different classes of algorithms, and then provide attendees with in-depth knowledge of some of the important algorithms within each class, focusing in particular on recent approaches, such as stochastic methods or image-space techniques. Attendees will learn to select the one most appropriate for their application, and implement it with only very little further research. The intended audience are practitioners and students working in 3D computer graphics. Topics to be addressed - hierarchical collision detection - stochastic methods - distance fields - spatial subdivisions - image-space techniques - continuous collision detection - non-polygonal object representations (e.g., point clouds)

Random access channel is incorporated in IEEE 802.16 WiMAX system to transport contention-based messages in the uplink, such as bandwidth requests generated by best effort applications, from mobile stations (MSs) to the base station(BS). Regarding the packet transmissions in the random access channel, delay, throughput and power consumption are usually considered as major performance metrics. We propose an enhanced power calibration protocol to optimize the system performance in terms of channel access delay, system throughput and MS transmit power consumption. Optimal selection of power levels is formulated in order to maximize the achievable throughput while being subject to power consumption constraint of mobile stations. Our scheme can substitute the random backoff mechanism in the current the WiMAX uplink random access channel, as it can accomplish a significantly improved access delay performance without an increment of design complexity. Simulations are conducted to validate our protocol and confirm its performance superiority as compared to the random channel access method used in the current WiMAX.

This paper addresses self-optimization of the random access channel (RACH) in the Third-Generation Partnership Project (3GPP) Long-Term Evolution (LTE). Ensuring satisfactory random access (RA) performance in terms of access delay (AD) is crucial for reducing the delays associated with initial access and handovers. The feasibility of self-optimization is investigated by means of simulations, where the coupling between several parameters and the RACH performance in terms of AD is provided. We present two candidate feedback control algorithms that automatically adjust key RACH parameters to meet specified AD targets.

Random access channel (RACH) procedures in modern wireless communications are generally based on multi-channel slotted-ALOHA, which can be optimized by flexibly organizing devices' transmission and retransmission. However, due to the lack of information about the traffic generation statistics and the occurrence of random collision, optimizing RACH in an exact manner is generally challenging. In this article, we first summarize the general structure of optimization for different RACH schemes, and then review existing RACH optimization methods based on machine learning (ML) and non-ML techniques. We demonstrate that the ML-based methods can better optimize RACH schemes compared to non-ML-based methods due to their capability in solving high-complexity long-term optimization problems. To further improve the RACH performance, we introduce a decoupled learning strategy (DLS) for access control optimization, which individually executes two sub-tasks: traffic prediction and access control configuration. In detail, the traffic prediction relies on an online supervised learning method adopting recurrent neural networks that can accurately capture traffic statistics over consecutive frames, while the access control configuration uses either a non-ML-based controller or a cooperatively trained deep reinforcement learning (DRL)-based controller selected depending on the complexity of different random access schemes. Numerical results show that the DLS optimizer considerably outperforms conventional DRL optimizers in terms of higher training efficiency and better access performance.

LTE random access procedure performs satisfactorily in case of asynchronous, uncorrelated traffic arrivals. However, when the arrivals are correlated and arrive synchronously, the performance of the random access channel (RACH) is drastically reduced, causing a large number of devices to experience outage. In this work we propose a LTE RACH scheme tailored for delay-sensitive M2M services with synchronous traffic arrivals. The key idea is, upon detection of a RACH overload, to apply a collision resolution algorithm based on splitting trees. The solution is implemented on top of the existing LTE RACH mechanism, requiring only minor modifications of the protocol operation and not incurring any changes to the physical layer. The results are very promising, outperforming the related solutions by a wide margin. As an illustration, the proposed scheme can resolve 30k devices with an average of 5 preamble transmissions and delay of 1.2 seconds, under a realistic probability of transmissions error both in the downlink and in the uplink.

Long Term Evolution (LTE) Networks are being planned to be upgraded to LTE Advanced along with increasing availability of Release 10 User Equipment (UEs) and Spectrum Availability for Carrier Aggregation. LTE Advanced brings a major step increase in Down Link and Uplink Throughputs and related spectral efficiencies. This paper explains the evolution of Frequency Division Duplex (FDD) throughputs for different Channel Bandwidths. The maximum theoretical physical layer throughputs and expected actual application layer throughputs after removing the necessary overheads by different broadcast, signaling, synchronization & random access channels have been explained with an impact analysis thereof. Throughput gains for upcoming LTE Advanced deployments have been computed for Frame Structure Type 1 (FDD) for Channel Bandwidth of 1.4 MHz, 3MHz, 5 MHz, 10 MHz, 15 MHz and 20 MHz along with Carrier Aggregation of 2 & 5 Component Carriers. Impact of increasing Signaling Channels, retransmissions & code rate on throughputs has been explained so that the computations can be extended to any deployment scenario.

In a long term evolution‐advanced (LTE‐A) system, the traffic overload of machine type communication devices is a challenge because too many devices attempt to access a base station (BS) simultaneously in a short period of time. We discuss the challenge of the gap between the theoretical maximum throughput and the actual throughput. A gap occurs when the BS cannot change the number of preambles for a random access channel (RACH) until multiple numbers of RACHs are completed. In addition, a preamble partition approach is proposed in this paper that uses two groups of preambles to reduce this gap. A performance evaluation shows that the proposed approach increases the average throughput. For 100,000 devices in a cell, the throughput is increased by 29.7% to 114.4% and 23.0% to 91.3% with uniform and Beta‐distributed arrivals of devices, respectively.

A fast algebraic non-penetration filter for continuous collision detection

Orthogonal frequency-division multiple access (OFDMA) systems are considered promising candidates for implementing next-generation wireless communication systems. They provide multiple channels that can be accessed via random access schemes. However, traditional random access schemes could result in an excessive amount of access delay. To address this issue, we develop a fast retrial scheme that is based on slotted Aloha and exploits the structure of OFDMA. A salient feature of this scheme is that when collisions occur instead of retrials occuring randomly in time, they occur randomly in frequency, i.e., the scheme randomly selects the subchannels for retrial. To further achieve fast access, retrials are designed to follow the 1-persistent type, i.e., no exponential backoff. To achieve the maximum throughput, we limit the maximum number of allowed retrials according to the load condition. We also consider the issue of designing for an appropriate reuse factor for random access channels in order to overcome the intercell interference problem in OFDMA multicell environments. Our finding is that full sharing, i.e., a reuse factor of one, performs best for given random access channels. Through analysis and simulation, we confirm that our fast retrial algorithm has the advantage of high throughput and low access delay, and the full sharing policy for random access channels shows high throughput as well as low collision.

Random access channel (RACH) is usually used for initial channel access, bandwidth request, etc. In this paper, we analyze the throughput and access delay performance of the RACH in an orthogonal frequency division multiple access (OFDMA) system. A closed-form expression of the RACH throughput is presented and its mean access delays under both binary exponential and uniform backoff policies have also been derived. Moreover, to further improve the utilization of RACH in an OFDMA system, we propose a novel message transmission scheme in a shared RACH. The message in the proposed scheme can be sent implicitly in the cyclic-shifted preambles which make the transmission much more reliable in a contention based RACH. Meanwhile, performance of the preamble detection has also been improved by the redundant information conveyed in messages. Finally, simulation results will demonstrate performance gains of the proposed scheme.