Paper Info
Title
Dynamic Slot Allocation Algorithm for R-ALOHA with Priority (PR-ALOHA)
Abstract
In this work, a new approach for dynamically allocating high priority probability and high priority slots in PR-ALOHA (Reserved ALOHA with Priority) was introduced. The Dynamic Slot Allocation (DSA) algorithm in PR-ALOHA is performed by dynamically allocating the number of high priority slots and high priority probability based on the available traffic. The performance of the system with DSA algorithm was tested by simulations and compared to the performance of the system without DSA. The simulation shows that the proposed DSA algorithm provides an approach to improve performance in a controlled manner for high and low priority traffic. Two functions are proposed for DSA, the first one is an exponential growth function, where the numbers of high priority slots increase with the number of terminals until it reach a maximum value. The second one is a bell-shaped function where the number of high priority slots increase to a maximum then decrease. Both functions are tested with fixed high priority probability (hpp) of 25% and dynamic hpp ranging (8%-63%). The bell shaped function gave better performance at fixed hpp, while the exponential function gave better performance with dynamic hpp. The simulation shows that the use of DSA improves the performance of PR-ALOHA.
Year
DOI
Venue
2010
10.1109/GLOCOM.2010.5683533
IEEE Global Telecommunications Conference (Globecom)
Keywords
Field
DocType
PR-ALOHA,inter-vehicle communication,Medium access control,Dynamic allocation
Resource management,Exponential function,Aloha,Computer science,Computer network,Real-time computing,Digital Signature Algorithm,Ranging,Throughput,Dynamic priority scheduling,Exponential growth
Conference
ISSN
Citations 
PageRank 
1930-529X
1
0.38
References 
Authors
2
2
Name
Order
Citations
PageRank
Nesreen Alsbou121.47
Hazem H. Refai226535.24