Minimum Number of Transmission Slots in D2D-assisted Wireless Coded Broadcast

被引:0
作者
Zhan, Cheng [1 ]
Wen, Zhe [1 ]
Zhu, Liyue [2 ]
机构
[1] Southwest Univ, Sch Comp & Informat Sci, Chongqing, Peoples R China
[2] SAPPRFT, Acad Broadcasting Sci, Beijing, Peoples R China
来源
2017 IEEE INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP) | 2017年
关键词
NETWORK; DELAY; TIME;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Broadcasting data to multiple users is widely used in wireless applications. We consider a group of mobile users, within proximity of each other, who are interested in the same video content. Network coded broadcast and cooperative coded communication can improve transmission efficiency and throughput over wireless network separately. In this paper we consider the D2D-assisted wireless network coded broadcast problem for users with multiple interfaces to minimize the number of transmission slots. In order to obtain all needed packets, user can receive encoded packet according to cellular link and local cooperative D2D links simultaneously. We analyze the lower bound of number of transmission slots and formulate the problem with integer linear programming(ILP). We also develop heuristic solution for this setup, and simulation results show that our coding scheme significantly reduces the number of transmission slots.
引用
收藏
页码:346 / 351
页数:6
相关论文
共 14 条
  • [1] Enabling a Tradeoff between Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems
    Aboutorab, Neda
    Sadeghi, Parastoo
    Sorour, Sameh
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (04) : 1296 - 1309
  • [2] [Anonymous], 2017, CISC VIS NETW IND GL
  • [3] [Anonymous], P AUSCTW SYDN NSW FE
  • [4] Bar-Yossef Z, 2006, ANN IEEE SYMP FOUND, P197
  • [5] Dynamic Rate Adaptation for Improved Throughput and Delay in Wireless Network Coded Broadcast
    Fu, Amy
    Sadeghi, Parastoo
    Medard, Muriel
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (06) : 1715 - 1728
  • [6] The capacity of wireless networks
    Gupta, P
    Kumar, PR
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 388 - 404
  • [7] Clique is hard to approximate within n(1-epsilon)
    Hastad, J
    [J]. 37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 627 - 636
  • [8] Bandwidth-Efficient Packet Scheduling for Live Streaming With Network Coding
    Huang, Shenglan
    Izquierdo, Ebroul
    Hao, Pengwei
    [J]. IEEE TRANSACTIONS ON MULTIMEDIA, 2016, 18 (04) : 752 - 763
  • [9] Polynomial time algorithms for multicast network code construction
    Jaggi, S
    Sanders, P
    Chou, PA
    Effros, M
    Egner, S
    Jain, K
    Tolhuizen, LMGA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) : 1973 - 1982
  • [10] Keller L., 2012, P ACM MOBISYS LOW WO