Wireless mesh networks (WMNs) are becoming increasingly common for applications, according to its multi-radio and multi-channel advantage over their counterpart, wireless LANs. In WMNs, multiple simultaneous communications over multi-radios using orthogonal channels further improve traffic throughput. Certainly, effective routing and channel assignment are critical, at the same time. Recently, a number of profile-based routing algorithms have emerged, using multi-commodity network flow. Traffic profile used in them records the QoS requirements. But expectant bandwidth requirements may not be assured in wireless condition. Hence, in this paper, we demonstrate a scheme to compute the maximal possible guaranteed bandwidth. Our evaluation demonstrates that our algorithm performs much better than the famous Shortest Path Routing algorithm in routing traffic profile on Grid networks.
展开▼
