4,884 research outputs found
ALOHA With Collision Resolution(ALOHA-CR): Theory and Software Defined Radio Implementation
A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is
proposed for high throughput wireless communications in a cellular scenario.
Transmissions occur in a time-slotted ALOHA-type fashion but with an important
difference: simultaneous transmissions of two users can be successful. If more
than two users transmit in the same slot the collision cannot be resolved and
retransmission is required. If only one user transmits, the transmitted packet
is recovered with some probability, depending on the state of the channel. If
two users transmit the collision is resolved and the packets are recovered by
first over-sampling the collision signal and then exploiting independent
information about the two users that is contained in the signal polyphase
components. The ALOHA-CR throughput is derived under the infinite backlog
assumption and also under the assumption of finite backlog. The contention
probability is determined under these two assumptions in order to maximize the
network throughput and maintain stability. Queuing delay analysis for network
users is also conducted. The performance of ALOHA-CR is demonstrated on the
Wireless Open Access Research Platform (WARP) test-bed containing five software
defined radio nodes. Analysis and test-bed results indicate that ALOHA-CR leads
to significant increase in throughput and reduction of service delays
Fast Adaptive S-ALOHA Scheme for Event-driven Machine-to-Machine Communications
Machine-to-Machine (M2M) communication is now playing a market-changing role
in a wide range of business world. However, in event-driven M2M communications,
a large number of devices activate within a short period of time, which in turn
causes high radio congestions and severe access delay. To address this issue,
we propose a Fast Adaptive S-ALOHA (FASA) scheme for M2M communication systems
with bursty traffic. The statistics of consecutive idle and collision slots,
rather than the observation in a single slot, are used in FASA to accelerate
the tracking process of network status. Furthermore, the fast convergence
property of FASA is guaranteed by using drift analysis. Simulation results
demonstrate that the proposed FASA scheme achieves near-optimal performance in
reducing access delay, which outperforms that of traditional additive schemes
such as PB-ALOHA. Moreover, compared to multiplicative schemes, FASA shows its
robustness even under heavy traffic load in addition to better delay
performance.Comment: 5 pages, 3 figures, accepted to IEEE VTC2012-Fal
Analysis of Half-Duplex Two-Node Slotted ALOHA Network With Asynchronous Traffic
Despite the long history of research on slotted ALOHA, the exact analysis of
the average delay is still in question as the performance of each node is
coupled with the activity of other nodes. In this paper, we consider a network
comprised of two half-duplex transmitter nodes with asynchronous arrival
traffic that follow the slotted ALOHA protocol. We propose a new queueing
theoretic model based on the state-dependent queues to analyze the network. In
addition, we derive the exact values of delay and stability region for each
node. The numerical results demonstrate the accuracy of our proposed model.Comment: 5 pages, 5 figure
Network Coding Tree Algorithm for Multiple Access System
Network coding is famous for significantly improving the throughput of
networks. The successful decoding of the network coded data relies on some side
information of the original data. In that framework, independent data flows are
usually first decoded and then network coded by relay nodes. If appropriate
signal design is adopted, physical layer network coding is a natural way in
wireless networks. In this work, a network coding tree algorithm which enhances
the efficiency of the multiple access system (MAS) is presented. For MAS,
existing works tried to avoid the collisions while collisions happen frequently
under heavy load. By introducing network coding to MAS, our proposed algorithm
achieves a better performance of throughput and delay. When multiple users
transmit signal in a time slot, the mexed signals are saved and used to jointly
decode the collided frames after some component frames of the network coded
frame are received. Splitting tree structure is extended to the new algorithm
for collision solving. The throughput of the system and average delay of frames
are presented in a recursive way. Besides, extensive simulations show that
network coding tree algorithm enhances the system throughput and decreases the
average frame delay compared with other algorithms. Hence, it improves the
system performance
- …