Broadcast erasure channel with feedback: The two multicast case-Algorithms and bounds

Simple item page
dc.contributor.authorOnaran, Efeen_US
dc.contributor.authorGatzianas, M.en_US
dc.contributor.authorFragouli, C.en_US
dc.coverage.spatialCalgary, AB, Canadaen_US
dc.date.accessioned2016-02-08T12:07:24Z
dc.date.available2016-02-08T12:07:24Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 7-9 June 2013en_US
dc.description.abstractWe consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of N users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages [1], [2], we propose a virtual queue based session-mixing algorithm, which does not require knowledge of channel statistics and achieves capacity for N = 2 and iid erasures. Since the extension of this algorithm to N > 2 is not straightforward, we describe a simple algorithm which outperforms standard timesharing for arbitrary N and is actually asymptotically better than timesharing, for any finite N, as the erasure probability goes to zero. We finally provide, through an information-theoretic analysis, sufficient but not necessary asymptotic conditions between N and n (the number of transmissions) for which the achieved sum rate, under any coding scheme, is essentially identical to that of timesharing. © 2013 IEEE.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:07:24Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1109/NetCod.2013.6570818en_US
dc.identifier.urihttp://hdl.handle.net/11693/27978
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/NetCod.2013.6570818en_US
dc.source.title2013 International Symposium on Network Coding (NetCod)en_US
dc.subjectBroadcast packeten_US
dc.subjectChannel statisticsen_US
dc.subjectCoding schemeen_US
dc.subjectErasure channelsen_US
dc.subjectInformation-theoretic analysisen_US
dc.subjectMulticast sessionsen_US
dc.subjectNumber of transmissionsen_US
dc.subjectSIMPLE algorithmen_US
dc.subjectCommunication channels (information theory)en_US
dc.subjectMulticastingen_US
dc.subjectNetwork codingen_US
dc.subjectSignal receiversen_US
dc.subjectAlgorithmsen_US
dc.titleBroadcast erasure channel with feedback: The two multicast case-Algorithms and boundsen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Broadcast erasure channel with feedback The two multicast case - Algorithms and bounds.pdf
Size:
329.92 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Electrical and Electronics Engineering