Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2018 | public
Journal Article

Data Dissemination using Instantly Decodable Binary Codes in Fog-Radio Access Networks

Abstract

This paper considers a device-to-device (D2D) fogradio access network wherein a set of users are required to store/receive a set of files. The D2D devices are connected to a subset of the cloud data centers and thus possess a subset of the data. This paper is interested in reducing the total time of communication, i.e., the completion time, required to disseminate all files among all devices using instantly decodable network coding (IDNC). Unlike previous studies that assume a fully connected communication network, this paper tackles the more realistic scenario of a partially connected network in which devices are not all in the transmission range of one another. The joint optimization of selecting the transmitting device(s) and the file combination(s) is first formulated, and its intractability is exhibited. The completion time is approximated using the celebrated decoding delay approach by deriving the relationship between the quantities in a partially connected network. The paper introduces the cooperation graph and demonstrates that the problem is equivalent to a maximum weight clique problem over the newly designed graph. Extensive simulations reveal that the proposed solution provides noticeable performance enhancement and outperforms previously proposed IDNC-based schemes.

Additional Information

© 2018 IEEE. Manuscript received June 21, 2017; revised November 16, 2017; accepted January 14, 2018. Date of publication January 23, 2018; date of current version May 15, 2018. This paper [1] was presented at the Proceedings of International Wireless Communications and Mobile Computing Conference (IWCMC' 2017), Valencia, Spain.

Additional details

Created:
August 21, 2023
Modified:
October 18, 2023