Data networks
On the performance of ad hoc networks with beamforming antennas
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Transmission scheduling in ad hoc networks with directional antennas
Proceedings of the 8th annual international conference on Mobile computing and networking
Using directional antennas for medium access control in ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
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.