Load-balancing routing for wireless access networks

Abstract

--Widespread use of wireless devices presents new challenges for network operators, who need to provide service to ever larger numbers of mobile end users, while ensuring Quality-of-Service guarantees. In this paper we describe a new distributed routing algorithm that performs dynamic load-balancing for wireless access networks. The algorithm constructs a load-balanced backbone tree, which simplifies routing and avoids per-destination state for routing and per-flow state for QoS reservations. We evaluate the performance of the algorithm using several metrics including adaptation to mobility, degree of load-balance, bandwidth blocking rate, and convergence speed. We find that the algorithm achieves better network utilization by lowering bandwidth blocking rates than other methods. I. INTRODUCTIONInternet appliances equipped with low-cost and short-range radios such as Bluetooth [2] and HomeRF [8] are expected to be widespread. Using these devices, mobile wireless users can access application servers from anywhere. Given the quality of service demands from the users all clamoring for access to the wired network infrastructure, a properly designed routing algorithm can maximize network efficiency and improve performance perceived by end users.For a wireless network, a routing system can be used for any of the following purposes:1. The wireless network is deployed for temporary use, or acts as an alternative infrastructure to the conventional wired network. Furthermore, the network is stationary in the sense that network nodes have fixed locations. Such a network can be a sensor network [3,6,11] or a rooftop network [1,18]. In this case, the routing system will configure routes automatically and quickly based on current radio links without necessarily requiring a trusted authority. 2. The wireless network is mobile. Because nodes may move, existing links can be broken and new ones can be created dynamically. The routing system will configure routes to reflect changing network topology. 3. The wireless network is required to provide QoS routes.For a given QoS demand, the routing system will attempt to find a satisfying route. 4. Suppose that traffic over the wireless network changes over time. The routing system will configure routes so that links evenly share current loads to minimize the bandwidth blocking rate resulting in better network utilization. Past research in routing for wireless networks, such as ad hoc networking [9], has mainly been for purposes 1 and 2. Some work has been for purpose 3, such as [4,19]. In this paper, we address a new routing problem: finding routes for wireless networks that will satisfy all the four purposes: 1, 2, 3 and 4. In particular, our routing algorithm will perform dynamic load-balancing to achieve 4.We focus on a special class of wireless networks, namely, "wireless access networks." Via such a network, an "end node," such as an information appliance, can send packets to and receive packets from an "egress node" that connects to the external networking infrastructure...

DECOR: Distributed construction of load balanced routing trees for many to one sensor networks

“…The first work in this area is from Hsiao et al who proposed a centralised algorithm for increasing the inner-corona balance of an arbitrary routing tree [15]. Their algorithm is iterative and in each iteration every node is examined to see if the balance of the tree can be improved by switching it (and its descendants) to a different parent.…”

Improving Quality of Service for Mobility Aware of Multi-path Routing Protocol for Load Balancing in Mobile Ad-Hoc Network

“…The Mobile Ad-hoc Network (MANET) is a collection of mobile nodes in which it communicate with each other via wireless links either directly or relying on other nodes as routers [3].The main harms in ad hoc networks are routing and characteristic of wireless communication. In infrastructure networks a node can communicate with all nodes within the same cell.Some vital characteristics of mobile ad-hoc networks arepeer-to-peer fashion during data transfer, dynamic topologyand mobility of nodes and in real-time such networks are heterogeneous.…”

A QOS Based Load Balanced Switch

“…The two stage load balancing switch is more scalable than the any other switch in the network architecture. Hardly load balanced switch got some problem with that, on sending and receiving the data in wired or wireless networks [8], the major problem with that is mis sequencing problems has arised to loss of data packets or mis matched data formats. Somehow in earlier they are tired to clear those problems with the algorithms named, Full frame first algorithm to get mis sequencing problems and they put the centralized schedular to achieve the 100% throughput results [4] [2] in their data packets.Oftenly they got the perfect data packets arrival in destination, but the problem with that methodology is the quality of data is reduced to lower.…”