TY - GEN
T1 - Interference-Aware Offloading of Deadline-Constrained Traffic in High Density Cellular Systems
AU - Ewaisha, Ahmed
AU - Tepedelenlioglu, Cihan
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - We consider one non-real-time (NRT) and N realtime (RT) cellular users interested in downloading delay-tolerant and delay-sensitive packets from the base station (BS), respectively. Each RT packet is a multicast packet and RT user i is satisfied if more than qi% of the data is received before the deadline. At each slot, one of the RT users is allowed to retransmit the data it has received from the BS to its RT neighbors. This reduces the load on the BS but causes interference to the NRT user. The problem is formulated as a joint scheduling and rate-allocation problem. We present a throughput-optimal algorithm that maximizes the NRT rate in this system under interference. Our simulations show that, in high density networks, increasing the number of RT users N in the system improves the NRT user's throughput due to the multi-user diversity effect. We also show that, in low density networks, the throughput is maximized at an optimal value of N.
AB - We consider one non-real-time (NRT) and N realtime (RT) cellular users interested in downloading delay-tolerant and delay-sensitive packets from the base station (BS), respectively. Each RT packet is a multicast packet and RT user i is satisfied if more than qi% of the data is received before the deadline. At each slot, one of the RT users is allowed to retransmit the data it has received from the BS to its RT neighbors. This reduces the load on the BS but causes interference to the NRT user. The problem is formulated as a joint scheduling and rate-allocation problem. We present a throughput-optimal algorithm that maximizes the NRT rate in this system under interference. Our simulations show that, in high density networks, increasing the number of RT users N in the system improves the NRT user's throughput due to the multi-user diversity effect. We also show that, in low density networks, the throughput is maximized at an optimal value of N.
UR - http://www.scopus.com/inward/record.url?scp=85083321804&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85083321804&partnerID=8YFLogxK
U2 - 10.1109/IEEECONF44664.2019.9048946
DO - 10.1109/IEEECONF44664.2019.9048946
M3 - Conference contribution
AN - SCOPUS:85083321804
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 1842
EP - 1846
BT - Conference Record - 53rd Asilomar Conference on Circuits, Systems and Computers, ACSSC 2019
A2 - Matthews, Michael B.
PB - IEEE Computer Society
T2 - 53rd Asilomar Conference on Circuits, Systems and Computers, ACSSC 2019
Y2 - 3 November 2019 through 6 November 2019
ER -