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

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

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

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. 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.

Original languageEnglish (US)
Title of host publication2014 IEEE Global Communications Conference, GLOBECOM 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1583-1589
Number of pages7
ISBN (Electronic)9781479935116
DOIs
StatePublished - Feb 9 2014
Event2014 IEEE Global Communications Conference, GLOBECOM 2014 - Austin, United States
Duration: Dec 8 2014Dec 12 2014

Other

Other2014 IEEE Global Communications Conference, GLOBECOM 2014
CountryUnited States
CityAustin
Period12/8/1412/12/14

Fingerprint

data exchange
Electronic data interchange
Controllers
Network coding
game theory
Game theory
collective behavior
performance
coding
Wireless networks
Recovery
simulation
time

Keywords

  • Cooperative data exchange
  • instantly decodable network coding
  • Nash equilibrium
  • non-cooperative games
  • potential game

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Communication

Cite this

Douik, A., Sorour, S., Hamidou, T., Alouini, M. S., & Al-Naffouri, T. Y. (2014). A game theoretic approach to minimize the completion time of network coded cooperative data exchange. In 2014 IEEE Global Communications Conference, GLOBECOM 2014 (pp. 1583-1589). [7037034] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2014.7037034

A game theoretic approach to minimize the completion time of network coded cooperative data exchange. / Douik, Ahmed; Sorour, Sameh; Hamidou, Tembine; Alouini, Mohamed Slim; Al-Naffouri, Tareq Y.

2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 1583-1589 7037034.

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

Douik, A, Sorour, S, Hamidou, T, Alouini, MS & Al-Naffouri, TY 2014, A game theoretic approach to minimize the completion time of network coded cooperative data exchange. in 2014 IEEE Global Communications Conference, GLOBECOM 2014., 7037034, Institute of Electrical and Electronics Engineers Inc., pp. 1583-1589, 2014 IEEE Global Communications Conference, GLOBECOM 2014, Austin, United States, 12/8/14. https://doi.org/10.1109/GLOCOM.2014.7037034
Douik A, Sorour S, Hamidou T, Alouini MS, Al-Naffouri TY. A game theoretic approach to minimize the completion time of network coded cooperative data exchange. In 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 1583-1589. 7037034 https://doi.org/10.1109/GLOCOM.2014.7037034
Douik, Ahmed ; Sorour, Sameh ; Hamidou, Tembine ; Alouini, Mohamed Slim ; Al-Naffouri, Tareq Y. / A game theoretic approach to minimize the completion time of network coded cooperative data exchange. 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 1583-1589
@inproceedings{33c10a176ae947a4ba35bcb8f11be230,
title = "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. 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.",
keywords = "Cooperative data exchange, instantly decodable network coding, Nash equilibrium, non-cooperative games, potential game",
author = "Ahmed Douik and Sameh Sorour and Tembine Hamidou and Alouini, {Mohamed Slim} and Al-Naffouri, {Tareq Y.}",
year = "2014",
month = "2",
day = "9",
doi = "10.1109/GLOCOM.2014.7037034",
language = "English (US)",
pages = "1583--1589",
booktitle = "2014 IEEE Global Communications Conference, GLOBECOM 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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 - Hamidou, Tembine

AU - Alouini, Mohamed Slim

AU - Al-Naffouri, Tareq Y.

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 - instantly decodable network coding

KW - Nash equilibrium

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

SP - 1583

EP - 1589

BT - 2014 IEEE Global Communications Conference, GLOBECOM 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -