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

Instantly decodable network coding (IDNC) reduces the completion delay of packet retransmission for multicast services in wireless point-to-multipoint (PMP) networks. Compared with multicast services, multiple unicast services may be more common in PMP networks. Reducing completion delay using IDNC for multiple unicast services is still an open problem. According to the construction features of IDNC, we find that if some unicast retransmissions are combined as a retransmission group, IDNC benefits from network coding (NC) considerably, which increases retransmission efficiency. Based on this observation, we study the total completion delay of all these unicast transmissions with intersession NC. In this paper, we provide an intersession insight into the IDNC method. Specifically, we propose a framework that contains 1) a general solution to this minimum completion delay (MCD) problem, which is modeled as a bin-packing problem, and 2) a lower bound of completion delay for the MCD solution. Additionally, we provide a high-efficiency greedy algorithm to solve the MCD problem with low computational complexity. Simulation results demonstrate that the proposed method saves almost 43% retransmissions in PMP networks and makes 87.5% retransmission packets benefit from the NC transmission.

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 decoding delay, in multicast cooperative data exchange (CDE) systems, where a group of geographically close clients cooperate with each other to obtain their missing packets. Here, an IDNC scheme is used for the transmissions across these clients. We utilize the stochastic shortest path (SSP) technique to study the minimum mean completion time problem. However, since finding the optimum solution is intractable, we use the obtained formulation to draw some theoretical guidelines to heuristically find solutions that can efficiently reduce the completion time. Second, we formulate the minimum mean decoding delay problem as selecting the appropriate maximal clique over well-structured graphs at the clients, and in order to reduce its complexity, we propose a simple heuristic algorithm for it. The effectiveness of our proposed algorithms is verified through extensive simulations and comparisons with existing techniques.

In this paper, we study the problem of distributing a real-time video sequence to a group of partially connected cooperative wireless devices using instantly decodable network coding (IDNC). In such a scenario, the coding conflicts occur to service multiple devices with an immediately decodable packet, and the transmission conflicts occur from simultaneous transmissions of multiple devices. To avoid these conflicts, we introduce a novel IDNC graph that represents all feasible coding and transmission conflict-free decisions in one unified framework. Moreover, a real-time video sequence has a hard deadline and unequal importance of video packets. Using these video characteristics and the new IDNC graph, we formulate the problem of minimizing the mean video distortion before the deadline as a finite horizon Markov decision process (MDP) problem. However, the backward induction algorithm that finds the optimal policy of the MDP formulation has high modeling and computational complexities. To reduce these complexities, we further design a two-stage maximal independent set selection algorithm, which can efficiently reduce the mean video distortion before the deadline. Simulation results over a real video sequence show that our proposed IDNC algorithms improve the received video quality compared with the existing IDNC algorithms.

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. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.

In this paper, we propose a scheme of wireless multimedia network coded broadcast retransmission, based on Device-to-Device (D2D) communications, in which there are network coding conflicts and transmission conflicts between multiple terminal devices. For this reason, a novel instantly decodable network coding (IDNC) graph is constructed, where all the feasible coding and non-transmission collision cases are shown in the graph. Based on the constructed IDNC graph, we design the optimal broadcast strategy for batch transmission and sliding window transmission, and propose a heuristic maximum weight network coding selection algorithm (MWSA-NC) to reduce the complexity of the optimal search algorithm. The simulation results show that compared to the traditional scheme, the proposed algorithm can greatly improve the throughput of the system, reduce decoding latency and reduce video stream distortion.

This paper considers a heterogeneous network architecture wherein devices use two wireless interfaces to receive packets from the base station and to transmit or receive packets from other devices concurrently. For such a network architecture, this paper focuses on time-critical and order-constrained applications that require quick and reliable in-order decoding of the packets. This paper first introduces the dual delivery delay as a measure of degradation compared with the optimal in-order packet delivery to the devices. It then addresses the minimum delivery delay problem using instantly decodable network coding (IDNC). In particular, the dual interface IDNC graph is constructed to represent all feasible coding opportunities and conflict-free transmissions. Subsequently, the minimum delivery delay problem is shown to be equivalent to a maximum weight independent set selection problem over the dual interface IDNC graph. Simulation results demonstrate that the proposed IDNC algorithm effectively reduces the delivery delay as compared with the existing network coding algorithms. Especially, for a layered video transmission, the proposed solution provides a sequential delivering of video layers to individual devices.

The traditional instantly decodable network coding (IDNC) schemes discard the non-instantly decodable packets (NIDPs), which results in the loss of useful information. In this letter, we consider a network coding scheme named as buffered instantly decodable network coding (B-IDNC) where each receiving node can cache the NIDPs containing two unreceived packets for subsequent network decoding, and give a decoding algorithm by utilizing the maximum decoding clique. The maximum decoding clique is defined as a subset of vertices in the IDNC graph, which can be decoded together. We approximate the average packet decoding delay minimization problem as the maximum weight encoding clique problem, and a heuristic algorithm named as maximum decoding clique based maximum weight vertex (MDC-MWV) searching algorithm is proposed to solve the approximated problem. Simulation results show that our proposed algorithm can reduce the average packet decoding delay compared with the conventional IDNC schemes.

Most of Wireless Sensor Networks (WSNs) are usually deployed in hostile environments where the communications conditions are not stable and not reliable. Hence, there is a need to design an effective distributed schemes to enable the sensors cooperating in order to recover the sensed data. In this paper, we establish a novel cooperative data exchange (CDE) scheme using instantly decodable network coding (IDNC) across the sensor nodes. We model the problem using the cooperative game theory in partition form. We develop also a distributed merge-and-split algorithm in order to form dynamically coalitions that maximize their utilities in terms of both energy consumption and IDNC delay experienced by all sensors. Indeed, the proposed algorithm enables these sensors to self-organize into stable clustered network structure where all sensors do not have incentives to change the cluster he is part of. Simulation results show that our cooperative scheme allows nodes not only to reduce the energy consumption, but also the IDNC completion time.

We are concerned with designing feedback-based adaptive Instantly Decodable Network Coding (IDNC) schemes with the aim of minimizing retransmission times in wireless multicast and broadcast scenarios. In this paper, we first analyze the multiple factors influencing the transmission times and give the quantitative formula. Meantime, we introduce the concept of Cache-based Instantly Decodable Network Coding (C-IDNC) that the correctly received undecodable retransmission packets are waited in the cache for a future network decoding opportunity rather than delete. Then, we formulate the retransmission times minimization problem as an max-weight search problem and propose efficient algorithms for finding its optimal solution. Further, we propose a heuristic algorithms with worst case linear execution complexity based on sorting and iteration. Simulation results show that our proposed algorithms significantly reduce the IDNC retransmission times compared to previous works.

We are concerned with designing feedback-based adaptive network coding schemes with the aim of minimizing decoding delay in each transmission in packet-based erasure networks. We study systems where each packet brings new information to the destination regardless of its order and require the packets to be instantaneously decodable. We first formulate the decoding delay minimization problem as an integer linear program and then propose efficient algorithms for finding its optimal solution(s). We show that our problem formulation is applicable to memoryless erasures as well as Gilbert-Elliott erasures with memory. We then propose a number of heuristic algorithms with worst case linear execution complexity that can be used when an optimal solution cannot be found in a reasonable time. We verify the delay and speed performance of our techniques through numerical analysis. This analysis reveals that by taking channel memory into account in network coding decisions, one can considerably reduce decoding delays.

The development of circuit testing and verification methods is commonly driven by formal analysis centered on an abstract mathematical model of the error or defect the method is designed to detect. Hardware Trojans, however, confound attempts to develop simple representative models due to the varieties of their physical embodiments in a circuit and the creative nature of a rational human adversary. Since it is nonetheless desirable to have a mathematical framework for determining the effectiveness of hardware Trojan detection methods, we present a game theoretic framework for so doing. Modeling the Trojan maker and detection method designer as opposing players in a 2-person strategic game is a necessary step in our process. However, the ultimate utility of the approach depends on an accurate security economic model of both players that can correctly consider the players' incentives, empirically-derived detection method efficacy metrics, a comprehensive taxonomy of hardware Trojans, and the places in the design cycle of the circuit where the Trojan insertion and detection occur. In this paper, we present such a security economic model and the resulting game, which we call the Trust Game. We illustrate the value of this game primarily in the context of how it may guide the development of new hardware Trojan detection methods. We solve a representative game, illustrating the value of two common solution concepts, the iterated elimination of dominated strategies and Nash equilibrium. We further show that this framework has utility to both of the opposing players in the game. Finally, we recommend the development of standardized Trust Games that can be used to quickly measure the efficacy of both new hardware Trojans and hardware Trojan detection methods.

In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC schem

In cognitive radio network (CRN), the utilities results in Nash equilibrium of power control game without using pricing are inefficient. In this paper, a distributed power control algorithm is proposed to improve the utilities of both primary user (PU) and secondary users (SUs) in the CRN based on game theoretic framework. A distributed power control is a non-cooperative power control game, and the quality of service (QoS) received by PU and SUs terminals are referred to as the utility function. PU and SUs act as decision makers in the game and they maximize their utilities in a distributed fashion. We introduce a new pricing function for SUs as a function of transmit power and square amount of interference in order to guide SUs to an efficient Nash equilibrium point. Analysis of the existence and uniqueness of Nash equilibrium for the proposed power control game with pricing is presented. Simulation results show that the proposed power control algorithm via a new pricing function maximizes the number of SUs access the unused spectrum, and improves the utilities of PU and SUs.

In this paper, user pairing within network coding for multiple access relaying systems is studied. Focusing on the scenario that consists of multiple users, one relay and one base station, the relay helps two users transmit messages to base station sharing the same resource block. A proper user pairing approach within network coding is necessary to further improve the system performance. Game theory is utilized to model the user pairing problem as a non-cooperative game. The Nash equilibrium (NE) provides a theoretical solution for the referred problem. Since the NE is not always unique, a heuristic algorithm is proposed to approach a quasi-equilibrium. Simulation results demonstrate that the proposed algorithm can improve the pairing fairness and the worst user's performance.

Multi-Generation Mixing (MGM) is a generalized approach of Network Coding (NC) that has its improvements when applied in packet loss networks. In this paper we apply MGM network coding in networks communicating video contents. NC has shown viable improvements when applied in packet loss networks. With practical network coding (generation based network coding), packets are grouped in chunks called generations. Generation is the unit of network coding encoding and decoding. The generation grouping of packets is necessary for the practical deployment of network coding. On the other hand it increases the cost of NC losses. NC losses reduce the ability of receiver to decode packets, and hence can severely degrade the quality of recovered video. Video is encoded in layers with Scalable Video Coding (SVC) a base layer and one or more enhancement layers. MGM employs the layering of scalable video to enhance the reliability of communication. MGM provides different levels of reliable communication for the different video layers to improve the overall reliability of video communication. SVC enhancement layers are dependent on lower layers to be recovered. With MGM enhancement layers support the recovery of lower layers. This is done by network encoding lower video layers in higher layers. Through extensive simulations, we show that MGM highly improves the quality of recovered video.