Title An Optimal Wireless Packet Scheduling Algorithm to Manage Multiclass Services in Packet Switched Networks Authors

نویسندگان

  • T. Bejaoui
  • V.Vèque
  • S. Tabbane
  • Tarek Bejaoui
  • Véronique Vèque
  • Sami Tabbane
چکیده

This paper introduces a GPRS-like cellular network simulator, where mobile terminals move, initiate and terminate their communications. This tool aims at evaluating the major QoS parameters in realistic propagation conditions and for different resource allocation policies. Our objectives on developping such simulator are first to compare some of existing channel management methods and second, to validate a new optimal scheme of allocating the physical channels to mobile users supporting multimedia applications. Our discrete-event simulation tool takes into account both the time variation of the system and its spatial dimension relating to the users movement and its effect on the signal propagation and the radio link. The system taken into account in this paper is a GPRS-like (i.e. TDMA) one, i.e. voice and data are integrated over Time Division Multiple Access wireless cellular network. In this paper, our scenario has considered three traffic classes : best-effort, medium and premium.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Soft-qos Provisioning Using the Token Bank Fair Queueing Scheduling Algorithm

Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibili...

متن کامل

Soft QoS provisioning using the token bank fair queuing scheduling algorithm

Future-generation wireless packet networks will support multimedia applications with diverse QoS requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibility of the packet-swit...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006