Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
MP-DSR: A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploiting multiple rates to maximize the throughput of wireless mesh networks
IEEE Transactions on Wireless Communications
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In wireless networks, it is very important to optimize the number of channels, due to the limit on the number of usable channels in a given network. In addition, multimedia services with high QoS requirements with respect to throughput and delay have recently become popular. To satisfy these requirements, it has become important to find a way of providing multipath transmission. A channel assignment algorithm is presented that minimizes the number of required channels while satisfying the throughput requirements of source---destination pairs in multichannel, multiradio, multirate wireless mesh networks. A mathematical model is proposed that considers interference effect, link capacity, and throughput requirements. A novel channel assignment algorithm is developed that takes into account multipath selection, channel reusability, link capacity sharing, and global optimization. The performance of the algorithm is compared with that of CPLEX, using 24 network scenarios. The maximum gap between the CPLEX solutions and those of the proposed algorithm is, on average, only 4.8%.