Abstract
In Packet Reservation Multiple Access (PRMA), the base station broadcasts an acknowledgment message after every slot. The terminals listen to this acknowledgment and immediately learn the result of their transmission (if any) and the status (available/reserved) of that slot. This requires all terminals to listen to acknowledgments in all slots. Here we consider a variant of this scheme, Frame Reservation Multiple Access (FRMA), where the base station broadcasts the acknowledgments for all the slots in a frame at the end of the frame. This results in reduced receiver activity, something that is commonly achieved in TDMA. This system has been modeled as a Markov chain and a precise analysis of its performance, in terms of packet dropping, is presented. Along with analysis of the fixed permission probability scheme, where all the terminals use a fixed value for the permission probability, we propose an adaptive permission probability scheme where the permission probability is chosen depending on the number of reserved slots at the beginning of a frame. The permission probabilities that minimize packet dropping have also been computed by solving a non-linear programming problem.
| Original language | English (US) |
|---|---|
| Pages | 26-30 |
| Number of pages | 5 |
| State | Published - 1994 |
| Event | Proceedings of the 1994 3rd Annual International Conference on Universal Personal Communications - San Diego, CA, USA Duration: Sep 27 1994 → Oct 1 1994 |
Other
| Other | Proceedings of the 1994 3rd Annual International Conference on Universal Personal Communications |
|---|---|
| City | San Diego, CA, USA |
| Period | 9/27/94 → 10/1/94 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture