• DocumentCode
    3085137
  • Title

    Relay Beam Selection with Directional Antennas

  • Author

    Mumey, Brendan ; Tang, Jian ; Xing, Yun ; Wolff, Richard

  • Author_Institution
    Dept. of Comput. Sci., Montana State Univ., Bozeman, MT, USA
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Relay Stations (RSs) can be deployed in a wireless network to extend its coverage and improve its capacity. Smart (directional) antennas can enhance the functionalities of RSs by forming one or multiple beams only towards intended receivers. In this paper, we focus on the topology control approach for efficient communications in wireless relay networks with smart antennas. This approach precomputes an antenna pattern for each node such that an efficient network topology can be formed for future communications. The corresponding optimization problem is formally defined as the Beam Selection Problem (BSP). First, we present an Integer Linear Programming (ILP) formulation to provide optimal solutions. Then we present a Linear Programming (LP) rounding-based algorithm for the BSP and show it has a constant factor approximation ratio. We also present a simple and fast greedy algorithm to solve the problem. Extensive simulation results show that the proposed algorithms provide close-to-optimal performance.
  • Keywords
    adaptive antenna arrays; directive antennas; greedy algorithms; integer programming; linear programming; radio networks; telecommunication network topology; directional antennas; greedy algorithm; integer linear programming; optimization; relay beam selection; relay stations; smart antennas; topology control; wireless relay networks; Approximation algorithms; Directional antennas; Network topology; Relays; Topology; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
  • Conference_Location
    Houston, TX, USA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-9266-4
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2011.6134412
  • Filename
    6134412