TY - JOUR
T1 - Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks
AU - Shnaiwer, Yousef N.
AU - Sorour, Sameh
AU - Sadeghi, Parastoo
AU - Aboutorab, Neda
AU - Al-Naffouri, Tareq Y.
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2018/3
Y1 - 2018/3
N2 - Opportunistic network coding (ONC) has shown high potential in enhancing the quality-of-experience for the clients of cellular networks using their previously downloaded files. In this paper, we study the problem of offloading clients from the macrocell base station (MBS) with the help of femtocaches (FCs) and ONC. We formulate this MBS offloading problem as an optimization problem over an ONC graph, and prove that it is nondeterministic polynomial-time (NP)-hard. Thus, we propose an ONC-broadcast offloading scheme, which utilizes separate ONC graphs at the MBS and FCs in addition to uncoded broadcasting, to offload the clients from the MBS. We analyze the performance of the ONC-broadcast offloading scheme and show that it is asymptotically optimal using random graph theory. Since even this ONC-broadcast offloading scheme is still NP-hard to implement, we devise an efficient heuristic to simplify the implementation. We show that the proposed heuristic reduces the worst case complexity of implementing the ONC-broadcast offloading scheme from an exponential to a quadratic function of the total number of vertices in the FC ONC graph. Simulation results show that, despite its low complexity, the proposed heuristic achieves similar MBS offloading performance to the ONC-broadcast offloading scheme.
AB - Opportunistic network coding (ONC) has shown high potential in enhancing the quality-of-experience for the clients of cellular networks using their previously downloaded files. In this paper, we study the problem of offloading clients from the macrocell base station (MBS) with the help of femtocaches (FCs) and ONC. We formulate this MBS offloading problem as an optimization problem over an ONC graph, and prove that it is nondeterministic polynomial-time (NP)-hard. Thus, we propose an ONC-broadcast offloading scheme, which utilizes separate ONC graphs at the MBS and FCs in addition to uncoded broadcasting, to offload the clients from the MBS. We analyze the performance of the ONC-broadcast offloading scheme and show that it is asymptotically optimal using random graph theory. Since even this ONC-broadcast offloading scheme is still NP-hard to implement, we devise an efficient heuristic to simplify the implementation. We show that the proposed heuristic reduces the worst case complexity of implementing the ONC-broadcast offloading scheme from an exponential to a quadratic function of the total number of vertices in the FC ONC graph. Simulation results show that, despite its low complexity, the proposed heuristic achieves similar MBS offloading performance to the ONC-broadcast offloading scheme.
KW - Femtocaching
KW - conflict graph
KW - macrocell offloading
KW - opportunistic network coding (ONC)
UR - http://www.scopus.com/inward/record.url?scp=85033660725&partnerID=8YFLogxK
U2 - 10.1109/TVT.2017.2771416
DO - 10.1109/TVT.2017.2771416
M3 - Article
SN - 0018-9545
VL - 67
SP - 2644
EP - 2659
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 3
ER -