¹Department of Computer Science, University of North Georgia, Georgia,USA, 30597
²Department of Computer Science, Gonzaga University, Spokane, Washington, USA, 99258
³Department of Computer Science, University of Wyoming, Laramie, Wyoming, USA, 82071
⁴David R. Cheriton School of Computer Science, University of Waterloo, Canada, N2L3G1

---

Abstract—Wireless mesh networks have the potential to deliver Internet broadband access, wireless local area network coverage and network connectivity at low costs. The capacity of a wireless mesh network is improved by equipping mesh nodes with multi-radios tuned to non-overlapping channels. By letting these nodes utilize the available channels opportunistically, we increase the utilization of the available bandwidths in the channel space. The essential problem is how to allocate the channels to these multi-radio nodes, especially when they are heterogeneous with diverse transmission types and bandwidths. Most of current work has been based on the objective to achieve maximal total bandwidths. In this paper, we propose a new bipartite-graph based model and design channel allocation algorithms that maximize the minimal channel gain to achieve relative fairness. Our model maps heterogeneous network environment to a weighted graph. We then use augmenting path to update channel allocation status and use canonical form to compare the new status with previous status to achieve better fairness. Evaluations demonstrate that our algorithms improve fairness compared with related algorithms.

Index Terms—Dynamic Spectrum Allocation, Cognitive Radio, Mesh Networks

[PDF]

Cite: Jianjun Yang, Bryson Payne, Markus Hitz, Yanping Zhang, Ping Guoc, Le Li, "Fair Gain Based Dynamic Channel Allocation for Cognitive Radios in Wireless Mesh Networks," Journal of Computers vol. 9, no. 10, pp. 2335-2341, 2014.