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

Handle URI:
http://hdl.handle.net/10754/316703
Title:
A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange
Authors:
Douik, Ahmed S. ( 0000-0001-7791-9443 ) ; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Sorour, Sameh; Tembine, Hamidou
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2014 IEEE Global Communications Conference
Conference/Event name:
2014 IEEE Global Communications Conference, GLOBECOM 2014
Issue Date:
11-May-2014
DOI:
10.1109/glocom.2014.7037034
ARXIV:
arXiv:1404.3945
Type:
Conference Paper
Additional Links:
http://arxiv.org/abs/1404.3945
Appears in Collections:
Conference Papers; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorDouik, Ahmed S.en
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorSorour, Samehen
dc.contributor.authorTembine, Hamidouen
dc.date.accessioned2014-05-11T07:50:12Z-
dc.date.available2014-05-11T07:50:12Z-
dc.date.issued2014-05-11en
dc.identifier.doi10.1109/glocom.2014.7037034en
dc.identifier.urihttp://hdl.handle.net/10754/316703en
dc.description.abstractIn 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.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://arxiv.org/abs/1404.3945en
dc.subjectCooperative data exchangeen
dc.subjectinstantly decodable network coding,en
dc.subjectnon-cooperative gamesen
dc.subjectpotential gameen
dc.subjectNash equilibriumen
dc.titleA Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchangeen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2014 IEEE Global Communications Conferenceen
dc.conference.date2014-12-08 to 2014-12-12en
dc.conference.name2014 IEEE Global Communications Conference, GLOBECOM 2014en
dc.conference.locationAustin, TX, USAen
dc.eprint.versionPre-printen
dc.contributor.institutionUniversität Augsburg, Institut für Physik, D-86135 Augsburg, Germanyen
dc.contributor.institutionFraunhofer Institut für Keramische Technologien und Systeme (IKTS), D-01277 Dresden, Germanyen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
dc.identifier.arxividarXiv:1404.3945en
kaust.authorDouik, Ahmed S.en
kaust.authorTembine, Hamidouen
kaust.authorAlouini, Mohamed-Slimen
kaust.authorAl-Naffouri, Tareq Y.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.