• Corpus ID: 13468147

AN OVERVIEW OF SCHEDULING ALGORITHMS IN WIRELESS MULTIMEDIA

@inproceedings{Mult2002ANOO,
  title={AN OVERVIEW OF SCHEDULING ALGORITHMS IN WIRELESS MULTIMEDIA},
  author={IP Mult and IN Imedia and GE Next},
  year={2002}
}
Scheduling algorithms are important components in the provision of guaranteed quality of service parameters such as delay, delay jitter, packet loss rate, or throughput. The design of scheduling algorithms for mobile communication networks is especially challenging given the highly variable link error rates and capacities, and the changing mobile station connectivity typically encountered in such networks. This article provides a survey of scheduling techniques for several types of wireless… 

Tables from this paper

Joint Radio Resource Management in Cognitive Networks: TV White Spaces Exploitation Paradigm
TLDR
This book chapter initially provides a state-of-the-art work for existing cognitive radio network architectures, while a reference architecture for commons and secondary TVWS trading is proposed and JRRM concepts for heterogeneous Radio Access Technologies’ extension over TVWS aiming to continuously guarantee the QoS, the network key performance indicators and at the same time targeting the overall highest system capacity are presented.

References

SHOWING 1-10 OF 20 REFERENCES
A slotted CDMA protocol with BER scheduling for wireless multimedia networks
TLDR
A novel medium access control (MAC) protocol called wireless multimedia access control protocol with BER scheduling (in short form, WISPER) for CDMA-based systems is proposed, which utilizes the novel idea of scheduling the transmission of multimedia packets according to their BER requirements.
An optimal topology-transparent scheduling method in multihop packet radio networks
TLDR
This paper compares the proposed algorithm for transmission scheduling with that of Chlamtac and Farago's and with the TDMA algorithm, and finds that the algorithm given gives better performance in terms of minimum throughput and minimum and maximum delay times.
Fair scheduling in wireless packet networks
TLDR
An ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions is described, and the worst-case throughput and delay bounds are derived.
A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms
TLDR
This paper presents a Wireless fair service model that captures the scheduling requirements of wireless scheduling algorithms, and presents a unified wireless fair queueing architecture in which scheduling algorithms can be designed to achieve wireless fair service.
Scheduled CDMA: a hybrid multiple access for wireless ATM networks
  • M. A. Arad, A. Leon-Garcia
  • Business
    Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications
  • 1996
TLDR
A new MAC protocol called scheduled CDMA (SCDMA) is introduced, a hybrid CDMA/TDMA scheme in which the base station schedules transmission of CDMA-based mobile terminals.
A generalized processor sharing approach to time scheduling in hybrid CDMA/TDMA
  • M. A. Arad, A. Leon-Garcia
  • Business
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
TLDR
This paper develops a time scheduling scheme suitable for the class of hybrid CDMA/TDMA systems and studies the implementation of this scheme in a specific hybrid system proposed earlier and addresses its integration with the power control technique.
Quality-of-Service in Packet Networks: Basic Mechanisms and Directions
Service disciplines for guaranteed performance service in packet-switching networks
TLDR
Several service disciplines that are proposed in the literature to provide per-connection end-to-end performance guarantees in packet-switching networks are surveyed and a general framework for studying and comparing these disciplines is presented.
Packet fair queueing algorithms for wireless networks with location-dependent errors
  • T. Ng, I. Stoica, Hui Zhang
  • Computer Science, Business
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
TLDR
This work identifies a set of properties, called channel-condition independent fair (CIF), that a packet fair queueing algorithm should have in a wireless environment and derives a novel algorithm based on start-timeFair queueing, called CIF-Q, that achieves all the above properties.
Power control and resource management for a multimedia CDMA wireless system
TLDR
Borders are developed on the total number of users of each class that can be supported simultaneously while maintaining adequate QoS and meeting resource constraints in future wireless systems.
...
...