Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 10th annual international conference on Mobile computing and networking
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 11th annual international conference on Mobile computing and networking
Integrated topology control and routing in wireless optical mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A traffic conditioning algorithm for enhancing the fairness between TCP and UDP flows in diffserv
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Profile-based routing and traffic engineering
Computer Communications
A QoS Framework with Traffic Request in Wireless Mesh Network
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
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.