• Corpus ID: 207930441

Coalition Formation Game for Delay Reduction in Instantly Decodable Network Coding Assisted D2D Communications

  title={Coalition Formation Game for Delay Reduction in Instantly Decodable Network Coding Assisted D2D Communications},
  author={Mohammed S. Al-Abiad and Ahmed Douik and Md. Jahangir Hossain},
Consider a wireless broadcast device-to-device (D2D) network wherein users' devices are interested in receiving some popular files. Each user's device possesses part of the content which is acquired in previous transmissions and cooperates with others to recover the missing packets by exchanging Instantly Decodable Network Coding (IDNC) packets. Recently, a distributed solution, relying on a non-cooperative game-theoretic formulation, has been proposed to reduce the communication time for fully… 

Figures and Tables from this paper



A Game-Theoretic Framework for Decentralized Cooperative Data Exchange using Network Coding

A game theoretic frame- work for studying the problem of minimizing the delay of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network shows that the formulation with complete information largely outperforms the conventional PMP scheme in most situations and achieves a lower delay.

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

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 and shows that the distributed solution achieves the centralized solution.

Delay reduction in multi-hop device-to-device communication using network coding

This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications and expresses the optimal solution using a graph theory approach by introducing the cooperation graph.

A Constrained Coalition Formation Game for Multihop D2D Content Uploading

This paper investigates relay-based schemes in cellular systems, where multihop device-to-device (D2D) communications are exploited for content uploading toward the eNodeB, and proposes a constrained coalition formation game, where each UE is a player whose cost is identified as the content upload time.

A distributed coalition formation framework for fair user cooperation in wireless networks

This work model cooperation in wireless networks through a game theoretical algorithm derived from a novel concept from coalitional game theory that enables the users to self-organize into independent disjoint coalitions and the resulting clustered network structure is characterized through novel stability notions.

Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game

A Bayesian game model is extended to a dynamic game model for which a Nash-stable coalitional structure is obtained in each subgame and another solution concept, namely, the Bayesian core, which guarantees that no mobile node has an incentive to leave the grand coalition.

Instantly Decodable Network Coding for Completion Time or Decoding Delay Reduction in Cooperative Data Exchange Systems

In this paper, we investigate the use of instantly decodable network coding (IDNC) for improving two fundamental performance metrics, namely, the completion time (as a measure of throughput) and mean

Completion Delay Minimization for Instantly Decodable Network Codes

Simulation results show that the proposed algorithms significantly reduce the IDNC completion delay compared to the random and maximum-rate algorithms, and almost achieve the global optimal completion delay performance over all network codes in broadcast scenarios.

Coalitional Game Theory for Communication Networks: A Tutorial

This article constitutes a treatment of coalitional game theory tailored to the demands of communications and network engineers and presents an application-oriented approach for understanding and analyzing coalitional games.

Minimum Broadcast Decoding Delay for Generalized Instantly Decodable Network Coding

This paper shows that the minimum decoding delay problem for G-IDNC can be formulated as a maximum weight clique problem over a well structured graph, and proposes a simple heuristic G- IDNC algorithm with sub-optimal performance.