Network Coding for Efficient Wireless Unicast

Lun, Desmond S.; Médard, Muriel; Koetter, R.

doi:10.1109/izs.2006.1649082

Cited by 87 publications

(69 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since an important aspect of the proposed strategy for real-time traffic is to locate the coding and decoding nodes at different points in the network based on topology, network technology and node capabilities this could eventually be integrated with video codecs. Figure 7 offers a revisit of the file transfer problem that looks at path issues [7]. While this was done over a unicast network, it offers a view of the possibilities of NC for realtime traffic.…”

Section: Real-time Transmissionmentioning

confidence: 99%

Video-Centric Network Coding Strategies for 4G Wireless Networks: An Overview

Montpetit¹,

Médard²

2010

2010 7th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-The impact of Internet content and IP based television on networks is growing. Video is now ubiquitous in the home and on the street. It demands new approaches to video transmission to meet the growing traffic volume. This paper presents a novel strategy for network coding in video transmission. It uses a variety of coding approaches and adds feedback and device discovery to tailor the coding to the receiver ecosystems and can achieve better overall performance than the non coded versions.

show abstract

Section: Real-time Transmissionmentioning

confidence: 99%

Video-Centric Network Coding Strategies for 4G Wireless Networks: An Overview

Montpetit¹,

Médard²

2010

2010 7th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…Using the concept of a super-relay, we also ignore the complexity of scheduling among the relays using RLNC, hence our analysis provides a lower bound for E[N RLN C ]. In [2] a distributed algorithm to determine the optimal number of packets that must be sent by each node in the network to minimize E[N RLN C ] has been proposed that can be used to schedule transmissions in the network; however, it is not clear how this algorithm performs for finite B.…”

Section: Performance Analysis Of Rlnc Schemementioning

confidence: 99%

“…The asymptotic performance of NC, with large packet lengths and large coding block sizes, has been analyzed for different topologies with unicast [2] and multicast [3] flows, and relay channels [4] and the results show a…”

Section: Introductionmentioning

confidence: 99%

On the performance of Random Linear Network Coding in relay networks

Khalili

Ghaderi

Kurose

et al. 2008

MILCOM 2008 - 2008 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-We compare the reliability performance gain of Random Linear Network Coding (RLNC) with Automatic Repeat Request (ARQ) for a wireless relay network taking into account overhead and complexity of feedback mechanism as well as overhead due to encoding vector embedded in packet header under RLNC. Our goal is not to propose a new ARQ or RLNC error control protocol, but rather to study the fundamental properties of ARQ and RLNC under condition of finite block sizes. We consider an Enhanced ARQ (ARQ-E) scheme that exploits sender side path diversity between the sender and the relays as well as a Single Path Routing (ARQ-SPR) scheme that uses a hop-by-hop ARQ protocol. The performance metric of interest is reliability gain, the expected number of channel uses per data bit received at the receiver. In the case of AWGN channels, we compare the reliability performance of these protocols with each other and observe the fact that RLNC provides limited performance gains.

show abstract

“…Most existing works [4], [5] that have applied erasure coding to routing problems in unreliable environments assume that there is no limitation on the number of redundant erasure-coded packets for a message. This assumption is not realistic because the overhead of message transmission can be extremely high without proper restrictions on redundant packets.…”

Section: Introductionmentioning

confidence: 99%

Erasure-coding based utility routing in multi-hop wireless networks

2009

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems

View full text Add to dashboard Cite

Abstract-Recently, erasure coding has become widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Most existing works assume that the number of redundant erasure-coded packets is unlimited for a message. In this paper, we relax this assumption and integrate the packet quantity into a routing problem in order to achieve a good balance between energy cost and reliability (packet delivery ratio). In doing so, we encounter two major challenges in regards to our new routing problem: one is determining the optimal quantity of redundant packets and the other is determining the optimal routing path. We introduce a benefit value to reflect the trade-off between cost and reliability, and design a single metric (expected utility) by integrating benefit value, cost, and reliability. Based on the expected utility metric, we explore the optimality in both path coding and source coding models. In the path coding model, we design an optimal algorithm, and in the source coding model we propose a heuristic solution. Results from extensive simulations on our custom simulator verify our claims.

show abstract

Network Coding for Efficient Wireless Unicast

Cited by 87 publications

References 22 publications

Video-Centric Network Coding Strategies for 4G Wireless Networks: An Overview

Video-Centric Network Coding Strategies for 4G Wireless Networks: An Overview

On the performance of Random Linear Network Coding in relay networks

Erasure-coding based utility routing in multi-hop wireless networks

Contact Info

Product

Resources

About