Instantly Decodable Network Coding for Completion Time or Decoding Delay Reduction in Cooperative Data Exchange Systems

In this paper, the authors investigate the use of instantly decodable network coding (IDNC) for improving two fundamental performance metrics, namely, the completion time (as a measure of throughput) and mean decoding delay, in multicast cooperative data exchange (CDE) systems, where a group of geographically close clients cooperate with each other to obtain their missing packets. Here, an IDNC scheme is used for the transmissions across these clients. The authors utilize the stochastic shortest path (SSP) technique to study the minimum mean completion time problem. However, since finding the optimum solution is intractable, The authors use the obtained formulation to draw some theoretical guidelines to heuristically find solutions that can efficiently reduce the completion time. Second, the authors formulate the minimum mean decoding delay problem as selecting the appropriate maximal clique over well-structured graphs at the clients, and in order to reduce its complexity, the authors propose a simple heuristic algorithm for it. The effectiveness of the proposed algorithms is verified through extensive simulations and comparisons with existing techniques.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01597918
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 15 2016 10:47AM