TY - GEN
T1 - A game theoretic approach to minimize the completion time of network coded cooperative data exchange
AU - Douik, Ahmed
AU - Sorour, Sameh
AU - Tembine, Hamidou
AU - Alouini, Mohamed Slim
AU - Al-Naffouri, Tareq Y.
N1 - Publisher Copyright:
© 2014 IEEE.
Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.
PY - 2014/2/9
Y1 - 2014/2/9
N2 - 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. We further show that our distributed solution achieves the centralized 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.
AB - 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. We further show that our distributed solution achieves the centralized 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.
KW - Cooperative data exchange
KW - Nash equilibrium
KW - instantly decodable network coding
KW - non-cooperative games
KW - potential game
UR - http://www.scopus.com/inward/record.url?scp=84949922286&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949922286&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2014.7037034
DO - 10.1109/GLOCOM.2014.7037034
M3 - Conference contribution
AN - SCOPUS:84949922286
T3 - 2014 IEEE Global Communications Conference, GLOBECOM 2014
SP - 1583
EP - 1589
BT - 2014 IEEE Global Communications Conference, GLOBECOM 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE Global Communications Conference, GLOBECOM 2014
Y2 - 8 December 2014 through 12 December 2014
ER -