A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange

Ahmed S. Douik, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini, Sameh Sorour, Hamidou Tembine

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations


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.
Original languageEnglish (US)
Title of host publication2014 IEEE Global Communications Conference
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages7
ISBN (Print)9781479935123
StatePublished - Feb 17 2015

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange'. Together they form a unique fingerprint.

Cite this