Temporally Ordered Routing Algorithm Research Articles

Impact of Jellyfish attack on routing protocols in TCP-based MANETs

Mobile ad-hoc networks (MANETs) are self-organized infrastructure-less network of mobile wireless devices that could be deployed for communication. Due to the insecure wireless communication medium, multi-hop routing communication process, and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as Jellyfish attacks. A Jellyfish node targets TCP-based MANET and exploits its working mechanism to degrade the communication performance. This attack is hard to detect since it is a TCP protocol compliant methodology.In this paper, we evaluate the performance of the Ad hoc on-demand vector (AODV), Dynamic source routing (DSR), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols under the Jellyfish delay variance attacks for TCP-based MANETs. Further, the TAHOE, RENO, and SACK variants of TCP protocol are considered for comparison. These routing protocols are simulated using the OPNET simulator to compare their performance, using specific performance metrics on the network. The experimental results show that the AODV protocol performs better than the DSR, TORA, OLSR, and GRP protocols under the jellyfish delay variance attack. Further, the SACK TCP variant performs better than the other TCP variants under the Jellyfish delay variance attack.

Performance evaluation of MANET routing protocols under DDOS attacks

Mobile ad-hoc networks (MANETs) consist of a set of communicating wireless mobile nodes or devices that could be deployed without the need for pre-established infrastructure for communication. Due to the insecure wireless communication medium and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as distributed denial of service (DDOS) attacks. DDOS attacks are used to temporarily disable network services by overloading the target system with huge traffic, such that it cannot respond to legitimate traffic.
 In this paper, we evaluate the performance of the Ad hoc on demand vector (AODV), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols in MANETs under the DDOS attacks. These routing protocols are simulated using OPNET simulator to compare their performance using specific performance metrics on the network. The experimental results show that TORA protocol performs better than the AODV, OLSR, and GRP protocols under the DDOS attack.

Evaluation of Routing Protocols and Mobility in Flying Ad-hoc Network

The ability of dynamic reconfigurability, quick response and ease of deployment has made Unmanned Aerial Vehicles (UAVs), a paramount solution in several areas such as military applications. Flying ad-hoc network (FANET) is a net-work of UAVs connected wirelessly and configured continuously without infrastructures. Routing on its own is not significant, but the mobility sequence of a UAV in FANETs is a more significant factor and an interesting research topic. The routing protocols gives us a certain and better perception of routing structure for FANETs. In this paper, routing protocols such as Ad-hoc On-Demand Vector (AODV), Dynamic Source Routing (DSR), Temporally Ordered Routing Algorithm (TORA), Geographic Routing Protocol (GRP) and Optimized Link State Routing (OLSR) are compared using performance parameters such as number-of-hops, packet loss ratio, throughput, end-to-end delay and throughput. The mobility models like Pursue Mobility Model (PRS), Semi-Circular Random Movement (SCRM), Manhattan Grid Mobility Model (MGM) and Random Waypoint Mobility (RWPM). The evaluation is carried out with three scenarios including one sender node and one receiver node, all senders one receiver and all senders all receivers are considered for above protocols and mobility models. For all evaluation scenarios, the performance of OLSR is the most efficient among the five routing protocols under four different performance parameters due to its proactive nature which makes the routing information up to date with the help of MPR (Multi Point Relay) in the network, resulting in the reduction of routing overhead in the network.

Performance Analysis of DSR and TORA Model Routing Protocols In Vehicular Ad Hoc Network

Pekanbaru city is a large area, therefore traffic congestion often occurs due to the density of society’s vehicles. From this problem, it is needed a technology that can exchange information between vehicles. Information Technology that can involve many vehicles with special network types without dependence on an infrastructure is Ad Hoc Network. One type of this network is Vehicular Ad Hoc Network (VANET). VANET is a new concept in enabling communication between Vehicle to Vehicle (V2V). For efficient data packet delivery, VANET requires a routing protocol. In this research, for simulated and analyzed performance is used the Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) protocol. NS-2 is used to simulated a moved nodes, SUMO software is used to simulated real map of SKA Mall crossroad and parameter the quality of performance routing protocol DSR can determined by End to End Delay, Packet Delivery Ratio (PDR) and Routing Overhead (RO). This simulation uses scenario 100 nodes, 150 nodes, 200 nodes and 250 nodes. The simulation results with the scenario of changing the number of nodes, the DSR routing protocol produces better performance with an average of End to End Delay is 0.1066 s, average of PDR is 95.45% and average of RO is 1.0076. While the TORA routing protocol has an average of End to End Delay is 0.1163s, average of PDR is 93.49% and average of RO is 1.0801. And in the scenario of node speed changes, the TORA routing protocol produces better performance with an average of End to End Delay is 0.0861 s and average of PDR 97.37%. While the DSR routing protocol is better with an average of RO is 1.0076.

Performance Assessment of QoS Using AODV, TORA and ZRP Routing Protocol in MANET

In Mobile Ad hoc Networks (MANET) nodes often change their location independently where neither fixed nor centralized infrastructure is present. Nodes communicate with each other directly or via intermediate nodes. The advantages of the MANET layout lead to self-structure and compatibility to most important functions such as traffic distribution and load balancing. Whenever the host moves rapidly in the network the topology becomes updated due to which the structure of MANET varies accordingly. In the literature, different routing protocols have been studied and compared by researchers. Still, there are queries regarding the performance of these protocols under different scenarios. MANETs are not based on a predesigned structure. In this paper, the performance assessment of the Quality of Services (QoS) for different protocols such as Ad hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) in the existence of the various number of communicating nodes is studied. The performance matrices throughput, end – to – end delay and packet delivery ratio are considered for simulations. Ns 2.35 simulator is used for carrying out these simulations. Results are compared for AODV, TORA, and ZRP routing protocols. The results show that AODV and TORA perform well in end – to – end delay as compared to zone routing protocol. Zone routing protocol performs well in packet delivery ratio and throughput as compared to both the other protocols.

Analysis of traffic congestion at Jattu Junction (Auchi) with queuing theory using TORA and SIDRA softwares

Traffic congestion is a major problem in developing country like Nigeria. Traffic congestion at intersection is on the increase in Auchi metropolis as the numbers of vehicles increases there, which eventually lead to traffic delay and traffic crash casualties. For this research, an Markovian/Markovian/1 (M/M/1) queuing model was used to analyse the queuing characteristic of the intersection to determine the arrival rate and service rate of the vehicles. An operation research software known as Temporary-Ordered Routing Algorithm (TORA) version 2.5 was used to analyze the arrival and service time data obtained to determine the operating characteristics of the M/M/s model for each of the intersection. The result showed that the average traffic intensity of the intersections was more than the optimal traffic intensity of 0.5 indicating the intersections were congested. Signalised & unsignalised Intersection Design and Research Aid (SIDRA) software was further used to analyse the intersection to access the performance measure of the intersection. The result from the SIDRA software also confirmed that the intersection was congested. It was recommended that the capacity of the intersection should be increased; government should construct traffic signals and enforce law to sanction motorists that inappropriately park along the road sides close to intersection; appropriate government agency should carry out more public enlightenment on the use of traffic signal and other roads signs; and alternative roads should be constructed to mitigate the congestion at intersections.

Application of Linear Programming Approach for Determining Optimum Production Cost

Cost optimization problem deals with that problem which aims to find out the most appropriate ways to fulfill the demand of a particular product of any manufacturing company with minimum cost. Linear programming is one of the most appropriate techniques for scheduling the optimum cost of manufacturing. In this study, the production schedule of a bicycle manufacturing company is taken into account. The mathematical formulation of the problem under consideration is performed by using a linear programming approach. An operations research software, TORA (Temporary-Ordered Routing Algorithm), has been used in solving the problem and analyzing the results. Results reveal that a specific schedule has a great impact on optimizing the production cost.

Energy Efficient Routing Technique by using TORA and BPSO

A MANET (Mobile Ahoc NETwork) is infrastructure less self configuring a set of mobile devices, and those devices communicating via wireless. Devices in MANET can free to move anywhere and any direction. Due to nature of movable, the link between each device can frequently change; due to its dynamic nature of MANET it has some security issues than other fixed infrastructure networks. In the devices in MANET, energy consumption in devices is an important issue. Therefore we need a energy-efficient routing method that consume less energy and incress the lifetime of network. In this proposed paper, here proposed a energy-efficient routing method by using TORA (Temporally Ordered Routing Algorithm) and BPSO (Binary Particle Swarm Optimization).

An Energy Efficient Enhanced Hybrid Routing Protocol for MANET utilizing Artificial Bee Colony

Mobile Ad hoc Network (MANET) is a self-organized wireless network with no central control station or no rigid infrastructure. The main objective of the ad hoc network is that the nodes move arbitrarily that needs the routing protocols to rapidly counter the change of network topology. Limited energy resource availability is the core issue in MANET. For energy efficiency enhancement, this research has acquainted a hybrid routing algorithm which is an amalgamation of Ad hoc On-Demand Distance Vector Routing (AODV) and Temporally-Ordered Routing Algorithm (TORA) routing protocols for the route discovery process using Low Energy Adaptive Clustering Hierarchy (LEACH). Artificial Bee Colony (ABC) algorithm has been used for the optimization if some sort of distortion occurs within the network. The simulation has been executed in MATLAB simulation tool using QoS parameters, such as throughput, energy consumption, PDR and delay. Comparative analysis has been done to portray the proposed work effectiveness.

A Comprehensive Analysis of Simulated results for the Performance of AODV and TORA Routing Protocols in Mobile Ad-hoc Networks

A Mobile Ad-Hoc Network (MANET) is underpinning less system of movable devices connected by wireless links. Every device in MANET moves arbitrarily on any path with no impediments and this free movement helps in transforming its links to new devices promptly and unpredictably. MANETs do not require a predefined arrangement or centralized administration to interconnect with each other. This research work is carried out to compare the efficiency of two of the on-demand routing protocols - Ad Hoc On-Demand Distance Vector Routing (AODV) and Temporally Ordered Routing Algorithm (TORA) for mobile ad hoc network and the parameters taken into consideration for evaluation are packet delivery ratio, throughput, End to End Delay, Routing overhead, Energy Consumption and others. With the help of NS2, the simulated results of both the protocols are analysed based on its parameters chosen in this work. In particular, the parameters mainly considered for the comparison are packet delivery ratio and End to End Delay. Finally, the performance of these two protocols is compared on the basis of its simulation time.

Comparative Study of AODV and DSR Routing Protocols for MANET: Performance Analysis

An ad hoc network is an assortment of wireless mobile nodes dynamically forming a transitory network lacking the use of any presented network communications or centralized management. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc on-Demand Distance Vector Routing (AODV) and Temporally Ordered Routing Algorithm (TORA) have been projected. In this work an attempt has been ended to evaluate the performance of two outstanding on demand reactive routing protocols for mobile ad hoc networks: DSR and AODV. The performance differentials are analyzed using varying time, packet delivery ratio, throughput and end-to-end delay. These simulations are carried out using the ns-2 network simulator, which is used to run ad hoc simulations.

Performance Evaluation of Routing Protocols for Voice and Video Traffics

Wireless networks are comprised of nodes which are high in mobility and are adhoc natured where centralized access point is not required. Each node will have particular transmission range in which the data transmits from source to destination in that transmission range. Route construction for transmission of data from source to destination is tough due to high node mobility and dynamic nature of network. Many routing protocols are proposed and implemented in networks to reduce such mobility and dynamic difficulties for route construction. These routing protocols construct a route from source to destination based on availability of network nodes. Adhoc On demand Distance vector (AODV) is a self-starting dynamic network, Dynamic source routing (DSR) and Temporally Ordered Routing Algorithm (TORA) are most frequent used ones for dynamic route construction. Voice and Video are two mostly used applications nowadays as the users are immensely using them. In this paper, a comparison is made in performances of AODV, DSR and TORA for the traffics of voice and video. The performance is evaluated in terms of delay, throughput and packet delivery ratio. Simulations are conducted using network simulator NS 2.35.

Comparison of Reactive Routing protocols in MANET using IDS system

Mobile Ad-hoc networks (MANETs) is a infrastructure less network. They have so many advantages but disadvantages are security, transmission, energy etc. It has two types of protocols they are- reactive routing protocols and proactive routing protocols. In our paper, we discuss about comparing the security systems between the TORA (Temporally Ordered Routing Algorithm) and AODV (Ad-hoc on-demand distance vector routing) protocols using IDS (Intrusion Detection System) to get better result than proposed system. TORA is an algorithm for a routing data across MANETs, is an on-demand routing protocol. The main objective of TORA is to limit control message propagation in the highly dynamic mobile environment. AODV is an protocol establishes routes to destinations on demand and supports both unicast and multicast routing. The AODV protocol builds routes between nodes only if they are requested by source nodes. AODV creates a series of temporary nodes back to the requesting node. In our proposed system we compared parameters like Packet Delivery Ratio (PDR), Routing Overhead (RO) and Throughput through network simulation 2 (NS2). Keywords- MANETs, IDS, protocols, TORA, AODV, security

A Survey on Performance Evaluation of Non-Realistic Mobility Models with Different Routing Protocols on MANET

We are moving from the traditional wired communications to wireless communications. Wireless network consists of several nodes which communicate without any wired channel. MANET (Mobile adhoc network) is one of the types of wireless network. Mobile means moving, infrastructure less and network means communication between nodes. So, “Mobile adhoc networks” are a kind of Dynamic network in which nodes are moving without any centralized structure. Selection of routing protocol and mobility model in Mobile adhoc network is a challenging task due to its dynamic changes in topologies. We discuss in this paper non-realistic mobility models and various routing protocols of adhoc networks. The objective of this review paper, is to determine the performance measures like throughput, packet Packet delay, Routing overhead, effect of speed, no. of packets transmitted, lost, bytes and bit rate of MANET’s Routing Dynamic Source Routing (DSR), Ad-hoc On Demand Distance Vector (AODV) and Temporally Ordered Routing Algorithm(TORA) with respect to time / number of nodes. This detailed simulation results illustrate the importance evaluating and implementing routing protocols environment and this also help to researchers in deciding which mobility model is better under which condition.

Design and Analysis of A High Resuluation Navigation System for The Intillegent Transportation System

This paper suggests an information gathering and monitoring system designed for vehicular ad-hoc networks(VANETs) and that implemented in a large area.The suggested infrastructure consists of low cost wireless sensors covering certain areas and connected to “the monitoring and control center” through a master node, the study is divided into four phases: the first phase discusses the information gathering process in vehicles and sensors level, the second phase discusses how to send the brief road traffic information to the master node. This process is based on the concepts of the summarization and aggregation and study the effect of using one or two channels for that purpose, the third phase focuses on the information transportation between the master nodes until it reaches to “the monitoring and control center”, The mechanism of the information transportation in this phase is proposed to be in an ad-hoc manner using four ad-hoc protocols Ad-hoc On Demand Distance Vector Routing Protocol AODV,Dynamic Source routingDSR, Optimized Link State Routing Protocol OLSR and Temporally-Ordered Routing Algorithm Protocol TORA. The best protocol willbe selectedaccording to its data delivery, latency and average throughput on the radio channel and the fourth phase deals with dissemination of the gathered information to the vehicles.The proposed system is designed and simulated using “OPNET” package. The results indicate the ability of applying real time and high resolution monitoring system using these techniques.

Experimental based Performance Analysis of Proactive OLSR, Reactive Tora and Hybrid GRP Routing Protocols in MANET

Mobile Ad hoc Network (MANET) contains mobile nodes which exchange information dynamically over wireless links. Routing Protocols are the most vital element of MANET, which are needed to handle dynamic communication and also find route. Performance of routing protocols is an important issue. In MANET, due to mobility of nodes, the wireless links are highly error prone and can go down frequently, interference and less infrastructure. In this research, performance of Optimized Link State Routing (OLSR), Temporary Ordered Routing Algorithm (TORA) and Geographic Routing Protocol (GRP) routing protocols are evaluated in mobile Ad hoc network by using simulator against various quantitative metrics like Network Load, Throughput, Retransmission Attempts and Media Access Delay by varying physical characteristics, number of nodes, nodes speed and pause time. Various simulation scenarios are investigated by varying matrices. A comparative performance analysis of aforesaid protocols is carried out in this research. In the last, conclusion is presented which demonstrates that performance of routing protocols differs by varying matrices.

Optimising VoIP Traffic over MANET: Leveraging the Power of TORA On-Demand Routing Protocol

Ad hoc Network (MANET) routing protocols studies in the last decade have focused more on proactive routing protocols with many specifics to data traffic. Only fewer works have addressed the issues of reactive protocols supporting voice application. This research work analyses the performance of VoIP application in MANET configured with Temporary Ordered Routing Algorithm (TORA) routing protocol as on-demand routing protocol. The VoIP application is evaluated using four different parameters namely; codec, MAC protocol, mobility and node density in an OPNET simulation environment. The quality of transmission was measured through different performance metrics such as jitter, Mean Opinion Score (MOS), end-to-end delay and throughput. Results show that major metrics that had high impact on the performance of the network included mobility and node density. It research proved that communication in an ad hoc network using TORA is more productive and effective with fewer nodes. It could also be said that given the utilization of TORA routing protocol in MANET, quality of voice communication is disproportionate to node density. Increase in the number of nodes greatly depreciates voice quality. In the whole, the work provides a very good analysis that could help the academia and industries in reaching decisions for a most suiting routing protocol at any given ad hoc voice communication setup.

STUDY AND ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD-HOC NETWORK

Mobile Ad-hoc Networks (MANETs) is a network without a fixed Infrastructure. In wireless networks users expect to get access to the network security and to exchange information anytime and anywhere. The ad hoc wireless network consists of mobile networks which creates architecture for communication without the help of traditional fixed-position routers. Establishing strong routes and providing security are the main tasks in MANETs. Routing is the critical issue in the MANET and focus based on routing protocols such as Ad hoc On-demand Distance Routing Protocol (AODV), Dynamic Source Routing (DSR), Temporally Ordered Routing Algorithm (TORA) and Optimized Link State Routing (OLSR) are interesting due to their applications. OPNET is used to establish the simulations of these routing protocols the performance of the routing protocols is studied by selecting metrics. Metrics are used to select the best path for exchanging information from source to destination. Result show that AODV and TORA is suitable for larger networks while changing network topology with selected metrics.

PERFORMANCE EVALUATION OF PROACTIVE, REACTIVE AND HYBRID ROUTING PROTOCOLS WITH MOBILITY MODEL IN MANETS

Our work mainly focused on the performance and effe cts of different mobility models like Random Waypoi nt, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Li nk-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zon e Routing Protocol (ZRP) routing protocols. These t hree routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updatedproactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed t he performance issues in AODV, DSDV and DSR routing protocols in Random Wayp oint mobility model on Mobile Ad hoc Networks (MANE Ts) is not satisfactory due to link failure and late acknowled gement. To resolve the specified issue, we have com e up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA aA simulation was carried out in NS2 and Bonnmotion for above said pr otocols and mobility models in Constant Bit Rate (C BR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our si mulation it was shown that few mobility model performed better in different routin g protocols. In our simulation results, we got a hi gh Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR p rotocols.

An Efficient Ant Based QOS Aware Intelligent Temporally Ordered Routing Algorithm for MANETS

A Mobile Ad hoc network (MANET) is a self configurable network connected by wireless links. This type of network is only suitable for temporary communication links as it is infrastructure-less and there is no centralised control. Providing QoS aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of QoS aware routing is to find a feasible path from source to destination which will satisfy two or more end to end QoS constrains. Therefore, the task of designing an efficient routing algorithm which will satisfy all the quality of service requirements and be robust and adaptive is considered as a highly challenging problem. In this work we have designed a new efficient and energy aware multipath routing algorithm based on ACO framework, inspired by the behaviours of biological ants. Basically by considering QoS constraints and artificial ants we have designed an intelligent version of classical Temporally Ordered Routing Algorithm (TORA) which will increase network lifetime and decrease packet loss and average end to end delay that makes this algorithm suitable for real time and multimedia applications.