Please use this identifier to cite or link to this item:
|Title:||End-to-end resource allocation in OFDM based linear multi-hop networks||Authors:||Zhang, X.
|Issue Date:||2008||Citation:||Zhang, X.,Jiao, W.,Tao, M. (2008). End-to-end resource allocation in OFDM based linear multi-hop networks. Proceedings - IEEE INFOCOM : 1552-1560. ScholarBank@NUS Repository. https://doi.org/10.1109/INFOCOM.2007.140||Abstract:||We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple relays. The problem is to maximize the end-to-end average transmission rate under a long-term total power constraint by adapting the transmission power on each subcarrier over each hop and the transmission time used by each hop in every time frame. The solution to the problem is derived by decomposing it into two subproblems: short-term time and power allocation given an arbitrary total power constraint for each channel realization, and total power distribution over all channel realizations. We show that the optimal solution has the following features: the power allocation on subcarriers over each hop has the water-filling structure and a higher water level is given to the hop with relatively poor channel condition; meanwhile, the fraction of transmission time allocated to each hop is adjusted to keep the instantaneous rates over all hops equal. To tradeoff between performance, computational complexity and signalling overhead, three suboptimal resource allocation algorithms are also proposed. Numerical results are illustrated under different network settings and channel environments. © 2008 IEEE.||Source Title:||Proceedings - IEEE INFOCOM||URI:||http://scholarbank.nus.edu.sg/handle/10635/70162||ISBN:||9781424420261||ISSN:||0743166X||DOI:||10.1109/INFOCOM.2007.140|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 3, 2022
checked on Aug 4, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.