Cooperative Peer-to-Peer Repair for Wireless Multimedia Broadcast

Raza, Syed Ali; Li, Danjue; Chuah, Chen-Nee; Cheung, Gene

doi:10.1109/icme.2007.4284840

Cited by 38 publications

(32 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given the recent popularity of multi-homed mobile devices [5]-devices with both 3G cellular and IEEE 802.11 wireless interfaces-one potential solution to the broadcast packet loss problem is for a group of interconnected peers listening to the same video stream to use their 802.11 interfaces to cooperatively perform out-of-band repair of 3G broadcast losses. This is the premise behind our previously proposed cooperative peer-to-peer repair (CPR) framework [6] to combat WWAN packet losses. Having each correctly received a different subset of packets from WWAN broadcast (due to different channel conditions experienced), an ad-hoc network of peers can then locally broadcast their packets via 802.11 to cooperatively recover lost WWAN packets.…”

Section: Structured Network Coding and Cooperativementioning

confidence: 99%

“…Having each correctly received a different subset of packets from WWAN broadcast (due to different channel conditions experienced), an ad-hoc network of peers can then locally broadcast their packets via 802.11 to cooperatively recover lost WWAN packets. Using our developed heuristics, we showed in [6] that significant packet recovery can be achieved. Moreover, if we permit each peer to perform network coding (NC) [7]-linearly combining payloads of received packets in Galois Field where is the field size and is a positive integer-before forwarding packets, we showed in [8] that even further performance gain can be achieved.…”

Section: Structured Network Coding and Cooperativementioning

confidence: 99%

“…Theorem 1: Assuming the dimensions of the subspaces spanned by the native coefficient vectors in peers and are and , then the instantaneous innovative probability of the NC packet transmitted from to has a lower bound as follows: (6) where is the probability that the subspace spanned by vectors in is a subset of the subspace spanned by the vectors in , which can be calculated as (7) Proof: We leverage [19, Lemma 2.1], which stated if the subspace spanned by native coefficient vectors in the transmitting peer is not a subset of the subspace spanned by the native coefficient vectors in the receiving peer, then the probability that the subspace dimension increases at the receiving peer, i.e., the innovative probability, is at least . If dimension of is larger than dimension of , then obviously , and the first line of (6) follows.…”

Section: A Innovative Probability For Single Streammentioning

confidence: 99%

“…Equation (6) shows the innovative probability assuming dimensions of the subspaces and are known. Generally, we define the probability mass function (PMF) of the dimensions of the subspaces for the average peer as , and we can calculate the lower bound of the average innovative probability,…”

Section: A Innovative Probability For Single Streammentioning

confidence: 99%

See 3 more Smart Citations

Structured Network Coding and Cooperative Wireless Ad-Hoc Peer-to-Peer Repair for WWAN Video Broadcast

Liu¹,

Cheung

Chuah³

2009

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Abstract-In a scenario where each peer of an ad-hoc wireless local area network (WLAN) receives one of many available video streams from a wireless wide area network (WWAN), we propose a network-coding-based cooperative repair framework for the ad-hoc peer group to improve broadcast video quality during channel losses. Specifically, we first impose network coding structures globally, and then select the appropriate video streams and network coding types within the structures locally, so that repair can be optimized for broadcast video in a rate-distortion manner. Innovative probability-the likelihood that a repair packet is useful in data recovery to a receiving peer-is analyzed in this setting for accurate optimization of the network codes. Our simulation results show that by using our framework, video quality can be improved by up to 19.71 dB over un-repaired video stream and by up to 5.39 dB over video stream using traditional unstructured network coding.Index Terms-Cooperative peer-to-peer repair, network coding, wireless wide area network (WWAN) video broadcast.

show abstract

Section: Structured Network Coding and Cooperativementioning

confidence: 99%

Section: Structured Network Coding and Cooperativementioning

confidence: 99%

Section: A Innovative Probability For Single Streammentioning

confidence: 99%

Section: A Innovative Probability For Single Streammentioning

confidence: 99%

See 2 more Smart Citations

Structured Network Coding and Cooperative Wireless Ad-Hoc Peer-to-Peer Repair for WWAN Video Broadcast

Liu¹,

Cheung

Chuah³

2009

IEEE Trans. Multimedia

View full text Add to dashboard Cite

show abstract

“…In [4,1,2], some other P2P approaches use a secondary channel such as 802.11 or Bluetooth, with focus on mobile devices. We omit a detailed description of related work for space considerations.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Cooperative Repair of Wireless Broadcasts

Harwood

Voulgaris

Steen

2011

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Abstract. Wireless broadcasting systems, such as Digital Video Broadcasting (DVB), are subject to signal degradation, having an effect on end users' reception quality. Clearly, reception quality can be improved by increasing signal strength. This, however, comes at a significantly increased energy use, with adverse environmental and financial consequences, notably in either sparsely populated rural regions, or overly built and difficult to penetrate dense urban areas. This paper discusses our ongoing work on an alternative approach to improving reception quality, based on the collaborative repair of lossy packet streams among the community of DVB viewers. We present our main idea, the crucial design decisions, the algorithm, as well as preliminary results demonstrating the feasibility and efficiency of this approach.Keywords: Peer-to-Peer, Cooperative Repair, Video Broadcasting BackgroundWireless broadcasting systems, such as Digital Video Broadcasting [3] (DVB), are subject to interference from the environment, which can result in loss of information and an associated loss of quality for the user. Forward error correction (FEC) and interleaving based schemes involve high overhead on the essentially limited DVB bandwidth. In contrast, a cooperative peer-to-peer repair (CPR) mechanism relies on a primary channel being repaired using a CPR protocol on a secondary channel. We consider the primary channel to be a video stream and we have chosen the ISO/IEC 13818-1 Int. Std. as a case study, which is the standard used for DVB. We propose to use UDP over the Internet as the secondary channel. The ISO/IEC 13818-1 standard describes how to packetize streaming data, such as video and audio streams, for transmission and/or storage. In this case, where the transmission system is unreliable, the standard prescribes the use of Transport Stream (TS) packets of 188 bytes in length. The video and audio ⋆⋆ Research undertaken while on sabbatical at Vrije Universiteit

show abstract

Instantly decodable network codes for cooperative index coding problem over general topologies

Tajbakhsh

Sadeghi

Aboutorab

2014

2014 Australian Communications Theory Workshop (AusCTW)

View full text Add to dashboard Cite

We consider a group of n wireless clients and a set of k messages. Each client initially holds a subset of messages and is interested in an arbitrary subset of messages. Each client cooperates with other clients to obtain the set of messages it wants by exchanging instantly decodable network coded (IDNC) packets. This problem setting is known as the cooperative index coding problem. Clients are assumed to be connected through an arbitrary topology. In the absence of any known algorithm to complete the exchange of packets for general network topologies, we propose a greedy algorithm to satisfy the demands of all the clients with the aim of reducing the mean completion time. Our algorithm, in a completely distributed fashion, decides which subset of clients should transmit at each round of transmission and which messages should be coded together by each transmitting client to generate an IDNC packet. The algorithm encourages transmissions which are decodable for a larger number of clients and attempts to avoid collisions. We evaluate the performance of our algorithm via numerical experiments.

show abstract

Cooperative Peer-to-Peer Repair for Wireless Multimedia Broadcast

Cited by 38 publications

References 5 publications

Structured Network Coding and Cooperative Wireless Ad-Hoc Peer-to-Peer Repair for WWAN Video Broadcast

Structured Network Coding and Cooperative Wireless Ad-Hoc Peer-to-Peer Repair for WWAN Video Broadcast

Cooperative Repair of Wireless Broadcasts

Instantly decodable network codes for cooperative index coding problem over general topologies

Contact Info

Product

Resources

About