Scheduling in wireless cellular networks under probabilistic channel information

Aytac Azgin, Marwan M Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

As wireless networks continue to grow, users will be demanding more service diversity and differential quality-of-service (QoS). At the packet level, differential QoS is met by means of scheduling for channel access. Several algorithms have been proposed for packet scheduling over the wireless link. The main consideration in the design of these algorithms is the characteristics of the wireless channel. Previous works used a two-state Markov model to characterize the channel and design the scheduling algorithm. This coarse approximation can lead to a considerable amount of inaccuracy in the expected user performance, i.e., when implemented under realistic channel conditions the algorithm may not perform as expected. In this paper, we propose a scheduling algorithm and an associated MAC scheme that enable operation under realistic channel conditions. We use an JV-state Markov model to characterize the channel, where N > 2. The channel characteristics are incorporated into the scheduler through the use of future channel estimates, making the scheduler more immune to channel variations. Our scheme allows for adaptive FEC, whereby the code rate varies according to the forecasted channel state. Comparisons between the proposed algorithm and wireless fair service (WFS) S. Lu et al., (1998) show that the proposed algorithm gives better results in terms of both throughput and delay, while preserving the fairness characteristics. It is also shown that the proposed algorithm is more stable under variations in mobility and network load. Furthermore, by being able to significantly reduce the number of retransmissions, the proposed algorithm makes better utilization of the channel bandwidth and reduces the energy consumed in delivering a packet.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Computer Communications and Networks, ICCCN
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages89-94
Number of pages6
Volume2003-January
ISBN (Print)0780379454
DOIs
StatePublished - 2003
Event12th IEEE International Conference on Computer Communications and Networks, ICCCN 2003 - Dallas, United States
Duration: Oct 20 2003Oct 22 2003

Other

Other12th IEEE International Conference on Computer Communications and Networks, ICCCN 2003
CountryUnited States
CityDallas
Period10/20/0310/22/03

Fingerprint

Scheduling
Scheduling algorithms
Quality of service
Telecommunication links
Wireless networks
Throughput
Bandwidth

Keywords

  • Algorithm design and analysis
  • Bandwidth
  • Delay
  • Fading
  • Intelligent networks
  • Job shop scheduling
  • Land mobile radio cellular systems
  • Scheduling algorithm
  • Throughput
  • Wireless networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Azgin, A., & Krunz, M. M. (2003). Scheduling in wireless cellular networks under probabilistic channel information. In Proceedings - International Conference on Computer Communications and Networks, ICCCN (Vol. 2003-January, pp. 89-94). [1284154] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCN.2003.1284154

Scheduling in wireless cellular networks under probabilistic channel information. / Azgin, Aytac; Krunz, Marwan M.

Proceedings - International Conference on Computer Communications and Networks, ICCCN. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. p. 89-94 1284154.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Azgin, A & Krunz, MM 2003, Scheduling in wireless cellular networks under probabilistic channel information. in Proceedings - International Conference on Computer Communications and Networks, ICCCN. vol. 2003-January, 1284154, Institute of Electrical and Electronics Engineers Inc., pp. 89-94, 12th IEEE International Conference on Computer Communications and Networks, ICCCN 2003, Dallas, United States, 10/20/03. https://doi.org/10.1109/ICCCN.2003.1284154
Azgin A, Krunz MM. Scheduling in wireless cellular networks under probabilistic channel information. In Proceedings - International Conference on Computer Communications and Networks, ICCCN. Vol. 2003-January. Institute of Electrical and Electronics Engineers Inc. 2003. p. 89-94. 1284154 https://doi.org/10.1109/ICCCN.2003.1284154
Azgin, Aytac ; Krunz, Marwan M. / Scheduling in wireless cellular networks under probabilistic channel information. Proceedings - International Conference on Computer Communications and Networks, ICCCN. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. pp. 89-94
@inproceedings{d38f000e0d31467e96cfb32842c2190d,
title = "Scheduling in wireless cellular networks under probabilistic channel information",
abstract = "As wireless networks continue to grow, users will be demanding more service diversity and differential quality-of-service (QoS). At the packet level, differential QoS is met by means of scheduling for channel access. Several algorithms have been proposed for packet scheduling over the wireless link. The main consideration in the design of these algorithms is the characteristics of the wireless channel. Previous works used a two-state Markov model to characterize the channel and design the scheduling algorithm. This coarse approximation can lead to a considerable amount of inaccuracy in the expected user performance, i.e., when implemented under realistic channel conditions the algorithm may not perform as expected. In this paper, we propose a scheduling algorithm and an associated MAC scheme that enable operation under realistic channel conditions. We use an JV-state Markov model to characterize the channel, where N > 2. The channel characteristics are incorporated into the scheduler through the use of future channel estimates, making the scheduler more immune to channel variations. Our scheme allows for adaptive FEC, whereby the code rate varies according to the forecasted channel state. Comparisons between the proposed algorithm and wireless fair service (WFS) S. Lu et al., (1998) show that the proposed algorithm gives better results in terms of both throughput and delay, while preserving the fairness characteristics. It is also shown that the proposed algorithm is more stable under variations in mobility and network load. Furthermore, by being able to significantly reduce the number of retransmissions, the proposed algorithm makes better utilization of the channel bandwidth and reduces the energy consumed in delivering a packet.",
keywords = "Algorithm design and analysis, Bandwidth, Delay, Fading, Intelligent networks, Job shop scheduling, Land mobile radio cellular systems, Scheduling algorithm, Throughput, Wireless networks",
author = "Aytac Azgin and Krunz, {Marwan M}",
year = "2003",
doi = "10.1109/ICCCN.2003.1284154",
language = "English (US)",
isbn = "0780379454",
volume = "2003-January",
pages = "89--94",
booktitle = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Scheduling in wireless cellular networks under probabilistic channel information

AU - Azgin, Aytac

AU - Krunz, Marwan M

PY - 2003

Y1 - 2003

N2 - As wireless networks continue to grow, users will be demanding more service diversity and differential quality-of-service (QoS). At the packet level, differential QoS is met by means of scheduling for channel access. Several algorithms have been proposed for packet scheduling over the wireless link. The main consideration in the design of these algorithms is the characteristics of the wireless channel. Previous works used a two-state Markov model to characterize the channel and design the scheduling algorithm. This coarse approximation can lead to a considerable amount of inaccuracy in the expected user performance, i.e., when implemented under realistic channel conditions the algorithm may not perform as expected. In this paper, we propose a scheduling algorithm and an associated MAC scheme that enable operation under realistic channel conditions. We use an JV-state Markov model to characterize the channel, where N > 2. The channel characteristics are incorporated into the scheduler through the use of future channel estimates, making the scheduler more immune to channel variations. Our scheme allows for adaptive FEC, whereby the code rate varies according to the forecasted channel state. Comparisons between the proposed algorithm and wireless fair service (WFS) S. Lu et al., (1998) show that the proposed algorithm gives better results in terms of both throughput and delay, while preserving the fairness characteristics. It is also shown that the proposed algorithm is more stable under variations in mobility and network load. Furthermore, by being able to significantly reduce the number of retransmissions, the proposed algorithm makes better utilization of the channel bandwidth and reduces the energy consumed in delivering a packet.

AB - As wireless networks continue to grow, users will be demanding more service diversity and differential quality-of-service (QoS). At the packet level, differential QoS is met by means of scheduling for channel access. Several algorithms have been proposed for packet scheduling over the wireless link. The main consideration in the design of these algorithms is the characteristics of the wireless channel. Previous works used a two-state Markov model to characterize the channel and design the scheduling algorithm. This coarse approximation can lead to a considerable amount of inaccuracy in the expected user performance, i.e., when implemented under realistic channel conditions the algorithm may not perform as expected. In this paper, we propose a scheduling algorithm and an associated MAC scheme that enable operation under realistic channel conditions. We use an JV-state Markov model to characterize the channel, where N > 2. The channel characteristics are incorporated into the scheduler through the use of future channel estimates, making the scheduler more immune to channel variations. Our scheme allows for adaptive FEC, whereby the code rate varies according to the forecasted channel state. Comparisons between the proposed algorithm and wireless fair service (WFS) S. Lu et al., (1998) show that the proposed algorithm gives better results in terms of both throughput and delay, while preserving the fairness characteristics. It is also shown that the proposed algorithm is more stable under variations in mobility and network load. Furthermore, by being able to significantly reduce the number of retransmissions, the proposed algorithm makes better utilization of the channel bandwidth and reduces the energy consumed in delivering a packet.

KW - Algorithm design and analysis

KW - Bandwidth

KW - Delay

KW - Fading

KW - Intelligent networks

KW - Job shop scheduling

KW - Land mobile radio cellular systems

KW - Scheduling algorithm

KW - Throughput

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=51349159270&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51349159270&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.2003.1284154

DO - 10.1109/ICCCN.2003.1284154

M3 - Conference contribution

AN - SCOPUS:51349159270

SN - 0780379454

VL - 2003-January

SP - 89

EP - 94

BT - Proceedings - International Conference on Computer Communications and Networks, ICCCN

PB - Institute of Electrical and Electronics Engineers Inc.

ER -