Skip to main content

Low-Complexity Distributed Multibase Transmission and Scheduling

Abstract

This paper addresses the problem of base station coordination and cooperation in wireless networks with multiple base stations. We present a distributed approach to downlink multibase beamforming, which allows for the multiplexing of user terminals, randomly located in a network with base stations. In particular, we detail a low-complexity scheduling algorithm, which can be employed with different objective functions, exemplified here by two approaches: (1) maximizing the sum rate of the network; and (2) maximizing the number of users served, given a statistical constraint on the received rate per user. The optimizations are based on locally available information at each base station. Results show that our approaches yield significant gains, when compared to schemes that do not allow cooperation between cells. These gains are obtained without the extensive signaling overhead required in previously known multicell MIMO processing.

Publisher note

To access the full article, please see PDF.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Hilde Skjevling.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Skjevling, H., Gesbert, D. & Hjørungnes, A. Low-Complexity Distributed Multibase Transmission and Scheduling. EURASIP J. Adv. Signal Process. 2008, 741593 (2007). https://doi.org/10.1155/2008/741593

Download citation

Keywords

  • Information Technology
  • Quantum Information
  • Full Article
  • Publisher Note