TY - GEN

T1 - Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas

AU - Kasiviswanathan, Shiva

AU - Zhao, Bo

AU - Vasudevan, Sudarshan

AU - Urgaonkar, Bhuvan

PY - 2010

Y1 - 2010

N2 - Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a set of subscribers and one or more access points possessing directional antennas, we formalize the problem of orienting these antennas in two fundamental settings: (i) subscriber-centric, where the objective is to fairly allocate bandwidth among the subscribers and (ii) provider-centric, where the objective is to maximize the revenue generated by satisfying the bandwidth requirements of subscribers. For both the problems, we first design algorithms for a network with only one access point working under the assumption that the number of antennas does not exceed the number of non-interfering channels. Using the well-regarded lexicographic max-min fair allocation as the objective for a subscriber-centric network, we present an optimum dynamic programming algorithm. For a provider-centric network, the allocation problem turns out to be NP-hard. We present a greedy heuristic based algorithm that guarantees almost half of the optimum revenue. We later enhance both these algorithms to operate in more general networks with multiple access points and no restrictions on the relative numbers of antennas and channels. A simulation-based evaluation using OPNET demonstrates the efficacy of our approaches and provides us further in insights into these problems.

AB - Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a set of subscribers and one or more access points possessing directional antennas, we formalize the problem of orienting these antennas in two fundamental settings: (i) subscriber-centric, where the objective is to fairly allocate bandwidth among the subscribers and (ii) provider-centric, where the objective is to maximize the revenue generated by satisfying the bandwidth requirements of subscribers. For both the problems, we first design algorithms for a network with only one access point working under the assumption that the number of antennas does not exceed the number of non-interfering channels. Using the well-regarded lexicographic max-min fair allocation as the objective for a subscriber-centric network, we present an optimum dynamic programming algorithm. For a provider-centric network, the allocation problem turns out to be NP-hard. We present a greedy heuristic based algorithm that guarantees almost half of the optimum revenue. We later enhance both these algorithms to operate in more general networks with multiple access points and no restrictions on the relative numbers of antennas and channels. A simulation-based evaluation using OPNET demonstrates the efficacy of our approaches and provides us further in insights into these problems.

UR - http://www.scopus.com/inward/record.url?scp=77949628432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949628432&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-11322-2_31

DO - 10.1007/978-3-642-11322-2_31

M3 - Conference contribution

AN - SCOPUS:77949628432

SN - 3642113214

SN - 9783642113215

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 295

EP - 306

BT - Distributed Computing and Networking - 11th International Conference, ICDCN 2010, Proceedings

T2 - 11th International Conference on Distributed Computing and Networking, ICDCN 2010

Y2 - 3 January 2010 through 6 January 2010

ER -