Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the
last decade. it surrounded by much challenges that should be solved the improve establishment of such
networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc
Networks (MANETs). As this type of networks does not require any pre-exist hardware. As well as, every
node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the
network internal structure will be unpredictably changed frequently according to continuous activities
between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This
model puts the functionality of routing operation in crucial angle in the area of research under mobile adhoc
network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new
routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed
to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under
different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are
designed for mobile ad-hoc networks by describing their structures, operations, features and then
comparing their various characteristics.
Comparative Performance Evaluation of Ad-hoc on Demand Distance Vector Routin...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
3 a survey analysis on manet routing protocols and mobility models for variou...INFOGAIN PUBLICATION
Ad-hoc network is a collection of wireless mobile nodes which dynamically form a temporary network without the use of any existing network infrastructure. It may connect hundreds to thousands of mobile nodes. The primary goal of such an ad-hoc network is correct and efficient route establishment between a pair of nodes so that message can be delivered easily and in a timely manner. The main objective of this paper is to address different MANET routing protocols and different types of mobility models used in MANETs. This paper also put emphasis on the work done by various researches using routing protocols and mobility models. This paper would be great help for the people who are conducting research for the problems in MANETs.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
A MANET is an autonomous group of mobile users that communicate over reasonably slow
wireless links. The network topology may vary rapidly and unpredictably over time, because the nodes
are mobile. The network is decentralized, where all network activity, including discovering the topology
and delivering messages must be executed by the nodes themselves. Hence routing functionality will
have to be incorporated into the mobile nodes. MANET is a kind of wireless ad-hoc network and it is a
self-configuring network of mobile routers (and associated hosts) connected by wireless links – the union
of which forms an arbitrary topology. Such a network may operate in a standalone fashion, or may be
connected to the larger Internet Problems in Ad Hoc Networks.
Security Enhancement in AODV Routing Protocol for MANETsidescitation
Adhoc networks are a new wireless networking paradigm for mobile hosts.
Mobile Ad-hoc Networks (MANETs) are wireless networks with absence of infrastructure
centralized support. Routing in MANETs is challenging task due to mobility of nodes.
Several routing protocols have been developed for Mobile Ad-hoc Networks. This paper
describes concept of security enhancement in AODV routing protocol by detection and
tolerance of attacks using secure message transmission (SMT) protocol. Present AODV
routing protocol is not secure by malicious nodes. One main challenge in design of these
networks is their vulnerability to security attacks. In this paper we study how to make node
malicious and at same we will detect malicious node in AODV protocol using Network
Simulator-2(NS-2) tool.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Comparative Performance Evaluation of Ad-hoc on Demand Distance Vector Routin...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
3 a survey analysis on manet routing protocols and mobility models for variou...INFOGAIN PUBLICATION
Ad-hoc network is a collection of wireless mobile nodes which dynamically form a temporary network without the use of any existing network infrastructure. It may connect hundreds to thousands of mobile nodes. The primary goal of such an ad-hoc network is correct and efficient route establishment between a pair of nodes so that message can be delivered easily and in a timely manner. The main objective of this paper is to address different MANET routing protocols and different types of mobility models used in MANETs. This paper also put emphasis on the work done by various researches using routing protocols and mobility models. This paper would be great help for the people who are conducting research for the problems in MANETs.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
A MANET is an autonomous group of mobile users that communicate over reasonably slow
wireless links. The network topology may vary rapidly and unpredictably over time, because the nodes
are mobile. The network is decentralized, where all network activity, including discovering the topology
and delivering messages must be executed by the nodes themselves. Hence routing functionality will
have to be incorporated into the mobile nodes. MANET is a kind of wireless ad-hoc network and it is a
self-configuring network of mobile routers (and associated hosts) connected by wireless links – the union
of which forms an arbitrary topology. Such a network may operate in a standalone fashion, or may be
connected to the larger Internet Problems in Ad Hoc Networks.
Security Enhancement in AODV Routing Protocol for MANETsidescitation
Adhoc networks are a new wireless networking paradigm for mobile hosts.
Mobile Ad-hoc Networks (MANETs) are wireless networks with absence of infrastructure
centralized support. Routing in MANETs is challenging task due to mobility of nodes.
Several routing protocols have been developed for Mobile Ad-hoc Networks. This paper
describes concept of security enhancement in AODV routing protocol by detection and
tolerance of attacks using secure message transmission (SMT) protocol. Present AODV
routing protocol is not secure by malicious nodes. One main challenge in design of these
networks is their vulnerability to security attacks. In this paper we study how to make node
malicious and at same we will detect malicious node in AODV protocol using Network
Simulator-2(NS-2) tool.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node D...IJERA Editor
Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis work consist a systematic comparative evaluation of a new multipath routing protocol for MANETS. The new protocol, called Multipath Destination Sequenced Distance Vector (MDSDV) is based on the well known single path Destination Sequenced Distance Vector (DSDV) is compared with known protocol DSDV. This work containing evaluates the protocols on a range of MANETS with between 50, 75 and 100 nodes, which are static nodes. The protocol comparison metrics are Throughput and Residual Energy.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networksijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
Wireless networking has been an active research focus since the early days of the packet radio
network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent
developments in wireless devices have made laptop computers, personal digital assistants (PDA),
pagers, and cellular telephones portable. Now, users can carry these devices to any place at any
time. Hence, there is a need for a network that can be deployed at any place at any time without
any infrastructure support. In some cases, an infrastructure-based network is hard to build.
Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases,
infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados.
Hence, there is always a need for setting up a temporary network among a group of users without
any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks
(MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs
consist of a group of mobile nodes, which have limited battery and limited processing power.
MANETs are self-organizing and self-configuring networks and they can be deployed without any
infrastructure support. Numerous groundbreaking applications have been proposed based on
MANETs. These applications include disaster management, search and recovery, remote
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.12, No.2, April 2021
2
healthcare, tele-geoprocessing, education, traffic management, process control, and security [2].
These applications impose diversified design and performance constraints on the MANETs.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node D...IJERA Editor
Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis work consist a systematic comparative evaluation of a new multipath routing protocol for MANETS. The new protocol, called Multipath Destination Sequenced Distance Vector (MDSDV) is based on the well known single path Destination Sequenced Distance Vector (DSDV) is compared with known protocol DSDV. This work containing evaluates the protocols on a range of MANETS with between 50, 75 and 100 nodes, which are static nodes. The protocol comparison metrics are Throughput and Residual Energy.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networksijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
Wireless networking has been an active research focus since the early days of the packet radio
network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent
developments in wireless devices have made laptop computers, personal digital assistants (PDA),
pagers, and cellular telephones portable. Now, users can carry these devices to any place at any
time. Hence, there is a need for a network that can be deployed at any place at any time without
any infrastructure support. In some cases, an infrastructure-based network is hard to build.
Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases,
infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados.
Hence, there is always a need for setting up a temporary network among a group of users without
any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks
(MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs
consist of a group of mobile nodes, which have limited battery and limited processing power.
MANETs are self-organizing and self-configuring networks and they can be deployed without any
infrastructure support. Numerous groundbreaking applications have been proposed based on
MANETs. These applications include disaster management, search and recovery, remote
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.12, No.2, April 2021
2
healthcare, tele-geoprocessing, education, traffic management, process control, and security [2].
These applications impose diversified design and performance constraints on the MANETs.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Manet review characteristics, routing protocols, attacks and performance metricsIJARIIT
The term “mobile” is termed as moving and “ad hoc” is termed as a temporary network without any centralized
administration or permanent infrastructure. Because of the dynamic MANET topology, this review is mainly concentrated on
diverse routing techniques that are considered as the main challenges these days. A variety of strategies has been given for the
effective routing for providing the enhanced performance. Different routing protocols have been presented for MANET that
makes it’s hard to decide which protocol is appropriate for different network conditions. This paper gives an overview of MANET
with its applications and characteristics, its routing protocols, attacks and its performance parameters.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly, thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable and consistent connectivity between the mobile nodes. They conclude logically based on the interaction between mobile nodes in MANET routing and encourage them to choose the optimum path between source and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as the optimized variant of link state routing in which packets are sent throughout the network using the multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol under condition of changing mobility speed and network density. The study's performance indicators are average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2 (NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise redundant data transmission during the normal message broadcast. The MPRs enhance the link state protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired broadcasts can be reduced and limited. Further research will focus on different scenario and environment using different mobility model.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Mobile ad hoc networks (MANET) are characterized by multi-hop wireless links and
resource constrained nodes. One of the major challenges in mobile ad hoc networks (MANETs) is
link failures due to mobility. Because nodes in a MANET act as routers for any ongoing packet
communication and have limited transmission ranges, the communication links are broken, and
packet losses occur. To improve network lifetime, energy balance is an important concern in such
networks. This paper concentrates on routing techniques which is the most challenging issue due to
the dynamic topology of ad hoc networks. There are different strategies proposed for efficient
routing which claimed to provide improved performance. There are different routing protocols
proposed for MANETs which makes it quite difficult to determine which protocol is suitable for
different network conditions .This paper provides an overview of different routing protocols.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Similar to Comparative Review for Routing Protocols in Mobile Ad-Hoc Networks (20)
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Comparative Review for Routing Protocols in Mobile Ad-Hoc Networks
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
DOI : 10.5121/ijasuc.2016.7202 13
COMPARATIVE REVIEW FOR ROUTING
PROTOCOLS IN MOBILE AD-HOC NETWORKS
Hatem S. A. Hamatta, Nabeel I. Zanoon and Rasha M. Al-Tarawneh
Department of Applied Sciences, Al-Balqa’ Applied University, Aqaba, Jordan
ABSTRACT
Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the
last decade. it surrounded by much challenges that should be solved the improve establishment of such
networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc
Networks (MANETs). As this type of networks does not require any pre-exist hardware. As well as, every
node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the
network internal structure will be unpredictably changed frequently according to continuous activities
between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This
model puts the functionality of routing operation in crucial angle in the area of research under mobile ad-
hoc network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new
routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed
to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under
different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are
designed for mobile ad-hoc networks by describing their structures, operations, features and then
comparing their various characteristics.
KEYWORDS
MANET, Proactive Routing Protocols, Reactive Routing Protocols, Hybrid Routing Protocols
1. INTRODUCTION
During development cycle in the modern technologies, three types of wireless networks became
clear; Infra-structured networks, ad-hoc networks and combination of both. The first wireless
network is based on bridges known as base stations. Mobiles within these networks need to
connect and communicate with one base station which is the nearest to. Thus, according to
mobility metric in this kind of networks, each node leaves the range of the base station that it
communicates with should be covered with range of another base station. A hand-off process is
required between the old base station and new one. In this case the mobile node will be able to
keep its communication easily throughout the entire network. Such kind of networks is called
Wireless Local Area Networks (WLANs), which is suitable for use in controlled and identified
environments (i.e. Offices and universities etc.). In contrast to infra-structure network with base
stations which provide coverage for mobile nodes, an ad-hoc network neither have access to base
stations nor fixed routers and did not have any controlled environments. These networks can be
identified in any environment. Here every node moves unpredictably and dynamically without
any support from infra-structured network components that restrict network construction.
Therefore, the nodes operate as routers which discover and maintain routes to other nodes in the
network. Thus, the network can be constructed any time anywhere (i.e. emergency searches and
meetings etc.).
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
14
This paper reviews different types of routing protocols designed for ad-hoc networks. In the
beginning it describes the evolution of ad-hoc networks, and then describes the design goals and
the challenges for routing in this kind of network. On the other hand, section 3 describes the
operation of each protocol and its characteristics. While the later section shows general
comparisons between routing classifications; and finally, conclusion is included in the last
section of the article.
2. EVOLUTION OF AD-HOC NETWORK
At the beginning of the 70’s, Abramson with his fellow researchers at the University of Hawaii
invented ALOHAnet which was the first public demonstration of a wireless packet data network
[2]. It utilized single-hop wireless packet switching and multiple access solutions for sharing a
single channel. In addition to the need of fixed single-hop wireless network implementation in
ALOHAnet as originally it was, the basic idea was compelling and applicable to any environment
where access to available resources had to be negotiated among a set of uncoordinated nodes
[13], it started operation of providing public demonstration of wireless packet data network in
1971. Also, it triggered widespread interests in different directions of computer communication
according to its success and novelty.
In 1972, a new project had been developed; called Packet Radio Network (PRNet) to provide a
packet wireless network military application. PRNet was sponsored by the defense advanced
research project agency (DARPA) [13], and [9]. PRNET uses a combination of ALOHA with
Carrier Sense Multiple Access (CSMA) to access the shared radio channel. It was designated to
support self-organized, self-configured, and detect radio connectivity for the dynamic operation
of Routing Protocol without any support form fixed infrastructure which proved the feasibility
and efficiency of infrastructure-less network and their applications for civilian and military
purpose.
The Survivable Radio Network (SURAN) appeared in 1980 as an extended to the work on multi-
hop wireless networks to provide ad-hoc networking with small, low-cost, low-power devices
with efficient protocols and improved scalability and survivability [18].
Hence, Mobile Ad-Hoc Network can be defined as a set of multi-hop wireless mobile nodes,
which communicates with each other in the case of absence of established infrastructure or any
centralized administration. Thus, the main goal of MANET is to improve and extend the mobility
of nodes where these nodes must form the network routing infrastructure in ad-hoc environments.
The hotspot of MANETs applications is the need of rapid deployment and dynamic configuration,
reconfiguration with absent of infrastructure network components (i.e. military battlefields,
emergency search, rescue sites and class rooms).
3. AD-HOC MOBILE ROUTING SCHEMES
Since mobile nodes in MANETs are capable of communicating with each other without any
existing of networks infrastructure. These nodes are not bounded to any centralized control such
as base stations or mobile switching centers. For this reason, the communication sessions can be
achieved either through single-hop transmission in case the destination node placed within the
transmission range of the source node, or by multi-hop transmission if the packets must relaying
through intermediate nodes to reach the destination node in case it placed outside the range of
source node [1],[10] and [15]. In MANET, each node behaves not only as a host but also as a
router, to form the needed range to give the source node the ability to communicate with the
destination node without direct wireless transmission range between them. Thus, in this kind of
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
15
networks each node participates in an ad-hoc routing operation, setting up and maintaining
routing information which allows the form of multi-hop range to any other node through the
network. So, designing efficient routing protocol in such a network is a challenging problem
regarding to its unique characteristics, such as dynamic changing topology, cooperation between
nodes, lack of centralized management and monitoring facility, restricted power supply, and
scalability. This indicates no stable communication infrastructure [12]. For this reason, routing in
ad-hoc network has become a popular and interesting research topic.
Routing is the process of determining a good path thru the network from source node to some
arbitrary destination nodes. So, movements of mobile nodes in MANET cause the nodes to move
in and out the range from one another. Thus, there is a rapid establishment and breaking of links
in the network, forcing the stability of network topology to change dynamically with time. For
this reason, traditional routing protocols which are used in wired network cannot be applied
directly to wireless and ad-hoc network. Thus, several considerations design issues are defined by
the Internet Engineering Task Force (IETF) which is required in routing protocols to be used
under mobile ad-hoc network requirements listed as follow [11]:
• Distribution operation
• Demand-based operation
• Proactive operation
• Routing overhead
• Multi-hop routing capability
• Dynamic topology maintenance
• Self-starting and recovery
• Loop prevention
Since the network relies on multi-hop transmissions in its communications, new challenges are
derived to determine the multi-hop route over which data packets can be exchanged between
source and destination mobile nodes. The most important factor to measure the quality of routing
protocols in ad-hoc networks is identified by the ability of adapting the variations of network
topology dynamically. According to the initiation time for routing activities, routing protocols for
mobile ad-hoc network can be broadly classified into three basic categories: 1) proactive or table-
driven routing protocols, 2) reactive or on-demand routing protocols, and 3) hybrid routing
protocols which is combination of both proactive and reactive routing protocols. Figure 1 shows
main classifications and some representative examples of routing protocols classes that can be
used in mobile ad-hoc network.
Figure 1. Classification of Ad-Hoc Routing Protocols
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
16
3.1. Proactive Routing Protocols
It is also called Table-Driven routing protocols; it attempts to maintain consistent, up-to-date
routing information from each node to every other node in the network. Also, such protocols
require each node to maintain its routing table in which it keeps tables updated with the
acquisition of new information. Thus, table-driven proactive routing protocols respond to changes
and updates throughout the network in order to maintain a consistent network view. It has
advantages of providing lower latency in data delivery, whilst its main drawback is the wastage of
bandwidth in periodically sending update packets even when they are not necessary, such as when
there is no link failure, or only a few amounts of routes are required. Some proactive MANET
protocols include: DSDV [17], OLSR [6], and WRP [14] are described in the following
subsections, where some of their basic characteristics are shown in table 1.
Table 1. Basic Characteristics of Some Proactive Ad-Hoc Routing Protocols.
Parameter DSDV OLSR WRP
Route Selection Metric Link State Multipoint
Relay
Shortest Path
Routing Uniformity Uniform Uniform Uniform
Multiple Route No No No
Topology Structure Flat Flat Flat
Routing Update Time Hybrid Periodic Hybrid
Update Information Metric Distance Vector Link State Distance Vector
Beacon Yes Yes Yes
Loop Free Yes Yes Yes, but not
consistent
Critical Nodes No MPR No
No. of Tables 2 7 4
Control Overhead High Low High
3.1.1. Destination-Sequenced Distance Vector Routing Protocol (DSDV)
Destination-Sequence Distance Vector Routing Protocol is described by [17] as one of the most
important proactive routing protocols that had been developed earlier for mobile ad-hoc networks.
Few modifications were applied on the classical Bellman-Ford routing mechanism as specified by
RIP [8] to fulfil the needs of stable environment in mobile ad-hoc network. The improvements
made to the Bellman-Ford algorithm cover freedom from loops in routing tables. This was
implemented by adding a sequence number (originally generated by destination node) with each
distance vector entry to indicate the stability and freshness of that entry, thereby avoiding the
formation of routing loops.
According to the needs of stable network, routing table updates are periodically transmitted
throughout the network in order to give all nodes a consistent view of network layout; figure 2
shows the routing table for node N1 in ad-hoc environment. According to that, huge amount of
network traffic will appear. Two types of packets are defined to solve update problems; the first
type is known as a full dump packet, which is used infrequently to carry out all available routing
information. Whereas, the second one is smaller than full dump packet, it is called incremental
packet, which is used to relay only that information which has changed since last full dump.
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
17
Figure 2. Example of Routing Table in DSDV
The key point of DSDV is the way it handles those types of packets, to keep track of both stale
and fresh information that describes the network layout with minimal impact on the network
overhead. Thus, there are two routing tables kept at each node. One is used for forwarding packet,
while the other is advertised via incremental routing information packets. Accordingly, full dump
is responsibility of the first table while the responsibility of the second table is incremental
packet.
At each time new route broadcast occurs, the following information are included in broadcasted
packet; 1) the address of the destination, 2) number of hops to reach the destination, 3) the
destination sequence number, 4) unique broadcast sequence number[17]. The nodes always use
the rout labeled with the most recent sequence number. But, if there are two updates with the
same sequence number, the route with the smaller metric will be used because it implements the
shortest path to the destination. Also, the nodes keep track of the settling time of routes, or the
average time that routes to a destination will fluctuate before the route with the best metric is
received. DSDV manages the freshness of the routes by delaying the broadcast of a routing
update by the length of the settling time; nodes can reduce network traffic and optimize routes by
eliminating those broadcasts that would occur if a better route was discovered in the very near
future.
3.1.2. Optimized Link-State Routing Protocol (OLSR)
OLSR is a proactive table-driven routing protocol designated for mobile ad-hoc networks. It is an
optimized version of a conventional link-state routing algorithm in which every node maintains
its own information about the network. It is considered as a flat routing protocol, since it does not
require any central administration control to handle routing process. It differs from other routing
protocols according to its ability to minimize the number of required control messages.
Consequently, it gives the network a fresh network topology layout. The key point behind
improvements founded in OLSR is achieved by dividing the network into a set of groups each
with its specified roles. Groups cooperate with each other to determine the required optimization
implemented in OLSR. Thus, OLSR adapt this issue with respect to all possible overhead by
defining special group of nodes called Multipoint Relay (MPR), which includes the minimum
number of the symmetric “1-hop” neighbours from which it is possible to reach all the
symmetrical strict “2-hop” neighbours in order to calculate the optimal MPR set, as shown in
figure 3. Any node belongs to MPR set of node N must satisfy the following conditions:
• X X Neighbours set of node N.
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
18
• K in 2-hop neighbourhood of node N | K Neighbours set of node X, also must have a
bi-directional link to X.
• |MPR(N)| must be the minimal list of neighbours that cover the 2-hop neighbourhood of
node N with bi-directional links.
Figure 3. Multipoint Relays
The idea of MPR is to improve flooding process of broadcasts by reducing the number of nodes
that occupy the information exchange throughout the network. Many data structures are
introduced by OLSR; those must be adapted by each node in the network:
• Link Table.
• Neighbours Table.
• 2-Hop Neighbours Table.
• MPR Table.
• MPR Selector Table.
• Topology Table.
• Routing Table.
Thus, to perform OLSR operations with these various data structures the protocol also defined
two special packets structure; HELLO, and Topology Control (TC) messages. Hello message
generally serves three important independent tasks: (1) link sensing, (2) neighbour detection, and
(3) MPR selection signaling. Since these tasks are based on periodic information exchange within
a node neighbourhood and also it serves the common purpose of local topology discovery. Thus,
it affects all information that exists in link table, neighbours table, MPR table, and MPR selector
table. Link table can be accomplished through periodic of HELLO message and the table hold
information about the local links, while neighbours table can be deducted directly from
information exists in link table about the entire symmetric 1-hop neighbourhood to perform
neighbour detection. Thus, it is considered as a part of link sensing. On the other hand, MPRs of a
given node (say N) are declared according to subsequent HELLOs which transmitted from given
node, consequently, this information will reach the multipoint relays themselves. So, any node
can belong to MPR(N) if and only if:
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
19
• It belongs to symmetric 1-hop neighbours of N (is considered as neighbour of N).
• It enables node N to reach 2-hop neighbours.
• It has the willingness to be MPR.
Consequently, MPR(N) are also do the same process of broadcast HELLO message periodically
for its 1-hop neighbours, node N will consider that those nodes set themselves as MPR(N) and
accordingly, it will update its MPR SELECTOR table in which it puts the addresses of its 1-hop
neighbours nodes which has been selected as a multipoint relays along with the corresponding
MPR sequence number of that neighbour node. All previous data structures are defined in OLSR
to be the base infrastructure of transmission of TC. It is considered as the only way the node can
exchange its own links in the network through its MPR sets, the node must send at least link of its
MPR selector set. The sequence number associated with each MPR is also attached to the list.
The freshness of the messages is recognized using higher sequence number. Also, it is used to
avoid loops of the messages by discarding TC packets with same or smaller sequence number.
The advantage of TC is helping each node to build its own topology table and give stable view of
the network layout since the node continuously updates its topology table according to it.
The main difference detected between OLSR and other routing protocols is; its ability to give
each node the required infrastructure and needed data structure to maintain its routing table
locally, which gives the ability to route the packets towards other destinations in the network. The
information available in neighbours and topology tables are the base of routing table in OLSR,
each node re-calculates its routing table if any changes occur in any of link table, neighbours
table, 2-hop neighbours table, or topology table. It maintains its routing information accordingly
with respect to finding the shortest path for all routes that will be inserted in routing table.
Although, routing table re-calculation required a lot of information about the network. In OLSR it
does not trigger any packet to be transmitted neither in the entire network, nor in the 1-hop
neighbourhood. Accordingly, it is clear that OLSR protocol is well suited to work on a dense
network where most of the communication is concentrated between large numbers of nodes.
3.1.3. Wireless Routing Protocol (WRP)
Another type of proactive (table-driven) distance vector routing protocols is WRP that is used in
multi-hop packet-radio network. It follows the shortest-path routing techniques. Typically, it is
based on Distributed Bellman-Ford algorithm (DBF) [8]. In this protocol, all routing nodes know
the length of the shortest path through its neighbours to every destination node in the network. It
proposed a Path-Finding-Algorithm (PFA), to deal with temporary looping situation. Also, the
protocol limits routing table updates to include only that entries affected by network changes.
The main updating function in WRP is performed only between neighbourhoods. It is designed to
run on the top of the medium access control protocol of a wireless network. Also, it ensures
reliable transmission of update messages as it adapts the mean of re-transmissions. This can be
achieved by sending a positive acknowledgment (ACK) after receiving an updating message free
of errors. This ACK can be considered as an assertion to neighbourhood between nodes. The
protocol maintains three tables and one list. First table is a distance table which implements
required information toward all destinations in the network, the number of hops is considered as a
distance to a particular destination, next hop to reach destination must be specified within each
entry. Second table, the routing table gives full specification vector for each known destination in
the network as shown in figure 4. This specification is (Destination Identifier, Distance to the
Destination, Shortest Path, and specified Tag which identifies the status of that entry if it
corresponds to simple path or loop). Third table is link cost table. It gives the cost of relaying
information through neighbours. Also, status of links with neighbours is attached. At the end, the
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
20
message re-transmission list (MRL) specifies re-transmission entries. It gives each node the
ability to know which updates have to be re-transmission.
Figure 4. Routing Table in WRP
WRP operates smoothly in information exchange among nodes. This means, it permits
propagation only between neighbours. Accordingly, the first update should ask all neighbours to
send an ACK. Consequently, when there is no updates, null update message called HELLO
message will be sent to the neighbours, where the time interval between two successive messages
is “HELLO Interval”. Each node in the network can decide to update its routing table after a new
update has been received from its neighbours or any changes in the link status with its neighbours
received. Accordingly, in case of receiving updates, they are processed in order. After that, the
node should generate a new update message toward its neighbours.
3.1.4. Summary of Proactive (Table-Driven) Routing Protocols
Updating procedure in MANETs consumes significant amount of network bandwidth in most of
table-driven routing protocols. Accordingly, global routing does not scale very well [1]. The
reason is, each node should update its routing information for all nodes belong to the same
network. This process should be repeated periodically to keep track to the last network topology
layout. Thus, the attractive difference between these protocols is the way they handle the view of
network topology. Thus, table 2 maintains the main advantages and disadvantages for the
examined proactive routing protocols.
Table 2. Basic Characteristics of Some Proactive Ad-Hoc Routing Protocols
Protocol Advantages Disadvantages
DSDV (1) Loop free.
(2) Simple computationally efficient.
(1) Excessive communication overhead.
(2) Slow convergence.
(3) Tendency to create routing loops in
large networks overhead.
OLSR (1) Reduce size of update message
and number of transmissions than
a Pure link state routing protocol
(1) It requires information of both 1- hop
and 2- hop neighbors
WRP (1) Loop free.
(2) Lower worst case time complexity than
DSDV.
(1) Prevent sleep mode.
(2) A large amount of memory and
periodic hello message consumes power
and bandwidth.
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
21
3.2. Reactive Routing Protocols
Reactive routing protocols are designed to minimize routing overhead. It is also called, source-
initiated on-demand routing. Instead of tracking all changes in the network topology to determine
the shortest path to all destinations, on-demand protocols trigger this process only when
necessary. Mainly, these protocols perform two operations. First, ROUTING DISCOVERY which
is triggered when a node requires route to particular destination. Routing discovery process is
performed by source node (source-initiated). Second, ROUTING MAINTENENACE; Once a route
is established, it is maintained by routing maintenance until either the destination becomes
inaccessible along every path from the source or until the needs for route is finished.
The main advantage of on-demand nature operations is that it usually has lower average of
routing overhead if it is compared with proactive routing protocols. Due to that, reactive routing
protocols receive more attention than proactive routing protocols. Since they are more stable for
dynamic environments in MANET. Various parameters were used for reactive routing protocol
improvement to come up with the proactive technique circumstances shown in table 3.
Accordingly, these reactive on-demand protocols include: DSR [7], AODV [16], and ABR [19]
which described in the following subsections.
Table 3. Basic Characteristics of Some Reactive Ad-Hoc Routing Protocols
Parameter DSR AODV ABR
Route Selection Metric Shortest Path
Updated Path
Shortest Path
Updated Path
Signal Strength or
Associativity And
Shortest Path
Routing Uniformity Uniform Uniform Uniform
Multiple Route Yes No Yes
Topology Structure Flat Flat Flat
Routing Update Time Event Driven Event Driven Event Driven
/Periodically
Update Information
Metric
Route Error Route Error Route Error
Beacon Yes No Yes
Loop Free Yes Yes Yes
Critical Nodes No No No
Route Reconfiguration Erase Route
and Inform
Source
Erase Route and
Inform Source
Alternate Route or
Localized
Broadcast Query
Until Find A Route
Control Overhead Low Low Low
3.2.1. Dynamic Source Routing Protocol (DSR)
The Dynamic Source Routing protocol is one of reactive on demand routing protocols that is
based on distance vector technique. This protocol adopts the concept of source routing and
derived routing techniques in which the sender explicitly lists the complete sequence of nodes
required to reach destination in the packets header. This concept identifies each forwarding
“hop” using the address of the next node to which the transmitted packet will be advanced on its
way until it reaches its destination. DSR is explicitly initiated for wireless environments of an ad-
hoc network. It dynamically determines the routes needed to reach destination. Thereby, there is
no periodic advertisement in the protocol while it reduces the network overhead.
The basic operation of DSR protocol starts at sender node as it constructs a source routing in
packet’s header. After that, the sender transmits the packet to the first hop listed in the source
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
22
route of the received REPLY packets. The first hop node check whether it is the final destination
of the packet’s or not, and it simply transmits the packet to the next hop listed in the source route
in the packet’s header until the packet reaches its final destination.
To allow all nodes to participate in the ad-hoc routing, each one maintains its source routes in its
route cache. Accordingly, for any node willing to send a packet to another node, it first checks its
route cache for a source route to the destination. In case route is found, the sender uses it to
propagate the packet directly to the destination. These routes are discovered on demand using
process called Route Discovery as shown in figure 5.
Figure 5. Route Discovery in DSR
In route discovery operation, Route Request Packet is initiated for seeking a route to specified
destination. This packet contains information about the source and destination. According to that,
any node that receives a Route Request Packet first checks its route cache for any available
information about its listed destinations as shown in figure 5. Subsequently, the node adds its
identity to the header of Route Request Packet and then broadcasts it. When information is
available or Route Request Packet reach destination a Route Reply Packet will be sent back to the
source in reverse direction as illustrated in figure 6. This is simply done by copying the sequence
of nodes identities collected from Route Request Packet.
Figure 6. Route Reply Propagation in DSR
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
23
The Route Reply Packet contains the entire route to the destination which is recorded in the route
cache of the source node. On the case of link failure, the node that had detected the route break
sends ERROR Packet back to the source. In this case, all nodes in this sub-path including the
source will delete all existing information about this route from their route cache and a fresh route
discovery process will be initiated if a route is still needed.
3.2.2. Ad-Hoc On-demand Distance Vector Routing Protocol (AODV)
This protocol is considered as an improvement of the Destination-Sequenced Distance Vector
(DSDV). Unlike DSDV, AODV minimizes the number of required broadcasts as it creates and
maintains routes only when they are needed. Thus, it limits the time used for route acquisition.
The protocol uses traditional routing tables and only one entry per each destination. Also, it
utilizes sequence number to examine the freshness of the stored routes in routing table. Also, it
ensures loops free routing. Thus, each routing table entry is “expired” after a certain
predetermined threshold of time.
In contrast to DSR, AODV uses a different mechanism to create routes, when a source node
desires to send a message to another node whereas it does not already have a valid route to that
destination, it applies a path discovery operation to find out fresh valid path to that destination.
Accordingly, it broadcasts a route request packet to its neighbours, all nodes presented (between
source and destination) are occupied as intermediate nodes. Route Discovery operation is
completed either by any intermediate node which has a fresh enough valid route to the requested
destination or by the destination itself.
The path freshness is determined by the destination sequence number, which is compared with
available information in an intermediate node for a requested path. At this moment, if the
intermediate node does not have any information about that destination or it has entry for that
destination in its routing table with destination sequence number less than the one in route request
packet, it proceeds forwarding routing request to its neighbours until it reaches any node which
has valid route for that destination or it reaches destination itself. Route Discovery can be
finalized only by destination or intermediate node if its recorded entry sequence number is greater
than the one in Route Request. Consequently, it establishes unicast Route Reply Packet backward
along the reversed path from which it first receives the Route Request. Accordingly, every node
belongs to this path sets up its forwarding route entries in their routing tables which refer to the
node from which Route Reply came as shown in figure 7 and figure 8 respectively. Thus, valid
path will be achieved for forwarding process.
Figure 7. Route Request in AODV
12. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
24
Figure 8. Route Reply in AODV
Another operation is very important in AODV. That is, Routing Maintenance Operation, it
provides route recovery in case of path breaks due to link failure or node movements as shown in
figure 9. This failure cannot be handled locally. So, a special unsolicited route reply will be sent
to source node that initiates this broken path with fresh sequence number and hop count is set to
∞ [16]. This packet instantiated by those nodes where its next hop become unreachable, the
special route reply packet notifies all nodes in the path about the link breaks. Consequently, all of
these nodes reply that packet to their active neighbours and so on. At the time of reaching the
packet to the source, it can restart route discovery in case it still requires a path to that destination.
Figure 9. Routing Maintenance in AODV
3.2.3. Associativity-Based Routing Protocol (ABR)
ABR is one of reactive source-initiated routing protocols that employ an associativity-based
routing scheme where a route is selected according to the period of stability [19]. This interval of
time will be the metric which helps the destination to choose one from the available routes as the
best route for specific connection. The metric was defined on the basis of the movement time of
particular node as an unstable period. This process can be defined using associativity “ticks”
which is defined by Route Selection Rule. According to this rule, three different cases were
specified to gain with the best route:
• Case 1: choose the highest associativity “ticks” route.
13. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
25
• Case 2: if some routes have same highest associativity “ticks”, then the one with the
minimum hop-count will be chosen.
• Case 3: if some routes have same highest associativity “ticks” and same minimum hop-
count then any one of these routes will be arbitrary selected.
The route selection metric is executed as a consequence to first phase of ABR routing protocol.
Accordingly, two other phases are required to completely identify ABR routing protocol. These
phases are:
Route Discovery Phase:
It is considered as the first executed phase of ABR routing protocol. It computes the
approximation of the data throughput associated with any selected route. This operation depends
on the availability of knowledge about associative “ticks” for neighbours in the route. Also, the
relaying load of nodes supporting route should be known.
This phase initially, assumes there is no information about the designated Destination in all nodes
in the network except destination’s neighbours. In case any node needs a route to the Destination,
it broadcasts a special message called Broadcast Query (BQ) message. The BQ message will be
flooded throughout the entire network until it reaches any node that has a valid route to the
destination. To reduce the network overhead BQ message attached with a uniquely identified
sequence number where the amount of time BQ message transmitting should not exceed once.
Consequently, all intermediate nodes examine the uniqueness of the BQ message whether it
accessed before or not. According to that, if the node is not the destination, the node will append
its address in BQ message and pass it to its neighbours. Information like relaying load,
propagation delay of the link and the hop-count will be appended in BQ message for all
intermediate nodes between source and destination.
At the Destination side, ABR Route Selection Algorithm will be executed at an appropriate time
after receiving the first BQ message to select the best route from all possible known routes.
Accordingly, the Destination sends a REPLY packet through the selection route. All intermediate
nodes listed in reply packet update their routing information as a valid route. Otherwise the node
will not be able to forward any packet to that destination even if it hears the transmission. In this
case, no duplicate packets will reach destination.
Eventually, the source will send another BQ packet in case it never receives REPLY from
destination after predefined BQ-timeout. Accordingly, all intermediate nodes will consider the
new BQ packet according to its unique sequence number of the same destination.
Route Re-Construction Phase:
This phase is considered as a route maintenance phase. It performs a set of operations
implemented in ABR routing protocol, which are:
• Partial Route Discovery.
• Invalid Route Erasure.
• Valid Route Update.
• New Route Discovery.
14. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
26
In this protocol, the chosen route is more likely the one with long-lived that based on the property
of associativity. Accordingly, any unexpected moves should be recorded. The protocol will try to
locate alternative valid route quickly without re-broadcasting query message, unless necessary.
Route Deletion Phase:
It is counted as the last step in ABR routing protocol as it starts when a particular route is no
longer needed. To do this, the source initiates a route delete broadcast; accordingly, all
intermediate nodes update their routing entries.
3.2.4. Summary of Reactive (on-Demand) Routing Protocols
As on-demand routing protocol designed to minimize the high overheads of maintaining routing
information in proactive routing protocols, it applies routing discovery only for active and
required routes. Thus, the node can predict its connectivity to other nodes only on demand to
those nodes. As in proactive, all nodes participating on finding path when source requests that
path for designated destination. Reactive routing reduces the impact of network topology
consistency, since this is not required. This was the core idea of reactive routing technique. But,
latency time will be increase according to the route discovery process which increases the time
for delivering data to the destination. List of advantages and disadvantages of examined reactive
on demand routing protocol as shown in table 4.
Table 4. Basic Characteristics of Some Proactive Ad-Hoc Routing Protocols
Protocol Advantages Disadvantages
DSR (1) Multiple route
(2) Promiscuous overhearing
(3) No periodic hello message and fast
recover
(1) Scalability problems due to the
nature of source routing
(2) Large delay and large networks
overhead
AODV (1) Adaptable to highly dynamic topologies
(2)Uses bandwidth efficiently
(3)Loop free
(1) Scalability problems
(2) Large delay
ABR (1) Route stability
(2)Avoid packet duplicates
(3) No route reconstruction
(1) Operation complexity
(2) Communication complexity
(3) Scalability problems
3.3. Hybrid Routing Protocols
New generation of Routing protocols are generated to be adapted in mobile ad-hoc networks.
These protocols are come up with better balance between adaptability for various network
circumstances, conditions, and routing overhead. These protocols adapt the nature of reactive and
proactive routing techniques, where each will be applied under different conditions and regions. It
increases network scalability, since this improvement is achieved by taking the benefits of
dividing the network into zones or clusters and applying proactive routing concepts within each
zone or cluster, where reactive routing techniques are applied across different zones or clusters.
Thus, it takes the advantages of both pro- and re- active routing techniques to formulate new
routing protocol with better performance paradigm. Some of hybrid routing protocols are
described in the following subsection such as Zone Routing Protocol [5] and Landmark Ad-Hoc
Routing Protocol [3] and [4]. Also, a list of protocols parameters is shown in table 5.
15. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
27
Table 5. Basic Characteristics of Some Hybrid Ad-hoc Routing Protocols
Parameter ZRP LANMAR
Route Selection Metric Shortest Path Shortest Path or
Quite Close to Shortest
Path
Routing Uniformity Nonuniform Nonuniform
Multiple Route No Yes
Topology Structure Hierarchical Hierarchical
Routing Update Time Hybrid Hybrid
Update Information Metric Hybrid Hybrid
Beacon Yes Yes
Loop Free Yes Yes
Critical Nodes No Landmark
Control Overhead Medium Medium
3.3.1. Zone Routing Protocol (ZRP)
Due to the scalability required for mobile ad-hoc network, Zone Routing Protocol (ZRP) was the
first hybrid routing protocol which reduces the control overhead by applying proactive routing
protocols and decreases the latency that appears from routing discovery in reactive routing
protocols. So, it applies both proactive and reactive ad-hoc routing components.
ZRP was first introduced by Hass in 1997[5]; the key value of this protocol is the ability to divide
all networks members into a set of groups called zones. Each zone limited each node with k-hops
to reach the zone boundaries. To deploy this concept, ZRP found two types of protocols. First,
IntrA-zone Routing Protocol (IARP), it allows all nodes to update and maintain their routing
tables to contain consistent routes for all other nodes within the same zone. IARP was constructed
under the basis of proactive routing techniques. On the other hand, ZRP built IntEr-zone Routing
Protocol (IERP) according to reactive routing concepts to be used between routing zones.
Accordingly, for any required route regarding a specified destination located in local zone, source
can establish its route from its routing table that cached pro-actively by IARP. Then, the packet
can be delivered immediately since both source and destination belong to the same zone. But for
other routes beyond local zone, the source broadcasts a route request to those nodes located at the
zone border which are called peripheral nodes to communicate with other zone. Accordingly,
these peripherals check its local zone whether the requested node is a member of their local zone
or not. Consequently, peripherals will forward the request packet to the destination boarder nodes,
which will send a route reply on the reverse path back to the source with the full path from source
to the required destination. The total overhead of flooding such as path discovery is minimized
since it is based on a corporation between peripherals only.
3.3.2. Landmark Ad-Hoc Routing Protocol (LANMAR)
This protocol implements the adaptation of fixed wide area network. According to landmark
paradigm, the protocol does not require any predefined hierarchal addressing scheme; moreover,
it extracts the basis of landmark and modifies it to be applicable for ad-hoc environment. It adapts
the concept of landmark that handles group mobility. This scheme solves both mobility and
scalability problem. Also, the protocol uses routing scheme that implements some modification
on FSR. Since FSR allows each node to have information about the entire network. While
LANMAR gives the ability to keep information only about the nodes within the scope of
landmark nodes, where these landmarks are elected dynamically.
LANMAR maintains routing information within the group according to proactive link state
routing protocols. Also, a distance vector algorithm is used to maintain routing information
16. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
28
amongst all landmarks. So, every node has a full view about topology of its group where
distances of routing vector information to all landmarks are known.
Accordingly, nodes are willing to send a packet for specified destination placed within the same
group, the packet will deliver immediately to that destination, since the routing operation based
on the accurate routing information available in sender routing tables. Otherwise, the node will
pass the packet towards the landmark that corresponds to the destination group, where it may
route the packet to the destination directly.
The main advantage of LANMAR protocol is the ability to reduce the overall control overhead
through the trimming process of local routing tables. On the other hand, the overhead is totally
minimized by the concepts of summarizing routing information to remote groups of nodes.
3.4. Proactive vs. Reactive vs. Hybrid Routing
The trade-offs between ad-hoc routing strategies are quite complex. Table 6 shows different
parameters that can be taken into account while classifying ad-hoc routing protocols as mentioned
in figure 1. Accordingly, to identify which approach is better depends on many factors, such as
the size of the network, the mobility, the data traffic and so on. Most of proactive protocols
attempt to maintain routes to all possible destinations, whether they are needed or not. Thus, it is
continuously propagates and maintains routing information.
In contrast, reactive protocols initiate route discovery on the demand of data traffic. The only
routes required to those desired destinations. This routing approach can reduce routing overhead
when a network is almost static and the active traffic is not heavy. However, the source node has
to wait for routing discovery process to discover valid fresh route to the designated destination,
accordingly, increasing the response time.
The hybrid routing approach can adjust its routing strategies that adapt both proactive and
reactive techniques according to a network’s characteristics and thus provides an attractive
method for routing in MANETs. However, a network’s characteristics, such as the mobility
pattern and the traffic pattern, can be expected to be dynamic.
Table 6. Main Classification of Ad-Hoc Routing Protocol
Parameter Proactive Reactive Hybrid
Network Architecture Flat/Hierarchical Flat Flat/Hierarchal
Topology Distribution Periodical When needed Both
Distribution Type Flooding Only from Src to Dest Both
Route Availability Instantaneously On-demand Based on destination
location
Route Latency Comprehensive Available on demand Both
Communication
Overhead
High Low Medium
Amount of Local
Information
Large Low Based on the node role
and cluster size
4. CONCLUSION
According to the characteristics of mobile ad-hoc networks, set of circumstances should be taken
into account when mobile ad-hoc network is required. These networks are based on specific needs
which specify their requirements. Network size, structure, movement speed, availability of
resources and much more, specify the network requirements and also, the type of ad-hoc that will
17. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
29
be built. Thus, the protocol uses play significant role and has high impact on the network
operations. Since it adjusts the overall networking operations under these circumstances.
Accordingly, this paper examines main categories of routing protocols Pro-active, Re-active, and
Hybrid routing protocols (Figure 1) that can be applied on MANETs. According to performance
metric and those circumstances, implementing such kind of protocols is not easy but it should be
simple as much as possible.
Since, all categories focus on the concept of reducing the control overheads. Reactive on-demand
protocols perform more efficiently than proactive table-driven protocols since it is not required to
have a consistent view of the network according to its rapid changes, while keeping this view
without any need will exhaust network bandwidth as well as network resources. So it is
beneficially to reduce control overhead by applying reactive routing techniques. But, according to
scalability issues, the reactive protocols do not work well. This opens the door for applying
hybrid routing protocols which is compromising between proactive and reactive techniques. This
category is suitable for large network where it takes its advantages from its ability to apply
hierarchal structure for ad-hoc environment. It simplifies routing management by taking kind of
adjustment between reactive and proactive routing techniques.
REFERENCES
[1] Abolhasan, M., T. Wysocki, and E. Dutkiewicz (2004). A review of routing protocols for mobile ad
hoc networks. Ad Hoc Networks 2 (1), 1 - 22. DOI : "10.1016/S1570-8705(03)00043-X".
[2] Abramson, N. (1970). The aloha system: another alternative for computer communications. In
Proceedings of the November 17-19, 1970, fall joint computer conference, AFIPS '70 (Fall), New
York, NY, USA, pp. 281-285. ACM. DOI : “10.1145/1478462.1478502”.
[3] Gerla, M., X. Hong, and G. Pei (2000). Landmark routing for large ad hoc wire-less networks. In
Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE, Volume 3, pp. 1702-1706
vol.3. DOI:”10.1109/GLOCOM.2000.891927”.
[4] Guangyu, P., M. Geria, and X. Hong (2000). Lanmar: landmark routing for large scale wireless ad
hoc networks with group mobility. In Mobile and Ad Hoc Networking and Computing, 2000.
MobiHOC. 2000 First Annual Work-shop on, pp. 11-18. DOI:”10.1109/MOBHOC.2000.869208”.
[5] Hass, Z. (1997). A new routing protocol for the reconfigurable wireless networks. In Universal
Personal Communications Record, 1997. Conference Record., 1997 IEEE 6th International
Conference on, Volume 2, pp. 562-566 vol.2. DOI:”10.1109/ICUPC.1997.627227”.
[6] Jacquet, P., P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot (2001). Optimized
link state routing protocol for ad hoc networks. In Multi Topic Conference, 2001. IEEE INMIC 2001.
Technology for the 21st Century. Proceedings. IEEE International, pp. 62-68. DOI:”10.1109/ INMIC.
2001.995315”.
[7] Johnson, D. B. and D. A. Maltz (1996). Dynamic source routing in ad hoc wireless networks. In
Mobile Computing, pp. 153-181. Kluwer Academic Pub-lishers. DOI:”10.1007/978-0-585-29603-
6_5”.
[8] Jr., L. R. Ford. and D. R. Fulkerson (1962). Flows in Networks. Princeton University Press. ISBN:
9780691146676
[9] Jubin, J. and J. Tornow (1987). The darpa packet radio network protocols. Proceedings of the IEEE
75 (1), 21-32. DOI:”10.1109/PROC.1987.13702”.
18. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
30
[10] Latiff , L. and N. Fisal (2003). Routing protocols in wireless mobile ad hoc network - a review. In
Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on, Volume 2, pp. 600-604
Vol.2. DOI: ”10.1109/APCC.2003.1274428”.
[11] Macker, J. P. and M. S. Corson (1998, January). Mobile ad hoc networking and the ietf. SIGMOBILE
Mob. Comput. Commun. Rev. 2 (1), 9-14. DOI: “10.1145/584007.584015.
[12] Mohapatra, P. and S. V. Krishnamurthy (2005). Ad Hoc Networks Technologies and Protocols.
United States of America: Springer US. ISBN: 978-0-387-22689-7.
[13] Murthy, C. S. R. and B. Manoj (2004). Ad Hoc Wireless Networks: Architectures and Protocols.
Upper Saddle River, NJ, USA: Prentice Hall PTR. ISBN: 013147023X.
[14] Murthy, S. and J. J. Garcia-Luna-Aceves (1996, October). An efficient routing protocol for wireless
networks. Mob. Netw. Appl. 1 (2), 183-197. DOI : ”10.1007/BF01193336”.
[15] Perkins, C. (2006). Ad hoc networking in the ietf. In Broadband Convergence Networks, 2006. BcN
2006. The 1st International Workshop on, pp. 1-35. DOI: “10.1109/BCN.2006.1662294”.
[16] Perkins, C. and E. Royer (1999). Ad-hoc on-demand distance vector routing. In Mobile Computing
Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on, pp. 90-100.
DOI: “10.1109/MCSA.1999.749281”.
[17] Perkins, C. E. and P. Bhagwat (1994). Highly dynamic destination-sequenced distance-vector routing
(dsdv) for mobile computers. pp. 234-244.
[18] Szkutak, P. M. (1985). Design of a survivable packet radio network control algorithm. In Military
Communications Conference, 1985. MILCOM 1985. IEEE, Volume 3, pp. 713-717. DOI:
“10.1109/MILCOM.1985.4795130:.
[19] Toh, C.-K. (1996). A novel distributed routing protocol to support ad-hoc mobile computing. In
Computers and Communications, 1996., Conference Proceedings of the 1996 IEEE Fifteenth Annual
International Phoenix Conference on, pp. 480-486. DOI: “10.1109/PCCC.1996.493675”.
AUTHOR
Dr. Hatem S. A. Hamatta received his B.Sc. degree in Computer Science from Yarmouk
University, Irbid, Jordan, in 2003, the M.Sc. degree in Computer Science from University of
Jordan, Amman, Jordan, in 2006. He is currently pursuing his research work of PhD Degree
in Wireless Network Security from Aligarh Muslim University, Aligarh, India. Since 2006,
he has been with the faculty of the Department of Applied Sciences at Al-Balqa` Applied
University/Aqaba University College, Aqaba, Jordan; where he is currently Assistant
Professor and Dean Assistant for Development and Quality Assurance. His research interests include
Wireless Network Security, Mobile Ad Hoc Networks and its routing issues, Intrusion Detection Systems
and Security Design Issues. He is also a member of ACM GOLD Affinity Group, Professional
Communication and Computer Society. Also, he is member of ACM and international Association of
Engineers.
Dr. Nabeel Mohammed Zanoon, He received his PhD in Computer System Engineering,
from South-West State University, Kursk, Russia, in 2011. He is faculty member with a Al-
Balqa’ Applied University since 2011; where he is currently Assistant Professor and Head
of Applied Sciences Department. Also, He is Director of the Computer Center and Cisco
Academy with Aqaba University College. He has published several researches in several
area, security of E-Banking, algorithm scheduling in Grid and Cloud, Meta-Grammar,
Hardware and Architectural Computer, Fiber Optical and Mobile Ad Hoc Networks.
19. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.2, April 2016
31
Rasha M. Al-Tarawneh received her B.Sc. and M.Sc. degree in Computer Science from
Al-Balqa` Applied University, Salt, Jordan, in 2008 and 2011 respectively. Since 2011, she
has been with the faculty of the Department of Applied Sciences at Al-Balqa` Applied
University/Aqaba University College, Aqaba, Jordan; where she is currently a full time
Lecturer.