On end-to-end scheduling in wireless cellular networks

Walid Saad, Zaher Dawy, Sanaa Sharafeddine

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

1 Citation (Scopus)

Abstract

Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm tor services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.

Original languageEnglish
Title of host publicationIEEE International Symposium on Spread Spectrum Techniques and Applications
Pages502-506
Number of pages5
DOIs
StatePublished - Dec 25 2008
Event2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008 - Bologna, Italy
Duration: Aug 25 2008Aug 28 2008

Other

Other2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008
CountryItaly
CityBologna
Period8/25/088/28/08

Fingerprint

Uplink
Scheduling algorithms
Cellular Networks
Scheduling Algorithm
Wireless Networks
Quality of service
Scheduling
Time-varying Channels
Resource Allocation
Resource allocation
Trade-offs
Resources
Requirements
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Saad, W., Dawy, Z., & Sharafeddine, S. (2008). On end-to-end scheduling in wireless cellular networks. In IEEE International Symposium on Spread Spectrum Techniques and Applications (pp. 502-506). [4621458] https://doi.org/10.1109/ISSSTA.2008.99

On end-to-end scheduling in wireless cellular networks. / Saad, Walid; Dawy, Zaher; Sharafeddine, Sanaa.

IEEE International Symposium on Spread Spectrum Techniques and Applications. 2008. p. 502-506 4621458.

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

Saad, W, Dawy, Z & Sharafeddine, S 2008, On end-to-end scheduling in wireless cellular networks. in IEEE International Symposium on Spread Spectrum Techniques and Applications., 4621458, pp. 502-506, 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008, Bologna, Italy, 8/25/08. https://doi.org/10.1109/ISSSTA.2008.99
Saad W, Dawy Z, Sharafeddine S. On end-to-end scheduling in wireless cellular networks. In IEEE International Symposium on Spread Spectrum Techniques and Applications. 2008. p. 502-506. 4621458 https://doi.org/10.1109/ISSSTA.2008.99
Saad, Walid ; Dawy, Zaher ; Sharafeddine, Sanaa. / On end-to-end scheduling in wireless cellular networks. IEEE International Symposium on Spread Spectrum Techniques and Applications. 2008. pp. 502-506
@inproceedings{757c121738264ad496ad2aa05e1180f2,
title = "On end-to-end scheduling in wireless cellular networks",
abstract = "Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm tor services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.",
author = "Walid Saad and Zaher Dawy and Sanaa Sharafeddine",
year = "2008",
month = "12",
day = "25",
doi = "10.1109/ISSSTA.2008.99",
language = "English",
isbn = "9781424422043",
pages = "502--506",
booktitle = "IEEE International Symposium on Spread Spectrum Techniques and Applications",

}

TY - GEN

T1 - On end-to-end scheduling in wireless cellular networks

AU - Saad, Walid

AU - Dawy, Zaher

AU - Sharafeddine, Sanaa

PY - 2008/12/25

Y1 - 2008/12/25

N2 - Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm tor services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.

AB - Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm tor services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.

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

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

U2 - 10.1109/ISSSTA.2008.99

DO - 10.1109/ISSSTA.2008.99

M3 - Conference contribution

SN - 9781424422043

SP - 502

EP - 506

BT - IEEE International Symposium on Spread Spectrum Techniques and Applications

ER -