By Topic

Cross-Layer Fair Bandwidth Sharing for Multi-Channel Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rad, A.H.M. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC ; Wong, V.W.S.

In a wireless mesh network (WMN) with a number of stationary wireless routers, the aggregate capacity can be increased when each router is equipped with multiple network interface cards (NICs) and each NIC is assigned to a distinct orthogonal frequency channel. In this paper, given the logical topology of the network, we mathematically formulate a cross- layer fair bandwidth sharing problem as a non-linear mixed- integer network utility maximization problem. An optimal joint design, based on exact binary linearization techniques, is proposed which leads to a global maximum. A near-optimal joint design, based on approximate dual decomposition techniques, is also proposed which is practical for deployment. Performance is assessed through several numerical examples in terms of network utility, aggregate network throughput, and fairness index. Results show that our proposed designs can lead to multi-channel WMNs which are more efficient and fair compared to their single- channel counterparts. The performance gain on both efficiency and fairness increase as the number of available NICs per router or the number of available frequency channels increases.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:7 ,  Issue: 9 )