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: Most WSN routing protocols select route based on hop count. Efficient routing metric should consider both inter-flow and intra-flow interference. A new minimum route-interference routing metric for multi-radio WMN is proposed. The path which has a minimum total interference can be found by using this metric. Simulation result shows that network performance can be significantly improved with the new routing metric.
  • [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
  • [Show abstract] [Hide abstract]
    ABSTRACT: Joint channel assignment and routing is an essential yet challenging issue for multi-radio multi-channel wireless mesh networks. Though several works are presented in the existing literature to approach this problem, the key question – how to ensure that the resulting network performance can closely track the optimal solution under high traffic variability without incurring too much overhead, remains unanswered. In this work, we present a new solution called “Robust joint Channel Assignment and Routing with Time partitioning (RCART)” for WMNs. RCART consists of three steps: (1) Time Partitioning and Traffic Characterization, which accomplishes the goal of partitioning time into periodic intervals with consistent properties which can be routed efficiently, (2) Robust Routing, which finds a robust routing scheme that provides an upper bound on the worst-case network performance for traffic demands that fall into a convex region, (3) Channel Assignment, which allocates radios to fixed channels during the time interval identified in step 1 and based on the knowledge of traffic distribution from step 2, using the worst-case congestion ratio as a robustness metric in its objective. Introducing time partitions as an additional control variable in the robust mesh routing RCART solution significantly improves average-case performance. Performance evaluation is conducted for RCART using real traffic demand traces. The results show that our RCART solution significantly outperforms the existing works without time partitioning or with simpler traffic profile models.
    Ad Hoc Networks 02/2014; 13:210–221. · 1.94 Impact Factor

Full-text (2 Sources)

Available from
Jun 4, 2014