Multi-rate Multi-hop Wireless Networks Research Articles

Understanding the Benefits of Successive Interference Cancellation in Multi-Rate Multi-Hop Wireless Networks

The performance of wireless multihop networks depends on the achievable channel capacity for each transmission link as well as the level of spectrum spatial reuse in the network. For the latter one, successive interference cancellation (SIC) has emerged as an advanced PHY technique with the ability of decoding two or more overlapping signals and therefore allowing multiple concurrent transmissions. Effectively managing the transmission concurrency over the shared medium ensures good quality of transmission and therefore results in higher achievable transmission data rates. In this paper, we seek to understand the benefits of SIC and its interference management capabilities in a multi-rate multihop wireless network. To characterize the network performance under these characteristics, we follow a cross-layer design approach and formulate the joint routing and scheduling problem with rate control as a mixed integer linear program with the objective to maximize the minimum flow throughput. Given its large scale and combinatorial complexity, we follow a decomposition approach using column generation to solve the problem. However, the complexity of solving exactly the pricing subproblem limits the application of the model to very small size network instances. We develop one efficient greedy method for solving exactly the pricing subproblem as well as a simulated annealing based heuristic approach with very good performance. Our results indicate that SIC benefits strongly depend on the strength of the received signals. We show that transmission links with fixed higher data rates do not necessarily yield higher SIC gains because higher transmission rates result in sparser network topologies and thus less flexible routing. Larger networks with SIC capabilities and bitrate adaptation however are most effective in controlling the interference and improving the spatial reuse and thus reap the largest benefits with gains exceeding 20% over networks only with SIC capabilities or only with rate control.

Joint Routing and Scheduling in WMNs with Variable-Width Spectrum Allocation

This paper addresses, in the context of wireless network design, the problem of optimally partitioning the spectrum into a set of nonoverlapping channels with nonuniform spectrum widths. While narrower bands split the total available spectrum into more nonoverlapping channels allowing more parallel concurrent transmissions, wider spectrum bands yield links with larger transport capacity. Thus, we model the combinatorially complex problem of joint routing, link scheduling, and variable-width channel allocation in both single and multirate multihop wireless networks as a mixed integer linear program, and present a solution framework using the column generation decomposition approach. Given the nature and complexity of the resulting dual subproblem, we propose heuristic methods for partitioning the spectrum and allocating resources to each active links, and hence obtain solutions for larger network instances. We present several numerical results and engineering insights suggesting both spectrum width and transmission rates as effective tunable knobs for combatting interference and promoting spatial reuse and thus achieving superior performance in multihop settings.

An integrated routing and rate adaptation framework for multi-rate multi-hop wireless networks

In this paper, we propose a new integrated framework for joint routing and rate adaptation in multi-rate multi-hop wireless networks. Unlike many previous efforts, our framework considers several factors that affect end-to-end performance. Among these factors, the framework takes into account the effect of the relative positions of the links on a path when choosing the rates of operation and the importance of avoiding congested areas. The key element of our framework is a new comprehensive path metric that we call ETM (for expected transmission cost in multi-rate wireless networks). We analytically derive the ETM metric. We show that the ETM metric can be used to determine the best end-to-end path with a greedy routing approach. We also show that the metric can be used to dynamically select the best transmission rate for each link on the path via a dynamic programming approach. We implement the ETM-framework on an indoor wireless mesh network and compare its performance with that of frameworks based on the popular ETT and the recently proposed ETOP metrics. Our experiments demonstrate that the ETM-framework can yield throughput improvements of up to 253 and 368 % as compared with the ETT and ETOP frameworks.

다중 전송률 다중 홉 무선 네트워크에서 최적화된 다중 경로 네트워크 코딩

In this paper, we propose a method for throughput improvement in multirate multihop wireless networks with intra-session network coding. A multirate transmission supports several rates so that it has a tradeoff between transmission rate and transmission range, therefore multirate can cope with the performance degradation. We present the rate selection method with intra-session network coding in multirate nodes. The effective transmission rate is calculated by using intra-session network coding, and then its maximum effective transmission rate is selected. Concurrent transmission set is determined by selected transmission rate and then the linear programming is formulated for throughput calculation in multihop wireless networks. We evaluate the performance by using MATLAB and lp_solve programs in two topologies. It is shown that the throughput of the proposed method is improved.

Load-Based Route Discovery Through Searching Range Adaptation for MANET Throughput Improvement

Traditional routing protocols designed for multihop wireless networks, e.g., the mobile ad hoc network (MANET), select a route with the smallest hop count. The end-to-end throughput in the route may not be the maximum when the network has multiple link data rates, as a small hop number implies a large geographic distance (link distance) for each hop. Due to the radio signal attenuation, this results in a low SNR at the receiving node and, consequently, a low available link data rate. Reducing the link distance by using routes with more hop counts can increase the link data rate. However, this may not necessarily improve the end-to-end throughput because more nodes have to be included in the routes. In this paper, we first investigate and analyze the impact of link distance on end-to-end throughput in multirate multihop wireless networks. Analysis and simulation results show that changing the link distance affects the network throughput. To achieve a high network throughput, a proper link distance requirement has to be set for each hop, depending on different parameters such as load density. Based on this finding, we then propose a crossing-layer adaptive searching range (ASR) routing algorithm. ASR can be integrated into existing routing protocols. According to the local network load density, ASR can help improve the network performance by adjusting the link distance in the routes.