4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Fair Bandwidth Allocation Framework for Heterogeneous Multi-Radio Wireless Mesh Networks

  • @INPROCEEDINGS{10.1109/BROADNETS.2007.4550529,
        author={Shree Raman and Aura Ganz and Ramgopal R. Mettu},
        title={Fair Bandwidth Allocation Framework for Heterogeneous Multi-Radio Wireless Mesh Networks},
        proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2010},
        month={5},
        keywords={},
        doi={10.1109/BROADNETS.2007.4550529}
    }
    
  • Shree Raman
    Aura Ganz
    Ramgopal R. Mettu
    Year: 2010
    Fair Bandwidth Allocation Framework for Heterogeneous Multi-Radio Wireless Mesh Networks
    BROADNETS
    IEEE
    DOI: 10.1109/BROADNETS.2007.4550529
Shree Raman1,*, Aura Ganz1,*, Ramgopal R. Mettu1,*
  • 1: Department of Electrical and Computer Engineering University of Massachusetts Amherst, Amherst, MA 01003
*Contact email: sraman@ecs.umass.edu, ganz@ecs.umass.edu, mettu@ecs.umass.edu

Abstract

To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute the backbone of Wireless Mesh Networks (WMNs) will be equipped with multiple radios of different technology standards. The multiplicity of channels, radios and technology standards makes the problem of efficient network utilization in a WMN more challenging. Unlike previous works that focused only on homogeneous WMNs, in this paper, we focus on determining an effective routing, channel assignment and scheduling scheme that maximizes the network capacity, while maintaining node level fairness in a heterogeneous network setting. We first introduce a novel graph model that captures the WMN heterogeneity in terms of the number of radios and radio technologies. Using this model, we provide an optimization formulation that determines the effective routing scheme and traffic values on each edge. To determine an interference-free channel assignment of these traffic values, we introduce a joint channel assignment and scheduling algorithm that preserves node level fairness. We perform an extensive evaluation of our solution in homogeneous and heterogeneous networks and study the impact of the number of orthogonal channels, radios, gateways and the aggregate traffic demand on the performance of our solution. Our results show that the proposed scheme obtains node level fairness while maximizing the network capacity.