2,862 research outputs found

    Tcp Performance Optimization In Interaction With Mac Layer Over Multi-Hop Ad-Hoc Networks

    Get PDF
    Transport Control Protocol (TCP) has been designed to provide reliable data delivery between end hosts in traditional wired networks and is the most widely used reliable transport protocol over the internet. TCP keeps looking at the traffic inside the network by employing the congestion control mechanisms. The basic assumption underlying TCP congestion control is that packet losses are an indication of congestion in the wired network. The effect of such an assumption on TCP's performance in wireless environments has been a long-standing research study. The reason is specific wireless properties such as high medium access contention; route breakage and high bit error rate in radio channels pose different challenges in TCP performance when it runs over wireless networks. In this thesis, the focus is given on the interaction between TCP and Medium Access Control (MAC) layer in multi-hop ad-hoc networks to deal with the effect of high medium access contention on TCP throughput. The main problem of TCP over IEEE 802.11 MAC protocol is the extensive number of medium access carried out by TCP. In fact, TCP sender will be informed of successful transmissions by receiving the acknowledgment (ACK) from the other end host to achieve the reliability. In this way, the MAC overhead may be caused by generating redundant ACK packets that compete in the same route with data packets for the media. As the load increases, the well-known hidden terminal effects caused by interference between ACK and data packets can degrade TCP performance dramatically if TCP acknowledges every incoming data packets. To address above problem, in this thesis a dynamic TCP-MAC interaction strategy is proposed which tries to reduce the number of induced ACKs by monitoring the channel condition. To this end, the total collision probability collected along the path from sender to receiver in MAC layer is used to properly set the number of the delayed ACKs (DA) in TCP. Based on the measured collision probability, TCP sender dynamically adjusts itself to the channel condition by delaying less ACKs in high traffics and more in low traffic conditions. Upon this strategy, an enhanced TCP throughput has been achieved in trade-off between moderate and high traffics. Finally, the relationship between the TCP throughput and optimized number of delayed ACKs has been investigated in different hop counts scenarios which employ a dynamic traffic. The findings show that for a given hop count, there exists an optimized delay window size which maximizes the TCP throughput. Overall, the achieved throughput increments are up to about 30% over the regular TCP with DA extension and cwnd limit and about 10% over the existing method called Dynamic Adaptive Acknowledgment (TCP-DAA and TCP-DAAp)

    Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications

    Get PDF
    We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches

    Insights into the Design of Congestion Control Protocols for Multi-Hop Wireless Mesh Networks

    Get PDF
    The widespread deployment of multi-hop wireless mesh networks will depend on the performance seen by the user. Unfortunately, the most predominant transport protocol, TCP, performs poorly over such networks, even leading to starvation in some topologies. In this work, we characterize the root causes of starvation in 802.11 scheduled multi-hop wireless networks via simulations. We analyze the performance of three categories of transport protocols. (1) end-to-end protocols that require implicit feedback (TCP SACK), (2) Explicit feedback based protocols (XCP and VCP) and (3) Open-loop protocol (UDP). We ask and answer the following questions in relation to these protocols: (a) Why does starvation occur in different topologies? Is it intrinsic to TCP or, in general, to feedback-based protocols? or does it also occur in the case of open-loop transfers such as CBR over UDP? (a) What is the role of application behavior on transport layer performance in multi-hop wireless mesh networks? (b) Is sharing congestion in the wireless neighborhood essential for avoiding starvation? (c) For explicit feedback based transport protocols, such as XCP and VCP, what performance can be expected when their capacity estimate is inaccurate? Based on the insights derived from the above analysis, we design a rate-based protocol called VRate that uses the two ECN bits for conveying load feedback information. VRate achieves near optimal rates when configured with the correct capacity estimate

    JTP: An Energy-conscious Transport Protocol for Wireless Ad Hoc Networks

    Full text link
    Within a recently developed low-power ad hoc network system, we present a transport protocol (JTP) whose goal is to reduce power consumption without trading off delivery requirements of applications. JTP has the following features: it is lightweight whereby end-nodes control in-network actions by encoding delivery requirements in packet headers; JTP enables applications to specify a range of reliability requirements, thus allocating the right energy budget to packets; JTP minimizes feedback control traffic from the destination by varying its frequency based on delivery requirements and stability of the network; JTP minimizes energy consumption by implementing in-network caching and increasing the chances that data retransmission requests from destinations "hit" these caches, thus avoiding costly source retransmissions; and JTP fairly allocates bandwidth among flows by backing off the sending rate of a source to account for in-network retransmissions on its behalf. Analysis and extensive simulations demonstrate the energy gains of JTP over one-size-fits-all transport protocols.Defense Advanced Research Projects Agency (AFRL FA8750-06-C-0199

    A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks

    Get PDF
    This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST), Pakistan, and the Higher Education Commission, Pakistan

    CA-AQM: Channel-Aware Active Queue Management for Wireless Networks

    Get PDF
    In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditions, automatic bit rate control schemes are implemented to adjust the transmission bit rates based on the perceived channel conditions. This leads to a wireless network with diverse bit rates. On the other hand, TCP is unaware of such {\em rate diversity} when it performs flow rate control in wireless networks. Experiments show that the throughput of flows in a wireless network are driven by the one with the lowest bit rate, (i.e., the one with the worst channel condition). This does not only lead to low channel utilization, but also fluctuated performance for all flows independent of their individual channel conditions. To address this problem, we conduct an optimization-based analytical study of such behavior of TCP. Based on this optimization framework, we present a joint flow control and active queue management solution. The presented channel-aware active queue management (CA-AQM) provides congestion signals for flow control not only based on the queue length but also the channel condition and the transmission bit rate. Theoretical analysis shows that our solution isolates the performance of individual flows with diverse bit rates. Further, it stabilizes the queue lengths and provides a time-fair channel allocation. Test-bed experiments validate our theoretical claims over a multi-rate wireless network testbed

    Cross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks

    Get PDF
    This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constraint and scheduling constraint using multicommodity flow variables, and formulate resource allocation in networks with fixed wireless channels (or single-rate wireless devices that can mask channel variations) as a utility maximization problem with these constraints. By dual decomposition, the resource allocation problem naturally decomposes into three subproblems: congestion control, routing and scheduling that interact through congestion price. The global convergence property of this algorithm is proved. We next extend the dual algorithm to handle networks with timevarying channels and adaptive multi-rate devices. The stability of the resulting system is established, and its performance is characterized with respect to an ideal reference system which has the best feasible rate region at link layer. We then generalize the aforementioned results to a general model of queueing network served by a set of interdependent parallel servers with time-varying service capabilities, which models many design problems in communication networks. We show that for a general convex optimization problem where a subset of variables lie in a polytope and the rest in a convex set, the dual-based algorithm remains stable and optimal when the constraint set is modulated by an irreducible finite-state Markov chain. This paper thus presents a step toward a systematic way to carry out cross-layer design in the framework of “layering as optimization decomposition” for time-varying channel models
    corecore