Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced Link-Status Detection for High Speed Link Aggregation in Cognitive Radio Networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Journal on Selected Areas in Communications
Opportunistic routing in multi-radio multi-channel multi-hop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Opportunistic routing in multi-radio multi-channel multi-hop wireless networks
IEEE Transactions on Wireless Communications
Improving the throughput of wireless mesh networks for web services
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
The design and evaluation of fair scheduling in wireless mesh networks
Journal of Computer and System Sciences
Computers and Electrical Engineering
Hi-index | 0.01 |
In this paper, we study joint rate control, routing and scheduling in multi-channel wireless mesh networks (WMNs), which are traditionally known as transport layer, network layer and MAC layer issues respectively. Our objective is to find a rate allocation along with a flow allocation and a transmission schedule for a set of end-to-end communication sessions such that the network throughput is maximized, which is formally defined as the maximum throughput rate allocation (MRA) problem. As simple throughput maximization may result in a severe bias on rate allocation, we take account of fairness based on a simplified max-min fairness model and the proportional fairness models. We define the max-min guaranteed maximum throughput rate allocation (MMRA) problem and proportional fair rate allocation (PRA) problem. We present efficient linear programming (LP) and convex programming (CP) based schemes to solve these problems. Numerical results show that proportional fair rate allocation schemes achieves a good tradeoff between throughput and fairness.