• DocumentCode
    1857197
  • Title

    Coordinated scheduling and beamforming for multicell spectrum sharing networks using branch & bound

  • Author

    Yu, Lei ; Karipidis, Eleftherios ; Larsson, Erik G.

  • Author_Institution
    Electr. Eng. Dept., Linkoping Univ., Linkoping, Sweden
  • fYear
    2012
  • fDate
    27-31 Aug. 2012
  • Firstpage
    819
  • Lastpage
    823
  • Abstract
    We consider the downlink of a multicell network where neighboring multi-antenna base stations share the spectrum and coordinate their frequency and spatial resource allocation strategies to improve the overall network performance. The objective of the coordination is to maximize the number of users that can be scheduled, meeting their quality-of-service requirements with the minimum total transmit power. The coordinated scheduling and multiuser transmit beamforming problem is combinatorial; we formulate it as a mixed-integer second-order cone program and propose a branch & bound algorithm that yields the optimal solution with relatively low-complexity. The algorithm can be used to motivate or benchmark approximation methods and to numerically evaluate the gains due to spectrum sharing and coordination.
  • Keywords
    antennas; array signal processing; integer programming; quality of service; resource allocation; tree searching; beamforming; branch & bound algorithm; coordinated scheduling; mixed-integer second-order cone program; multi-antenna base stations; multicell spectrum sharing networks; quality of service requirements; spatial resource allocation; Array signal processing; Complexity theory; Interference; Joints; Signal to noise ratio; Vectors; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
  • Conference_Location
    Bucharest
  • ISSN
    2219-5491
  • Print_ISBN
    978-1-4673-1068-0
  • Type

    conf

  • Filename
    6334281