Rate-Aware Network Codes for Video Distortion Reduction in Point-to-Multipoint Networks

Karim, Mohammad S.; Douik, Ahmed; Sorour, Sameh

doi:10.1109/tvt.2017.2674674

Cited by 9 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given the fact that deriving the performance expressions for the considered problem in this paper is highly complex, we only used heuristic schemes. The inability to derive such expressions is widely found in existing works in the literature on a simpler yet related NC problems, e.g., [34], [37], [39], [41], [42].…”

Section: Greedy Algorithm For Scheduling and Power Adaptationmentioning

confidence: 99%

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Al-Abiad

Douik

Sorour

et al. 2022

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

Cloud radio access networks (C-RANs) are promising paradigms for the fifth-generation (5G) networks due to their interference management capabilities. In a C-RAN, a central processor (CP) is responsible for coordinating multiple Remote Radio Heads (RRHs) and scheduling users to their radio resource blocks (RRBs). In this paper, we develop a novel cross-layer network coding (CLNC) approach that proposes to optimize RRH's transmit powers and user's rates in making the coding decisions. As such, cross-layer throughput of the network is maximized. The joint user scheduling, file encoding, and power adaptation problem is solved by designing a subgraph for each RRB, in which each vertex represents potential user-RRH associations, encoded files, transmission rates, and power levels (PLs) for one RRB. It is then shown that the C-RAN throughput maximization problem is equivalent to a maximum-weight clique problem over the union of all such subgraphs, called herein the CRAN-CLNC graph. Numerical results revealed that the proposed joint and iterative schemes offer improved throughput performances as compared to the existing algorithms in the literature. Compared to our proposed joint scheme, our proposed iterative scheme has a certain degradation, roughly in the range of 9% -14%. This small degradation in the throughput performance of the iterative scheme comes at the achieved low computational complexity as compared to the high complexity of the joint scheme.

show abstract

Section: Greedy Algorithm For Scheduling and Power Adaptationmentioning

confidence: 99%

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Al-Abiad

Douik

Sorour

et al. 2022

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…may cause packet loss at the users' end. Thus, after the first stage, the users inform the BS about their packet reception status via an error-free link [32]. The packet reception status is determined by a feedback matrix F ∈ {0, 1} M ×N whose entries f nm are defined as follows:…”

Section: System Setup and Problem Formulationmentioning

confidence: 99%

Packet Completion Time Minimization via Joint D2D and Cellular Communication: A Unified Network Coding Approach

Denis¹,

Seferoğlu²

2020

Preprint

View full text Add to dashboard Cite

This paper tackles the problem of transmitting a common content to a number of cellular users by means of instantly decodable network coding (IDNC) with the help of intermittently connected D2D links. Of particular interest are broadcasting real-time applications such as video-on-demand, where common contents may be partially received by cellular users due to packet erasures over cellular links. Specifically, we investigate the problem of packet completion time, defined as the number of transmission slots necessary to deliver a common content to all users. Drawing on graph theory, we develop an optimal packet completion time strategy by constructing a two-layer IDNC conflict graph.The higher-layer graph permits us to determine all feasible packet combinations that can be transmitted over the cellular link, while the lower-layer graph enables us to find all feasible network coded packets and identify the set of users that can generate and transmit these packets via intermittently connected D2D links. By combining the higher-layer and the lower-layer IDNC conflict graphs, we demonstrate that finding the optimal IDNC packets to minimize the packet completion time problem is equivalent to finding the maximum independent set of the two-layer IDNC conflict graph, which is known to be an Juwendo Denis and Hulya Seferoglu are with the Department of Electrical and Computer Engineering,

show abstract

“…They formulated the problem as a maximum weight clique problem in the IDNC graph and proposed two heuristic algorithms to solve the problem. On the other hand, in a wireless point-to-multipoint network, Karim et al [13] considered the problem of reducing video distortion of a set of devices that are interested in receiving in realtime a video sequence broadcasted from a BS. Since finding the optimal solution using Markov decision process is intractable, they proposed an online maximal clique selection algorithm over a rate aware IDNC graph in order to select the suitable packet combination and transmission rate.…”

Section: Related Work and Contributionsmentioning

confidence: 99%

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

Rate-Aware Network Codes for Video Distortion Reduction in Point-to-Multipoint Networks

Cited by 9 publications

References 31 publications

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Packet Completion Time Minimization via Joint D2D and Cellular Communication: A Unified Network Coding Approach

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

Contact Info

Product

Resources

About