#### DMCA

## Optimal Resource Allocation in Relay-assisted Cellular Networks with Partial CSI (2009)

Venue: | IEEE Trans. on Signal Processing |

Citations: | 4 - 2 self |

### Citations

12155 | Elements of information theory. - Cover, Thomas - 1991 |

7181 | Convex optimization
- Boyd, Vandenberghe
- 2002
(Show Context)
Citation Context ... by (24) where the union is taken over the allocations satisfying (16) and (17). Lemma 3: The DL instantaneous achievable rate region is convex. Proof: For fixed , some properties of convex functions =-=[37]-=- can be used to show that the right-hand side of (18) is concave: the minimum of concave functions is concave, and the concavity of (19) and (20) can be shown resorting to the function , which is conc... |

1914 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maulloo, et al.
- 1998
(Show Context)
Citation Context ...ch as the IEEE 802.16 suite [14]–[16], the 3GPP LTE [22], and WiMAX [23] for synchronization purposes. With this setup, we aim at optimizing the network operation for maximizing network utility [21], =-=[24]-=-–[27] in a cell-by-cell approach. Centralized optimization is hence performed at each BS which, upon collection of CSI, takes scheduling decisions and implements resource allocation strategies shaping... |

1469 | Fundamentals of Wireless Communication. - Tse, Viswanath - 2005 |

1166 |
Gamal. Capacity theorems for the relay channel
- Cover, El
- 1979
(Show Context)
Citation Context ...ation of high spectral efficiencies and boost network performance, we assume that relay stations (RSs) are deployed within the cell coverage area to enhance the communicationbetween theusers and theBS=-=[1]-=-–[5]. Interpreting thepresence of relays as an extension of the network infrastructure enabling relay-assisted transmission, their locations are assumed to remain fixed, although they can indeed be op... |

800 |
A quantitative measure of fairness and discrimination for resource allo- in shared computer systems
- Jain, Chiu, et al.
- 1984
(Show Context)
Citation Context ...e we focus on the average steady-state per-user and link direction throughput (UL and DL directions are averaged together as their utilities are the same). It is plotted against Jain’s fairness index =-=[39]-=- in each direction for a given cell deployment. This index rates the degree of fairness incurred in serving competing flows with a real number between (worst case: one user gets it all) and 1 (best ca... |

660 | Fair end-to-end window-based congestion control
- Mo, Walrand
- 2000
(Show Context)
Citation Context ... network, there is no reason to focus on functions upper-bounded by 1. This can allow us to consider a wider class of utility functions. A useful example of best-effort utility function is the family =-=[38]-=- if if (47) where the choice of the parameter governs the way resources are shared among users, and its role shall be discussed later at the end of Section VI. B. Network Utility Maximization To accou... |

454 |
for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems,
- Standard
- 2004
(Show Context)
Citation Context ...nd data latency, and allows for finer granularity in resource allocation [13], a must in wideband systems. For these and other reasons, it results appealing for upcoming wireless networking standards =-=[14]-=-–[16]. The second choice is related to the availability and quality of channel state information (CSI) at each network location (BS, RSs, and MSs). In relayless OFDMA networks, centralized perfect CSI... |

435 | Fading relay channels: Performance limits and spacetime signal design
- Nabar, Bolcskei, et al.
- 2004
(Show Context)
Citation Context ...rmining the optimal relaying strategy) we shall adopt here the cooperation protocol of [6, Prop. 2], based on the decode-and-forward strategy [7], which comprises essentially some of the protocols in =-=[3]-=-, [5], [8], [9] as particular cases and is able to work with partial knowledge of the channel state. To make our approach more general, we let the BS, the RSs, and the MSs be equipped with an arbitrar... |

337 | Multiuser OFDM with adaptive subcarrier, bit, and power allocation,”
- Wong, Cheng, et al.
- 1999
(Show Context)
Citation Context ... links of our scenario. On the one hand, the amount of processing required to take advantage of perfect CSI can be formidable (the complexity has been shown to be NP-hard even for a relayless network =-=[18]-=-) and possibly non-affordable. On the other hand, for sufficiently fast time-varying channels, the necessary CSI refresh interval can happen to exceed the capacity of the limited-rate feedback channel... |

314 | Capacity bounds and power allocation for wireless relay channel
- Host-Madsen, Zhang
- 2005
(Show Context)
Citation Context ... power allocation across antennas is performed (see [28] for relay-assisted communication protocols where power allocation is performed assuming perfect CSI), the achievable rate in [bit/s] satisfies =-=[6]-=- (2) where the min function models whether it is the source-relay link or the source-destination link which act as information bottlenecks for the relayed message component, and (3) (4) where the s am... |

239 | A tutorial on cross-layer optimization in wireless networks - Lin, Shroff, et al. |

190 | Dual methods for nonconvex spectrum optimization of multicarrier systems
- Yu, Lui
- 2006
(Show Context)
Citation Context ...e form of per-tone fading state knowledge) can be used to allocate resources adaptively. Hence, bandwidth, power, and rate can be optimally assigned to align with the instantaneous network conditions =-=[17]-=-, yielding enormous performance gains. However, such perfect CSI is likely not to be available in all the links of our scenario. On the one hand, the amount of processing required to take advantage of... |

175 | On the capacity of MIMO relay channels - Wang, Zhang, et al. - 2005 |

144 | Capacity bounds via duality with applications to multi-antenna systems on flat fading channels
- Lapidoth, Moser
(Show Context)
Citation Context ...accurately performed offline by using Monte Carlo methods. However, as for Rayleigh fading and an or antenna configuration, results on the expectation of the logarithm of a Chi-square random variable =-=[35]-=- can be applied to show that (12) Authorized licensed use limited to: UNIVERSITAT POLITÈCNICA DE CATALUNYA. Downloaded on July 16, 2009 at 08:56 from IEEE Xplore.sRestrictions apply. 2814 IEEE TRANSAC... |

113 |
Capacity of multiple-antenna fading channels: spatial fading correlation, double scattering, and keyhole
- Shin, Lee
- 2003
(Show Context)
Citation Context ...over the fading distribution, i.e., the distribution of the matrices , the resulting expectations depend only on the link s and the products, and admit closed-form expressions for both the MIMO [10], =-=[31]-=- and the distributed MIMO [32] channel in case of Rayleigh fading. However, analytical expressions cannot be derived for other fading distributions like Ricean, that are common in the BS-RS link and i... |

98 | Joint optimization of relay strategies and resource allocations in a cooperative cellular network
- Ng, Yu
- 2007
(Show Context)
Citation Context ... the network. Even worse, propagation and processing delays on the feedback channels may result in outdated, useless CSI at the beginning of a resource allocation phase. Thus, unlike other works [17]–=-=[21]-=- we shall study the network scenario of all transmitters having perfect knowledge of the path loss of each of the channels, a slowly varying scalar parameter, but being ignorant of each per-tone fadin... |

73 | Optimal resource allocation in wireless ad hoc networks: A price-based approach
- Xue, Li, et al.
- 2006
(Show Context)
Citation Context ... the IEEE 802.16 suite [14]–[16], the 3GPP LTE [22], and WiMAX [23] for synchronization purposes. With this setup, we aim at optimizing the network operation for maximizing network utility [21], [24]–=-=[27]-=- in a cell-by-cell approach. Centralized optimization is hence performed at each BS which, upon collection of CSI, takes scheduling decisions and implements resource allocation strategies shaping the ... |

56 | Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications - Palomar, Chiang - 2007 |

54 | Resource allocation for wireless fading relay channels: Max-min solution
- Liang, Veeravalli, et al.
- 2007
(Show Context)
Citation Context ...d message component. Assuming that communication takes place over bandwidths (relay-receive subphase) and (relay-transmit subphase) and that uniform power allocation across antennas is performed (see =-=[28]-=- for relay-assisted communication protocols where power allocation is performed assuming perfect CSI), the achievable rate in [bit/s] satisfies [6] (2) where the min function models whether it is the ... |

32 | A resource allocation strategy for distributed MIMO multi-hop communication systems
- Dohler, Gkelias, et al.
- 2004
(Show Context)
Citation Context ...imal relaying strategy) we shall adopt here the cooperation protocol of [6, Prop. 2], based on the decode-and-forward strategy [7], which comprises essentially some of the protocols in [3], [5], [8], =-=[9]-=- as particular cases and is able to work with partial knowledge of the channel state. To make our approach more general, we let the BS, the RSs, and the MSs be equipped with an arbitrary number of ant... |

31 |
Distributed turbo codes: towards the capacity of the relay channel
- Zhao, Valenti
- 2003
(Show Context)
Citation Context ...e optimal relaying strategy) we shall adopt here the cooperation protocol of [6, Prop. 2], based on the decode-and-forward strategy [7], which comprises essentially some of the protocols in [3], [5], =-=[8]-=-, [9] as particular cases and is able to work with partial knowledge of the channel state. To make our approach more general, we let the BS, the RSs, and the MSs be equipped with an arbitrary number o... |

28 | Fair allocation of subcarrier and power in an OFDMA wireless mesh network
- Lee, Leung
- 2006
(Show Context)
Citation Context ...satisfaction of one user given its served throughput. Although many schemes implicitly assume utilities proportional to throughputs [17], [19], [30], we shall adopt here a more general approach as in =-=[20]-=-, [21], and [24]–[27]. We define a user utility function as a concave function of the (long-term) throughput , which is computed using the exponentially weighted smoothing (43) where stands for the th... |

27 | Is amplify-and-forward practically better than decodeand-forward or vice versa
- Yu, Li
- 2005
(Show Context)
Citation Context ... of the relay channel is still an open problem (so is determining the optimal relaying strategy) we shall adopt here the cooperation protocol of [6, Prop. 2], based on the decode-and-forward strategy =-=[7]-=-, which comprises essentially some of the protocols in [3], [5], [8], [9] as particular cases and is able to work with partial knowledge of the channel state. To make our approach more general, we let... |

25 |
Transmission and reception with multiple antennas: Theoretical foundations
- Biglieri, Taricco
- 2004
(Show Context)
Citation Context ...he RSs, and the MSs be equipped with an arbitrary number of antennas, denoted by , , and , respectively ( is the number of antennas of the th MS, ) such that extra performance gains arising from MIMO =-=[10]-=-–[12] can be also captured. Pursuing theapplicationofour results to practical scenarioswe are led to two important choices, the first one being the adoption 1053-587X/$25.00 © 2009 IEEE Authorized lic... |

20 |
Bounds for the determinant of the sum of hermitian matrices
- Fiedler
- 1971
(Show Context)
Citation Context ...the convexity of the function for all . Lemma 2: A lower bound to the ergodic capacity of an and distributed MIMO channel is (10) Proof: Since for and both and are Hermitian matrices, it follows from =-=[34]-=- that (11) The lemma follows by similarly applying Jensen’s inequality resorting twice to the function . 8Note that since , sfor . Fig. 2. Exact ergodi... |

15 |
Resource Allocation for FDMA-Based Regenerative Multihop Links
- Dohler, Gkelias, et al.
- 2004
(Show Context)
Citation Context ...plified transmit diversity [5]—Set to be too small to enable direct BS–MS reliable communication in the relay-receive subphase. Protocol II [3], receive diversity [3]—Set . Multihop relaying [5], =-=[29]-=-, [30]—Set and to be too small to enable direct BS–MS reliable communication in the relay-receive subphase. Direct transmission—Set and/or and/or . B. Universal Concave Lower Bounds on the Achievabl... |

14 | Cross-layer QoS Analysis of Opportunistic OFDM-TDMA
- Chang, Chien, et al.
(Show Context)
Citation Context ...time allowing a modular tone-based multiplexing of users. In addition, it improves upon TDMA with respect to achievable rates and data latency, and allows for finer granularity in resource allocation =-=[13]-=-, a must in wideband systems. For these and other reasons, it results appealing for upcoming wireless networking standards [14]–[16]. The second choice is related to the availability and quality of ch... |

8 |
On the approximation of MIMO capacity
- Dohler, Aghvami
- 2005
(Show Context)
Citation Context ...N RELAY-ASSISTED CELLULAR NETWORKS 2813 the parameter values and not that the same expression holds for all of them. Other parametric approaches have been taken to approximate MIMO ergodic capacities =-=[33]-=-, but oppositely to our needs, concavity with respect to durations, bandwidths, and powers was not guaranteed, parameter values were not systematically found (i.e., curve fitting was performed), and t... |

7 |
The Mobile Broadband WiMAX Standard
- Teo, Tao, et al.
- 2007
(Show Context)
Citation Context ...e provided that some pilot tones are placed within the transmission bandwidth, which is a common practice in OFDM-based standards such as the IEEE 802.16 suite [14]–[16], the 3GPP LTE [22], and WiMAX =-=[23]-=- for synchronization purposes. With this setup, we aim at optimizing the network operation for maximizing network utility [21], [24]–[27] in a cell-by-cell approach. Centralized optimization is hence ... |

5 |
Variable rate two phase collaborative communication protocols for wireless networks
- Ochiai, Mitran, et al.
- 2006
(Show Context)
Citation Context ...n of high spectral efficiencies and boost network performance, we assume that relay stations (RSs) are deployed within the cell coverage area to enhance the communicationbetween theusers and theBS[1]–=-=[5]-=-. Interpreting thepresence of relays as an extension of the network infrastructure enabling relay-assisted transmission, their locations are assumed to remain fixed, although they can indeed be optimi... |

3 |
Adaptive resource allocation based on channel information in multihop OFDM systems,” presented at the
- Bae, Cho
- 2006
(Show Context)
Citation Context ...in resource allocation problems, and allow us to describe the satisfaction of one user given its served throughput. Although many schemes implicitly assume utilities proportional to throughputs [17], =-=[19]-=-, [30], we shall adopt here a more general approach as in [20], [21], and [24]–[27]. We define a user utility function as a concave function of the (long-term) throughput , which is computed using the... |

3 | Unifying analysis of ergodic MIMO capacity in correlated Rayleigh fading environments
- Kießling
- 2005
(Show Context)
Citation Context ...i.e., the distribution of the matrices , the resulting expectations depend only on the link s and the products, and admit closed-form expressions for both the MIMO [10], [31] and the distributed MIMO =-=[32]-=- channel in case of Rayleigh fading. However, analytical expressions cannot be derived for other fading distributions like Ricean, that are common in the BS-RS link and include line-of-sight component... |

2 |
Resource allocation in multihop OFDMA Broadcast Networks
- Calvo, Fonollosa
- 2007
(Show Context)
Citation Context ...d transmit diversity [5]—Set to be too small to enable direct BS–MS reliable communication in the relay-receive subphase. Protocol II [3], receive diversity [3]—Set . Multihop relaying [5], [29], =-=[30]-=-—Set and to be too small to enable direct BS–MS reliable communication in the relay-receive subphase. Direct transmission—Set and/or and/or . B. Universal Concave Lower Bounds on the Achievable Rate... |