A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications

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

Research output: Contribution to journalArticle

Abstract

This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D enabled systems, users cooperate to recover all their missing packets. The paper proposes a game theoretic framework as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. The session is modeled by self-interested players in a non-cooperative potential game. The utility functions are designed so as increasing individual payoff results in a collective behavior which achieves both a desirable system performance in a shared network environment and the Nash equilibrium. Three games are developed whose first reduces the completion time, the second the maximum decoding delay and the third the sum decoding delay. The paper, further, improves the formulations by including a punishment policy upon collision occurrence so as to achieve the Nash bargaining solution. Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario. Numerical results suggest that the proposed game-theoretical formulation provides appreciable performance gain against the conventional point-to-multipoint (PMP), especially for reliable user-to-user channels.

Original languageEnglish (US)
Article number7501895
Pages (from-to)901-917
Number of pages17
JournalIEEE Transactions on Mobile Computing
Volume16
Issue number4
DOIs
StatePublished - Apr 1 2017

Fingerprint

Network coding
Decoding
Communication
Learning algorithms
Feedback
Controllers

Keywords

  • Device-to-device communications
  • instantly decodable network coding
  • nash equilibrium
  • non-cooperative games
  • potential game

ASJC Scopus subject areas

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

Cite this

A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications. / Douik, Ahmed; Sorour, Sameh; Hamidou, Tembine; Al-Naffouri, Tareq Y.; Alouini, Mohamed Slim.

In: IEEE Transactions on Mobile Computing, Vol. 16, No. 4, 7501895, 01.04.2017, p. 901-917.

Research output: Contribution to journalArticle

Douik, Ahmed ; Sorour, Sameh ; Hamidou, Tembine ; Al-Naffouri, Tareq Y. ; Alouini, Mohamed Slim. / A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications. In: IEEE Transactions on Mobile Computing. 2017 ; Vol. 16, No. 4. pp. 901-917.
@article{5e93a68a8a0b43289806fa424fbb17c9,
title = "A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications",
abstract = "This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D enabled systems, users cooperate to recover all their missing packets. The paper proposes a game theoretic framework as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. The session is modeled by self-interested players in a non-cooperative potential game. The utility functions are designed so as increasing individual payoff results in a collective behavior which achieves both a desirable system performance in a shared network environment and the Nash equilibrium. Three games are developed whose first reduces the completion time, the second the maximum decoding delay and the third the sum decoding delay. The paper, further, improves the formulations by including a punishment policy upon collision occurrence so as to achieve the Nash bargaining solution. Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario. Numerical results suggest that the proposed game-theoretical formulation provides appreciable performance gain against the conventional point-to-multipoint (PMP), especially for reliable user-to-user channels.",
keywords = "Device-to-device communications, instantly decodable network coding, nash equilibrium, non-cooperative games, potential game",
author = "Ahmed Douik and Sameh Sorour and Tembine Hamidou and Al-Naffouri, {Tareq Y.} and Alouini, {Mohamed Slim}",
year = "2017",
month = "4",
day = "1",
doi = "10.1109/TMC.2016.2586068",
language = "English (US)",
volume = "16",
pages = "901--917",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications

AU - Douik, Ahmed

AU - Sorour, Sameh

AU - Hamidou, Tembine

AU - Al-Naffouri, Tareq Y.

AU - Alouini, Mohamed Slim

PY - 2017/4/1

Y1 - 2017/4/1

N2 - This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D enabled systems, users cooperate to recover all their missing packets. The paper proposes a game theoretic framework as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. The session is modeled by self-interested players in a non-cooperative potential game. The utility functions are designed so as increasing individual payoff results in a collective behavior which achieves both a desirable system performance in a shared network environment and the Nash equilibrium. Three games are developed whose first reduces the completion time, the second the maximum decoding delay and the third the sum decoding delay. The paper, further, improves the formulations by including a punishment policy upon collision occurrence so as to achieve the Nash bargaining solution. Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario. Numerical results suggest that the proposed game-theoretical formulation provides appreciable performance gain against the conventional point-to-multipoint (PMP), especially for reliable user-to-user channels.

AB - This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D enabled systems, users cooperate to recover all their missing packets. The paper proposes a game theoretic framework as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. The session is modeled by self-interested players in a non-cooperative potential game. The utility functions are designed so as increasing individual payoff results in a collective behavior which achieves both a desirable system performance in a shared network environment and the Nash equilibrium. Three games are developed whose first reduces the completion time, the second the maximum decoding delay and the third the sum decoding delay. The paper, further, improves the formulations by including a punishment policy upon collision occurrence so as to achieve the Nash bargaining solution. Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario. Numerical results suggest that the proposed game-theoretical formulation provides appreciable performance gain against the conventional point-to-multipoint (PMP), especially for reliable user-to-user channels.

KW - Device-to-device communications

KW - instantly decodable network coding

KW - nash equilibrium

KW - non-cooperative games

KW - potential game

UR - http://www.scopus.com/inward/record.url?scp=85015754518&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015754518&partnerID=8YFLogxK

U2 - 10.1109/TMC.2016.2586068

DO - 10.1109/TMC.2016.2586068

M3 - Article

VL - 16

SP - 901

EP - 917

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 4

M1 - 7501895

ER -