Please use this identifier to cite or link to this item:
Title: Cooperative coding and routing in multiple-terminal wireless networks
Keywords: Achievable rates, capacity, cooperative coding, information theory, multiple-terminal networks, routing
Issue Date: 1-Jul-2008
Citation: ONG LEE CHONG, LAWRENCE (2008-07-01). Cooperative coding and routing in multiple-terminal wireless networks. ScholarBank@NUS Repository.
Abstract: We investigate information-theoretic achievable rates for multiple-terminal wireless networks. First, we find the best way to route data from the source to the destination if each relay must fully decode the source message. We design an algorithm that finds a set of routes, containing a rate-maximizing one, without needing to optimize the code used by the nodes. In addition, we propose an algorithm with polynomial running time that finds an optimal route with high probability. Second, we study the trade-off between level of node cooperation and achievable rates. We find that the performance of local cooperation is close to that of whole-network cooperation in the low SNR regime. Last, we investigate achievable rates for networks where the source data might be correlated. We study how different coding strategies perform in different channel settings. For special cases, we show that some coding strategies actually approach the capacity.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis.pdf1.83 MBAdobe PDF



Page view(s)

checked on Apr 15, 2021


checked on Apr 15, 2021

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.