Conference Paper

Integrating Traffic Estimation and Routing Optimization for Multi-Radio Multi-Channel Wireless Mesh Networks

Vanderbilt Univ., Nashville
DOI: 10.1109/INFOCOM.2008.23 Conference: INFOCOM 2008. The 27th Conference on Computer Communications. IEEE
Source: IEEE Xplore

ABSTRACT Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In this problem formulation, traffic demand is usually implicitly assumed as static and known a priori. Contradictorily, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, in order to apply the optimization-based routing solution into practice, one must take into account the dynamic and unpredictable nature of wireless traffic demand. This paper presents an integrated framework for network routing in multi-radio multi-channel wireless mesh networks under dynamic traffic demand. This framework consists of two important components: traffic estimation and routing optimization. By analyzing the traces collected at wireless access points, the traffic estimation component predicts future traffic demand based on its historical value using time-series analysis, and represents the prediction result in two forms - mean value and statistical distribution. The optimal mesh network routing strategies then take these two forms of traffic demand estimations as inputs. In particular, two routing algorithms are proposed based on linear programming which consider the mean value and the statistical distribution of the predicted traffic demands, respectively. The trace-driven simulation study demonstrates that our integrated traffic estimation and routing optimization framework can effectively incorporate traffic dynamics in mesh network routing, where both algorithms outperform the shortest path algorithm in about 80% of the test cases.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we consider wireless mesh networks (WMNs) used to share the Internet connectivity of sparsely deployed fixed lines with heterogeneous capacity, ranging from ISP-owned high-speed links to subscriber-owned low-speed connections. If traffic is routed in the mesh without considering the load distribution and the bandwidth of Internet connections, some gateways may rapidly get overloaded because they are selected by too many mesh nodes. This may cause a significant reduction of the overall network capacity. To address this issue, in this paper we first develop a queuing network model that predicts the residual capacity of network paths, and identifies network bottlenecks. By taking advantage of this model, we design a novel Load-Aware Route Selection algorithm, named LARS, which improves the network capacity by allocating network paths to upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ Internet connections. Using simulations and a prototype implementation, we show that the LARS scheme significantly outperforms the shortest-path first routing protocol using a contention-aware routing metric, providing up to 240% throughput improvement in some network scenarios.
    Computer Communications. 01/2011; 34:948-961.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Traffic routing is central to the utility and scalability of wireless mesh networks. Many recent routing studies have examined this issue, but generally they have assumed that the demand is constant and given in advance. On the contrary, wireless traffic studies have shown that demand is highly variable and difficult to predict, even when aggregated at access points.There are several approaches for handling volatile traffic. On one hand, traffic may be modeled in real-time with a dynamic routing based upon forecasted traffic demand. On the other hand, routing can be made with the focus towards maximally unbalanced demand, such that the worst-case performance is contained (known as oblivious routing). The first approach can perform competitively when traffic can be forecasted with accuracy, but may result in unbounded worst-case performance when forecasts go wrong. It is an open question how these two approaches would compare with each other in real networks and if possible at all, whether a benchmark could be defined to guide the selection of the appropriate routing strategy.To answer the above open question, this paper conducts a systematic comparison study of the two approaches based on the extensive simulation study over a variety of network scenarios with real-world traffic trace. It identifies the key factors of the network topology and traffic profile that affect the performance of each routing strategy. A series of metrics are examined with varying powers of forecasting whether predictive routing or oblivious routing will perform better. Following the guidelines defined by these metrics, we present an adaptive strategy which augments the performance of the predictive routing with the worst-case bound provided by the oblivious routing through adaptive selection of routing strategies based on the degree of traffic uncertainty.
    Computer Networks 01/2010; · 1.23 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A wireless mesh network (WMN) is a special type of wireless ad-hoc network, which consists of mesh clients, mesh routers and gateways to the Internet, organized in a mesh topology. The mesh clients are often laptops, cell phones and other wireless devices. Mesh routers forward traffic between mesh clients and gateways. Despite a number of promising features provided by WMNs, such as low deployment cost, self-healing, etc., the throughput of WMNs is often limited by severe congestion and collisions, and thus cannot satisfy the increasing traffic demands of numerous applications. In this paper, we study how to maximize the throughput of IEEE 802.11n WMNs by joint routing and frame aggregation. Frame aggregation is to aggregate multiple frames into a large frame before transmission, to reduce communication overhead and alleviate collisions. We first show that previous frame aggregation strategies cannot achieve optimal network throughput. We then formulate the joint problem into a linear programming (LP) problem by considering traffic in the network as flow. As most previous algorithms for LP are centralized and difficult to deploy in large-scale WMNs, we propose a distributed algorithm to solve the formulated problem, in which each mesh router determines the amount of traffic flow for its adjacent links based on the traffic information of neighbors and interfering links. However, in realistic 802.11n WMNs, traffic is transmitted in frames instead of flow, and the traffic to different routers needs to be distinguished. Thus, we further provide an algorithm to determine the routing and frame aggregation strategy for each mesh router, using the traffic flow derived from the first algorithm. We have conducted extensive simulations to evaluate the proposed algorithms and the results demonstrate that the network throughput can be significantly improved compared with existing schemes.
    Parallel & Distributed Processing (IPDPS), 2013 IEEE 27th International Symposium on; 01/2013

Full-text (2 Sources)

Available from
Jun 4, 2014