Efficient radio resource utilization and fairness are important goals that must be achieved since wireless ATM systems support various services with different traffic characteristics such as CBR and UBR. This paper proposes a novel delay-and-queuing data size-based MAC protocol for broadband wireless ATM. The proposed MAC protocol relies on a new resource scheduling algorithm that decides the priority of channel assignment based on both the queuing delay and the queuing data size in the transmission buffer. Simulation results confirm that the proposed MAC protocol is able to provide throughput fairness and to achieve excellent throughput performance for ATM services that experience dynamic traffic fluctuations.

Channel-state-dependent (CSD) radio-resource scheduling algorithms for wireless message transport using a framed ALOHA-reservation access protocol are presented. In future wireless systems that provide Mbps-class high-speed wireless links using high frequencies, burst packet errors, which last a certain number of packets in time, would cause serious performance degradation. CSD resource scheduling algorithms utilize channel-state information for increasing overall throughput. These algorithms were comparatively evaluated in terms of average allocation plus transfer delay, average throughput, variance in throughput, and utilization of resources. Computer simulation results showed that the CSD mechanism has a good effect, especially on equal sharing (ES)-based algorithms, and also CSD-ES provides low allocation plus transfer delay, high average throughput, low variance in throughput, and efficient utilization of radio resources.

This paper presents an object-oriented model to handle the temporal relationship for all of the multimedia objects at the presentation platform. Synchronization of the composite media objects is achieved by ensuring that all objects presented in the upcoming "manageable" period must be ready for execution. To this end, the nature of overlays is first investigated for various types of objects. Critical overlaps which are crucial in synchronization are also defined. The objective of synchronization is to ensure that the media objects can be initiated precisely at the critical point of the corresponding critical overlap. The concept of manageable presentation interval is introduced and the irreducible media group is defined. The resource scheduling of each presentation group for media object pre-fetch time versus buffer occupancy is also examined. Accordingly, a new model called group cascade object composition Petri-net (GCOCPN) is proposed and an algorithm to implement this temporal synchronization scheme is presented.