Coding for Distributed Fog Computing in Internet of Mobile Things

被引:18
作者
Yue, Jing [1 ]
Xiao, Ming [2 ]
机构
[1] RISE Res Inst Sweden, Reliable Wireless Lab, S-22370 Lund, Sweden
[2] KTH Royal Inst Technol, Sch Elect Engn & Comp Sci, Devis Informat Sci & Engn, S-11428 Stockholm, Sweden
关键词
Mobile handsets; Servers; Edge computing; Task analysis; Encoding; Complexity theory; Internet of mobile things; distributed fog computing; MapReduce; fountain codes; processing time and latency; DISTANCE; CODES;
D O I
10.1109/TMC.2019.2963668
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Internet of Mobile Things (IoMTs) refers to the interconnection of mobile devices, for example, mobile phones, vehicles, robots, etc. For mobile data, strong extra processing resources are normally required due to the limited physical resources of the mobile devices in IoMTs. Due to latency or bandwidth limitations, it may be infeasible to transfer a large amounts of mobile data to remote server for processing. Thus, distributed computing is one of the potential solutions to overcome these limitations. We consider the device mobility in IoMTs. Two situations of the movement position of the mobile devices, i.e., unpredictable and predictable, are considered. In addition, three possible relative positions between the two server sets which respectively correspond to the positions of a mobile device for computation tasks offloading and for output results receiving, i.e., within the same server sets, with two different server sets and with two adjacent server sets, are studied. Coded schemes with high flexibility and low complexity are proposed based on Fountain codes to reduce the total processing time and latency of the distributed fog computing process in IoMTs for the above different situations. The latency related performance, i.e., the computation, the communication and the transmission loads, is analyzed. We also compare of the Fountain code-based and the uncoded schemes and numerical results demonstrate that shorter total processing time and lower latency can be achieved by the Fountain code-based schemes.
引用
收藏
页码:1337 / 1350
页数:14
相关论文
共 39 条
  • [1] [Anonymous], 2017, ARXIV161203301V2
  • [2] [Anonymous], 2015, CISCO VISUAL NETWORK, P1
  • [3] Avestimehr A, 2017, P IEEE FOG WORLD C F, P1
  • [4] Avestimehr A. S, 2018, ARXIV180107487V2
  • [5] An Aloha protocol for multihop mobile wireless networks
    Baccelli, F
    Blaszczyszyn, B
    Mühlethaler, P
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) : 421 - 436
  • [6] Byers J. W., 1998, Computer Communication Review, V28, P56, DOI 10.1145/285243.285258
  • [7] Cabrera GJA, 2016, INT SYM WIRELESS COM, P188, DOI 10.1109/ISWCS.2016.7600898
  • [8] Mapreduce: Simplified data processing on large clusters
    Dean, Jeffrey
    Ghemawat, Sanjay
    [J]. COMMUNICATIONS OF THE ACM, 2008, 51 (01) : 107 - 113
  • [9] Ferdinand N, 2018, IEEE INT SYMP INFO, P1620, DOI 10.1109/ISIT.2018.8437473
  • [10] Halbawi W, 2018, IEEE INT SYMP INFO, P2027, DOI 10.1109/ISIT.2018.8437467