Synchronizing TCP with Block Acknowledgement over Multi-hop Wireless Networks

In this study we investigate the interaction between TCP and MAC layer in a wireless multi-hop network. This type of network has traditionally found applications in the military (automated battlefield), law enforcement (search and rescue) and disaster recovery (flood, earthquake), where there is no fixed wired infrastructure. Wireless "ad-hoc" multi-hop networks have previously been proposed for nomadic computing applications. Key requirements in all the above applications are reliable data transfer and congestion control, features that are generally supported by TCP. Unfortunately, TCP performs on wireless in a much less predictable way than on wired protocols. Using simulation, we provide new insight into two critical problems of TCP over wireless multi-hop. The first is the conflict between data packets and ACKs, which causes TCP performance to degrade for window sizes greater than 1 packet. The second is the interaction between MAC and TCP layer backoff timers which causes severe unfairness and capture conditions. In the paper, we identify these problems in several representative simulation runs on various topologies and traffic patterns and indicate possible remedies to improve TCP efficiency over a wireless multi-hop network.

This paper addresses the Quality of Service (QoS) degradation problem of wireless relay node failures in multihop Worldwide interoperable Microwave Access (WiMAX) and Long Term Evolution (LTE) networks. In general, node protection in a communication network increases the reliability of the traffic flow from source to destination. For wireless networks, implementing the traditional 1+1 protection scheme increases the capital cost, as resources cannot be fully utilized. On the other hand, the design and implementation of the 1:N protection scheme in wireless networks for greater value of N (> 2) is very difficult, due to wireless network coverage and the physical layer design. To overcome the above drawbacks, a technique based on network coding is proposed for node protection in multihop wireless networks. In multihop wireless networks, few research efforts are concentrated on node protection schemes using network coding. Moreover, to best of our knowledge, no reports have been published on measuring the QoS performance for node protection in 4G wireless networks using network coding. In this paper, we first describe the node protection scheme using XOR network coding for multihop 4G wireless networks. Then, we measure the QoS performance, such as packet delivery ratio (PDR), latency and jitter, for different scenarios. The scenarios include a failure of a single relay node and failures of two relay nodes with and without our protection scheme and user's mobility. The simulation results show that the QoS performance with protection against a single relay node failure and failures of two relay nodes are very close to that of no failure scenario, while the network reliability increases due to the protection mechanism. Also, we report a decoding problem in multihop wireless networks using XOR network coding.

There have been some rapid advances on the design of full duplex (FD) transceivers in recent years. Although the benefits of FD have been studied for single-hop wireless communications, its potential on throughput performance in a multi-hop wireless network remains unclear. As for multi-hop networks, a fundamental problem is to compute the achievable end-to-end throughput for one or multiple communication sessions. The goal of this paper is to offer some fundamental understanding on end-to-end throughput performance limits of FD in a multi-hop wireless network. We show that through a rigorous mathematical formulation, we can cast the multi-hop throughput performance problem into a formal optimization problem. Through numerical results, we show that in many cases, the end-to-end session throughput in a FD network can exceed 2x of that in a half duplex (HD) network. Our finding can be explained by the much larger design space for scheduling that is offered by removing HD constraints in throughput maximization problem. The results in this paper offer some new understandings on the potential benefits of FD for end-to-end session throughput in a multi-hop wireless network.

In a multi-hop wireless network, connectivity is determined by the link that is established by the receiving signal strength computed by subtracting the path loss from the transmission power. Two path loss models are commonly used in research, namely two-ray ground and shadow fading, which determine the receiving signal strength and affect the link quality. Link quality is one of the key factors that affect network performance. In general, network performance improves with better link quality in a wireless network. In this study, we measure the network connectivity and performance in a shadow fading path loss model, and our observation shows that both are severely degraded in this path loss model. To improve network performance, we propose power control schemes utilizing link quality to identify the set of nodes required to adjust the transmission power in order to improve the network throughput in both homogeneous and heterogeneous multi-hop wireless networks. Numerical studies to evaluate the proposed schemes are presented and compared.

The performance of a multihop wireless network is typically affected by the interference caused by transmissions in the same network. In a statistical fading environment, the interference effects become harder to predict. Information sources in a multihop wireless network can improve throughput and delay performance of data streams by implementing interference-aware packet injection mechanisms. Forcing packets to wait at the head of queues and coordinating packet injections among different sources enable effective control of copacket interference. In this paper, throughput and delay performance in interference-limited multihop networks is analyzed. Using nonlinear probabilistic hopping models, waiting times which jointly optimize throughput and delay performances are derived. Optimal coordinated injection strategies are also investigated as functions of the number of information sources and their separations. The resulting analysis demonstrates the interaction of performance constraints and achievable capacity in a wireless multihop network.

The effective provision of real-time, packet-based voice conversations over multi-hop wireless networks faces several stringent constraints not found in conventional packet-based networks. The wireless links in an ad hoc network are highly error prone and may go down frequently because of node mobility, interference, channel fading, and the lack of infrastructure, it is very difficult and challenging to implement voice transmission over multi-hop wireless networks. In this research, to maximize the performance of multi-hop wireless networks during voice transmission we choose some parameters and methodological approaches e.g. Since voice applications consume more energy than typical applications, we designed the ad hoc and adaptive control model to simulate our scheme.

Modern network technologies first evolved in wired networks and subsequently entered the wireless network field. Applications may work in pure wired network, pure wireless network or hybrid network. Improving performance in these network infrastructures has been a continuous effort for decades. In this dissertation, we tackle two important challenges: (1) improving handover performance in heterogeneous wireless network, and (2) improving TCP performance in multi-hop wireless network. In heterogeneous network, users expect uninterrupted services moving from one network to another. IEEE proposed Media Independent Handover (MIH) to make it possible to achieve better handover performance. Currently, Mobile IPv4 (MIP) is the dominant mechanism for mobility management and is expected to persist into the future. However, when multiple interfaces of a mobile client are connected to a Foreign Agent (FA), MIP and its existing improvements do not perform well when the active interface fails unexpectedly. In this dissertation, we propose novel mechanism and MIP extension with MIH support. We prove experimentally that the new approach eliminates the FA-HA latency and achieves much faster handover, compared with existing mechanism. Our method also allows FA-bicasting, which can improve transmission reliability by combining traffic from different links, through the same FA. In multi-hop wireless networks, the main network factor that affects TCP performance is the medium-access contention, complicated by other factors like hidden terminal. We analyze the TCP congestion window and provide a more accurate estimate of its optimal value than those reported in the prior work. We also show that the much shorter TCP-ACK packets consume comparable channel capacity as the much longer data packets. We therefore propose two methods to improve TCP throughput, as follows. (1) Segregate the flows of data and ACK using static routing in grid wireless network, (2) Develop an improved variant of delayed TCP ACK by minimizing the number of ACK packets. Our evaluation validates the effectiveness of the proposed method, which can enhance TCP performance significantly. In terms of throughput, it achieves up to 204% improvement over the regular TCP in chain-topology wireless networks, and about 35% improvement in a complex grid wireless network. We also propose a new architecture to achieve higher throughput when multiple TCP connections exist.

Wireless multi-hop local area networks use in general scheduling schemes that assume the network capacity to be known. Indeed in most of the throughput-optimal algorithms the sources are assumed to send at a rate within the capacity region. However, measurements made on real deployments show that the network capacity is usually difficult to characterize and also time-varying. It is therefore important to understand how the network behaves when the sources attempt to transmit at a rate above capacity. Toward this goal, we show 3-phase regime in the effect of the input rate λ on the end-to-end throughput μ of a multi-hop network. First, when λ is smaller than a threshold λ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> , μ is an increasing function of λ. Second, when λ is larger than another threshold λ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> > λ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> , μ is independent of λ. Third, when λ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> <; λ <; λ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , μ decreases with λ. To understand this phenomenon, we capture the relation between the end-to-end throughput and the queue stability with a mathematical model that allows us to explain and derive the exact values of the transition points λi. We then validate experimentally our simulation results with measurements on a testbed composed of five wireless routers.

Our objective is to analyze and minimize the amount of energy needed to transmit packets in a multihop wireless network, such as a sensor network or an ad hoc network. The total energy consumed to transmit a packet from a source to a destination is a function of the number of hops along the path and the energy needed to successfully transmit a packet in one hop. Given a path, the number of hops needed depends on the transmission range. The energy consumed for a successful transmission in a hop depends on not only the transmission range but also the medium access strategy. In this paper, we generalize the analysis of the energy consumption on packet transmission in multihop wireless networks. The analysis is applicable to a range of multiaccess schemes from TDM to random access schemes. The results show that typically, there is a transmission range that results in the minimum energy. However, a smaller transmission range does not always lead to less energy consumed by packet transmission. The optimum energy consumption is the result of balancing several factors, including: 1) the ratio of an overhead packet length to a data packet length, where overhead packets refer to the control packets used to reserve the media or the data packets involved in collisions; 2) the number of transmissions of the overhead packets; 3) the number of hops along a path; and 4) the transmission range.

In recent years, there has been a significant amount of work done in developing low-complexity scheduling schemes to achieve high performance in multihop wireless networks. A centralized suboptimal scheduling policy, called Greedy Maximal Scheduling (GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings. However, its distributed realization requires high complexity, which becomes a major obstacle for practical implementation. In this paper, we develop simple distributed greedy algorithms for scheduling in multihop wireless networks. We reduce the complexity by relaxing the global ordering requirement of GMS, up to near zero. Simulation results show that the new algorithms approximate the performance of GMS, and outperform the state-of-the-art distributed scheduling policies.

TCP performance in contention-based multi-hop wireless networks is shaped by two main factors, which are unlike the wired network case. First, the maximum throughput for a given topology and flow pattern is reached at an optimal congestion window. We provide an improved analysis of this effect. Second, the control traffic uses higher proportion of the channel bandwidth than in the wired case. Our results show that the much smaller TCP ACKpackets consume channel resource comparable to the much longer data packets, over high-speed connections. Motivated by this understanding, we reformulate and enhance an existing idea for improving TCP performance by further lowering the number of control packets. Extensive simulations show that our strategy increases the TCP throughput up to 205% compared to the regular TCP, in long-hop wireless networks and 35% in a complex network.

Interference neutralization (IN) is an interference management technique that allows simultaneous transmission of multiple links by nullifying their mutual interference in the air via cooperation among the transmitters. Although IN has been studied from information theoretic perspective, its potential for a general multi-hop wireless network has not been explored. The goal of this paper is to understand IN in a multi-hop wireless network from networking perspective. We first establish an IN reference model. Based on this reference model, we develop a set of feasibility constraints for a subset of links to be active simultaneously. By identifying each eligible neutralization node (called neut), we study IN in a general multi-hop network and develop a set of necessary constraints to characterize neut selection, IN, and scheduling. These constraints allow us to study the performance of multi-hop networks without the need of getting involved into onerous signal design issues at the physical layer. Finally, we apply our IN model and constraints to study a throughput maximization problem and show that the use of IN can generally increase network throughput. In particular, throughput gain is most significant when the node density increases.

In a multihop wireless network, the throughput performance decreases seriously because of inter-flow and intra-flow collision. The backoff algorithm is the de facto function to resolve collision in 802.11 networks. In this paper we study the impact of five back-off algorithms on the performance of 802.11-based multihop wireless networks with different network topology and flow patterns. Simulations show that the backoff algorithms have big influence on the performance of both UDP and TCP flows. But none of the current backoff algorithms can improve the throughput and fairness performance in multihop wireless networks efficiently. It shows that the traditional random backoff algorithms are no longer suitable for collision resolution in distributed multihop wireless networks.

In this paper, we present experimental studies on Multi-channel Multi-radio Multi-hop (M3) wireless networks. The interference of multiple channels and multiple radios is studied. The result may help to understand effect of multi-channel and multi-radio in real system and is useful as reference for network performance optimization. We evaluate the coexistence of real-time traffic and best-effort traffic in multi-hop wireless networks. Our experiments show that coordination among wireless nodes is critical for optimal network performance, especially in the scenarios with quality of service (QoS) requirements. To perform the experiments, an M3 testbed with 32 nodes is built. The testbed is based on Windows operating system and provides convenient programming interface and management tools. The architecture and key modules of the testbed design are described.

Adaptive per hop differentiation for end-to-end delay assurance in multihop wireless networks