Theoretical Maximum Throughput of IEEE 802.11 and its Applications
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
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
Rate Performance Objectives of Multihop Wireless Networks
IEEE Transactions on Mobile Computing
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Topology Optimization for Backbone Wireless Mesh Networks
CNSR '07 Proceedings of the Fifth Annual Conference on Communication Networks and Services Research
Improving Quality of Service and Assuring Fairness in WLAN Access Networks
IEEE Transactions on Mobile Computing
The nominal capacity of wireless mesh networks
IEEE Wireless Communications
Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions
IEEE Communications Magazine
Hi-index | 0.00 |
Multiradio wireless mesh network (WMN) is a feasible choice for several applications, as routers with multiple network interface cards have become cheaper. Routing in any network has a great impact on the overall network performance, thus a routing protocol or algorithm for WMN should be carefully designed taking into account the specific characteristics of the network. In addition, in wireless networks, serious unfairness can occur between users if the issue is not addressed in the network protocols or algorithms. In this paper, we are proposing a novel centralized routing algorithm, called Subscriber Aware Fair Routing in WMN (SAFARI), for multiradio WMN that assures fairness, leads to a feasible scheduling, and does not collapse the aggregate network throughput with a strict fairness criterion. We show that our protocol is feasible and practical, and exhaustive simulations show that the performance is improved compared to traditional routing algorithms.