A channel-state-dependent bandwidth allocation scheme for integrated isochronous and bursty media data in a cellular mobile information system

V. K.N. Lau, Y. K. Kwok

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper, we introduce a novel bandwidth allocation protocol for integrated wireless isochronous (e.g., voice) and bursty (e.g., file data) media data services on the uplink channel in a cellular mobile information system. The proposed protocol is TDMA based and the uplink frame is divided into two subframes: a request subframe and an information subframe. Our scheme, called CHARISMA (Channel Adaptive Reservation-based Isochronous Multiple Access), works by first gathering users' request via the mini-slots in the request subframe and then decides on the allocation of the information slots in the information subframe based on the channel states ranking of the mobile users. The merit of the CHARISMA protocol is that the precious bandwidth can be utilized more effectively because mobile terminals having good channel states can enjoy a higher throughput and a lower transmission error probability. The multiple access performance of the proposed MAC protocol is compared with traditional TDMA-based MAC algorithms.

Original languageEnglish
Pages524-528
Number of pages5
Publication statusPublished - 2000
Externally publishedYes
Event21st Century Military Communications Conference Proceedings MILCOM 2000 - Los Angeles, CA, United States
Duration: 22 Oct 200025 Oct 2000

Conference

Conference21st Century Military Communications Conference Proceedings MILCOM 2000
Country/TerritoryUnited States
CityLos Angeles, CA
Period22/10/0025/10/00

Keywords

  • Adaptive protocols
  • Bandwidth allocation
  • Cellular networks
  • Channel state
  • Multiple access control

Fingerprint

Dive into the research topics of 'A channel-state-dependent bandwidth allocation scheme for integrated isochronous and bursty media data in a cellular mobile information system'. Together they form a unique fingerprint.

Cite this