Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
12 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
37 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Rate Aware Instantly Decodable Network Codes (1504.03985v2)

Published 15 Apr 2015 in cs.IT and math.IT

Abstract: This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications and abstract the model as equally slotted time for all users, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The consideration of asymmetric rates for receivers reflects more practical application scenarios and introduces a new trade-off between the choice of coding combinations for various receivers and the broadcasting rate for achieving shorter completion time. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. The highest weight clique in the created graph being potentially not unique, the paper further suggests a multi-layer version of the proposed solution to improve the obtained results from the employed completion time approximation. Simulation results indicate that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme.

Citations (29)

Summary

We haven't generated a summary for this paper yet.