A New paradigm for load balancing in WMNs

2008

Wireless Mesh Networks (WMNs) provide a cost-effective way of deploying a network and providing broadband Internet access. In WMNs a subset of nodes called gateways provide connectivity to the wired infrastructure (typically the Internet). Because traffic volume of WMNs is expected to be high, and due to limited wireless link capacity, gateways are likely to become a potential bottleneck. In this paper, we propose a distributed load-balancing protocol where gateways coordinate to reroute flows from congested gateways to under-utilized gateways. Unlike other approaches, our scheme takes into account the effects of interference. This makes it suitable for implementation in practical scenarios, achieving good results, and improving on shortest path routing. Also, it is load-sensitive and can improve network utilization in both balanced and skewed topologies. Simulation results prove the effectiveness of our approach, which outperforms all schemes tested. We have observed throughput gains of up to 80% over the shortest path algorithm.

2015

In Wireless Mesh Networks (WMNs), Gateways (GWs) plays an important role as they connect the WMN to a large number of wired networks. As a result all traffics are aggregated at the GW nodes which leads to traffic congestion at the GW and hence results in quicker failure of the GW. Due to limited capacity of the gateway, large number of packet drops occurs at the gateways which degrade the performance of the WMN. Hence this paper addressed the Load balancing of WMN. To do so, a clustering technique is been considered which divides the WMN into a number of clusters. After cluster formation, a cluster head is selected within each cluster, comprising all the information of each and every node and coordinates the transmission of packets\traffic within each cluster and also may exchange data to neighboring nodes. This paper proposed a k-means clustering method to divide the WMN into k clusters and hence to reduce its load within each cluster. The implementation of the proposed k-means clu...

International Journal of Computer Applications, 2015

Wireless Mesh Networks (WMN) is emerging as a promising technology platform for future generation wireless networking. It has distinct technical advantages over other available wireless technologies. However, the increasing requirement of smart users drives heavy data traffic in WMNs and hence their load management becomes crucial for efficient network operation. Smarter load management also leads to higher WMN reliability, enhanced throughput, scalability and network availability. This paper provides a detailed investigation of various load management techniques for WMNs proposed so far that will enable us to better understand load balancing and associated challenges.

Wireless mesh networks technology has drawn considerable attention as a promising broadband access technology despite the increase in the number of internet access technologies. It has been found that increasing the number of the gateways ordinarily, does not results in network throughputs as it is intended unless load balancing scheme is also employed in the network. A load balancing scheme is required to balance the traffic in the network across the various gateways nodes and avoids overloading any gateway node. In this paper, AODV routing protocol is modified to combine the route discovery process with a load balancing technique. The modified AODV selects a route to the destination based on the current load of the intermediate nodes and selects a gateway from the available mesh network gateways based on its current load, the simulations show that this load balancing technique will improve the performance of the wireless mesh networks.

Wireless Mesh Networks (WMN) with multiple gateway leads to load sharing problem. Good amount of work has been done on static load distribution in WMN. But has its own limitation because of dynamic nature load. Dynamic load sharing has been the focus of this work, as very little work is done on this. IEEE 802.11s proposal is in place have protocol for dynamic load shifting from one gateway region to the other. However creating dynamic partition around each gateway remains problem of research. We in this paper have proposed and simulated enhance dynamic load balancing among the partitions. That is, Internet Gateway (called Mesh Portal Point in 802.11s) load balancing problem using a graph theory heuristic for graph partitioning. Simulation results show increased mesh throughput.

ipcsit.com

Abstract. This paper proposes a load control routing scheme for intra cluster routing in wireless mesh networks. Unlike other existing schemes proposed for load balancing for wireless mesh networks, this routing scheme implements in a different manner for both ...

2008

In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.

This paper presents a theoretical as well as simulation model to measure throughput of Wireless Mesh Networks (WMN) at various stages of load sharing. We develop a queue based analytic model which allows us to calculate relative throughput of the multi-gateway WMN. The model is used to calculate WMN throughput improvement in three cases. The first case is when disjoint clusters are created around each gateway of WMN. In second case when a cluster gets overloaded it shares its load with a neighbour cluster. In the third case a wired network support is provided through internetworking when all the clusters are congested and cannot share load with each other. To analyse performance for these three cases we develop an analytic model based on queuing theory. The same three cases are also modelled using MATLAB simulation model. The results obtained through both the models are compared and were found to be very close to each other.

2011

Packet loss in Wireless Mesh Networks (WMNs) is due to congestion and probably due to high bit error rate caused by interference, link and node failures. Presently, congestion control and routing protocols in WMNs are not seen to have tamed this recurrent problem of congestion being experience most times in the wireless network. Routing techniques may lead to a co ngestive scenario and the congestion control should detect and probably avoid such situations. The way in which the congestion is handled may results in longer delay and more packet loss and a very significant overhead may also be incurred. Hence, this study takes a cl oser look at existing solutions with the application of clustering techniques to solve routing and congestion control problems because it offers scalability and reduced overheads. The study further exposes the weakness and added advantages of some of these cluster based solutions which can assist researchers to come up with broader approach to tackle the inherent problems of congestions and load balancing in an ad hoc network like WMNs. The paper conclude with a planned future research to device an appropriate level of tradeoff between computational overheads of cluster-based routing and high network throughput, low latency and delay while solving congestion problems.

International Review on Computers and Software, 2013

In wireless mesh networks, admission control and congestion mitigation are the essential techniques along with routing issues. Multi path routing can be used for efficiently allocating the resources and balancing the load. In this paper we propose algorithms to perform load balancing and admission control using multipath routing in Wireless Mesh Networks (WMNs). Admission control process is triggered during the arrival of new traffic request which is accepted or rejected based on the value of requested bandwidth in comparison with the available bandwidth. When we observe congestion in any of the links along the primary path, load balancing is performed in which the traffic is distributed along the least loaded alternate paths.