Network coding in relay networks Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/j9602276w

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Transmission over wireless networks presents multiple technical challenges due to noise, interference, fading, power constraints and bandwidth limitation. Different solutions have been propposed to overcome these issues and some of them are treated here. Cooperative diversity has been proposed as an implementation for networks where terminals are restricted to using physical arrays; this technique implements space diversity by creating virtual antennas arrays with cooperating nodes in order to combat multipath fading. Network Coding recently has been presented as a technique to increase the throughput in multicast networks. Most of the work done on the topic considers an error free transmission and few works have taken into account the errors due to the nature of the wireless channel. This thesis proposes the use of network coding over some scenarios in relay networks, in order to obtain diversity. It also addresses some cooperative protocols and their performance in terms of bit error rate. Reliability criteria based on channel information are established for a practical network implementation. In short, we propose a scheme for a wireless network using ideas based on network coding.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Language
File Format
File Extent
  • 415926 bytes
Replaces
Additional Information
  • description.provenance : Submitted by Eduardo Alban (albane@onid.orst.edu) on 2007-09-14T21:40:24Z No. of bitstreams: 1 thesis.pdf: 415926 bytes, checksum: 444cfe5840db7bd03d464b9df529e056 (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2007-09-20T17:10:58Z (GMT) No. of bitstreams: 1 thesis.pdf: 415926 bytes, checksum: 444cfe5840db7bd03d464b9df529e056 (MD5)
  • description.provenance : Made available in DSpace on 2007-09-20T17:11:00Z (GMT). No. of bitstreams: 1 thesis.pdf: 415926 bytes, checksum: 444cfe5840db7bd03d464b9df529e056 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2007-09-17T17:02:13Z (GMT) No. of bitstreams: 1 thesis.pdf: 415926 bytes, checksum: 444cfe5840db7bd03d464b9df529e056 (MD5)

Relationships

In Administrative Set:
Last modified: 08/01/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items