Introduction to algorithms
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
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
Architecture and evaluation of an unplanned 802.11b mesh network
Proceedings of the 11th annual international conference on Mobile computing and networking
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
Proceedings of the 12th annual international conference on Mobile computing and networking
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
Proceedings of the 12th annual international conference on Mobile computing and networking
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignment and link scheduling is essential for throughput improvement. Effective channel assignment schemes can greatly relieve the interference effect between nearby transmissions. However, not only the links in wireless mesh network using different channels can be activated at a time, but some links in the same channel also can be activated concurrently if the SNIR (Signal-to-Noise and Interference Ratio) at their receiver endpoints is not lower than the threshold. In this paper, we investigate the problem of how to schedule a set of feasible transmission under physical interference model by using the Spatial TDMA access scheme and channel assignment in wireless mesh networks. We also consider the fairness enhancement to prevent some border nodes of the network from starvation. By using Minimum Spanning Tree as network subgraph constructed from original network graph, we propose centralized algorithms for scheduling and channel assignment to maximize the aggregate throughput and to provide the fairness of the network. We also evaluate the throughput improvement and fairness enhancement of our algorithms through extensive simulations and the results show that our algorithm can achieve significant aggregate throughput and fairness performance.