Priority based wireless packet communication with admission and throughput control

This paper proposed PBMA (priority based multiple access) and PBMA-TC (priority based multiple access with throughput control) for mobile communication to meet user´s demands. We define the priority according to the waiting time, which includes request access time and waiting time at the request table. We assumed two grades of priority, high priority and low priority. The former is corresponds to time sensitive traffic, and the latter is to cost sensitive traffic. In PBMA, priority is controlled using an admission limitation (admission control) and the request table. In PBMA-TC, to improve the throughput of a packet of the high priority user more, a collision resolution algorithm (throughput control) is added to PBMA. The collision resolution algorithm is a tree algorithm based on priority. These methods were evaluated by computer simulation. As an example, when the value of throughput for the request access channel is about 0.32, PBMA-TC is twice as average waiting time of a packet of a low priority user as PBMA. In PBMA-TC, the probability of loss of a packet of high priority user is zero due to the throughput control