Abstract

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.

Highlights

  • Wireless mesh network (WMN) [1] has recently appeared as a promising technology, which can increase coverage area and capacity of existing wireless networks

  • The bottleneck collision domain (BCD) can be used to estimate the maximum number of users in a network with a fixed data rate since if each user transmits at rate r, Cb = m·r, where m Z+, and the link bandwidth is L, the throughput per node Gm will be bounded by Gm ≤ L/m [9]

  • The simulation results show that the proposed routing algorithm Subscriber Aware Fair Routing in WMN (SAFARI) outperforms collision domain (CD) and distance-based routing algorithms in terms of the increased network throughput and the number of admitted users

Read more

Summary

Introduction

Wireless mesh network (WMN) [1] has recently appeared as a promising technology, which can increase coverage area and capacity of existing wireless networks. Users with multiple hops can be completely starved, while capacity, in terms of throughput, is maximized This is naturally not fair, especially if the users pay the same amount for the service. Routing in WMN has been seen from the point of view of the mesh routers (e.g., in [3]). As they are, mesh routers do not generate traffic, they only forward traffic of users and other routers. Subscribers can be unevenly distributed in the network; the number of subscribers registered to a mesh router can vary significantly This is neglected in most of capacity and routing studies, where one user per router is assumed (e.g., in [4]).

Related Work
Preliminaries
Proposed Algorithm
Findings
Conclusions and Summary
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.