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

Douik, Ahmed; Sorour, Sameh; Tembiné, Hamidou; Al-Naffouri, Tareq Y.; Alouini, Mohamed‐Slim

doi:10.1109/tmc.2016.2586068

Cited by 13 publications

(6 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• 'Delay-aware and Energy-unaware non-coalitional CDE' which considers a non-cooperative game in a D2D configuration to select a single transmitting device among a number of players arranged in a single big cluster in order to reduce only the overall completion time [15].…”

Section: Simulation Resultsmentioning

confidence: 99%

“…For a contentaware IDNC in device-to-device (D2D) networks, where not all devices are interested in the same quality of content, Keshtkarjahromi et al [14] proposed a novel content and loss aware IDNC scheme that improves jointly the completion time and content quality. Furthermore, Douik et al [15] introduced a non-cooperative game theoretic framework in (D2D) networks in order to solve the IDNC delay minimization problem. They proposed three games to reduce the completion time, the maximum decoding delay and the sum decoding delay.…”

Section: Related Work and Contributionsmentioning

confidence: 99%

“…Moreover, executing the intracluster recovery phase simultanously in every cluster reduces significantly the time of recovery process. However, in [15], the delay-aware decision making of the suitable combined packets and the transmitting device is made by all nodes in the network and the network-coded packets are transmitted for all nodes whatever the network size is.…”

Section: System Model and Definitions A System Model And Recovementioning

confidence: 99%

See 2 more Smart Citations

A Coalitional Game-Theoretic Framework for Cooperative Data Exchange Using Instantly Decodable Network Coding

Zayene¹,

Habachi²,

Meghdadi³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper investigates the cooperative data exchange (CDE) scheme using the instantly decodable network coding across energy-constrained devices over the wireless channels. In fact, enabling the CDE brings several challenges, such as how to extend the network lifetime and how to reduce the number of transmissions in order to satisfy the urgent delay requirements. The problem is modeled using the cooperative game theory in partition form. Unlike most existing studies, which are only delay-sensitive, we take into account both the completion time and the consumed energy. We propose a distributed mergeand-split algorithm to allow the wireless nodes to self-organize into the independent disjoint coalitions in a distributed manner. Indeed, the proposed algorithm guarantees reduced energy consumption and minimizes the delay in the resulting clustered network structure. Note that we have considered not only the transmission energy but also the computational energy consumption. Moreover, we focus on the mobility issue and we analyze how, in the proposed framework, the nodes can adapt to the dynamics of the network. Such an important result offers insights into how to design the scalable energy and delay aware CDE framework. The simulation results validate the proposed framework and show that, interestingly, the nodes reduce both the energy consumption and the completion time. INDEX TERMS Coalitional game theory, cooperative data exchange, instantly decodable network coding, unmanned aerial network. The associate editor coordinating the review of this manuscript and approving it for publication was Matti Hämäläinen.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Related Work and Contributionsmentioning

confidence: 99%

Section: System Model and Definitions A System Model And Recovementioning

confidence: 99%

See 1 more Smart Citation

A Coalitional Game-Theoretic Framework for Cooperative Data Exchange Using Instantly Decodable Network Coding

Zayene¹,

Habachi²,

Meghdadi³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The rapid increase of mobile devices and the emergence of new technologies as well as services demand more efficient wireless cellular networks [1][2][3][4]. The 5th generation (5G) communication networks need to support abundant business scenarios, such as Internet of Vehicles [5][6][7], Internet of Things [8][9][10], virtual reality [11,12], device-to-device communications [13][14][15][16], and so forth. Therefore, plenty of important technologies are worth studying in future communication networks, for example, multicarrier modulation, massive multiple-input multiple-output (MIMO), millimeter wave, and so forth [1][2][3][4].…”

Section: Introductionmentioning

confidence: 99%

An Overview of FIR Filter Design in Future Multicarrier Communication Systems

et al. 2020

View full text Add to dashboard Cite

Future wireless communication systems are facing with many challenges due to their complexity and diversification. Orthogonal frequency division multiplexing (OFDM) in 4G cannot meet the requirements in future scenarios, thus alternative multicarrier modulation (MCM) candidates for future physical layer have been extensively studied in the academic field, for example, filter bank multicarrier (FBMC), generalized frequency division multiplexing (GFDM), universal filtered multicarrier (UFMC), filtered OFDM (F-OFDM), and so forth, wherein the prototype filter design is an essential component based on which the synthesis and analysis filters are derived. This paper presents a comprehensive survey on the recent advances of finite impulse response (FIR) filter design methods in MCM based communication systems. Firstly, the fundamental aspects are examined, including the introduction of existing waveform candidates and the principle of FIR filter design. Then the methods of FIR filter design are summarized in details and we focus on the following three categories—frequency sampling methods, windowing based methods and optimization based methods. Finally, the performances of various FIR design methods are evaluated and quantified by power spectral density (PSD) and bit error rate (BER), and different MCM schemes as well as their potential prototype filters are discussed.

show abstract

“…Thus, the coding-based protocols can offer resilience to link failures, increase throughput, and reduce the delivery delay [18,19]. Several coding-based schemes have shown that deterministic forms of reliable transport in ON can be allowed by integrating receivers' acknowledgements (ACKs) [20,21]. Nevertheless, these solutions rely on considerable redundancy/forwarding to cater the packet losses in the network and increase the probability of the message arriving at its destination, thus obtaining acceptable latency at the cost of energy resources [22].…”

Section: Introductionmentioning

confidence: 99%

A Reliable Transport Scheme for Human Opportunistic Networks

Mao

Chen

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

The human opportunistic networks (ONs) formed by hand-held smart devices can facilitate peer-to-peer communication when humans are on the move, despite contemporaneous end-to-end paths rarely existing. In some scenarios, where network resources, especially power, are scarce and the traffic is large, the data delivery is prone to poor user experience and unbounded delay, although the best effort mechanism “store-carry-forward” is used. To cope with that, most transport/routing schemes obtain an acceptable latency at the cost of energy resources. In real-life human ONs, however, excessive energy consumption will trigger passive participation of the relays in message forwarding, so as to save their limited energy resource. Thus, the reliability of these schemes may get worse in real-life human ONs. In this paper, a reliable transport scheme is developed by making an optimal trade-off between the file round-trip delay and the energy consumption of relays. We make use of acknowledgements and coding at the source to enable successful file delivery. When setting up the network model, the cache management rule referred as “full-duplex” strategy is formulated, and then a mathematical model is established to analyze the proposed scheme. This model describes the evolution of packet dissemination and allows both the mean file round-trip delay and the energy consumption up to the reception of the last acknowledgement by the source to be expressed. Subsequently, a new function based on these two metrics is proposed to reflect the number of files that can be delivered under time and energy constraints. Through optimization procedure, the configurations that can maximize the function are obtained; thus, the optimization of these two metrics is achieved. Numerous simulations and comparisons are conducted and the results verify the accuracy of the analytical model. Comparison results show that with limited energy and passive relays, the proposed transport scheme can significantly reduce the energy consumption of file delivery, which obviously alleviates the selfish behavior of nodes. Therefore, the reliability and stability of the communication service in human ONs are enhanced.

show abstract

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

Cited by 13 publications

References 40 publications

A Coalitional Game-Theoretic Framework for Cooperative Data Exchange Using Instantly Decodable Network Coding

A Coalitional Game-Theoretic Framework for Cooperative Data Exchange Using Instantly Decodable Network Coding

An Overview of FIR Filter Design in Future Multicarrier Communication Systems

A Reliable Transport Scheme for Human Opportunistic Networks

Contact Info

Product

Resources

About