Mobile Communications, Computing and Caching Resources Optimization for Coded Caching with Device Computing

Li Yingjiao
Li Yingjiao
Chen Zhiyong
Chen Zhiyong
Cited by: 0|Bibtex|Views15
Other Links: arxiv.org
Weibo:
We prove the convergence of the computation programming problem by utilizing the alternating direction method of multipliers, and a stationary point can be obtained

Abstract:

Edge caching and computing have been regarded as an efficient approach to tackle the wireless spectrum crunch problem. In this paper, we design a general coded caching with device computing strategy for content computation, e.g., virtual reality (VR) rendering, to minimize the average transmission bandwidth with the caching capacity and...More

Code:

Data:

0
Introduction
  • Bandwidth saving is an eternal topic in wireless communications systems, especially in the era of shortage of wireless spectrum resource.
  • Let N ⊆ F denote the set of computation tasks that are decided to be coded cached in each mobile device, i.e., cn = 1, for all n ∈ N .
  • The input data of the computation tasks A, B, C is coded cached at each mobile device and N = F {A, B, C} where N = |F| = 3, that is c = {1, 1, 1} and d = 1.
Highlights
  • Bandwidth saving is an eternal topic in wireless communications systems, especially in the era of shortage of wireless spectrum resource
  • Bandwidth requirement in the wireless network has been greatly spurred by broadband applications and services, such as the immersive panoramic virtual reality (VR) video, high definition holographic gaming, and 8K/16K ultra-high definition video [1]
  • The above studies reveal that the edge caching, e.g., at a base station (BS) or the mobile devices, has been regarded as a key enabling technology in future wireless networks to tackle the wireless spectrum crunch problem
  • This paper proposes a coded caching with device computing strategy to minimize the average bandwidth consumption subject to the caching size and the energy of the mobile device, as well as the delay constraints
  • The alternating direction method of multipliers (ADMM) algorithm is used to solve the computation programming, and we prove that the nonconvex problem can converge on monotropic program based on alternating direction method of multipliers, a stationary point of the computation programming is obtained
  • Let N ⊆ F denote the set of computation tasks that are decided to be coded cached in each mobile device, i.e., cn = 1, for all n ∈ N
Results
  • The mobile device k requests a computation task whose input data has been coded cached and decides to compute locally.
  • Similar to Case 3,the task f in the mobile device k is computed by the MEC server, and has not been coded cached.
  • Define BqI as the achievable bandwidth in the task request state Sq when the input data is decided to be coded cached, i.e., d = 1, and the expression is as follows
  • Traditional Transmission: In the case, BS only multicasts the entire output data of a task to MDs, without using the caching and computing capability of MDs. Fig.
  • It shows the proposed scheme achieves minimum bandwidth consumption over the baselines by making full use of the caching and computing resources of the mobile devices.
  • The authors can see from Fig. 3 that even if the mobile device does not have the caching ability, i.e., C = 0, the proposed scheme can save the bandwidth compared with the traditional transmission scheme by using the local computing.
  • Similar to [5], Fig. 5 evaluates the coded gain of the proposed scheme, compared with the uncoded caching with device computing scheme which the entire input data or the entire output data of a task is cached in a MD.
Conclusion
  • The authors have studied the problem of how to save the average transmission bandwidth by exploiting the caching and computing resources of MDs in the MEC system.
  • A coded caching with device computing strategy is proposed to minimize the average bandwidth under the delay of the computation tasks, the cache size and the average energy consumption of MDs. The formulated problem is a large-scale mix integer nonconvex and nonsmooth programming when the numbers of MDs and computation tasks get larger.
  • There is no mobile device that requests the coded cached task when M q = 0, and the data size of coded multicast transmission is zero, i.e., bq (c, x) = 0.
Summary
  • Bandwidth saving is an eternal topic in wireless communications systems, especially in the era of shortage of wireless spectrum resource.
  • Let N ⊆ F denote the set of computation tasks that are decided to be coded cached in each mobile device, i.e., cn = 1, for all n ∈ N .
  • The input data of the computation tasks A, B, C is coded cached at each mobile device and N = F {A, B, C} where N = |F| = 3, that is c = {1, 1, 1} and d = 1.
  • The mobile device k requests a computation task whose input data has been coded cached and decides to compute locally.
  • Similar to Case 3,the task f in the mobile device k is computed by the MEC server, and has not been coded cached.
  • Define BqI as the achievable bandwidth in the task request state Sq when the input data is decided to be coded cached, i.e., d = 1, and the expression is as follows
  • Traditional Transmission: In the case, BS only multicasts the entire output data of a task to MDs, without using the caching and computing capability of MDs. Fig.
  • It shows the proposed scheme achieves minimum bandwidth consumption over the baselines by making full use of the caching and computing resources of the mobile devices.
  • The authors can see from Fig. 3 that even if the mobile device does not have the caching ability, i.e., C = 0, the proposed scheme can save the bandwidth compared with the traditional transmission scheme by using the local computing.
  • Similar to [5], Fig. 5 evaluates the coded gain of the proposed scheme, compared with the uncoded caching with device computing scheme which the entire input data or the entire output data of a task is cached in a MD.
  • The authors have studied the problem of how to save the average transmission bandwidth by exploiting the caching and computing resources of MDs in the MEC system.
  • A coded caching with device computing strategy is proposed to minimize the average bandwidth under the delay of the computation tasks, the cache size and the average energy consumption of MDs. The formulated problem is a large-scale mix integer nonconvex and nonsmooth programming when the numbers of MDs and computation tasks get larger.
  • There is no mobile device that requests the coded cached task when M q = 0, and the data size of coded multicast transmission is zero, i.e., bq (c, x) = 0.
Reference
  • C. V. N. Index, “global mobile data traffic forecast update, 2017–2022,” Cisco White paper, 2019.
    Google ScholarLocate open access versionFindings
  • E. Bastug, M. Bennis, M. Medard, and M. Debbah, “Toward interconnected virtual reality: Opportunities, challenges, and enablers,” IEEE Communications Magazine, vol. 55, no. 6, pp. 110–117, June 2017.
    Google ScholarLocate open access versionFindings
  • H. Liu, Z. Chen, and L. Qian, “The three primary colors of mobile systems,” IEEE Commun. Mag., vol. 54, no. 9, pp. 15–21, Sep. 2016.
    Google ScholarLocate open access versionFindings
  • G. S. Paschos, G. Iosifidis, M. Tao, D. Towsley, and G. Caire, “The role of caching in future communication systems and networks,” IEEE Journal on Selected Areas in Communications, vol. 36, no. 6, pp. 1111–1125, June 2018.
    Google ScholarLocate open access versionFindings
  • M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2856–2867, May 2014.
    Google ScholarLocate open access versionFindings
  • C. Yang, Y. Yao, Z. Chen, and B. Xia, “Analysis on cache-enabled wireless heterogeneous networks,” IEEE Trans. Wireless Commun., vol. 15, no. 1, pp. 131–145, Jan 2016.
    Google ScholarLocate open access versionFindings
  • Y. Sun, Z. Chen, M. Tao, and H. Liu, “Communications, caching, and computing for mobile virtual reality: Modeling and tradeoff,” IEEE Transactions on Communications, vol. 67, no. 11, pp. 7573–7586, Nov 2019.
    Google ScholarLocate open access versionFindings
  • X. Yang, Z. Chen, K. Li, Y. Sun, N. Liu, W. Xie, and Y. Zhao, “Communication-constrained mobile edge computing systems for wireless virtual reality: Scheduling and tradeoff,” IEEE Access, vol. 6, pp. 16 665–16 677, 2018.
    Google ScholarLocate open access versionFindings
  • Y. Sun, Z. Chen, M. Tao, and H. Liu, “Bandwidth gain from mobile edge computing and caching in wireless multicast systems,” to appear in IEEE Trans. Wireless Commun., arxiv.org/abs/1901.09738, 2019.
    Findings
  • J. Zhang, X. Lin, and X. Wang, “Coded caching under arbitrary popularity distributions,” IEEE Transactions on Information Theory, vol. 64, no. 1, pp. 349–366, Jan 2018.
    Google ScholarLocate open access versionFindings
  • M. A. Maddah-Ali and U. Niesen, “Decentralized coded caching attains order-optimal memory-rate tradeoff,” IEEE/ACM Transactions on Networking, vol. 23, no. 4, pp. 1029–1040, Aug 2015.
    Google ScholarLocate open access versionFindings
  • T. Luo, V. Aggarwal, and B. Peleato, “Coded caching with distributed storage,” IEEE Transactions on Information Theory, vol. 65, no. 12, pp. 7742–7755, Dec 2019.
    Google ScholarLocate open access versionFindings
  • K. Li, C. Yang, Z. Chen, and M. Tao, “Optimization and analysis of probabilistic caching in n -tier heterogeneous networks,” IEEE Trans. Wireless Commun., vol. 17, no. 2, pp. 1283–1297, Feb 2018.
    Google ScholarLocate open access versionFindings
  • M. Ji, G. Caire, and A. F. Molisch, “The throughput-outage tradeoff of wireless one-hop caching networks,” IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6833–6859, Dec 2015.
    Google ScholarLocate open access versionFindings
  • T. D. Tran, T. D. Hoang, and L. B. Le, “Caching for heterogeneous small-cell networks with bandwidth allocation and caching-aware bs association,” IEEE Wireless Communications Letters, vol. 8, no. 1, pp. 49–52, Feb 2019.
    Google ScholarLocate open access versionFindings
  • B. P. Rimal, D. P. Van, and M. Maier, “Cloudlet enhanced fiber-wireless access networks for mobile-edge computing,” IEEE Transactions on Wireless Communications, vol. 16, no. 6, pp. 3601–3618, 2017.
    Google ScholarLocate open access versionFindings
  • C. You, K. Huang, H. Chae, and B. Kim, “Energy-efficient resource allocation for mobile-edge computation offloading,” IEEE Trans. Wireless Commun., vol. 16, no. 3, pp. 1397–1411, March 2017.
    Google ScholarLocate open access versionFindings
  • C. You, K. Huang, and H. Chae, “Energy efficient mobile cloud computing powered by wireless energy transfer,” IEEE Journal on Selected Areas in Communications, vol. 34, no. 5, pp. 1757–1771, May 2016.
    Google ScholarLocate open access versionFindings
  • Y. Liu, J. Liu, A. Argyriou, and S. Ci, “Mec-assisted panoramic vr video streaming over millimeter wave mobile networks,” IEEE Transactions on Multimedia, vol. 21, no. 5, pp. 1302–1316, 2018.
    Google ScholarLocate open access versionFindings
  • M. S. Elbamby, C. Perfecto, M. Bennis, and K. Doppler, “Edge computing meets millimeter-wave enabled vr: Paving the way to cutting the cord,” in 2018 IEEE Wireless Communications and Networking Conference (WCNC), April 2018, pp. 1–6.
    Google ScholarLocate open access versionFindings
  • J. Park, P. Popovski, and O. Simeone, “Minimizing latency to support vr social interactions over wireless cellular systems via bandwidth allocation,” IEEE Wireless Communications Letters, vol. 7, no. 5, pp. 776–779, Oct 2018.
    Google ScholarLocate open access versionFindings
  • X. Yang, Z. Fei, J. Zheng, N. Zhang, and A. Anpalagan, “Joint multi-user computation offloading and data caching for hybrid mobile cloud/edge computing,” IEEE Transactions on Vehicular Technology, vol. 68, no. 11, pp. 11 018–11 030, Nov 2019.
    Google ScholarLocate open access versionFindings
  • A. P. Miettinen and J. K. Nurminen, “Energy efficiency of mobile clients in cloud computing,” in Usenix Conference on Hot Topics in Cloud Computing, 2010.
    Google ScholarLocate open access versionFindings
  • W. Yuan and K. Nahrstedt, “Energy-efficient cpu scheduling for multimedia applications,” Acm Transactions on Computer Systems, vol. 24, no. 3, pp. 292–331, 2006.
    Google ScholarLocate open access versionFindings
  • T. D. Burd and R. W. Brodersen, “Processor design for portable systems,” Journal of VLSI signal processing systems for signal, image and video technology, vol. 13, no. 2, pp. 203–221, Aug 1996. [Online]. Available: https://doi.org/10.1007/BF01130406
    Locate open access versionFindings
  • G. T. 36.213, “Evolved universal terrestrial radio access (e-utra) physical layer procedures (release 15),” version 15.2.0, Oct. 2018.
    Google ScholarFindings
  • J. R. Birge and F. Louveaux, Introduction to stochastic programming. Springer Science & Business Media, 2011.
    Google ScholarFindings
  • B. Dai, Y. Liu, and W. Yu, “Optimized base-station cache allocation for cloud radio access network with multicast backhaul,” IEEE Journal on Selected Areas in Communications, vol. 36, no. 8, pp. 1737–1750, Aug 2018.
    Google ScholarLocate open access versionFindings
  • A. H. Land and A. G. Doig, “An automatic method of solving discrete programming problems,” Econometrica, vol. 28, no. 3, pp. 497–520, 1960. [Online]. Available: http://www.jstor.org/stable/1910129
    Locate open access versionFindings
  • J. E. Kelley, Jr, “The cutting-plane method for solving convex programs,” Journal of the society for Industrial and Applied Mathematics, vol. 8, no. 4, pp. 703–712, 1960.
    Google ScholarLocate open access versionFindings
  • M. De Santis, “Continuous approaches to mixed integer programming problems,” 2012.
    Google ScholarFindings
  • W. Murray and K.-M. Ng, “An algorithm for nonlinear optimization problems with binary variables,” Computational Optimization and Applications, vol. 47, no. 2, pp. 257–288, 2010.
    Google ScholarLocate open access versionFindings
  • S. Lucidi and F. Rinaldi, “Exact penalty functions for nonlinear integer programming problems,” Journal of optimization theory and applications, vol. 145, no. 3, pp. 479–488, 2010.
    Google ScholarLocate open access versionFindings
  • M. De Santis, “Continuous approaches to mixed integer programming problems,” 2012.
    Google ScholarFindings
  • Y. Wang, W. Yin, and J. Zeng, “Global convergence of admm in nonconvex nonsmooth optimization,” Journal of Scientific Computing, vol. 78, no. 1, pp. 29–63, 2019.
    Google ScholarLocate open access versionFindings
  • H. A. Le Thi, T. P. Dinh, and H. Van Ngai, “Exact penalty and error bounds in dc programming,” Journal of Global Optimization, vol. 52, no. 3, pp. 509–535, 2012.
    Google ScholarLocate open access versionFindings
  • S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein et al., “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine learning, vol. 3, no. 1, pp. 1–122, 2011.
    Google ScholarLocate open access versionFindings
  • A. L. Yuille and A. Rangarajan, “The concave-convex procedure (cccp),” in Advances in neural information processing systems, 2002, pp. 1033–1040.
    Google ScholarFindings
Full Text
Your rating :
0

 

Tags
Comments