Dynamic Power Control for Delay-Optimal Coded Edge Computing

被引:1
作者
Geng, Dongqing [1 ]
He, Xiaofan [1 ]
Jin, Richeng [2 ]
Dai, Huaiyu [3 ]
机构
[1] Wuhan Univ, Elect Informat Sch, Wuhan 430072, Peoples R China
[2] Zhejiang Univ, Coll Informat Sci & Elect Engn, Hangzhou 310058, Peoples R China
[3] North Carolina State Univ, Dept Elect & Comp Engn, Raleigh, NC 27695 USA
基金
中国国家自然科学基金;
关键词
Task analysis; Edge computing; Power control; Mobile handsets; Wireless communication; Encoding; Signal to noise ratio; Coded computing; distributed edge computing; dynamic power control; lyapunov optimization; TRANSMISSION; REPLICATION; LATENCY;
D O I
10.1109/TWC.2023.3307140
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Coded edge computing is envisioned as a promising solution to cope with the ever-increasing large-scale and computation-intensive mobile applications. Besides alleviating the computation straggling issue, task encoding in coded edge computing is also beneficial to the transmission of computation results. Nonetheless, existing pioneering works in this direction mainly take an information-theoretical perspective and assume the ideal scenarios of high signal-to-noise ratio. To the best of our knowledge, the issue of power control still remains largely unexplored for coded edge computing. In this work, two novel power control schemes are developed for coded edge computing in dynamic wireless environments, which apply to the repetition encoded task computing and the general linearly encoded task computing, respectively. However, the corresponding optimization problems turn out to be non-convex and highly non-trivial. To this end, by exploiting the underlying structural property, a novel partition-based iterative optimization method is developed to obtain the closed-form expression of the optimal dynamic power control strategy for repetition encoded task computing. For the case of more general linearly encoded task computing, the corresponding problem is transformed into a sum-of-ratio problem and then solved iteratively. Simulations are conducted to corroborate the effectiveness of the proposed schemes.
引用
收藏
页码:3283 / 3297
页数:15
相关论文
共 39 条
  • [1] Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
    Bitar, Rawad
    Parag, Parimal
    El Rouayheb, Salim
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (08) : 4609 - 4619
  • [2] Boyd S., 2004, Convex Optimization, DOI [10.1017/CBO9780511804441, DOI 10.1017/CBO9780511804441]
  • [3] Adaptive Gradient Coding
    Cao, Hankun
    Yan, Qifa
    Tang, Xiaohu
    Han, Guojun
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2022, 30 (02) : 717 - 734
  • [4] On the Lambert W function
    Corless, RM
    Gonnet, GH
    Hare, DEG
    Jeffrey, DJ
    Knuth, DE
    [J]. ADVANCES IN COMPUTATIONAL MATHEMATICS, 1996, 5 (04) : 329 - 359
  • [5] Joint Computation Offloading and User Association in Multi-Task Mobile Edge Computing
    Dai, Yueyue
    Xu, Du
    Maharjan, Sabita
    Zhang, Yan
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (12) : 12313 - 12325
  • [6] On the Optimal Recovery Threshold of Coded Matrix Multiplication
    Dutta, Sanghamitra
    Fahim, Mohammad
    Haddadpour, Farzin
    Jeong, Haewon
    Cadambe, Viveck
    Grover, Pulkit
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) : 278 - 301
  • [7] "Short-Dot": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products
    Dutta, Sanghamitra
    Cadambe, Viveck
    Grover, Pulkit
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (10) : 6171 - 6193
  • [8] Dutta S, 2017, IEEE INT SYMP INFO, P2403, DOI 10.1109/ISIT.2017.8006960
  • [9] Geng Dongqing, 2022, 2022 IEEE Globecom Workshops (GC Wkshps), P1109, DOI 10.1109/GCWkshps56602.2022.10008758
  • [10] A Coded Distributed Computing Framework for Task Offloading from Multi-UAV to Edge Servers
    Guo, Yunkai
    Gu, Shushi
    Zhang, Qinyu
    Zhang, Ning
    Xiang, Wei
    [J]. 2021 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2021,