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
Wireless Broadcasting with Network Coding
KTH, School of Electrical Engineering (EES), Communication Theory. (Communication Theory)
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 [en]
wireless broadcasting, relay-aided system, systematic binary deterministic rateless codes, random network coding, instantaneously decodable network coding
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-40472ISBN: 978-91-7501-082-3 (print)OAI: oai:DiVA.org:kth-40472DiVA: diva2:441385
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
List of papers
1. Efficient wireless broadcasting based on systematic binary deterministic rateless codes
Open this publication in new window or tab >>Efficient wireless broadcasting based on systematic binary deterministic rateless codes
Show others...
2010 (English)In: IEEE International Conference on Communications, 2010Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the design and use of systematic binary deterministic rateless (BDR) codes for information transmission over block-erasure broadcast channels. BDR codes are designed to obtain a level of maximal distance separable (MDS) properties, making these codes ideal for the considered broadcast scenario. For a certain number of encoded redundancy blocks, we derive an expression for the probability that the MDS properties are maintained. Moreover, if limited feedback is available, we extend the BDR coding protocol to further improve the system performance. Numerical results show that for a finite number of source blocks and as the number of users grows the proposed systematic BDR codes performs significantly better than LT codes. The proposed schemes with feedback have better performance than traditional ARQ schemes.

Series
IEEE International Conference on Communications, ISSN 1550-3607
Keyword
Broadcast channels, Finite number, Information transmission, Limited feedback, LT codes, Maximal distance separable, Numerical results, Rateless codes, Wireless broadcasting, Numerical analysis, Codes (symbols)
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-30305 (URN)10.1109/ICC.2010.5502155 (DOI)000290335601048 ()2-s2.0-77955350421 (Scopus ID)
Conference
2010 IEEE International Conference on Communications, ICC 2010; Cape Town; 23 May 2010 through 27 May 2010
Note

QC 20110318

Available from: 2011-03-18 Created: 2011-02-23 Last updated: 2012-09-05Bibliographically approved
2. Efficient network coding for wireless broadcasting
Open this publication in new window or tab >>Efficient network coding for wireless broadcasting
Show others...
2010 (English)In: IEEE Wireless Communications and Networking Conference, WCNC, 2010Conference paper, Published paper (Refereed)
Abstract [en]

It has been shown in the literature that network coding can improve the transmission efficiency of wireless broadcasting as compared to traditional ARQ schemes. In this paper, 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 blocks. The proposed scheme makes use of an index allocation algorithm that distributes information blocks that have been erased during transmission into a minimum number of encoding sets , where each set represents the erased blocks to be jointly network encoded and retransmitted. Numerical results show that the proposed scheme enables higher transmission efficiencies than traditional ARQ, and previously proposed networks coding schemes for wireless broadcasting.

Keyword
Allocation algorithm, Coding scheme, Information blocks, Lower bounds, Network coding, Numerical results, Transmission efficiency, Wireless broadcasting, Broadcasting, Information theory, Numerical analysis, Wireless telecommunication systems, Wireless networks
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-41479 (URN)10.1109/WCNC.2010.5506109 (DOI)000299203100014 ()2-s2.0-77955032349 (Scopus ID)978-1-4244-6396-1 (ISBN)
Conference
IEEE Wireless Communications and Networking Conference 2010, WCNC 2010; Sydney, NSW; 18 April 2010 through 21 April 2010
Note

QC 20110927

Available from: 2011-09-27 Created: 2011-09-27 Last updated: 2012-09-05Bibliographically approved
3. Efficient Scheduling for Relay-Aided Broadcasting with Random Network Codes
Open this publication in new window or tab >>Efficient Scheduling for Relay-Aided Broadcasting with Random Network Codes
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
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-41482 (URN)10.1109/PIMRC.2011.6139821 (DOI)000300719700352 ()2-s2.0-84857559826 (Scopus ID)978-1-4577-1348-4 (ISBN)
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
4. Design and Analysis of Relay-aided Broadcast using Binary Network Codes
Open this publication in new window or tab >>Design and Analysis of Relay-aided Broadcast using Binary Network Codes
2011 (English)In: Journal of Communication, ISSN 0021-9916, E-ISSN 1460-2466, Vol. 6, no 8, 610-617 p.Article in journal (Refereed) Published
Abstract [en]

We consider a base-station broadcasting a set of order-insensitive packets to a user population over packet-erasure channels. To improve efficiency we propose relay-aided transmission using instantaneously-decodable binary network coding. The proposed coding schemes have the benefits of minimal decoding delay and low complexity. We further analyze the performance of the resulting broadcast schemes, and 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
Academy Publisher, 2011
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-41484 (URN)10.4304/jcm.6.8.610-617 (DOI)2-s2.0-80655142302 (Scopus ID)
Note

QC 20160420

Available from: 2011-09-27 Created: 2011-09-27 Last updated: 2017-12-08Bibliographically approved
5. Relay-aided multi-cell broadcasting with random network coding
Open this publication in new window or tab >>Relay-aided multi-cell broadcasting with random network coding
2010 (English)In: 2010 International Symposium on Information Theory and Its Applications, 2010, 957-962 p.Conference paper, Published paper (Refereed)
Abstract [en]

We investigate a relay-aided multi-cell broadcasting system using random network codes, where the focus is on devising efficient scheduling algorithms between relay and base stations. Two scheduling algorithms are proposed based on different feedback strategies; namely, a one-step scheduling algorithm with instantaneous feedback for each redundancy packet; and a multi-step scheduling algorithm with feedback only after multiple redundancy packets. For the latter case, dynamic programming is applied to determine optimal scheduling. Numerical results show that the transmission efficiency of the multi-step algorithm approaches that of the one-step algorithm, but requires significantly less feedback. They both significantly outperform corresponding ARQ and random scheduling approaches.

Keyword
Broadcasting systems, Feedback strategies, Multi-step, Multicell, Numerical results, Optimal scheduling, Random network, Random network coding, Step algorithms, Transmission efficiency, Broadcasting, Dynamic programming, Encoding (symbols), Information theory, Quality assurance, Redundancy, Spectroscopy, Telecommunication networks, Scheduling algorithms
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-41481 (URN)10.1109/ISITA.2010.5649536 (DOI)2-s2.0-78651342020 (Scopus ID)9781424460175 (ISBN)
Funder
ICT - The Next Generation
Note
QC 20110927Available from: 2011-09-27 Created: 2011-09-27 Last updated: 2011-10-30Bibliographically approved

Open Access in DiVA

fulltext(361 kB)746 downloads
File information
File name FULLTEXT02.pdfFile size 361 kBChecksum SHA-512
ec493a646cc4617845daa9e5deca92ff76007748d0b8f9e046824f0ea1469c585d86c4830529ef918d07f709ae16287f7b9bc590de6ce3485b020fa19868a3bc
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lu, Lu
By organisation
Communication Theory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 746 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 294 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