TY - GEN
T1 - Video multicast through cooperative incremental parity packet transmission
AU - Guo, Zhili
AU - Wang, Yao
AU - Erkip, Elza
AU - Panwar, Shivendra
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - In this paper, a cooperative multicast scheme that uses Randomized Distributed Space Time Codes (R-DSTC), along with packet level Forward Error Correction (FEC), is studied. Instead of sending source packets and parity packets through two hops using R-DSTC as proposed in our prior work, the new scheme delivers both source packets and parity packets using only one hop. The source station (access point, AP) first sends all the source packets, then the source as well as all nodes that have received all source packets together send the parity packets using R-DSTC. As more parity packets are transmitted, more nodes can decode all source packets and join the parity packet transmission. The process continues until all nodes acknowledge (through feedback) the receipt of enough packets for recovering the source packets. For each given node distribution, the optimum transmission rates for source and parity packets, are determined such that the video rate that can be sustained at all nodes is maximized. This new scheme can support significantly higher video rates (and correspondingly higher PSNR of decoded video) than the prior approaches. We further present two suboptimal approaches, which do not require full information about user distribution and feedback, and hence are more feasible in practice. The new scheme using only the node count information and without feedback still outperforms our prior approach that assumes full channel information and no feedback, when the node density is sufficiently high.
AB - In this paper, a cooperative multicast scheme that uses Randomized Distributed Space Time Codes (R-DSTC), along with packet level Forward Error Correction (FEC), is studied. Instead of sending source packets and parity packets through two hops using R-DSTC as proposed in our prior work, the new scheme delivers both source packets and parity packets using only one hop. The source station (access point, AP) first sends all the source packets, then the source as well as all nodes that have received all source packets together send the parity packets using R-DSTC. As more parity packets are transmitted, more nodes can decode all source packets and join the parity packet transmission. The process continues until all nodes acknowledge (through feedback) the receipt of enough packets for recovering the source packets. For each given node distribution, the optimum transmission rates for source and parity packets, are determined such that the video rate that can be sustained at all nodes is maximized. This new scheme can support significantly higher video rates (and correspondingly higher PSNR of decoded video) than the prior approaches. We further present two suboptimal approaches, which do not require full information about user distribution and feedback, and hence are more feasible in practice. The new scheme using only the node count information and without feedback still outperforms our prior approach that assumes full channel information and no feedback, when the node density is sufficiently high.
KW - Incremental parity transmission
KW - Randomized distributed space time coding
KW - User cooperation
KW - Video multicast
KW - Wireless networks
UR - http://www.scopus.com/inward/record.url?scp=84875996532&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875996532&partnerID=8YFLogxK
U2 - 10.1145/2457413.2457418
DO - 10.1145/2457413.2457418
M3 - Conference contribution
AN - SCOPUS:84875996532
SN - 9781450318938
T3 - MoVid 2013 - Proceedings of the 5th Workshop on Mobile Video
SP - 19
EP - 24
BT - MoVid 2013 - Proceedings of the 5th Workshop on Mobile Video
T2 - 5th Workshop on Mobile Video, MoVid 2013
Y2 - 27 February 2013 through 27 February 2013
ER -