Data networks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Design of a fair bandwidth allocation policy for VBR traffic in ATM networks
IEEE/ACM Transactions on Networking (TON)
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
A MAC protocol for full exploitation of directional antennas in ad-hoc wireless networks
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
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
Deafness: A MAC Problem in Ad Hoc Networks when using Directional Antennas
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Enhancing the Performance of Ad Hoc Wireless Networks with Smart Antennas
Enhancing the Performance of Ad Hoc Wireless Networks with Smart Antennas
Long distance wireless mesh network planning: problem formulation and solution
Proceedings of the 16th international conference on World Wide Web
MobiSteer: using steerable beam directional antenna for vehicular network access
Proceedings of the 5th international conference on Mobile systems, applications and services
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks
Computers and Operations Research
Hi-index | 0.01 |
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 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.