This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
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.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
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.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
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.
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 comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
ENERGY AND PERFORMANCE EVALUATION OF REACTIVE, PROACTIVE, AND HYBRID ROUTING ...ijwmn
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics
such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other
metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio
between the consumed energy and the throughput; and the e-PDR which is the ratio between the
consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in
Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different
mobility models. Simulations are conducted using NS3 and the parameters of a real network interface
card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR
provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive
mode of HWMP is more energy efficient than the reactive mode.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
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.
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 comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
ENERGY AND PERFORMANCE EVALUATION OF REACTIVE, PROACTIVE, AND HYBRID ROUTING ...ijwmn
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics
such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other
metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio
between the consumed energy and the throughput; and the e-PDR which is the ratio between the
consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in
Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different
mobility models. Simulations are conducted using NS3 and the parameters of a real network interface
card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR
provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive
mode of HWMP is more energy efficient than the reactive mode.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Experiment of Routing Protocol AODV (AdHoc On-demand Distance Vector)IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Performance Improvement of Multiple Connections in AODV with the Concern of N...pijans
Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central
coordination. In MANET, node mobility and dynamic topology play an important role in the performance.
MANET provide a solution for network connection at anywhere and at any time. The major features of
MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET
due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for
routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in
the network. Several issues have been identified. The bandwidth is recognized as the prominent factor
reducing the performance of the network. This paper gives an improvement of normal AODV for
simultaneous multiple connections under the consideration of bandwidth of node.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
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.
Analysis of Blackhole Attack in AODV and DSR IJECEIAES
Mobile Ad-Hoc Networks (MANETs) are supreme ruler and demoralization wireless scheme. MANETs are infrastructure less i.e. their structure is not fixed, and the nodes be able to move about and can leave the network whenever they want. The nodes are to perform as more over router and host. In MANETs, the node can be in contact with every node as their configuration is not fixed and the nodes starts transmitting the packets to each other for the establishment of the connection. To hitch the link, the nodes make use of some routing protocols like Ad-Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DestinationSequenced Distance Vector (DSDV). Security in MANET is the key matter meant for the fundamental utility of network. There are many attacks caused in MANET. Blackhole attack is one that occurs in MANET. A Black hole attack is an attack where the node, which is malicious advertise itself as having the optimal route to the destination and drops all the packets instead of forwarding further t o the destination. Here, we have shown the blackhole attack in AODV and DSR. Through simulation we evaluate the performance of the two above protocols under blackhole attack.
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.
Similar to PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET (20)
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
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.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
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.
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.
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/
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
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
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
UiPath Test Automation using UiPath Test Suite series, part 4
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANET
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
DOI : 10.5121/ijasuc.2013.4403 27
PERFORMANCE EVALUATION ON EXTENDED
ROUTING PROTOCOL OF AODV IN MANET
Debraj Modak1
and Dipankar Saha2
1
Department of Electronics and Communication Engineering,
Abacus Institute of Engineering and Management, Mogra, Hooghly.
ddebraj.hetc@gmail.com
2
Department of Electronics and Communication Engineering,
Global Institute of Management and Technology, Krishnanagar, Nadia.
dipankar.hetc@gmail.com
ABSTRACT
A Mobile Ad-hoc Network is a collection of mobile nodes that form a wireless network and the mobile
nodes dynamically communicate to other nodes without the use of any preplanned infrastructure. Each
node can acts as a router and forwards data packets to every other nodes in the network. Topology of the
network changes very frequently due to mobility of the nodes. AODV(Ad-hoc on demand distance vector
routing protocol) has been extensively used protocol in MANET. But AODV and other on demand routing
protocol use single route reply. An extension version of AODV called RAODV (Reverse AODV) [11] tries
multiple route replies and enhances the network performances like packet delivery ratio. Another extended
version of AODV namely MAODV allows each node in the network to send out multicast data packets
rather than sending unicast traffic. An evaluation of these two protocols has been carried out by using NS-
2.34.The comparisons of these protocols has been studied using some performance metrics like end to end
delay, overhead by varying number of nodes which has not been done.
KEYWORDS
Manet, Raodv, Maodv, Routing Protocol, MACT massage, GRPH massage
1. INTRODUCTION
Mobile ad hoc network (MANET) plays an important role in the communication networks now-a-
days and for coming advancement. The important role is the fact that as the distances among the
nodes in an ad hoc network become very less, the network easily access information from space
that provides capacity per Joule of energy. Recent research advances in low power, low cost and
low rate wireless communications endure a promising future for the deployment of sensor
networks to support a broad range of applications like health monitoring, habitat monitoring,
target tracking and disaster management [1, 2, 3].
Mobile ad hoc networks consist of nodes that can communicate through the use of wireless links
and do not form any static topologies. The fundamental features of these networks is that it does
not possess any infrastructure and dedicated nodes which are present in the fixed kind of
networks and provide network connectivity operations. For maintaining connectivity in a mobile
ad hoc network all mobile nodes in the network go through routing operation of network traffic.
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
28
The communication among the nodes cannot be imposed by a centralized administration system.
Thus, for such self-deployed a protocol of physical or network layer must be come in the frame
that enforce connectivity requirements in order to guarantee the unstoppable operation of the
higher layer protocols.
Mobile ad hoc networks (MANET) composed of set of mobile nodes which communicate with
each other wirelessly and do not need any preinfrastructure. The mobile ad-hoc network topology
changes very frequently since the nodes are capable to move and we need to cope with problems
raised through this type of networks. If the source and destination nodes are not within the
transmission range of each other, then intermediate nodes would be served as intermediate routers
for the communication between the two nodes. Moreover, if the communication between mobile
nodes does not occur mutually, it can use other neighboring nodes to achieve communication and
communicates through frequently changing network [4, 5].
The main contribution of this paper is that we have made a substantial effort to study the
performance of two AODV family of routing protocols, namely MAODV, and RAODV for a
Mobile Ad-Hoc network environment. Since the computation time between two receiving signals
is less for an MANET, these two protocols find undisrupted links and feasible routes from
performance parameters without considering the fluctuation in signal strengths and network
topologies of mobile ad hoc networks. Firstly, we take a widely used protocol namely Ad-hoc
On-Demand Distance Vector Routing Protocol (AODV) that uses a source on-demand route
establishment process, then represent an extended version of this algorithm namely Reverse
AODV (RAODV). Route stability parameters have been used for selecting stable routes in the
network [6]. The remaining part of the paper describes about another extended version of AODV
called Multicast AODV (MAODV).In the next section, these two protocols have been compared
with some deterministic metrics and finally we concluded our paper.
2. REVERSE ADHOC ON-DEMAND DISTANCE VECTOR ROUTING
PROTOCOL
It is the extended reverse version of AODV. In AODV and other on-demand routing protocol,
source node initiates route discovery process [8] by broadcasting route request packet to its
neighbor to find a route to the destination. Each intermediate node acknowledges the RREQ by
sending a Route Reply (RREP) packet to the source node or rebroadcasts the RREQ to its
neighbors after incrementing the broadcast id. One of the disadvantages of AODV is that it is
based on single route reply along the first reverse path to establish routing path. Random change
of topology in the network leads that the route reply could not reach to the source node. Loss of
RREP leads to the source node to reinitiates route discovery process which degrades the routing
performances. In R-AODV, loss of RREP messages considered. This protocol discovers routes or
paths when source node needs a new route by using a reverse route discovery procedure. The
source node and destination node plays basically same role during route discovery process from
the point of sending control messages. So, when the destination node receives route request
(RREQ) packet, it broadcasts reverse request (R-RREQ) packet to find out the source node. When
source node gets an R-RREQ message it starts data transmission.
The source node initiates route discovery procedure by broadcasting RREQ to its neighbor.
Whenever the source node issues aRREQ, the broadcast ID is incremented by one. The source
node broadcasts the RREQ to all other nodes in the network. When a RREQ received by an
intermediate node, it starts checking that already it has that RREQ with the same source address.
The node cashes broadcast id and source address and drops redundant RREQ messages. The
RREQ packet contains the following fields:
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
29
Table:1Packet Format of RREQ
When the destination node receives first route request message, it generates reverse request (R-
RREQ) message and broadcasts it to neighbor nodes in the network. The R-RREQ packet
contains the following fields:
Table: 2 Packet Format of R-RREQ
When intermediate node receives R-RREQ messages, it goes check for redundancy. If it already
had that the same message, then it drops the message, otherwise send it to the next neighboring
nodes. When the first reverse request message reaches to the source node, it starts transmission of
packet in the network and other R-RREQs that arrived to the source node slowly will reserve for
future use.
3. MULTICAST ADHOC ON-DEMAND DISTANCE VECTOR ROUTING
PROTOCOL
MAODV is the multicast extended routing protocol of AODV. Both AODV and MAODV are on-
demand routing protocols for ad-hoc networks. AODV used for unicast traffic and MAODV[7][9]
for multicast traffic means that it send out multicast data packets and it goes through the multicast
group tree and composed of the group members and several routers, which are not member of the
group member. So all the group member nodes and the routers are all tree members and belong to
the group tree. In every multicast tree, the group member that first builds the tree is the group
leader for that tree, responsible for maintaining the group tree broadcasting Group-Hello (GRPH)
messages periodically in the whole network. Every node has three tables in the network. Firstly,
there is a table called Unicast route table which record the next hop for routes to other
destinations for unicast traffic. Secondly, another table where every hop record the next hops for
the tree structure of each multicast group and known is multicast route table. Each node and its
next neighbour node is connected with each other either downstream or upstream depends on
position. Now, If the next neighbour node is one-way nearer to the group leader node, the
direction is upstream; otherwise, the direction is downstream. In the group leader nodes there
have no upstream nodes, while other nodes in the tree should have one and only one upstream.
The third table is the Group leader table. It stores the currently-known multicast group address
and its group leader address and the next hop when a node receives a periodic GRPH message
towards that group leader.
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
30
3.1. Route Discovery and Maintenance
In MAODV, in the network each node tries to send out multicast traffic, if the data source node
is not includes a tree member, then how the packet arrive to the multicast group member. In this
case, there we can incorporate two step. In first step, one route is to be established from that data
source node to a tree member; after that the tree member receives the multicast data packets, and
then it propagates the data through the whole tree, reaching every group member. This
mechanism used for route discovery and maintenance for sending a specific node address in
AODV to accomplish the first step. If the source node discovers a RREQ for MAODV which are
the same as the RREQ used in AODV, broadcasted in the network. The source node knows a
route to reach the group leader if it has the group leader table. In the Group leader table all
information are stored, by using this RREQ packet can be sent unicastly towards the group leader
if this is the first time the node sends RREQ. When RREQ goes through the network, the reverse
route towards the source node to next hop is constructed. If any node has fresh enough route to
that multicast address, or any tree member with identified group leader can respond to this RREQ
with a RREP. Through the reverse route when the RREP is sent back to the source node, every
intermediate node and the source node automatically updates the route to that tree member with
the destination address set to the multicast group address, thus the forwarding route is established
in their Unicast route tables. For this first step, the end node is a tree member. In the multicast
tree construction second step is accomplished.
Figure 3: Initial RREQs
3.2. Multicast Tree Construction
The control packets i.e. RREQ and RREP used in MAODV for tree construction which are
borrowed from AODV. When any node is not a tree member then it initiates a RREQ with a join
flag (RREQ-J) and creates multicast route table then it wants to join that multicast group. After
that it identifies itself as a group member, but with an unknown group leader address. Generally,
in the network RREQ-J is flooded and a node in the multicast group can get information how to
reach data to the group leader address through checking its own Group Leader Table, and for the
first time that it sends out RREQ-J and it can be sent directly towards the group leader.
3.3. Multicast Tree Maintenance
Multicast tree maintenance procedure consist of Periodic Group-Hello Propagation, Neighbour
Connectivity Maintenance, Group Leader Selection and Tree Marge.
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
31
3.3.1. Periodic Group-Hello Propagation
In this case, group leader plays the major role and initiates a Group-Hello message (GRPH)
throughout the whole network periodically, to specify the existence of that group and its current
status. So the tree member node receives GRPH from its own upstream can use the GRPH to
update their current group sequence number, current group leader and the current distance from
the group leader. It requires the GRPH messages to be propagated to its own tree structure from
upstream to downstream gradually. Now, a GRPH message is received by a tree member then it
first checks its group leader information stored in its Multicast Route Table. This GRPH is to be
discarded if it is the same group leader address is specified, and the node waits for next GRPH
from its own upstream. If its Multicast Route Table record the group leader information there
exists another tree with the same multicast group address and these two trees can be connected.
3.3.2 Neighbour Connectivity Maintenance
The neighbour connectivity is organised by repairing the downstream node of a link in the tree
realizes that the link is broken. Then it is not receiving any broadcast messages from that
neighbour in a specific time. Then, the downstream node deleting next hop becomes the request
source node sending out RREQ-J to determine a new limb. RREQ-J wants to join the multicast
group, in that this RREQ-J must be broadcast and attached with an extension including other
information about the node hop count to the group leader, When a RREQ-J with Extension
received by a tree member, it must check its own hop count to the group leader, it avoid the old
branch and its own downstream nodes responding to the RREQ-J. Tree partition will be
happened; when the request source node tries several times (RREQ_RETRIES) to repair that
branch, but has not received any RREP-J then network partition should be created. So, for this
partitioned tree a fresh group leader is selected.
3.3.3 Group Leader Selection
In the partitioned tree, a new group leader must be selected or if the group leader revokes its
group membership. Then the current node is a group member, it will become the new group
leader after partitioned the tree. Otherwise, it will force one of its tree neighbours to be the leader.
If there is any downstream node, it removes the entry for that group in its Multicast route table,
specifying it is not the member to the tree anymore, and broadcast a multicast activation (MACT)
message to this downstream node, indicating that it has no existence in that tree and for
maintaining the all nodes the tree needs a leader. If more than one downstream node are there,
then the recent node selects one downstream, become upstream link and broadcasts a a group-
leader flag(MACT-GL) towards that node, indicating that it has other address in the tree then
creates a new group leader node. The node changes the upstream direction into downstream after
receiving MACT-GL from upstream. Otherwise, it continues the above procedure till a group
member is reached and becomes the new group leader.
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
32
Figure 4: Group Leader in Multicast Tree
3.3.4 Tree Merge
If the member of the tree has a smaller group leader address that receives group hello packets
(GRPH) generated by another group leader with a larger address for the same group then tree
merge can be detected. After confirming for the leader’s permission for reconstruct the tree, the
tree member initiates the merge by unicastly sending a RREQ with a repair flag (RREQ-R) to the
group leader. Until the leader is reached from downstream to upstream the RREQ-R propagates
continuously. If the other nodes do not have the permission to reconstruct the tree, it can
acknowledge a RREP with a repair flag (RREP-R) to that request node. The RREP-R follows this
reverse route to the request node when receiving RREQ-R, the reverse route to the request node is
formed. If there is another tree for that group with a group leader having a larger address then, the
RREQ-R and RREP-R cycle is omitted and the leader has not allowed any other tree member to
recreate the tree.
4. PERFORMANCE EVALUATION
4.1. SIMULATION
The simulations are performed using Network Simulator 2 (NS-2), particularly popular in the
wireless networking community. The performance of RAODV is evaluated by comparing it with
MAODV protocol in same condition. In our simulation, MAC protocol is the IEEE standard
802.11 Distributed Coordination Function (DCF) [10].The traffic sources are constant bit rate
(CBR). Half of nodes are static, half of nodes move with a random mobility model. For mobile
nodes, velocities ranged between 0 m/s and 20 m/s, while the pause time was set to 30 seconds.
The data packet size is 512 bytes.
In the scenarios, the no of nodes in the network increase from 20 to 100 gradually. The size and
the area are selected .So that the nodes density is approximately constant, which would properly
reflect the scalability of routing protocols. Each simulation was run for duration of 900 seconds.
In graph we use is an average of 5 simulations sample data. We evaluated three performance
metrics:
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
33
4.1.1. Packet delivery ratio:
The ratio of the data packets delivered to the destinations to those generated by the sources.
4.1.2. Average control overhead:
The control packet overhead that for route discovery, clusters maintain and route repair etc.
4.1.3. End-to-end delay:
The average delay includes all possible delays caused by route discovery, propagation, and
transfer times etc.
4.1.4. Throughput :
The amount of packet successfully delivered to all the nodes in the network. It is generally
expressed in bits per second (bps) or kilobits per second (kbps).
4.2. RESULT AND ANALYSIS:
In the scenario, we studied the scalability of the protocols. For our simulation we have assumed
that the sensor network is static, where all the sensor nodes have the same radio range and also
energy is uniformly distributed among all the sensor nodes. Simulations are carried out in a non-
beacon mode and all the devices have the capabilities of a coordinator.
The results are shown in Fig.3. As shown in Fig. 3(a), both RAODV and MAODV show high
packet delivery ratio even for networks with 100 nodes. But RAODV consistently delivers about
1-2 percent more data packets than MAODV. Due to multipath in MAODV [12] there can be
many stale routes which may contribute to less packet delivery and increase of routing overhead
in the network. Thus, an active route in RAODV usually lasts longer and more data packets can
be delivered.
Fig. 3(b) shows the route overhead of the comparing route protocols. When nodes are above 40
then overhead of MAODV is increasing slowly with RAODV, when the nodes are more than 60,
the overhead of MAODV increase rapidly. In MAODV uses the multicast routing traffic so it
allows the packets to move in many paths. RAODV on the other hand uses reverse path technique
to find the paths which naturally increases the number of control packets needed to keep track of
the increasing number of paths. Here for our simulation since we have assumed that the nodes are
static, link failures is very rare and hence computing for link failures will lead to additional
overhead in MAODV, The low control overhead is critical for RAODV. RAODV has light
overhead.
In fig. 3(c) RAODV has less network delay when compared with MAODV. If the control packet
or overhead is to be more then successful packet will delivered less for that reason delay also be
more and converge at a point as the packets are varied indicating that the network gets saturated.
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
34
Here in MAODV the duplicate copies are not discarded immediately. This leads to more end to
end delay in the network for MAODV. So the interval time between sending by the source node
and receiving by the destination node, which includes the processing time and queuing time
increases.
In fig. 3(d) shows the throughput of comparing route protocols. RAODV has better outcomes
than MAODV. It is mainly depends on the lower delay and better successful packet delivered in
the network because when the route will be lost then MAODV uses multicast routing traffic but
RAODV sends packet consistently due to fast route recovery process than MAODV.
Fig: 3(a) Packet Delivery Ratio
Fig: 3(b) Average Control Packet
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
35
Fig: 3(c) End to End Delay
Fig: 3(d) Throughput
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
36
5. CONCLUSIONS
This approach can be utilized for determine the routing metric with less scalability and mobility
in between two routing protocols, namely reactive routing protocol Multicast Ad hoc On-Demand
Distance Vector Routing (MAODV) and Reverse Adhoc On-Demand Distance Vector routing
protocol in Tool command language and integrated the module in the ns-2 [13] Simulator. We
determine the performance comparison of the two protocols and simulations were carried out with
identical topologies and running different protocols on the mobile node in the network. In the
routing protocols, performance were considered with respect to metrics like Packet delivery ratio,
end to end delay, control overhead, throughput and compared the X-graph between these two
protocols. This simulation results illustrate that RAODV provide better packet delivery rate with
less route latency and overhead than any other routing protocol like AODV. For denser medium
RAODV provides better security to data packets for scrubby and significant security. In RAODV
we changed route replay packet configuration of AODV and named it RRREQ.
Our future work includes designing a new routing protocol that takes in to consideration the
various challenges under which a routing protocol has to work in a unique and challenging sensor
environment. With all these research challenges, we robustly accept as true that we have a very
stirring time ahead of us in the area of MANET.
REFERENCES
[1] I. Akylidiz, W. Su, Sankarasubramaniam, and E.Cayrici, “A survey on sensor networks”, IEEE
Communications Magazine, Volume: 40 Issue: 8, August 2002, pp.102-114.
[2] K. Akkaya and M. Younis, “A survey of Routing Protocols in Wireless Sensor Networks”, Elsevier
Ad Hoc Network Journal, 2005, pp 325-349.
[3] Gowrishankar.S, T.G.Basavaraju, SubirKumarSarkar, ”Issues in Wireless Sensor Networks”, In
proceedings of the 2008 International Conference of Computer Science and Engineering, (ICCSE
2008), London, U.K., 2-4 July, 2008.
[4] S. Corson, J. Macker., “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues
and Evaluation Considerations”, IETF RFC2501, 1999.
[5] Kush, A., Taneja, S., “A Survey of Routing Protocols in Mobile Adhoc Networks International
Journal of Innovation”, Management and Technology 1(3), 279–285 (2010).
[6] E. M. Royer and C. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile. Wireless
Networks,” IEEE Personal Communications, pp. 46–55, April 1999.
[7] Royer, E. M. and Perkins, C. E.; "Multicast Operation of the Ad-hoc On-Demand Distance Vector
Routing Protocol", Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile
Computing and Networking (MOBICOM.99), Seattle, WA, USA, August 1999, pages 207-218 .
[8] http://www.ids.nic.in/tnl_jces_Jun_2011/PDF.
[9] Royer, E. M. and Perkins, C. E.; "Multicast Ad hoc On-Demand Distance Vector (MAODV)
Routing", IETF, Intemet Draft: draft- ietf-manet-maodv-00.txt, 2000
[10] "Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications", IEEE
Standard 802.11-1997, IEEE Standards Dept. 1994.
[11] Chonggun Kim, Elmurod Talipov and Byoungchul Ahn, “ A Reverse AODV routing protocol in Ad
hoc Mobile Networks”, EUC
Workshops 2006, LNCS 4097, pp 522-531, 2006.
[12] J. J. Garcia-Luna-Aceves and M. Mosko, “Multipath Routing in Wireless Mesh Networks”, in first
IEEE Workshop on Wireless Mesh Networks (WiMesh 2005); 2005 September 26;Santa Clara; CA.
[13] http://www .isi.edu /nsnam/ns.
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
37
AUTHORS:
Debraj Modak received the bachelor’s degree from WBUT of electronics and
communicationengineering in 2009 and master’s from SRM University of Digital
Communicationand Networking in 2011. He has been worked as a Assistant Professor
in the Institute of Science and Technology, Midnapore, during 2011-12. At present, he
work as an Assistant Professorat the Department of Electronics and Communication in
the Abacus Institute of Engineering nd Management, Mogra.
Dipankar Saha received the bachelor’s degree from WBUT of electronics
andcommunicationengineering in 2009 and master’s from SRM University of Digital
Communication and Networking in 2011. He worked as a lecturer in the JIS College of
Engineering, Kalyani, during 2011-12. At present, he work as an Assistant Professor at
the Department of Electronics and Communication in the Global Institute of
Management and Technology, Krishnanagar.