Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas

Shiva Kasiviswanathan, Bo Zhao, Sudarashan Vasudevan, Bhuvan Urgaonkar

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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 maxmin fair allocation as the objective for a subscriber-centric network, we present a dynamic programming algorithm that achieves the fairest allocation. 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 insights into these problems.

Original languageEnglish (US)
Pages (from-to)114-127
Number of pages14
JournalPervasive and Mobile Computing
Volume7
Issue number1
DOIs
StatePublished - Jan 1 2011

Fingerprint

Directional Antenna
Wireless Networks
Wireless networks
Infrastructure
Bandwidth
Antennas
Antenna
OPNET
Greedy Heuristics
Algorithm Design
Multiple Access
Proliferation
Dynamic programming
Dynamic Programming
Efficacy
Exceed
NP-complete problem
Maximise
Restriction
Requirements

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications
  • Applied Mathematics

Cite this

Kasiviswanathan, Shiva ; Zhao, Bo ; Vasudevan, Sudarashan ; Urgaonkar, Bhuvan. / Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas. In: Pervasive and Mobile Computing. 2011 ; Vol. 7, No. 1. pp. 114-127.
@article{74ca7ae990b442318faff02138ac6885,
title = "Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas",
abstract = "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 maxmin fair allocation as the objective for a subscriber-centric network, we present a dynamic programming algorithm that achieves the fairest allocation. 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 insights into these problems.",
author = "Shiva Kasiviswanathan and Bo Zhao and Sudarashan Vasudevan and Bhuvan Urgaonkar",
year = "2011",
month = "1",
day = "1",
doi = "10.1016/j.pmcj.2010.07.003",
language = "English (US)",
volume = "7",
pages = "114--127",
journal = "Pervasive and Mobile Computing",
issn = "1574-1192",
publisher = "Elsevier",
number = "1",

}

Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas. / Kasiviswanathan, Shiva; Zhao, Bo; Vasudevan, Sudarashan; Urgaonkar, Bhuvan.

In: Pervasive and Mobile Computing, Vol. 7, No. 1, 01.01.2011, p. 114-127.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kasiviswanathan, Shiva

AU - Zhao, Bo

AU - Vasudevan, Sudarashan

AU - Urgaonkar, Bhuvan

PY - 2011/1/1

Y1 - 2011/1/1

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 maxmin fair allocation as the objective for a subscriber-centric network, we present a dynamic programming algorithm that achieves the fairest allocation. 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 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 maxmin fair allocation as the objective for a subscriber-centric network, we present a dynamic programming algorithm that achieves the fairest allocation. 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 insights into these problems.

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

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

U2 - 10.1016/j.pmcj.2010.07.003

DO - 10.1016/j.pmcj.2010.07.003

M3 - Article

VL - 7

SP - 114

EP - 127

JO - Pervasive and Mobile Computing

JF - Pervasive and Mobile Computing

SN - 1574-1192

IS - 1

ER -