The ALOHA SYSTEM

The report provides a status report and description of THE ALOHA SYSTEM research project at the University of Hawaii. THE ALOHA SYSTEM involves the analysis and construction of advanced methods of random access communications in large computer-communication systems. The existing ALOHA SYSTEM computer-communication network uses two 24,000 baud channels in the UHF band. The system employs message switching techniques similar to those of the ARPANET, in conjunction with a novel form of random access radio channel multiplexing. By means of these techniques the system has the capacity to accommodate several hundred active users of alphanumeric consoles on the two channels available. Each of these users can transmit and receive at a peak data rate of 24,000 baud although the average data rate of the users must of course be considerably less

Throughput analysis of ALOHA with cooperative diversity

Cooperative transmissions emulate multi-antenna systems and can improve the quality of signal reception. In this paper, we propose and analyze a cross layer random access scheme, C-ALOHA, that enables cooperative transmissions in the context of ALOHA system. Our analysis shows that over a fading channel C-ALOHA can improve the throughput by 30%, as compared to standard ALOHA protocol

Performance Enhancements for Asynchronous Random Access Protocols over Satellite

In this paper, a novel enhancement of the well known ALOHA random access mechanism is presented which largely extends the achievable throughput compared to traditional ALOHA and provides significantly lower packet loss rates. The novel mechanism, called Contention Resolution - ALOHA (CRA), is based on transmitting multiple replicas of a packet in an unslotted ALOHA system and applying interference cancellation techniques. In this paper the methodology for this new random access technique is presented, also w.r.t. existing Interference Cancellation (IC) techniques. Moreover numerical results for performance comparison with state of the art random access mechanisms, such as Contention Resolution Diversity Slotted ALOHA (CRDSA) are provided. Finally the benefit of taking strong forward error correcting codes for the performance of CRA is shown

An effective frame breaking policy for dynamic framed slotted aloha in RFID

The tag collision problem is considered as one of the critical issues in RFID system. To further improve the identification efficiency of an UHF RFID system, a frame breaking policy is proposed with dynamic framed slotted aloha algorithm. Specifically, the reader makes effective use of idle, successful, and collision statistics during the early observation phase to recursively determine the optimal frame size. Then the collided tags in each slot will be resolved by individual frames. Simulation results show that the proposed algorithm achieves a better identification performance compared with the existing Aloha-based algorithms

Adaptive schemes for packet data in a ds-cdma environment

This paper presents a novel adaptive DS-CDMA slotted-ALOHA packet random access scheme for improving the throughput of the conventional DS-CDMA slotted-ALOHA system. For this purpose a mobile-assisted algorithm is envisaged to control the change of the transmission rate according to the traffic load. This algorithm revealed that the optimum behavior may be almost reached at a low complexity cost. Moreover, the proposed algorithm was found to be robust to intercell interferencePeer ReviewedPostprint (published version

Performance analysis for a stabilized multi-channel slotted ALOHA algorithm

We study slotted ALOHA with multiple random access channels, the so called multi-channel ALOHA (MC-ALOHA). It is well known that single-channel ALOHA (SC-ALOHA) is unstable. Not surprisingly, MC-ALOHA is also unstable. A stabilization algorithm for MC-ALOHA has been proposed in [10], in which the pseudo-Bayesian algorithm in SC-ALOHA was extended to achieve stabilized MC-ALOHA. The idea is to estimate the number of attempting users so that user transmission probability can be adjusted accordingly. In this paper, we give a theoretical analysis on the algorithm performance for cases with limited and unlimited number of users by assuming perfect estimate. The theoretical results are validated by simulation, which shows the stabilization algorithm performs close to a system with perfect estimate. The simulation results also show that the performance of the stabilized algorithm is much better than the non-stabilized algorithm. With the stabilized algorithm, the system is always stable when the new packet arrival rate is less than system capacity. Even when the arrival rate is higher than capacity, system throughput can still be guaranteed. © 2003 IEEE.published_or_final_versio

Adaptive algorithms for improving the throughput in an indoor mobile s-aloha ds-cdma system

This paper presents a novel Adaptive DSCDMA Slotted-ALOHA packet random access scheme with transmitter-based spreading codes for mobiles. It is aimed at improving the throughput and message delay delivery when traffic load values below the saturation point of the conventional DS-CDMA Slotted-ALOHA system are sensed in the channel. For this purpose, one Mobile and two Base Station assisted algorithms are envisaged to control the change of the transmission rate according to the traffic load. These algorithms revealed that the optimum behavior, obtained using a Markov Chain model, may be almost reached at a low complexity cost.Peer ReviewedPostprint (published version