No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Analysis and Modeling of Network Connectivity in Routing Protocols for MANETs and VANETs
Abstract
In this paper, a framework is presented for node distribution with respect to
density, network connectivity and communication time. According to modeled
framework we evaluate and compare the performance of three routing protocols;
Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and
Fisheye State Routing (FSR) in MANETs and VANETs using two Mac-layer protocols;
802.11 and 802.11p. We have further modified these protocols by changing their
routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A
comprehensive simulation work is performed in NS-2 for the comparison of these
routing protocols for varying mobilities and scalabilities of nodes. To
evaluate their efficiency; throughput, End-to-End Delay (E2ED) and Normalized
Routing Load (NRL) of these protocols are taken into account as performance
parameters. After extensive simulations, we observe that AODV outperforms both
with MANETs and VANETs.
... Mobility prediction is nothing but the estimation of their future locations of the node. There is few mobility prediction methods are proposed in literature [6,7]. The main advantage of mobility prediction is to allocate in advance, the convenient another access point (node) before If the mobile terminal leaves the present one, for reducing the interruption that is in the communication taking place between the terminal mobiles. ...
Mobility prediction plays an important role in efficient planning and management of the bandwidth resources available in wireless networks. Mobility prediction allows estimating the stability of the paths in a Mobile Ad Hoc Networks. The prediction of mobility is explained as that prediction for the next movement of a mobile user in which the user travels between the nodes or the access points in the wireless network. This predicted path or its movement can further help in increasing the efficiency of that of the wireless network, by means of allocating resources effectively to its access point with the highest probability (which is the next point in attachment) as opposed to mindlessly allocating the excessive resources in the neighbourhood of the mobile nodes. Identification of such stable paths improves routing process by reducing the overhead and connection interruptions. As of now the mobility prediction and mobility aware topology control protocols are assumed to know its current mobility; by the way future positions are predicted along with future distances between neighbouring nodes. We introduce a novel approach for mobility prediction in MANET that accurately predicts the mobility pattern and their future location. Our proposed scheme can provide accurate prediction.
... Much research has been carried out on the suitability of MANET routing protocols in VANETs as well as several other research surveys [24] [25] [26] [27]. Contrarily, the frequent network partitioning (intermittent network connectivity) due to extremely dynamic topology and high mobility in VANET render MANET protocols unsuitable for vehicular communications. ...
Mobile ad hoc network is wireless network that employ multi-hop radio relayed and are capable of achieving without the support of any fixed infrastructure. The cut of any central coordinator makes the routing more complex. All nodes of these networks behave as routers and take part in discovery and maintenance of routes to other nodes in the network. This characterstic presents a big challenge to the design of a routing scheme, since bandwidth and power is very limited and the network topology changes as nodes move. Power consumption is prominent and critical issue faced by mobile adhoc network. Maximum power is consumed when the data is send from one node to another node. Therefore power productive routing mechanisms are required. In this paper, a routing mechanism based on the fisheye state routing with two groups of selection of nodes are achieved. First group of nodes having maximum power and second of nodes having minimum power. According to the number of packet received the particular group of nodes are selected to send the data from the source to the sink. In this way the power is utilized efficiently in the data sending process. This gives the reduction in the overall power consumption of the network. This scheme is named as Power-Aware Fisheye State Routing (PA-FSR). The parameters of FSR and PAFSR are compared. Results show that the proposed algorithm effectively utilizes the power to all nodes. For comparison various parameters like end-to-end delay average, Jitter and throughput have been considered.
Recent advances in wireless communication technologies and auto-mobile industry have triggered a significant research interest in the field of vehicular ad-hoc networks (VANETs) over the past few years. A vehicular network consists of vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications supported by wireless access technologies such as IEEE 802.11p. This innovation in wireless communication has been envisaged to improve road safety and motor traffic efficiency in near future through the development of intelligent transportation system (ITS). Hence, governments, auto-mobile industries and academia are heavily partnering through several ongoing research projects to establish standards for VANETs. The typical set of VANET application areas, such as vehicle collision warning and traffic information dissemination have made VANET an interesting field of mobile wireless communication. This paper provides an overview on current research state, challenges, potentials of VANETs as well as the ways forward to achieving the long awaited ITS.
Vehicular ad-hoc networks (VANETs) become a popular communication paradigm for vehicles to share traffic information on roads. However, the special form of wireless network provide a frequently intermittent and constantly evolving connection among the VANETs, which may lead to the result that conventional routing protocols designed for mobile ad-hoc networks (MANETs) cannot work properly in some of these dynamic networks. Motivated by the urgent needs of frequently rerouting, quality-of-service (QoS) supporting and limited computational capabilities, we focus on the routing precomputation by making use of a foreseeable network topology under the circumstances of vehicles equipped with Global Position System (GPS) or rail transit network. In this paper, we present our study on designing a routing calculation and optimization strategies to adapt VANETs system. The novel routing strategies have a capability to rapidly response to the frequently change of network topology and ability of congestion avoidance and congestion controlling by a comprehensive employment of Evolving Graphs (EG) model and Ant Colony Optimization (ACO). Through the simulation, our proposed scheme significantly performs superior than the related protocols in the literature in term of end-to-end delay, routing reply ratio, route discovery time and delivery ratio.
This paper evaluates and compares the performance of two routing protocols, one is reactive, Dynamic MANET On-Demand (DYMO) and other is proactive, Optimized Link State Routing (OLSR) in Mobile Ad-hoc Networks (MANETs) and Vehicular Ad-hoc Networks (VANETs). Performance of these protocols is analyzed using three performance metrics; Packet Delivery Ratio, Normalized Routing Overhead and End-to-End Delay against varying scalabilities of nodes. We perform these simulations with NS-2 using TwoRayGround propagation model. The SUMO simulator is used to generate a random mobility pattern for VANETs. From the extensive simulations, we observe that DYMO performs better than OLSR for both VANETs and MANETs at the cost of delay. Moreover, DYMO performs better in VANETs as compared to MANETs.
In this paper, we compare and analyze performance of five quality link
metrics forWireless Multi-hop Networks (WMhNs). The metrics are based on loss
probability measurements; ETX, ETT, InvETX, ML and MD, in a distance vector
routing protocol; DSDV. Among these selected metrics, we have implemented ML,
MD, InvETX and ETT in DSDV which are previously implemented with different
protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented
in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing
Load (NRL) and End-to-End Delay (E2ED) as performance parameters. Finally, we
deduce that InvETX due to low computational burden and link asymmetry
measurement outperforms among all metrics.
Ad hoc networks are characterized by multi-hop wireless
connectivity, frequently changing network topology and the need for
efficient dynamic routing protocols. We compare the performance of two
prominent on-demand routing protocols for mobile ad hoc networks -
dynamic source routing (DSR) and ad hoc on-demand distance vector
routing (AODV). A detailed simulation model with MAC and physical layer
models is used to study inter-layer interactions and their performance
implications. We demonstrate that even though DSR and AODV share a
similar on-demand behavior the differences in the protocol mechanics can
lead to significant performance differentials. The performance
differentials are analyzed using varying network load, mobility and
network size. Based on the observations, we make recommendations about
how the performance of either protocol can be improved
Ad hoc networks are characterized by multihop wireless
connectivity, frequently changing network topology and the need for
efficient dynamic routing protocols. We compare the performance of two
prominent on-demand routing protocols for mobile ad hoc networks:
dynamic source routing (DSR) and ad hoc on-demand distance vector
routing (AODV). A detailed simulation model with MAC and physical layer
models is used to study interlayer interactions and their performance
implications. We demonstrate that even though DSR and AODV share similar
on-demand behavior, the differences in the protocol mechanics can lead
to significant performance differentials. The performance differentials
are analyzed using varying network load, mobility, and network size.
Based on the observations, we make recommendations about how the
performance of either protocol can be improved
In this paper, we simulate the three routing protocols Destination Sequenced Distance Vector (DSDV), Optimized Link state Routing (OLSR), DYnamic MANET On Demand (DYMO) in NS-2 to evaluate and compare their performance using two Mac-layer protocols 802.11 and 802.lip. Comprehensive stimulation work is done for each routing protocol and the performance metrics Throughput, End to End Delay (E2ED), Normalized Routing load (NRL) is analyze in the scenarios of varying the mobilities and scalabilities. After extensive simulations, we observe that DSDV outperforms with 802.1 lp while DYMO gives best performance with 802.11.
Being most popular and IETF standard metric, minimum hop count is appropriately used by ad hoc networks, as new paths must rapidly be found in the situations where quality paths could not be found in due time due to high node mobility. There always has been a tradeoff between throughput and energy consumption, but stationary topology of WMNs and high node density of WSN's benefit the algorithms to consider quality-aware routing to choose the best routes. In this paper, we analytically review ongoing research on wireless routing metrics which are based on ETX (expected transmission count) as it performs better than minimum hop count under link availability. Performances over ETX, target platforms and design requirements of these ETX based metrics are high-lighted. Consequences of the criteria being adopted (in addition to expected link layer transmissions & retransmissions) in the form of incremental: (1) performance overheads and computational complexity causing inefficient use of network resources and instability of the routing algorithm, (2) throughput gains achieved with better utilization of wireless medium resources have been elaborated.
In Mobile Ad Hoc Networks (MANET), routing messages are broadcast if a destination is needed or a route to destination is broken. In this paper, we introduce a route breakage probability model of a mobile ad hoc network in a motorway scenario. The model shows high probability of route breakage between vehicles driving in opposite and low probability of route breakage between vehicles driving in same direction. The model, also, shows different effect of increasing transmission range on route breakage between vehicle in the same and opposite direction. Thus, route between vehicles driving in the same direction is reliable. On the other hand, route between vehicles driving in opposite direction breaks very often The model is tested with 200 vehicles on a two-way, 5 km motorway with 150m, 200m and 250m vehicle transmission range.
The fifth edition of this book continues teaching numerical analysis and techniques. Suitable for students with mathematics and engineering backgrounds, the breadth of topics (partial differential equations, systems of nonlinear equations, and matrix algebra), provide comprehensive and flexible coverage of numerical analysis.
In this paper, we evaluate, analyze, and compare the impact of mobility on the behavior of three reactive protocols (AODV, DSR, DYMO) and three proactive protocols (DSDV, FSR, OLSR) in multi-hop wireless networks. We take into account throughput, end-to-end delay, and normalized routing load as performance parameters. Based upon the extensive simulation results in NS-2, we rank all of six protocols according to the performance parameters. Besides providing the interesting facts regarding the response of each protocol on varying mobilities and speeds, we also study the trade-offs, the routing protocols have to make. Such as, to achieve throughput, a protocol has to pay some cost in the form of increased end-to-end delay or routing overhead.
In this paper, we identify and analyze the requirements to design a new
routing link metric for wireless multihop networks. Considering these
requirements, when a link metric is proposed, then both the design and
implementation of the link metric with a routing protocol become easy.
Secondly, the underlying network issues can easily be tackled. Thirdly, an
appreciable performance of the network is guaranteed. Along with the existing
implementation of three link metrics Expected Transmission Count (ETX), Minimum
Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with
Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show
that how the computational burden of a metric degrades the performance of the
respective protocol and how a metric has to trade-off between different
performance parameters.
In this paper, we propose a new quality link metric, interference and bandwidth adjusted ETX (IBETX) for wireless multi-hop networks. As MAC layer affects the link performance and consequently the route quality, the metric therefore, tackles the issue by achieving twofold MAC-awareness. Firstly, interference is calculated using cross-layered approach by sending probes to MAC layer. Secondly, the nominal bit rate information is provided to all nodes in the same contention domain by considering the bandwidth sharing mechanism of 802.11. Like ETX, our metric also calculates link delivery ratios that directly affect throughput and selects those routes that bypass dense regions in the network. Simulation results by NS-2 show that IBETX gives 19% higher throughput than ETX and 10% higher than Expected Throughput (ETP). Our metric also succeeds to reduce average end-to-end delay up to 16% less than Expected Link Performance (ELP) and 24% less than ETX.
In this paper, we study the statistical properties of the connectivity of VANETs with user mobility at the steady state. We assume a network of highways with arbitrary topology. The nodes arrive at the network through one of the traffic entry points following a Poisson process and move within the network according to a mobility model. The path of a node within the network is determined through a routing matrix. The system is modeled as a BCMP network of queues. We derive the probability distribution of the node population size within the network. Then, we determine the probability distribution of the cluster size seen by a new node arriving along a path. The presented numericals results illustrate the effect of mobility on connectivity. The results of the paper may be used to study the routing algorithms, throughput or delay in VANETs.
In this paper, we present a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which depends on distance to destination. From link state entries, nodes construct the topology map of the entire network and compute optimal routes. Simulation experiments show that FSR is simple, efficient and scalable routing solution in a mobile, ad hoc environment. 1 Introduction As the wireless and embedded computing technologies continue to advance, increasing numbers of small size and high performance computing and communication devices will be capable of tetherless communications and ad hoc wireless networking. An ad hoc wireless network is a selforganizing and self-configuring network with the capability of rapid deployment in response to application needs. An important characteristic wh...
A performance modeling of vehicular ad hoc networks (VANETs)
- M Khabazian
- M K Ali