Skip to main navigation Skip to search Skip to main content

Fair bandwidth allocation in wireless mesh networks with cognitive radios

    Research output: Contribution to scientific journalArticle in an indexed scientific journalpeer-review

    52 Scopus citations

    Abstract

    Wireless mesh networks (WMNs) are considered to be an economical solution for last-mile broadband Internet access. In this paper, we study end-to-end bandwidth allocation in WMNs with cognitive radios, which involves routing, scheduling, and spectrum allocation. To achieve a good tradeoff between fairness and throughput, we define two fair bandwidth-allocation problems based on a simple maxmin fairness model and the well-known lexicographical maxmin (LMM) fairness model, respectively. We present linear programming (LP)-based optimal and heuristic algorithms to solve both problems. Extensive simulation results are presented to justify the effectiveness of the proposed algorithms.

    Original languageEnglish
    Article number5353654
    Pages (from-to)1487-1496
    Number of pages10
    JournalIEEE Transactions on Vehicular Technology
    Volume59
    Issue number3
    DOIs
    StatePublished - Mar 2010

    Bibliographical note

    Funding Information:
    Manuscript received May 8, 2009; revised August 28, 2009 and October 15, 2009. First published December 15, 2009; current version published March 19, 2010. This work was supported in part by the National Science Foundation under Grant CNS-0721803, Grant CNS-0721880, Grant CNS-0845776, and Grant CNS-0905603. The review of this paper was coordinated by Prof. Y. Cheng.

    Keywords

    • Bandwidth allocation
    • Cognitive radios
    • Crosslayer optimization
    • Fairness
    • Lexicographical maxmin (LMM) Fairness
    • Routing, scheduling
    • Spectrum allocation
    • Wireless mesh networks (WMNs)

    Fingerprint

    Dive into the research topics of 'Fair bandwidth allocation in wireless mesh networks with cognitive radios'. Together they form a unique fingerprint.

    Cite this