Deadline-aware cooperative data exchange with network coding

详细信息    查看全文

• 作者：Yang Sui^a ; ^{yangsui@mail.hfut.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Xiumin Wang ; ^a ; ^{wxiumin@hfut.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Jin Wang^b ; ^{wjin1985@suda.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Lusheng Wang^a ; ^{wanglusheng@hfut.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Saihang Hou^a ; ^{saihanghou@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Cooperative data exchange ; Time critical application ; Network coding
• 刊名：Computer Networks
• 出版年：2016
• 出版时间：14 March 2016
• 年：2016
• 卷：97
• 期：Complete
• 页码：88-97
• 全文大小：969 K

文摘

Recent work shows that Cooperative Data Exchange (CDE) with network coding can significantly improve wireless performance, especially in data exchange scenario. Moreover, wireless networks are now capable of supporting time critical applications, e.g., video streaming. Such time-critical applications usually impose a deadline on the packet reception, i.e., beyond which, the packet is useless or invalid to the users. In this paper, we propose a deadline-aware CDE scheme with network coding, so as to maximize the total number of packets that can be timely received/decoded at wireless clients/devices. We first formulate the problem into an integer programming, and prove that it is NP-hard. For the case when the deadline of the packets is the same, we theoretically analyze the performance of two specific schemes. We then design an efficient heuristic algorithm to solve the general problem, which is based on an auxiliary graph model. Finally, simulation results demonstrate the effectiveness of the proposed scheme.