Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
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
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
A survey on wireless mesh networks
IEEE Communications Magazine
| Hi-index | 0.24 |
With the ability of simultaneous transmissions, multi-channel multi-interface wireless mesh networks (WMNs) have emerged with great potential in the improvement of network throughput and fairness. However, most proposed channel assignment algorithms for WMNs made an assumption that the network interface cards (NICs) are evenly assigned to the mesh routers. In this paper, we investigate the problems of NIC assignment and bandwidth allocation to minimize the infrastructure cost, and meanwhile guarantee the application requirements. We argue evenly assigning NICs to all routers is neither a necessary condition nor an effective solution, since not only the interference but also the traffic flows are important factors that will affect the parallel use of the bandwidth. One of the principal challenges addressing these problems is their interactive impact on the optimization of network throughput. By analyzing all kinds of constraints for traffic, NIC and performance, we formally define a problem space that addresses the relationships between different assignment and allocation problems. Furthermore, we demonstrate that a hard NIC assignment and bandwidth allocation problem can be decomposed and formulated into a well-defined single or multiple-phase problem. In addition to the linear programming (LP) solutions, we propose novel efficient heuristics for on-line decisions for the situation whenever the network architecture changes and needs recompute the system performance in real-time. We show through extensive simulations that the heuristic algorithms can achieve close to optimal solution and outperform the equal NIC assignment method with even a smaller number of NICs.