Title :
Beam scheduling and relay assignment in wireless relay networks with smart antennas
Author :
Mumey, Brendan ; Jian Tang ; Judson, Ivan ; Wolff, Richard S.
Author_Institution :
Dept. of Comput. Sci., Montana State Univ., Bozeman, MT, USA
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.
Keywords :
adaptive antenna arrays; computational complexity; directive antennas; greedy algorithms; optimisation; polynomial approximation; relay networks (telecommunication); scheduling; BS-RAP; MILP formulation; NP-hard; beam scheduling; directional antennas; mixed integer linear programming; polynomial-time greedy algorithms; receiving subscriber stations; relay assignment problem; relay stations; scheduling period; smart antennas; throughput system; wireless relay networks; Approximation algorithms; Directional antennas; Directive antennas; Relays; Scheduling; Wireless communication; Wireless relay networks; approximation algorithm; beam scheduling; relay assignment; smart antenna;
Conference_Titel :
INFOCOM, 2013 Proceedings IEEE
Conference_Location :
Turin
Print_ISBN :
978-1-4673-5944-3
DOI :
10.1109/INFCOM.2013.6566749
