scholarly journals ANT INTELLIGENCE ROUTING

2017 ◽  
Vol 25 (1) ◽  
pp. 81-93
Author(s):  
Chye Ong Gan ◽  
K. Daniel Wong ◽  
Wei-Le Woon
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Ad Hoc Wireless Networks ◽  
Third Party ◽  
Improve Performance ◽  
Ad Hoc Routing ◽  
End To End Delay ◽  
Hoc Networks ◽  
Routing Tables

We introduce AIR, a new ant-based routing protocol for ad hoc wireless networks. AIR incorporates recent technology advances in ad hoc routing protocols, such as ring-based searching and third-party reply, while retaining the characteristics and benefits of ant-based routing protocols, including probabilistic routing tables and pheromone evaporation. In addition, we combine the best features of previous ant-based routing protocols with new features like update ants and two-way route establishment, to further improve performance. We compare the performance of AIR against AODV and DSR using appropriately chosen simulations, the results of which are presented and discussed. We find that AIR is especially useful for ad hoc networks requiring low end-to-end delay where mobility rates are high.  

RAODV Routing Protocol for Congestion Detection and Relief in Ad Hoc Wireless Networks

2021 ◽  
Vol 13 (4) ◽  
pp. 21-34
Author(s):  
Xiaojie Liu ◽  
Ulrich Speidel
Keyword(s):  
Wireless Networks ◽  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Random Network ◽  
Detection Algorithm ◽  
Ad Hoc Wireless Networks ◽  
Third Party ◽  
Congestion Detection ◽  
Hoc Networks

Ad hoc wireless networks depend on mutual collaboration among nodes. Congestion in ad hoc wireless networks thus presents more of a challenge than for other network types. This article proposes RAODV (relieving AODV), a modification of the AODV routing protocol, to handle congestion via third party neighbour nodes in dense and static ad hoc networks. RAODV nodes use a T-entropy threshold-based congestion detection algorithm to determine the congestion status of their neighbours. If RAODV determines that congestion is occurring, it then tries to relieve congestion via a local repair modification algorithm that replaces the congested node by a suitable monitoring/third party neighbour node. This article also shows evidence that RAODV results in better network performance than AODV in simulations with random network topologies.

scholarly journals Flaws in Endair-A Secure Routing Protocol for MANETS

2013 ◽  
pp. 287-292
Author(s):  
B. Swetha ◽  
S. Ajay Kumar ◽  
TVS Prasad Gupta
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Network Routing ◽  
Secure Routing ◽  
Node Mobility ◽  
Ad Hoc Routing ◽  
Security Proof ◽  
Hoc Networks

Routing is the one of the essential criteria at network level in mobile ad hoc networks. Ad hoc network routing protocols are difficult to design, and secure because unable to handle rapid node mobility and network topology changes. It has been realized by many researchers, and several “secure” routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. This approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but to the best of our knowledge, it has not. A new ondemand source routing protocol, called endairA, and demonstrate the usage of our framework by proving security. It is analyzed and shown that the security proof for the route discovery algorithm, endairA is flawed due to hidden channel attack. To overcome this flaw of EndairA algorithm, we uses acknowledgement based reply to find a secured route which provides more security and overcomes the hidden channel attack in the existing approaches.

scholarly journals Novel Multipoint Relays Scheme Based on Hybrid Cost Function

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Ali Ouacha ◽  
Bachir Bouamoud ◽  
Ahmed Habbani ◽  
Jamal El Abbadi
Keyword(s):  
Cost Function ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Ad Hoc Routing ◽  
Packet Delivery ◽  
End To End Delay ◽  
Number Of Factors ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Performance Results

When evaluating the performance of QoS protocols, a number of factors have a major impact on the results. Notably, QoS is emphasized when mobile ad hoc networks (MANETs) are employed into aerospace fields. Some of these parameters are a particular manifestation of characteristics of the MANET environment, such as mobility. Indeed, our proposal is a novel multipoint relays scheme based on hybrid cost function taking into account QoS criteria and avoiding mobility effect of nodes, especially those selected as MPRs. A comprehensive simulation study was conducted to evaluate the performance of the proposed scheme. Performance results show that RQMPR outperforms existing MPR heuristic adopted in the ad hoc routing protocols OLSR and QOLSR, in terms of packet delivery and average end-to-end delay.

scholarly journals MANETs performance analysis with dos attack at different routing protocols

2015 ◽  
Vol 4 (2) ◽  
pp. 390 ◽  
Author(s):  
Alaa Zain ◽  
Heba El-khobby ◽  
Hatem M. Abd Elkader ◽  
Mostafa Abdelnaby
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Geographic Routing ◽  
Security Threat ◽  
Dos Attacks ◽  
Reactive Routing ◽  
Hoc Networks ◽  
The Impact

A Mobile Ad-Hoc Networks (MANET) is widely used in many industrial and people's life applications, such as earth monitoring, natural disaster prevention, agriculture biomedical related applications, and many other areas. Security threat is one of the major aspects of MANET, as it is one of the basic requirements of wireless sensor network, yet this problem has not been sufficiently explored. The main purpose of this paper is to study different MANETs routing protocols with three scenarios of Denial of Service (DoS) attacks on network layer using proactive routing protocol i.e. Optimized Link State Routing (OLSR) and Reactive routing protocols like Ad hoc On-Demand Distance Vector (AODV), Hybrid routing protocols like Geographic Routing Protocol (GRP). Moreover, a comparative analysis of DoS attacks for throughput, Data loss, delay and network load is taken into account. The performance of MANET under the attack is studied to find out which protocol is more vulnerable to the attack and how much is the impact of the attack on both protocols. The simulation is done using OPNET 17.

scholarly journals Performance Evaluation of GPSR and AODV Routing Protocols in MANETS

2019 ◽  
Vol 9 (2S) ◽  
pp. 459-461
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
On Demand ◽  
Protocol Performance ◽  
Military Applications ◽  
Wireless Medium ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks (MANETs) are collection of nodes connected through wireless medium and do not require infrastructure for operation. Network Topology keeps on changing because mobility of nodes are high. Therefore, it is important for MANETs to provide excellent routing and security features. Since MANETs do not require any pre-existing infrastructure, they are extensively used in emergency and rescue and military applications. MANETs thus will form essentially an important part in wireless networks. In this paper, Ad hoc On-Demand Distance Vector (AODV) and Greedy Perimeter Stateless Routing (GPSR) routing protocol performance is compared with respect to Throughput and E2ED and observed that there is an improvement in throughput by 11% in case of GPSR. Simulation is performed using NS3.

scholarly journals Enhancing Reactive Ad Hoc Routing Protocols with Trust

2022 ◽  
Vol 14 (1) ◽  
pp. 28
Author(s):  
Yelena Trofimova ◽  
Pavel Tvrdík
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Ad Hoc Routing ◽  
Trust Mechanism ◽  
Packet Delivery ◽  
Hoc Networks

In wireless ad hoc networks, security and communication challenges are frequently addressed by deploying a trust mechanism. A number of approaches for evaluating trust of ad hoc network nodes have been proposed, including the one that uses neural networks. We proposed to use packet delivery ratios as input to the neural network. In this article, we present a new method, called TARA (Trust-Aware Reactive Ad Hoc routing), to incorporate node trusts into reactive ad hoc routing protocols. The novelty of the TARA method is that it does not require changes to the routing protocol itself. Instead, it influences the routing choice from outside by delaying the route request messages of untrusted nodes. The performance of the method was evaluated on the use case of sensor nodes sending data to a sink node. The experiments showed that the method improves the packet delivery ratio in the network by about 70%. Performance analysis of the TARA method provided recommendations for its application in a particular ad hoc network.

scholarly journals Determining an optimum zone radius for zone routing protocol (ZRP) based on node mobility

2021 ◽  
Vol 21 (2) ◽  
pp. 1230
Author(s):  
Khalid W. Al-Ani ◽  
Salman Yussof ◽  
Hussein M. Haglan ◽  
Hothefa Shaker ◽  
Linda Mahdi Alani
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Node Mobility ◽  
Hybrid Routing ◽  
Zone Routing Protocol ◽  
Reactive Routing ◽  
Manet Routing ◽  
Hoc Networks ◽  
Zone Radius

Mobility is one of the important issues in Mobile Ad hoc Networks (MANET). By definition, MANET nodes are free to move around and this may cause difficulty in routing. MANET routing protocols must consider this factor when making routing decision. Zone Routing Protocol (ZRP) is a hybrid routing protocol, which utilizes the proactive and reactive routing protocols advantages. ZRP proactively maintains routing information within a routing zone, while reactively discovering routes to destinations beyond the routing zone. Since ZRP is based on the concept of routing zone, determining an optimum routing zone radius has the major impact on the performance of that protocol. In this research, we studied the effect of zone radius on the performance of ZRP with different levels of node mobility. Node mobility is defined using two different parameters: node speed and pause time. Based on the simulation results, ZRP protocol using zone radius of two provides the best packet delivery fraction, throughput and normalized routing load. However, a larger zone radius will provide a lower delay.

Inter-Domain Routing in Mobile Ad Hoc Networks

2010 ◽  
pp. 1-14 ◽  
Author(s):  
Chi-Kin Chau ◽  
Jon Crowcroft ◽  
Kang-Won Lee ◽  
Starsky H.Y. Wong
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Network Topology ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Ad Hoc Routing ◽  
New Directions ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Inter Domain Routing

Because of the increasing number of diverse routing protocols proposed to deal with the network dynamics in mobile ad hoc networks (MANETs), the heterogeneity of MANETs has increased dramatically. While many of these extant proposals only concern enhancing routing in a single domain, little attention has been given to the interoperations among heterogeneous MANETs. Moreover, the existing inter-domain routing protocols (i.e., BGP) that have been designed for the Internet cannot cope with the new challenges derived from the MANETs, such as (1) the rapid dynamic changes of network topology due to mobility, and (2) the larger diversity in intra-domain ad hoc routing protocols. In this chapter, the authors address some of the major challenges and identify new directions to the development of seamless inter-domain routing for enabling end-to-end communications over heterogeneous MANET domains.

An Efficient Two-Mode Routing Protocol in Dense and Sparse Vehicular Ad Hoc Networks

2015 ◽  
Vol 764-765 ◽  
pp. 817-821
Author(s):  
Ing Chau Chang ◽  
Yuan Fen Wang ◽  
Chien Hsun Li ◽  
Cheng Fu Chou
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Intersection Graph ◽  
Least Cost Path ◽  
Transmission Delays ◽  
Packet Delivery ◽  
Hoc Networks

This paper adopts a two-mode intersection graph-based routing protocol to support efficient packet forwarding for both dense and sparse vehicular ad hoc networks (VANET). We first create an intersection graph (IG) consisting of all connected road segments, which densities are high enough. Hence, the source vehicle leverages the proposed IG/IG bypass mode to greedily forward unicast packets to the boundary intersection via the least cost path of current IG. We then perform the IG-Ferry mode to spray a limited number of packet copies via relay vehicles to reach the boundary intersection of another IG where the destination vehicle resides. NS2 simulations are conducted to show that the two-mode IG/IG-Ferry outperforms well-known VANET routing protocols, in terms of average packet delivery ratios and end-to-end transmission delays.

Routing in Asymmetric Wireless Ad-Hoc Networks

2010 ◽  
pp. 132-145
Author(s):  
Pramita Mitra ◽  
Christian Poellabauer
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Route Discovery ◽  
Node Mobility ◽  
Ad Hoc Routing ◽  
Two Phase ◽  
First Case ◽  
Hoc Networks ◽  
Asymmetric Links

The presence of asymmetric links is a common and non-negligible phenomenon in many ad-hoc networks, including MANETs and sensor networks. Asymmetry is caused by node mobility, heterogeneous radio technologies, and irregularities in radio ranges and packet loss patterns. Most existing ad-hoc routing protocols either assume fully symmetric networks or simply ignore any asymmetric links. In the first case, route discovery can fail when the symmetry assumption does not hold true, e.g., many reactive routing protocols rely on a two-phase communication process, where the same path is used to communicate between a sender and a receiver. If a single link on this path is asymmetric, the route establishment may fail. In the second case, asymmetric links are identified and explicitly ignored in the route establishment phase. This can lead to route discovery failure if there is no symmetric path between a sender and a receiver or it can lead to less than optimal routes. This document provides an overview of routing protocols that explicitly consider asymmetric links in the route discovery phase and introduces robust mechanisms that bypass asymmetric links to ensure successful route establishment.

Sign in / Sign up

Export Citation Format

Share Document