Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Online Publication Date2017-11-08
Print Publication Date2018-03
Permanent link to this recordhttp://hdl.handle.net/10754/626239
MetadataShow full item record
AbstractOpportunistic network coding (ONC) has shown high potential in enhancing the quality-of-experience (QoE) 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 non-deterministic 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.
CitationShnaiwer Y, Sorour S, Sadeghi P, Aboutorab N, Al-Naffouri TY (2017) Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks. IEEE Transactions on Vehicular Technology: 1–1. Available: http://dx.doi.org/10.1109/TVT.2017.2771416.
SponsorsThis research was funded by a grant from the office of competitive research funding (OCRF) at the King Abdullah University of Science and Technology (KAUST). The work was also supported by the Deanship of Scientific Research (DSR) at King Fahd University of Petroleum and Minerals (KFUPM), Dhahran, Saudi Arabia, through projects EE002355 and KAUST-002.
Showing items related by title, author, creator and subject.
Conflict free network coding for distributed storage networksAl-Habob, Ahmed A.; Sorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo (2015 IEEE International Conference on Communications (ICC), Institute of Electrical and Electronics Engineers (IEEE), 2015-06) [Conference Paper]© 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side information, IDNC can speed up the current download process. However, transmission conflicts can occur since multiple servers can simultaneously send IDNC combinations of files to the same client, which can tune to only one of them at a time. To avoid such conflicts and design more efficient coded download patterns, we propose a dual conflict IDNC graph model, which extends the conventional IDNC graph model in order to guarantee conflict free server transmissions to each of the clients. We then formulate the download time minimization problem as a stochastic shortest path problem whose action space is defined by the independent sets of this new graph. Given the intractability of the solution, we design a channel-aware heuristic algorithm and show that it achieves a considerable reduction in the file download time, compared to applying the conventional IDNC approach separately at each of the servers.
Near-optimal Downlink precoding of a MISO system for a secondary network under the SINR constraints of a primary networkPark, Kihong; Alouini, Mohamed-Slim (2013 IEEE Wireless Communications and Networking Conference (WCNC), Institute of Electrical and Electronics Engineers (IEEE), 2013-04) [Conference Paper]In this paper, we study a multiple-input single-output cognitive radio (CR) system where only the primary base station (BS) has multiple antennas. We consider a rate maximization problem of the secondary network under signal-to-interference-plus-noise-ratio constraints on the primary network in order to guarantee the quality-of-service for the latter network. While the interference due to the secondary transmission in the conventional underlay CR approach may severely degrade the performance of the primary network, we propose a primary BS-aided approach in which the primary BS helps relay the secondary users' signals instead of allowing them to communicate with each other via a direct path between them. In addition, an algorithm to find a near-optimal beamforming solution at the primary BS is proposed. Finally, based on some selected numerical results, we show that the proposed scheme outperforms the conventional underlay CR configuration over a wide transmit power range. © 2013 IEEE.
Cross-Layer Cloud Offloading Using Fog Radio Access Networks and Network CodingShnaiwer, Yousef N.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Al-Ghadhban, Samir (2018 IEEE International Conference on Communications Workshops (ICC Workshops), Institute of Electrical and Electronics Engineers (IEEE), 2018-07-05) [Conference Paper]In this work, we propose a cross-layer approach for cloud offloading using network coding enabled fog radio access networks. Exploiting prior popular file downloads by clients, network coding was previously employed to send more efficient coded files from both edge nodes and the cloud, thus achieving further upper-layer offloading gains. The proposed cross-layer approach in this paper extends the study towards achieving actual cloud physical-resource offloading, by considering the download rates of each client from the cloud in the coding-based offloading process. We first formulate the cross- layer cloud offloading problem as an optimization problem over an opportunistic network coding graph, and prove its NP-hardness. We then devise a heuristic algorithm to efficiently solve the problem by dividing it into two subproblems, which are solved sequentially by a greedy vertex search and a sorted greedy coloring algorithms. Simulation results show a superior performance of our proposed cross-layer cloud offloading scheme compared to the traditional upper-layer scheme. Furthermore, the suggested heuristic achieves a close cloud offloading performance to the optimal cross-layer solution.