Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/45495
Title: | On network coding in wireless cooperative and cognitive communications | Authors: | Li, Qiang | Keywords: | DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems | Issue Date: | 2011 | Source: | Li, Q. (2011). On network coding in wireless cooperative and cognitive communications. Doctoral thesis, Nanyang Technological University, Singapore. | Abstract: | Network coding, first proposed in the seminal work by Ahlswede, Cai, Li, and Yeung, has attracted significant interest in the last decade in both academia and the industry due to its versatility and promising potential in improving the performance of communication networks. In contrast to conventional routing architecture which is typical in most computer networks where intermediate nodes of a network can only store-and-forward the received packets, the intermediate nodes are allowed to perform random mapping of the received packets in network coding. With independent information flows intended for different receivers combining at the intermediate nodes, the bottleneck of data communications has shifted from point-to-point links to the whole network topology. Although network coding was originally designed for wireline networks with error-free links, wireless networks provide a fertile ground for various applications based on network coding. | URI: | https://hdl.handle.net/10356/45495 | DOI: | 10.32657/10356/45495 | Schools: | School of Electrical and Electronic Engineering | Research Centres: | Positioning and Wireless Technology Centre | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
Appears in Collections: | EEE Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Te0702038E.pdf | 1.28 MB | Adobe PDF | ![]() View/Open |
Page view(s) 50
573
Updated on Mar 11, 2025
Download(s) 20
296
Updated on Mar 11, 2025
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.