Beam scheduling and relay assignment in wireless relay networks with smart antennas

Brendan Mumey, Jian Tang, Ivan Judson, Richard S. Wolff

Research output: Chapter in Book/Entry/PoemConference contribution

2 Scopus citations

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 the beam only towards intended receiving Subscriber Stations (SSs). In this paper, we study a joint problem of selecting a beam width and direction for the smart antenna at each RS and determining the RS assignment for SSs in each scheduling period. The objective is to maximize a utility function that can lead to a stable and high-throughput system. We define this as the Beam Scheduling and Relay Assignment Problem (BS-RAP). We show that BS-RAP is NP-hard, present a Mixed Integer Linear Programming (MILP) formulation to provide optimal solutions and present two polynomial-time greedy algorithms, one of which is shown to have a constant factor approximation ratio.

Original languageEnglish (US)
Title of host publication2013 Proceedings IEEE INFOCOM 2013
Pages130-134
Number of pages5
DOIs
StatePublished - 2013
Event32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013 - Turin, Italy
Duration: Apr 14 2013Apr 19 2013

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

Other32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013
Country/TerritoryItaly
CityTurin
Period4/14/134/19/13

Keywords

  • Wireless relay networks
  • approximation algorithm
  • beam scheduling
  • relay assignment
  • smart antenna

ASJC Scopus subject areas

  • General Computer Science
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Beam scheduling and relay assignment in wireless relay networks with smart antennas'. Together they form a unique fingerprint.

Cite this