Abstract

In this work we study the problem of hard-deadline constrained data offloading in cellular networks. A single-Base-Station (BS) single-frequency-channel down-link system is studied where users request the same packet from the BS at the beginning of each time slot. Packets have a hard deadline of one time slot. The slot is divided into two phases. Out of those users having high channel gain allowing them to decode the packet in the first phase, one is chosen to rebroadcast it to the remaining users in the second phase. This gives the remaining users a second opportunity to potentially decode this packet before the deadline passes. By this, the BS has offloaded the packet to a 'local network of users' which eliminates unnecessary BS retransmissions. The problem is modeled as a rate-adaptation and scheduling optimization problem to maximize the duration of this second phase such that each user receives a certain percentage of the packets. We show that the proposed algorithm has a polynomial complexity in the number of users with optimal performance.

Original language

English (US)

Title of host publication

Conference Record of the 52nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2018

abstract = "In this work we study the problem of hard-deadline constrained data offloading in cellular networks. A single-Base-Station (BS) single-frequency-channel down-link system is studied where users request the same packet from the BS at the beginning of each time slot. Packets have a hard deadline of one time slot. The slot is divided into two phases. Out of those users having high channel gain allowing them to decode the packet in the first phase, one is chosen to rebroadcast it to the remaining users in the second phase. This gives the remaining users a second opportunity to potentially decode this packet before the deadline passes. By this, the BS has offloaded the packet to a 'local network of users' which eliminates unnecessary BS retransmissions. The problem is modeled as a rate-adaptation and scheduling optimization problem to maximize the duration of this second phase such that each user receives a certain percentage of the packets. We show that the proposed algorithm has a polynomial complexity in the number of users with optimal performance.",

author = "Ahmed Ewaisha and Cihan Tepedelenlioglu",

year = "2019",

month = "2",

day = "19",

doi = "10.1109/ACSSC.2018.8645151",

language = "English (US)",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "1447--1451",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 52nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2018",

}

TY - GEN

T1 - Offloading Deadline-Constrained Cellular Traffic

AU - Ewaisha, Ahmed

AU - Tepedelenlioglu, Cihan

PY - 2019/2/19

Y1 - 2019/2/19

N2 - In this work we study the problem of hard-deadline constrained data offloading in cellular networks. A single-Base-Station (BS) single-frequency-channel down-link system is studied where users request the same packet from the BS at the beginning of each time slot. Packets have a hard deadline of one time slot. The slot is divided into two phases. Out of those users having high channel gain allowing them to decode the packet in the first phase, one is chosen to rebroadcast it to the remaining users in the second phase. This gives the remaining users a second opportunity to potentially decode this packet before the deadline passes. By this, the BS has offloaded the packet to a 'local network of users' which eliminates unnecessary BS retransmissions. The problem is modeled as a rate-adaptation and scheduling optimization problem to maximize the duration of this second phase such that each user receives a certain percentage of the packets. We show that the proposed algorithm has a polynomial complexity in the number of users with optimal performance.

AB - In this work we study the problem of hard-deadline constrained data offloading in cellular networks. A single-Base-Station (BS) single-frequency-channel down-link system is studied where users request the same packet from the BS at the beginning of each time slot. Packets have a hard deadline of one time slot. The slot is divided into two phases. Out of those users having high channel gain allowing them to decode the packet in the first phase, one is chosen to rebroadcast it to the remaining users in the second phase. This gives the remaining users a second opportunity to potentially decode this packet before the deadline passes. By this, the BS has offloaded the packet to a 'local network of users' which eliminates unnecessary BS retransmissions. The problem is modeled as a rate-adaptation and scheduling optimization problem to maximize the duration of this second phase such that each user receives a certain percentage of the packets. We show that the proposed algorithm has a polynomial complexity in the number of users with optimal performance.