An Efficient Capacity Allocation Scheme of Periodic Polling Services for a Multimedia Traffic in an IEEE802.16 System

Abstract

In this paper, we consider a capacity allocation scheme of periodic polling services for a multimedia traffic in an IEEE802.16 system. In the scheme of our interest, a base station assigns a subscriber station contiguous M uplink subframes for uplink traffic transmission and v vacation frames for saving power and opportunities for other subscriber stations. Among M uplink subframes, the subscriber station returns its remaining frames, when its queue is empty. The returned bandwidth will then be allocated to other subscriber stations. We carry out an analysis on this queueing system, by using a generating function approach. The performance of the proposed capacity allocation scheme is presented in terms of the first moment of queue length, the mean vacation and transmission period. We also compare its performance with that of a deterministic capacity allocation scheme, in which allocated bandwidth would not be returned.

Queueing Behavior of IEEE802.16 Random Access Protocol for Sporadic Data Transmissions

“…In [10]- [11], a10 we have also analyzed a transient and steady state queueing performance of the random access protocol with piggyback mechanism. In contrast to [4]- [11], the various performances of real-time periodic polling service have been also analyzed in [13]- [17].…”

Design and performance analysis of medium access control protocols for QOS in Wimax

“…In paper [28], the authors considered a capacity allocation scheme of periodic polling services for a multimedia traffic in an IEEE 802.16d network.…”