Throughput-range tradeoff of wireless mesh backhaul networks

Abstract

Abstract-Wireless backhaul communication is expected to play a significant role in providing the necessary backhaul resources for future high-rate wireless networks. Mesh networking, in which information is routed from source to destination over multiple wireless links, has potential advantages over traditional single-hop networking, especially for backhaul communication. We develop a linear programming framework for determining optimum routing and scheduling of flows that maximizes throughput in a wireless mesh network and accounts for the effect of interference and variable-rate transmission. We then apply this framework to examine the throughput and range capabilities for providing wireless backhaul to a hexagonal grid of base stations, for both single-hop and multihop transmissions for various network scenarios. We then discuss the application of mesh networking for load balancing of wired backhaul traffic under unequal access traffic conditions. Numerical results show a significant benefit for mesh networking under unbalanced loading.

Maximizing the throughput of large ad hoc wireless networks

“…There are many articles on wireless mesh networks, of which we mention [3], [4], [13], [14], and [32]. In [3], a broad overview of wireless mesh networks is provided, and many research issues are raised in a broad sense.…”

“…The meaning of this capacity is different from that of the capacity with respect to the spectrum exclusively allocated for routing within the mesh network. The two papers [14] and [32] are more technical as discussed below.…”

“…The work by [32] took into account the mutual interferences among neighboring links in studying achievable source-destination rates. The physical model used in [32] is an improvement over that in [14].…”

Optimizing compatible sets in wireless networks through integer programming

“…The use of CS is a powerful approach to various kinds of optimization problems in wireless networks involving transmission scheduling. For example, compatible sets are applied in such papers for optimizing routing, power control and traffic throughput as (Capone et al 2010a;Elbatt and Ephremides 2004;Viswanathan and Mukherjee 2006;Li and Ephremides 2007). In Pióro et al (2011) a max-min fair flow allocation problem in wireless mesh networks is considered, combining link rate adaptation with transmission scheduling-the CS subproblem is embedded as the pricing problem in a branch-and-price algorithm for solving the overall problem.…”

A Distributed Channel Access Scheduling Scheme with Clean-Air Spatial Reuse for Wireless Mesh Networks

“…Most of the work use some techniques such as compatibility matrix [3] to first find non-interfering transmission pairs and then use centralized algorithms for time slot assignment [4][5] [6] [7]. Various linear programming and heuristic methods are proposed for time slot assignment [8] [1]. These works require prior knowledge of the traffic requirements and the interference relationship between wireless nodes, and assume they do not change frequently.…”