Assessment of VANET multi-hop routing over an experimental platform

International audienceEvaluation of vehicular ad-hoc networks (VANETs) over real environments is still a remaining issue for most researchers. There are some works which carry out performance tests to evaluate the communication channel according to physical and MAC conditions. Only a few works deal with multi-hop experimentation in this field, and practically none tests multi- hop protocols. In this paper an integral VANET testbed is evaluated, using 802.11b and a multi-hop network managed by the Optimized Link State Routing protocol (OLSR). Up to four vehicles are used to study the VANET performance over different traffic environments and different metrics are considered to analyse the results in terms of delay, bandwidth, packet loss and distance between nodes. Furthermore, a deeper analysis is carried out to track the routes followed by packets end to end. Since a routing protocol is used, results differ from traditional one-hop and static-route tests, presenting a more realistic study

A Survey on Issues and Challenges in Congestion Adaptive Routing in Mobile Ad hoc Network

Mobile ad hoc networks is the future wireless communication systems have recently emerged as an important trend. Mobile adhoc network is self-configurable and adaptive. Due to the mobility of nodes, the network congestion occurs and it is difficult to predict load on the network which leads to congestion. Mobile adhoc network suffers from a severe congestion controlling problem due to the nature of shared communication and mobility. Standard TCP controlling mechanism for congestion is not fit to the dynamic changing topology of MANETs. This provides a wide scope of research work in mobile ad hoc network. The purpose of this survey is to study and analyze various issues and challenges in congestion control mechanisms in adaptive routing protocols in Mobile Adhoc Network (MANET)

A Cross Layer Solution to Address TCP Intra-flow Performance Degradation in Multihop Ad hoc Networks

Incorporating the concept of TCP end-to-end congestion control for wireless networks is one of the primary concerns in designing ad hoc networks since TCP was primarily designed and optimized based on the assumptions for wired networks. In this study, our interest lies on tackling the TCP instability and in particular intra-flow instability problem since due to the nature of applications in multihop ad hoc networks, connection instability or starvation even for a short period of time can have a negative impact on the Quality of Service and may not be acceptable for the end user. Through a detailed analysis, it will be shown that the main causes of TCP intra-flow instability lies in overloading the network by sending more packets than the capacity of the channel. Based on this, the paper proposes a novel cross layer solution called “TCP Contention Control” that dynamically adjusts the amount of outstanding data in the network based on the level of contention experienced by packets as well as the throughput achieved by connections. The simulation results show TCP Contention Control can drastically improve TCP stability over 802.11 multihop ad hoc networks

Smoothed Airtime Linear Tuning and Optimized REACT with Multi-hop Extensions

abstract: Medium access control (MAC) is a fundamental problem in wireless networks. In ad-hoc wireless networks especially, many of the performance and scaling issues these networks face can be attributed to their use of the core IEEE 802.11 MAC protocol: distributed coordination function (DCF). Smoothed Airtime Linear Tuning (SALT) is a new contention window tuning algorithm proposed to address some of the deficiencies of DCF in 802.11 ad-hoc networks. SALT works alongside a new user level and optimized implementation of REACT, a distributed resource allocation protocol, to ensure that each node secures the amount of airtime allocated to it by REACT. The algorithm accomplishes that by tuning the contention window size parameter that is part of the 802.11 backoff process. SALT converges more tightly on airtime allocations than a contention window tuning algorithm from previous work and this increases fairness in transmission opportunities and reduces jitter more than either 802.11 DCF or the other tuning algorithm. REACT and SALT were also extended to the multi-hop flow scenario with the introduction of a new airtime reservation algorithm. With a reservation in place multi-hop TCP throughput actually increased when running SALT and REACT as compared to 802.11 DCF, and the combination of protocols still managed to maintain its fairness and jitter advantages. All experiments were performed on a wireless testbed, not in simulation.Dissertation/ThesisMasters Thesis Computer Science 201

Predicting expected TCP throughput using genetic algorithm

Predicting the expected throughput of TCP is important for several aspects such as e.g. determining handover criteria for future multihomed mobile nodes or determining the expected throughput of a given MPTCP subflow for load-balancing reasons. However, this is challenging due to time varying behavior of the underlying network characteristics. In this paper, we present a genetic-algorithm-based prediction model for estimating TCP throughput values. Our approach tries to find the best matching combination of mathematical functions that approximate a given time series that accounts for the TCP throughput samples using genetic algorithm. Based on collected historical datapoints about measured TCP throughput samples, our algorithm estimates expected throughput over time. We evaluate the quality of the prediction using different selection and diversity strategies for creating new chromosomes. Also, we explore the use of different fitness functions in order to evaluate the goodness of a chromosome. The goal is to show how different tuning on the genetic algorithm may have an impact on the prediction. Using extensive simulations over several TCP throughput traces, we find that the genetic algorithm successfully finds reasonable matching mathematical functions that allow to describe the TCP sampled throughput values with good fidelity. We also explore the effectiveness of predicting time series throughput samples for a given prediction horizon and estimate the prediction error and confidence.Peer ReviewedPostprint (author's final draft

Experimental Analysis of Multi-hop Routing in Vehicular Ad-hoc Networks

International audienceEvaluation of vehicular ad-hoc networks (VANETs) over real environments is still a remaining issue for most re- searchers. There are some works dealing with common 802.11 anal- ysis over real vehicular environments, which carry out performance tests to measure the quality of the communication channel and justify results according to physical and MAC conditions. There are only a few works regarding multi-hop experimentation in this field, and even less (if not none) testing multi-hop protocols. In this paper an integral VANET testbed is evaluated, using 802.11b and a multi-hop network managed by the Optimized Link State Routing protocol (OLSR). Up to four vehicles are used over urban and highway environments to study the VANET performance, and different metrics are used to analyse the results in terms of delay, bandwidth, packet loss and distance between nodes. Furthermore, a deeper analysis is carried out to study the route followed by packets end to end, which enables us to count the number of hops and detect the links where packets are lost. Because a routing protocol is used, results differ from traditional two-hop and static- route tests, presenting a more realistic study. OLSR is considered as a good reference point for the research community, although it is not the most suitable protocol for vehicular environments, as results show