DSpace logo

Please use this identifier to cite or link to this item: http://142.54.178.187:9060/xmlui/handle/123456789/1106
Title: Merge-and-forward: a cooperative multimedia transmissions protocol using RaptorQ codes
Authors: Imtinan, Umera
Raza, Imran
Hussain, Syed Asad
Keywords: COMSATS
telecommunication network reliability
cooperative communication
decoding
error correction codes
multimedia communication
probability
forward error correction
protocols
relay networks (telecommunication)
Issue Date: 6-Oct-2016
Publisher: IET
Abstract: Recently, nodes cooperation has emerged as a popular means for improving the quality of multimedia delivery over fifth-generation cellular networks. However, in the conventional relaying scheme such as amplify-and-forward (AaF), there is a higher probability of duplicate packets at the receiver node which affect the decoding probability and consequently deteriorate the quality of multimedia transmission. In this study, the authors propose a cooperative multimedia transmission protocol based on a novel merge-and-forward relaying and the best relay selection (RS) schemes. Their best RS scheme is based on two important parameters: (i) two-hop link distances and (ii) minimum block error rate value. Moreover, to combat the packet loss for enhanced and reliable video delivery, they adopt application layer forward error correction scheme which is based on the most improved and advanced version of fountain codes (i.e. RaptorQ codes). They evaluate the performance of the proposed scheme under different time-sharing scenarios between the direct and best indirect transmission links in terms of decoding failure probability, decoding overhead, peak signal-to-noise ratio, and mean opinion score. Simulation results show that the proposed scheme outperforms the conventional AaF relaying scheme.
URI: http://142.54.178.187:9060/xmlui/handle/123456789/1106
ISSN: 1751-8636
Appears in Collections:Journals

Files in This Item:
File Description SizeFormat 
7581206.htm115 BHTMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.