Network Routing Mechanism Simulation Research Based on VANETs

Node misbehavior due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. To deal with misbehavior in MANET, an incentive mechanism should be integrated into routing decision-making. In this paper firstly we review existing techniques for secure routing, and then propose to use trust vector model based routing protocols. Each node would evaluate its own trust vector parameters about neighbors through monitoring neighbors’ pattern of traffic in network. At the same time, trust dynamics is included in term of robustness. Then we integrated trust model into Dynamic Source Routing (DSR) and Ad-hoc On Demand Distance Vector (AODV) which are most typical routing protocols in MANET. We evaluate the performance of those trust routing protocols by compar ing the simulation results of with and without the proposed trust mechanism . The simulation results demonstrate that modified routing protocols can effectively detect malicious nodes and mitigate their attacks.

A MANET is a self-motivated mobile wireless network that can be created exclusive of any former support. The challenge of MANET is to design robust routing algorithms which will satisfy all or few routing properties. Routing protocol in MANET can be categorized in various approaches depending upon network structure, communication model, routing strategy. Routing protocols can be further classified as proactive and reactive. Routing algorithms developed till today focused on the methods of routing. This article presents a survey of single /multipath routing algorithms, its advantages, and limitations. Researchers are attracted to rectify, design & develop concrete, routing algorithms which will fulfill the adequacy requirement of MANET users. This paper proposes the need robust routing protocol with security and energy efficient.

Objectives: It analyzed the simulation based study for impact of resource consumption attack on Signal-Stability Based Adapting (SSA) routing protocol in MANET. The performance of routing protocol is calculated by using these different parameters like throughput, Packet Delivery Ratio (PDR), end to end delay (E2E), routing overhead and energy consumption. Methods/ Statistical Analysis: The whole simulation is carried out through NS-2. NS-2 (Network Simulator version 2) is used for this simulation which is developed by UC Berkely. NS-2 is basically a combination of two languages OTcl and C++. Components of NS-2 are NAM (Network Animator), Proposing, Post prosing. NS-2 is a discrete event simulator in this C++ is easy to code but slower to run whereas OTcl is fast to run and difficult to code. Findings: We see the impact of this attack with three different performance metrics such as End to End, routing overhead, energy consumption throughput and packet delivery ratio (PDR).

Wireless ad hoc networks are an emerging and popular technology to the world; however, the benefits of them are actually their fragility, too. Owing to mobile node movement, the link break problem always occurs in the network. The problem greatly influences the throughput, delay, jitter, and lots of performance issues of a routing protocol. Hence, this article is proposed to evaluate the influence of link break problem on two categories of most popular routing protocols, i.e. table-driven and on-demand routing protocols. This article briefly discusses the main differences, building up mathematical model, setting up simulation environment, running the simulation, and finally presenting the simulation results and analyzing the performance. We found that the update probability of table-driven routing protocols increase exponentially with the number of mobile nodes but linearly with moving speed. On the contrary, the update probability of on-demand routing protocol increase both linearly with the number of mobile nodes and moving speed. We conclude that the effect of link break problem on table-driven routing protocols is much serious than that on on-demand routing protocols since the former has to maintain each link of the network but the latter only the links of a specific route. Table-driven routing protocols are not scalable; however, on-demand routing protocols are.

The increasing demand for delivering communication services in regions with intermittent connectivity and low node density has motivated researchers to develop new routing protocols. There are many application dependent routing protocols in the literature to establish communication for densely connected MANETs to the highly mobile and Opportunistic DTNs (Delay Tolerant Networks). OceanNet aims to provide reliable communication services to the fishermen who take fishing trips that last for several days. In this paper, we study the existing research done on MANET, DTN and hybrid routing protocols. We adopt a system level simulation study for the OceanNet network topology using NS-3. The goal of this approach is to understand the network performance under various factors such as scalability, node movement and connectivity of different types of fishing vessels using MANET protocols. Simulation results show that choosing a single MANET protocol does not prove to be effective for the different scenarios considered in the network.

Lots of routing protocols have been proposed in the literatures to overcome several challenges in ad hoc networks. The fundamental point we consider in this paper is that most of such protocols are generally based on the assumption that mobile nodes are functionally equivalent to each other in computing power and memory space. Moreover, all of the mobile nodes are required to use a common routing protocol to communicate with each other. However, such assumptions do not reflect the real world, even further the future oriented ubiquitous world. The ubiquitous paradigm requires networking technologies to support the heterogeneity including various capabilities to compute, amounts of storage, radio interfaces, patterns of mobility and others. In real scenario, for instance, some nodes may not want to relay packets for others owing to their power constraints. Also there might be nodes employing different routing protocols in a single communication zone. To cover some of these cases, this paper proposes a simple but efficient approach called HRPC (Heterogeneous Routing Protocol Coordinator) that works well in our previously proposed MANET architecture. HRPC is not a stand-alone routing protocol but a coordinating module for support bridging functionality between heterogeneous routing protocols in MANET. This paper also gives HRPC implementation and its demonstration results, where DYMO and OLSR routing protocols are used as an exemplified scenario to evaluate the operability of HRPC.

This study examines energy consumption and the impact on network lifetime using ANODR and DYMO routing protocols in MANETs with the QualNet simulator. Both ANODR and DYMO are designed for MANETs but employ different approaches for establishing and maintaining routes among mobile nodes. ANODR adapts routing decisions based on neighborhood information, while DYMO operates on-demand, establishing routes only when necessary. To investigate energy consumption and network lifetime, simulations or experiments should be conducted to compare the performance of these protocols under various scenarios. Analyzing these QoS metrics provides insights into the energy efficiency and impact on network lifetime of ANODR and DYMO in MANETs.

Ad hoc mobile devices heavily depend on the performance of batteries. Optimizing the power consumption is a very crucial issue. To maximize the lifetime of mobile ad hoc network, the power consumption rate of each node must be reduced. In this paper we present a novel energy efficient routing algorithm based on mobile agents to deal with the routing mechanism in the energy-critical environments. A few mobile agents move in the network and communicate with each node. They collect the network information to build the global information matrix of nodes. The routing algorithm chooses a shortest path of all nodes in all possible routes. Additionally, we compare the performance of power-relation routing protocol DSR (Dynamic Source Routing) in simulation environment.The results show that the survivability of Ad Hoc network has been better because of less energy consumption when using our improved DSR as compare to standard DSR protocol.

Mobile ad hoc network-a revolutionary concept in itself, is a collection of wireless mobile nodes that are dynamically and arbitrarily located in a fashion that the interconnection between nodes are capable of changing in a continual basis. MANET has increasingly gained popularity, especially with the military and it is the aim and zeal of technology to upgrade its components and make them better and better. Mainly 4 or 5 types of conventional routing protocols of reactive, proactive or hybrid natures are used based on the requirements of the network. However power consumption in all these are rather high causing the transmission cost to increase. Thus, the quest for an energy efficient routing protocol in MANET to make its usage even better. In this paper we have tried to talk about newer energy efficient routing protocols. These take into consideration that in MANET, channel and energy capacity are scarce resources. Thus it is extremely important to enhance the lifetime of MANETs. Hence we have listed certain energy efficient protocols ideally suited for the current scenario.

In order to verify the application effect of MANET Routing Protocol in vehicular ad hoc network, the table driven routing priors DSDV, OLSR and on-demand routing reactive AODV are used to verify the results. In this paper, the simulation platform is built by NS3 and SUMO, and the performance of MANET is verified by comparing the network performance parameters, such as throughput, packet delivery rate and end-to-end delay. The experimental results show that the routing protocol in MANET can be used in vehicular ad hoc networks, but the network performance parameters need to be further optimized.

Designing routing protocols for Mobile Ad Hoc Networks MANETs is a complex task because of its dynamic topology. A kind of routing protocols that suits the particularity of MANETs is so-called bio-inspired. Among these, focused on Ant Colony Optimisation ACO, which studies the behaviour of ants in their search for food, are especially relevant. One of these algorithms is AntOR, which relying on swarm intelligence, efficiently solves routing in MANETs. In this paper we show a parallelised version of AntOR, the so-called P-AntOR, that using programming multiprocessor architectures based on shared memory protocol, allows to run tasks in parallel using threads, being applicable this parallelisation in the route discovery phase, route local repair process and link failure notification. The simulation results indicate that P-AntOR performs better than its predecessor, with emphasis on the metric of average End-To-End delay, jitter and packet delivery ratio.

Mobile ad hoc network is an infrastructure-less network where the nodes are mobile and each node behaves as a router. There are many routing protocols in MANET which are used to govern the path from the source node to destination node. Many problems are associated with the MANET due to its wireless nature and the dynamic topologies, so this survey paper focuses on behavior of Transmission Control Protocol in reactive and proactive routing protocols of MANET which are DSDV, AODV, and DSR.

In MANETs, there are many critical issues such as energy consumption, QoS, exposure to attacks, link stability etc. that need to be addressed for improved communication. `Link Stability' is important because radio links are likely to be unreliable due to node mobility. This instability leads to increased rerouting which further escalates routing overhead. One way of reducing routing overhead is use of multicasting instead of unicast routing. Multicast Routing Protocol transmits data simultaneously to a group of destination nodes to achieve better resource utilization. In this paper, we present a multicasting routing protocol that uses received signal strength as a metric to estimate link stability. Estimated SINR (Signal to Interference plus Noise Ratio) at every node in respect of different senders is used to determine a reliable path that is likely to mitigate link failures and reduce end-to-end delay. For any two nodes, we aim at finding best link with high probability of longer lifetime. We have simulated our experiment on Exata/Cyber Simulator and compared the result of the proposed routing protocol with ODMRP (On-Demand Multicast Routing Protocol) based on minimum hop count. Analysis of our simulation results show improvement of various routing performance metrics such as PDR, Routing Overhead and packet drop ratio.

Several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network. This paper introduces a new schema in management of mobile nodes location in mobile ad hoc networks. Fuzzy logic optimization is applied to a better management of location update operation in hierarchical location services. Update management overhead is decreased without significant loss of query success probability. One-hop-chain-technique is used for Auto compensation. A new composed method can update mobile nodes location when the nodes cross a grid boundary. The proposed method uses a dynamic grid area that ?solves the ping-pong problem between grids. Simulation results show that these methods are effective. The algorithms are distributed and can keep scalability in the scenario of increasing nodes density?. The described solutions are not limited to a special network grid ordering, and can be used in every hierarchical ordering like GLS if the ordering can be mappable on these methods.

CSCW in design maybe work in Mobile Ad hoc Network and security of routing protocol in MANET is one key factor. The routing protocol for MANET uses cryptographic technology to heighten its security, which makes it possible to use formal method. Considered the property of routing protocol for MANET, the drawback of BAN logic is analyzed and the security is described based on improved BAN logic. The formalization of the protocol is described and the method is presented. Taken example of SADSR, the security of routing protocol is analyzed by using the method, which proves the method is valid. A method to attack SADSR is found.