A game theoretic approach to minimize the completion time of network coded cooperative data exchange

Abstract

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.

Instantly decodable network coding for real-time device-to-device communications

“…Recently, some works [20][21][22][23] begin to address the delay reduction problem in IDNC-enable D2D network configuration. While the authors in [20,21,23] design algorithm for the sum decoding delay reduction, references [20,22] propose schemes for the completion time reduction.…”

“…Indeed, as delay minimization problems in IDNC-based systems are equivalent to a maximum weight clique problems in the IDNC graph, the presented algorithms can be applied to different delay aspects and network settings. For example, they can be applied to reduce the complexity of the sum decoding delay minimization problem in imperfect feedback scenario proposed in [24] to the decentralized completion time reduction algorithm for D2D networks proposed in [22].…”

“…While the authors in [20,21,23] design algorithm for the sum decoding delay reduction, references [20,22] propose schemes for the completion time reduction. However, these works intersect as they directly extend the delay reduction PMP schemes, known to be NP-hard, to the D2D setting without considering the complexity issue for such battery-powered networks.…”

Decoding-Delay-Controlled Completion Time Reduction in Instantly Decodable Network Coding

“…Though both proved to be NP-hard parameters to minimize, many heuristics have been developed to solve them in many scenarios, e.g., references [11]- [13] study the decoding delay reduction and references [14]- [16] the completion time minimization in a device-todevice communication enabled network. In fact, it can be readily inferred from [9] and [10] that the policies derived so far to optimize one usually degrades the other.…”

Rate Aware Instantly Decodable Network Codes

“…The key idea is to approximate the completion time using a decoding delay dependent expression that can be used to reduce efficiently the overall delivery time. The approach is generalized in [23], [24] to distributed networks using game theory tools.…”