Article

The road to IMT-advanced communication systems: State-of-the- art and innovation areas addressed by the WINNER + project

Ericsson AB, Stockholm
IEEE Communications Magazine (Impact Factor: 3.66). 07/2009; DOI: 10.1109/MCOM.2009.5116799
Source: IEEE Xplore

ABSTRACT Phases I and II of the WINNER project contributed to the development, integration, and assessment of new mobile network techniques from 2004 to 2007. Some of these techniques are now in the 3GPP LTE and IEEE 802.16 (WiMAX) standards, while others are under consideration for LTE-Advanced and 802.16m. The WINNER+ project continues this forwardlooking work for IMT-advanced technologies and their evolution, with a particular focus on 3GPP LTE-advanced. This article provides an overview of the WINNER system concept and several of its key innovative components.

0 Bookmarks
 · 
71 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Relaying is a promising enhancement to current radio technologies, which has been considered in IMT-Advanced candidate technologies such as 3GPP LTE-Advanced and IEEE 802.16m. Relay enhanced networks are expected to fulfill the demanding coverage and capacity requirements in a cost efficient way. Among various relaying architectures multi-hop moving relays can provide additional capacity for the cases when fixed relays are inaccessible or not able to provide adequate solutions in terms of cost. In this paper, an overview of multi-hop moving relays along with some of the envisioned deployment scenarios is presented. Furthermore, different types of multi-hop moving relays are discussed and the challenges are addressed.
    CoRR. 01/2012; abs/1202.0207.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The knowledge of channel state information (CSI) is crucial for improving the performance of cooperative communication systems. In multiuser two-hop relay systems, the global CSI between a relay and multiple source-and-destination nodes can be estimated at the relay, and the local CSI between each node and the relay can be estimated at each node. In this paper, we analyze the spectral efficiency of multicarrier code-division multiple-access (MC-CDMA) two-hop relay systems, either with global CSI only at the relay or with local CSI only at every node. We resort to asymptotical analysis with random-matrix theory to derive the average spectral efficiency of decode-and-forward (DF) and amplify-and-forward (AF) two-hop relay systems. We then analyze the impact of spreading sequences, fading channel statistics, and low-complexity transceivers. Analytical and simulation results show that when an orthogonal spreading sequence is used, the relay system with local CSI only at every node is spectrally more efficient than that with global CSI only at the relay. Moreover, an artificially constructed one-tap spreading sequence can achieve a good tradeoff between the performance and the complexity.
    IEEE Transactions on Vehicular Technology 01/2012; 61(8):3603-3614. · 2.06 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Next generation wireless technologies offer various services from voice call to full motion pictures and even to high speed internet access. Consequently, the service providers (SP) armed with different wireless technologies (like 2.5G/3G/LTE) would require an adequate and significant amount of spectrum bandwidth for satisfying the need of their customers. Hence to achieve complete commercialization, the SPs, operating simultaneously, would demand for more and more spectrum from the regulatory body of the country. The spectrum demand on the part of the SP may vary with time (dynamic) because of varied kind of loads which are generated depending on the nature of the client-base, their requirements and their expected quality of experience. This work has addressed this challenging issue of allocating spectrum dynamically to different technologies under the portfolio of an SP. Here, we have conceived a scenario where service providers (SP) own multiple access networks (ANs) of different technologies. We envisage that an entity, called local spectrum controller (LSC) which is dedicated for managing the common pool of spectrum allocated to each SP. LSC is mainly responsible for distributing the spectrum to individual ANs of an SP in a fair manner. Since the available spectrum may not be sufficient enough to satisfy the aggregate demand from all ANs simultaneously, an LSC may face a situation, where satisfying individual demands from all ANs may result in a compromise between the demand and supply. This demand–supply situation would force an LSC or an SP to adhere to some dynamic spectrum management strategy, where demands of an AN would have to be satisfied depending on the current state of available spectrum and required usage of it. This calls for an adaptive dynamic strategy to be introduced by an SP for efficient spectrum distribution. The dynamic disparity of spectrum allocation can be idealized as a game between LSC and ANs. Hence, in the present work, we have modeled the problem of dynamic spectrum allocation as an n-player cooperative bankruptcy game and have solved the problem with the help of Shapley value and τ-value separately. We have investigated whether the ANs find it beneficial to cooperate with each other to make the solution sustainable enough. To evaluate the performances of the games that the ANs play, we have designed a novel utility function for each AN. We have identified plausible aims of an SP as minimizing overall dissatisfaction (MOD) and maximizing equality of distribution (MED). Next, we have studied performances of the above two solution concepts against max–min fairness algorithm (benchmarked in our case) with respect to the above objectives of LSC. Finally, we have proposed a unique heuristic in order to facilitate the decision making process of dynamic spectrum allocation, which leads to an adaptive yet optimized spectrum allocation strategy.
    Engineering Applications of Artificial Intelligence 01/2013; 26(s 5–6):1620–1630. · 1.96 Impact Factor

Full-text (2 Sources)

View
212 Downloads
Available from
May 30, 2014