Offloading Hard-Deadline Constrained Traffic in Multi-Flow Interference-Aware Cellular Systems

Ahmed Ewaisha, Cihan Tepedelenlioglu

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

Abstract

We consider a single BS serving G groups (flows) of users each with N real-time (RT) users. Each group is requesting to download some data by a hard-deadline at the end of a T -slot-frame. In addition, the BS is serving multiple non-real-time (NRT) users with no deadlines. The problem is to schedule the BS's transmission to the RT and NRT users to maximize the network's sum throughput, for users that are cooperating in the presence of interference. We present a scheduler with complexity of O(G2), where G is the number of RT groups in the system, and show it is throughput-optimal. Then we present extensive simulations to validate our findings.

Original languageEnglish (US)
Title of host publicationConference Record of the 54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020
EditorsMichael B. Matthews
PublisherIEEE Computer Society
Pages873-877
Number of pages5
ISBN (Electronic)9780738131269
DOIs
StatePublished - Nov 1 2020
Event54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020 - Pacific Grove, United States
Duration: Nov 1 2020Nov 5 2020

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
Volume2020-November
ISSN (Print)1058-6393

Conference

Conference54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020
Country/TerritoryUnited States
CityPacific Grove
Period11/1/2011/5/20

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Offloading Hard-Deadline Constrained Traffic in Multi-Flow Interference-Aware Cellular Systems'. Together they form a unique fingerprint.

Cite this