Deadline-Aware Cooperative Data Exchange with Network Coding

• 1、 School of Computer and Information, Hefei University of Technology, Hefei, 230009
• 2、 College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016

Abstract：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. We then theoretically derive the upper and lower bounds of the number of packets timely received at the clients with the proposed schemes, when the deadline of all the packets is the same. Furthermore, we 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.

Keywords： network coding cooperative data exchange time-critical application