Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient Scheduling for Relay-Aided Broadcasting with Random Network Codes
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2011 (English)In: 2011 IEEE 22nd International Symposium On Personal Indoor And Mobile Radio Communications (PIMRC), New York: IEEE , 2011, 1815-1819 p.Conference paper, Published paper (Refereed)
Abstract [en]

We investigate efficient scheduling algorithms for a relay-aided broadcasting system using random network codes, where our objective is to maximize the transmission efficiency. The broadcast from a base-station (BS) is divided into an information phase and a redundancy phase, where the half-duplex relay assists in the redundancy phase. Time-division transmission is used over packet-erasure channels, where the erasure probabilities of the BS-to-relay and relay-to-user links are lower than the BS-to-user links. Following the information phase, each user provides feedback on the status of received packets to the BS and the relay, which in turn both generate redundancy packets for the redundancy phase. To improve efficiency, we formulate a scheduling problem for the transmissions of redundancy packets from the BS and the relay. We consider two scenarios; namely instantaneous feedback after each redundancy packet, and feedback after multiple redundancy packets. In the first case the schedule is determined using a greedy algorithm, while in the second case the schedule is determined using dynamic programming. To determine the performance with instantaneous feedback, we develop an analytic approach based on a Markov chain. Numerical results show that the transmission efficiency of the dynamic programming algorithm is close to the performance of the greedy algorithm, but requires significantly less feedback.

Place, publisher, year, edition, pages
New York: IEEE , 2011. 1815-1819 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-41482DOI: 10.1109/PIMRC.2011.6139821ISI: 000300719700352Scopus ID: 2-s2.0-84857559826ISBN: 978-1-4577-1348-4 (print)OAI: oai:DiVA.org:kth-41482DiVA: diva2:444004
Conference
22nd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) Location: Toronto, CANADA Date: SEP 11-14, 2011
Funder
ICT - The Next Generation
Note
QC 20110927Available from: 2011-09-27 Created: 2011-09-27 Last updated: 2012-04-10Bibliographically approved
In thesis
1. Wireless Broadcasting with Network Coding
Open this publication in new window or tab >>Wireless Broadcasting with Network Coding
2011 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Wireless digital broadcasting applications such as digital audio broadcast (DAB) and digital video broadcast (DVB) are becoming increasingly popular since the digital format allows for quality improvements as compared to traditional analogue broadcast. The broadcasting is commonly based on packet transmission. In this thesis, we consider broadcasting over packet erasure channels. To achieve reliable transmission, error-control schemes are needed. By carefully designing the error-control schemes, transmission efficiency can be improved compared to traditiona lautomatic repeat-request (ARQ) schemes and rateless codes. Here, we first study the application of a novel binary deterministic rateless (BDR) code. Then, we focus on the design of network coding for the wireless broadcasting system, which can significantly improve the system performance compared to traditional ARQ. Both the one-hop broadcasting system and a relay-aided broadcasting system areconsidered.

In the one-hop broadcasting system, we investigate the application of systematic BDR (SBDR) codes and instantaneously decodable network coding (IDNC). For the SBDR codes, we determine the number of encoded redundancy packets that guarantees high broadcast transmission efficiencies and simultaneous lowcomplexity. Moreover, with limited feedback the efficiency performance can be further improved. Then, we propose an improved network coding scheme that can asymptotically achieve the theoretical lower bound on transmission overhead for a sufficiently large number of information packets.

In the relay-aided system, we consider a scenario where the relay node operates in half duplex mode, and transmissions from the BS and the relay, respectively, are over orthogonal channels. Based on random network coding, a scheduling problem for the transmissions of redundancy packets from the BS and the relay is formulated. Two scenarios; namely instantaneous feedback after each redundancy packet, and feedback after multiple redundancy packets are investigated. We further extend the algorithms to multi-cell networks. Besides random network coding, IDNC based schemes are proposed as well. We show that significant improvements in transmission efficiency are obtained as compared to previously proposed ARQ and network-coding-based schemes.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2011. ix, 29 p.
Series
Trita-EE, ISSN 1653-5146 ; 2011:05
Keyword
wireless broadcasting, relay-aided system, systematic binary deterministic rateless codes, random network coding, instantaneously decodable network coding
National Category
Engineering and Technology
Identifiers
urn:nbn:se:kth:diva-40472 (URN)978-91-7501-082-3 (ISBN)
Presentation
2011-09-07, sal V3, KTH, Stockholm, 15:00 (English)
Opponent
Supervisors
Note
QC 20110907Available from: 2011-09-27 Created: 2011-09-15 Last updated: 2011-09-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Xiao, MingRasmussen, Lars KildehöjSkoglund, Mikael

Search in DiVA

By author/editor
Lu, LuXiao, MingRasmussen, Lars KildehöjSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 59 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf