Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-rkxrd Total loading time: 0 Render date: 2024-07-16T14:04:34.364Z Has data issue: false hasContentIssue false

12 - Network coding in relay-based networks

from Part III - Relay-based cooperative cellular wireless networks

Published online by Cambridge University Press:  03 May 2011

Hong Xu
Affiliation:
University of Toronto, Canada
Baochun Li
Affiliation:
University of Toronto, Canada
Ekram Hossain
Affiliation:
University of Manitoba, Canada
Dong In Kim
Affiliation:
Sungkyunkwan University, Korea
Vijay K. Bhargava
Affiliation:
University of British Columbia, Vancouver
Get access

Summary

Introduction

Since its inception in information theory, network coding has attracted a significant amount of research attention. After theoretical explorations in wired networks, the use of network coding in wireless networks to improve throughput has been widely recognized. In this chapter, we present a survey of advances in relay-based cellular networks with network coding. We begin with an introduction to network coding theory with a focus on wireless networks. We discuss various network coded cooperation schemes that apply network coding on digital bits of packets or channel codes in terms of, for example, outage probability and diversity–multiplexing tradeoff. We also consider physical-layer network coding which operates on the electromagnetic waves and its application in relay-based networks. Then we take a networking perspective, and present in detail some scheduling and resource allocation algorithms to improve throughput using network coding in relay-based networks with a cross-layer perspective. Finally, we conclude the chapter with an outlook into future developments.

Network coding was first proposed in for noiseless wireline communication networks to achieve the multicast capacity of the underlying network graph. The essential idea of network coding is to allow coding capability at network nodes (routers, relays, etc.) in exchange for capacity gain, i.e., an alternative tradeoff between computation and communication. This can be understood by considering the classic “butterfly” network example. In Figure 12.1, suppose the source S wants to multicast two bits a and b to two sinks D1 and D2 simultaneously.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×