A MANET is an interconnection of mobile devices by wireless links, which forms a dynamic topology. Routing protocols play a vital role in transmission of data across the network. The two major classifications of routing protocols are unipath and multipath. In this paper, we have evaluated the performance of a widely used on-demand multipath routing protocol called AOMDV. This protocol has been selected due to its edge over other protocols in various aspects, such as reducing delay, routing load etc. The evaluation of AOMDV protocol is carried out in terms of four scenario patterns such as RWM, RPGM, MGM, and GMM in two different traffic patterns such as CBR and TCP using NS2 and Bonn Motion.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average Throughput
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average Throughput
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
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
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
Performance Analysis of Ad-hoc on Demand Distance Vector Routing (AODV) and D...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.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied 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.
Mobile ad hoc networks communicate without any fixed infrastructure or ant centralized domain. All the
nodes are free to move randomly within the network and share information dynamically. To achieve an
efficient routing various protocols have been developed so far which vary in their nature and have their
own salient properties. In this paper, we have discussed one of the latest protocols i.e. Dynamic Manet on
demand (DYMO) routing Protocol, implemented and analysed its performance with other similar protocols
against different parameters. Finally a comparison has been presented between all of them.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
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’.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
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
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
Performance Analysis of Ad-hoc on Demand Distance Vector Routing (AODV) and D...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.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied 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.
Mobile ad hoc networks communicate without any fixed infrastructure or ant centralized domain. All the
nodes are free to move randomly within the network and share information dynamically. To achieve an
efficient routing various protocols have been developed so far which vary in their nature and have their
own salient properties. In this paper, we have discussed one of the latest protocols i.e. Dynamic Manet on
demand (DYMO) routing Protocol, implemented and analysed its performance with other similar protocols
against different parameters. Finally a comparison has been presented between all of them.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
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’.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
BEHAVIOUR OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS INVESTIGATED FOR EME...ijwmn
Mobile Ad hoc Networks are open, shared, dynamic and self-organized networks. These distinct nature
lead to efficient use in emergency and recue scenarios where the sharing of information is necessary. In
order to share information within the network, a proper routing protocol is required to establish routes
between nodes. This article discusses which of the routing protocols such as reactive or proactive has
better performance in such scenario. In order to implement the test bed, we choose a real area in
Uttarakhand state, India where the disaster occurred recently hence so many civilizations had vanished
due to lack of communication and failure in recovery. Our aim is to choose an optimum routing protocol
that is correct and used for efficient route establishment between nodes so that message could be delivered
on time without loss and it will be implemented and used in future based on the model that we propose.
QoS Issues in MANET: A Comparative Study over Different Routing Protocolsrahulmonikasharma
MANETs are composed of autonomous nodes that are self-managed without any existing of infrastructure and centralized administration. Therefore, each node operates not only as an end system but also as a router to forward packets for other nodes. For these reasons, the network has a dynamic topology, so nodes can easily join or leave the network at any time. Routing information differentiates these networks from other ad-hoc networks. The study of QoS issues in Mobile Ad-hoc Network is done by simulation in MATLAB that can help in better understanding of the behavior of various routing protocols. This paper is intended to compare QoS parameters of various routing protocols.
Video transmission over wireless network requires
link reliability. Videos are having more data to be transmitted
during communication. The criticality and load of the network
increases when some video data is communicated over the
network. Firstly, describes the characteristics of Mobile Ad hoc
Networks and their Routing protocol, and second a mobile ad
hoc network (MANET) which consists of set mobile wireless
nodes and one fixed wireless server are design using ns-2. In this
research we will simulate three MANET routing protocols such
as AODV against three different parameters i.e. delay, network
load, throughput and retransmission.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
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 Computational Engineering Research (IJCER) ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
PERFORMANCE EVALUATION OF AOMDV PROTOCOL BASED ON VARIOUS SCENARIO AND TRAFFIC PATTERNS
1. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
DOI : 10.5121/ijcsea.2011.1603 33
PERFORMANCE EVALUATION OF AOMDV
PROTOCOL BASED ON VARIOUS SCENARIO AND
TRAFFIC PATTERNS
P.Periyasamy1
and 2
Dr.E.Karthikeyan
1
Department of Computer Science and Applications, Sree Saraswathi Thyagaraja
College, Pollachi - 642 107, Tamil Nadu, India
pereee@yahoo.com
2
Department of Computer Science, Government Arts College, Udumalpet - 642 126,
Tamil Nadu, India
e_karthi@yahoo.com
ABSTRACT
A MANET is an interconnection of mobile devices by wireless links, which forms a dynamic topology.
Routing protocols play a vital role in transmission of data across the network. The two major
classifications of routing protocols are unipath and multipath. In this paper, we have evaluated the
performance of a widely used on-demand multipath routing protocol called AOMDV. This protocol has
been selected due to its edge over other protocols in various aspects, such as reducing delay, routing load
etc. The evaluation of AOMDV protocol is carried out in terms of four scenario patterns such as RWM,
RPGM, MGM, and GMM in two different traffic patterns such as CBR and TCP using NS2 and Bonn
Motion.
KEYWORDS
MANET, unipath, multipath, AOMDV, RWM, RPGM, MGM, GMM, CBR, TCP, scenario patterns and
traffic patterns.
1. INTRODUCTION
1.1. Mobile Ad Hoc Networks
Mobile Ad hoc NETwork (MANET) is an interconnection of mobile devices by wireless links.
It does not need much physical infrastructure such as routers, servers, access points or cables.
Each mobile device functions as router as well as node. The most important characteristics of
MANET are i) Dynamic topologies ii) Bandwidth-constrained links iii) Energy constrained
operation and iv) limited physical security [7]. The various applications of MANETs are: i)
military - communication among soldiers in enemy environments, ii) personal area network -
printers, PDA, mobile phones, iii) business indoor application - meetings, symposium, demos, iv)
civilian outdoor application - taxis, cars, sport stadiums, v) emergency application - emergency
rescue operations, police, and earthquakes, and vi) home intelligence devices.
2. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
34
1.2. Routing Protocols
To have communication within the network, a routing protocol is used to discover routes between
nodes. The primary goal of such ad-hoc network routing protocol is to establish 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.
The two major classifications of MANET routing protocols are unipath and multipath routing
protocols.
1.2.1. Unipath Routing Protocols
The unipath routing protocols [1] discover a single route between a pair of source and destination.
A new route discovery is required in response to every route break which leads high overhead and
latency. The two components of unipath routing protocols are i) Route Discovery: finding a route
between a source and destination. ii) Route Maintenance: repairing a broken route or finding a
new route in the presence of a route failure. The most commonly used unipath routing protocols
are Ad Hoc On-demand Distance Vector (AODV) [6], Dynamic Source Routing (DSR) [6], and
Destination Sequenced Distance Vector (DSDV) [6].
1.2.2. Multipath Routing Protocols
The multipath routing protocols [1] discover multiple routes between a pair of source and
destination in order to have load balancing to satisfy Quality of Service (QoS) requirements. The
three main components of multipath routing protocols are i) Route Discovery: finding multiple
nodes disjoint, links disjoint, or non-disjoint routes between a source and destination. ii) Traffic
Allocation: Once the route discovery is over, the source node has selected a set of paths to the
destination and then begins sending data to the destination along the paths. iii) Path
Maintenance: regenerating paths after initial path discovery in order to avoid link/node failures
that happened over time and node mobility.
The benefits of the multipath routing protocols are i) Fault tolerance: Being redundant
information routed to the destination via alternative paths it reduces the probability of the
disruption of communication in case of link failures, ii) Load Balancing: selecting diverse traffic
through alternative paths in order to avoid congestion in links, iii) Bandwidth aggregation:
Splitting the data into multiple streams and then each of which has routed through a different path
to the same destination. Hence the effective bandwidth can be aggregated and iv) Reduced delay:
In the unipath routing protocols, the path discovery process needs to be initiated to find a new
route in order to avoid a route failure and this leads to high route discovery delay. This delay is
minimized in multipath routing protocols by backup routes that have been identified in route
discovery process. The most recently used multipath algorithms are Temporarily-Ordered
Routing Algorithm (TORA) [3], Split Multipath Routing (SMR) [3], Multipath Dynamic
Source Routing (MP-DSR) [1], Ad hoc On-demand Distance Vector-Backup Routing (AODV-
BR)[3] and Ad Hoc On-Demand Multipath Distance Vector Routing (AOMDV) [3].
The AOMDV protocol is widely used in mobile communication because of its edge over other
protocols in various aspects, such as reducing delay, routing load [1,3] etc. It is an on-demand
multipath routing protocol – starts a route discovery procedure when needed for MANET. We
evaluate its performance in terms of different mobility models such as Random Way point
Mobility (RWM), Reference Point Group Mobility (RPGM), Manhattan Grid Mobility (MGM)
and Gauss-Markov Mobility (GMM) and also different traffic patterns such as CBR and TCP
traffic patterns. To analyze these protocols, traffic patterns and mobility models are essential and
are discussed in subsequent sections.
3. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
35
The rest of this paper is organized as follows: In section 2, the characteristics of traffic patterns
are discussed; in section 3 the various mobility models are described; in section 4, the
functionality of AOMDV protocol is given; in section 5 the simulation model is discussed; in
section 6 the performance metrics are described; in section 6 the experimental results are
discussed and finally in section 7 the conclusion is given.
2. TRAFFIC PATTERNS
Traffic Patterns describe how the data is transmitted from source to destination. The two types of
traffic patterns employed in MANET are CBR and TCP Traffic patterns.
2.1. CBR Traffic Pattern
The qualities of Constant Bit Rate (CBR) traffic pattern [2,14] are i) unreliable: since it has no
connection establishment phase, there is no guarantee that the data is transmitted to the
destination, ii) unidirectional: there will be no acknowledgment from destination for confirming
the data transmission and iii) predictable: fixed packet size, fixed interval between packets, and
fixed stream duration.
2.2. TCP Traffic pattern
The qualities of Transmission Control Protocol (TCP) traffic pattern [2,14] are i) reliable: since
connection is established prior to transmitting data, there is a guarantee that the data is being
transmitted to the destination, ii) bi-directional: every packet that has to be transmitted by the
source is acknowledged by the destination, and iii) conformity: there will be flow control of data
to avoid overloading the destination and congestion control exists to shape the traffic such that it
conforms to the available network capacity [2]. Today more than 95% of the Internet protocol
traffic is carried out through TCP.
3. MOBILITY MODELS
Mobility models describe the movement pattern of the mobile users, their location; velocity and
acceleration [4,12]. They play a vital role in determining the performance of a protocol and also
differentiated in terms of their spatial and temporal dependencies. i) Spatial dependency is a
measure of how two nodes are dependent in their motion. When the two nodes are moving in the
same direction, then they have high spatial dependency. ii) Temporal dependency is a measure of
how current velocity (magnitude and direction) are related to previous velocity. The two nodes
are having the same velocity and direction means that they have high temporal dependency. The
commonly used mobility models are RWM, RPGM, MGM and GMM.
3.1. Random Way point Mobility (RWM)
RWM [4] model is the commonly used mobility model in which every node randomly chooses a
destination and moves towards it from a uniform distribution (0, Vmax) at any moment of time,
where Vmax is the maximum allowable velocity for every node. Each node stops for a duration
defined by the 'pause time' parameter when it reaches the destination. After the pause time it
again chooses a random destination and repeats the whole process until the end of the simulation.
4. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
36
3.2. Reference Point Group Mobility (RPGM)
The military battlefield communication uses RPGM [4] model in which each group has a logical
center called Group Leader (GL) for determining the group's motion behavior. Each node in this
mobility deviates from its velocity (both magnitude and direction) from that of the leader is
calculated as follows:
SVV MAXLM
SDRrandomtt **())()( += (1)
AMAXLM
ADRrandomtt **())()( += θθ (2),
where VM and VL are the magnitude of member and leader respectively, θM and θL are direction
of member and leader respectively, SMAX and AMAX are maximum speed and angle respectively, 0
< ADR and SDR < 1, SDR is the Speed Deviation Ratio and ADR is the Angle Deviation
Ratio. SDR and ADR employed to control the deviation of the velocity of group members from
that of the leader.
3.3. Manhattan Grid Mobility (MGM)
MGM [4] models are very useful to emulate the movement pattern of mobile nodes on streets.
This is sometimes called Urban Area (UR) model. It forms a number of horizontal and vertical
streets like a grid called maps. Each mobile node can be allowed to move along the grid of
horizontal and vertical streets on the map. It provides a pervasive computing service between
portable devices.
3.4. Gauss-Markov Mobility (GMM)
GMM [4] models adopt different levels of randomness through one tuning parameter. In which
each mobile node is initialized by a particular speed and direction. The movement updates the
speed and direction of each mobile node in a fixed interval of time n. The value of speed and
direction of the nth
instance is calculated based on the value of speed and direction of the (n-1)th
instance as follows:
X nsssnsn 1)21()1(1 −−+−+−= ααα (3)
X ndddnd n 1)21()1(1 −−+−+−= ααα (4),
where sn and d n are the new speed and direction of the mobile node at interval n, α is the
tuning parameter to vary the randomness such that 10 ≤≤ α , s and d are constants of
representing speed and direction as α→n ,
Xs n1−
and X nd 1− are random variable derived from
Gaussian distribution. The random values are obtained by setting 0=α and the linear motion is
obtained by setting 1=α . The intermediate randomness is obtained by varying α between 0 and
1 and the new position of the mobile node is calculated as follows:
)1cos(11 d nsnxnxn −−+−= (5)
)1cos(11 d nsnynyn −−+−= (6),
where ),( ynxn and )1,1( ynxn −− are the x and y coordinates of the mobile node positions at
nth and )1( −n th
time intervals respectively.
5. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
37
4. AD HOC ON-DEMAND MULTIPATH DISTANCE VECTOR ROUTING
(AOMDV)
The AODV [6] protocol starts a route discovery process through a route request (RREQ) to the
destination throughout the network. Once a non-duplicate RREQ is received, the intermediate
node records the previous hop and checks for a valid and fresh route entry to the destination. The
node sends a route reply (RREP) along with a unique sequence number to the source. On
updating the route information, it propagates the route reply and gets additional RREPs if a RREP
has either a larger destination sequence number (fresher) or a shorter route found.
To eliminate the occurrence of frequent link failures and route breaks in highly dynamic ad hoc
networks, AOMDV has been developed from a unipath path on-demand routing protocol AODV.
The AOMDV [1,3,13] protocol finds multiple paths and this involves two stages which are as
follows: i) A route update rule establishes and maintains multiple loop-free paths at each node,
and ii) A distributed protocol finds link-disjoint paths.
The AOMDV protocol finds node-disjoint or link-disjoint routes between source and destination.
Link failures may occur because of node mobility, node failures, congestion in traffic, packet
collisions, and so on. For finding node-disjoint routes, each node does not immediately reject
duplicate RREQs. A node-disjoint path is obtained by each RREQ, arriving from different
neighbor of the source because nodes cannot broadcast duplicate RREQs. Any two RREQs
arriving at an intermediate node through a different neighbor of the source could not have
traversed the same node. To get multiple link-disjoint routes, the destination sends RREP to
duplicate RREQs regardless of their first hop. For ensuring link-disjointness in the first hop of the
RREP, the destination only replies to RREQs arriving through unique neighbors. The RREPs
follow the reverse paths, which are node-disjoint and thus link-disjoint after the first hop. Each
RREP intersects at an intermediate node and also takes a different reverse path to the source to
ensure link-disjointness.
5. SIMULATIONS MODEL
Figure 1. Overview of the simulation model
The performance of AOMDV is evaluated in terms of Scenario and Traffic patterns using NS 2
[5,8] and Bonn Motion [11]. The following Figure 1. illustrates the simulation model [18] and
the simulation parameters are described in Table 1.
The result of simulation is generated as trace files and the awk & perl scripts are used for report
generation.
6. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
38
Table 1. Simulation Parameters
Parameter Value
Simulator NS-2.34
MAC Type 802.11
Simulation Time 100 seconds
Channel Type Wireless Channel
Routing Protocol AOMDV
Antenna Model Omni
Simulation Area 1520 m x 1520 m
Traffic Type CBR(udp), TCP(ftp)
Data Payload 512 bytes/packet
Network Loads 4 packets/sec
Radio Propagation Model TwoRayGround
Interface Queue Length 50
Interface Queue Type DropTail/PriQueue
Number of nodes 25,50,75,100
Interval 1000 sec
Mobility Model Random Way point Mobility, Reference
Point Group Mobility, Manhattan Grid
Mobility, Gauss-Markov Mobility
6. PERFORMANCE METRICS
Performance Metrics [9,15,16] are quantitative measures that can be used to evaluate any
MANET routing protocol. We considered the following six metrics in order to evaluate the multi
path on-demand routing protocol AOMDV in terms of four different scenarios such as RWM,
RPGM, MGM and GMM and also two different traffic patterns such as CBR and TCP traffic
patterns.
6.1. Packet Delivery Fraction (PDF)
PDF is the ratio of data packets delivered to the destination to those generated by the sources and
is calculated as follows:
Packet Delivery Fraction=
Numberof PacketsReceived
Number of PacketsSent
x 100.
6.2. Average Throughput
Average Throughput [17] is the number of bytes received successfully and is calculated by
AverageThroughput=
Numberof bytesreceived x8
Simulationtime x 1000
kbps.
7. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
39
6.3. Routing Overhead
Routing overhead is the total number of control packets or routing packets generated by routing
protocol during simulation and is obtained by
Routing Overhead = Number of RTR packets.
6.4. Normalized Routing Overhead
Normalized Routing Overhead is the number of routing packets transmitted per data packet
towards destination and calculated as follows:
Normalized Routing Overhead=
Number of Routing Packets
Number of PacketsReceived
.
6.5. Average End-to-End Delay (Average e2e delay)
Average End-to-End [10] delay is the average time of the data packet to be successfully
transmitted across a MANET from source to destination. It includes all possible delays such as
buffering during the route discovery latency, queuing at the interface queue, retransmission delay
at the MAC (Medium Access Control), the propagation and the transfer time. The average e2e
delay is computed by,
sec,1
)(
m
n
n
i
SiRi
D
∑
=
−
=
where D is the average end-to-end delay, n is the number of data packets successfully transmitted
over the MANET, ' i ' is the unique packet identifier, Ri is the time at which a packet with
unique identifier ' i ' is received and Si is the time at which a packet with unique identifier ' i ' is
sent. The Average End-to-End Delay should be less for high performance.
6.6. Packet Loss
Packet Loss is the difference between the number of data packets sent and the number of data
packets received. It is calculated as follows:
Packet Loss= Number of data packetssent− Numberof data packetsreceived.
7. RESULTS AND DISCUSSION
The performance evaluation of AOMDV protocol is tested in terms of CBR and TCP traffics for
different count of nodes namely 25, 50, 75, and 100 under four different scenarios (MANET
environments) and the results are as follows:
8. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
40
7.1. Packet Delivery Fraction
Table 2. Packet Delivery Fraction (%)
No.of
Nodes
Random Way point
Mobility
Reference Point
Group Mobility
Manhattan Grid
Mobility
Gauss-Markov
Mobility
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
25 26.4838 98.672 92.3698 99.1337 17.1023 99.3025 6.42408 92.1907
50 91.926 98.461 56.5843 99.281 81.4465 99.6809 24.4066 99.356
75 87.9534 98.9128 99.9552 99.2748 68.24 98.4355 87.7569 95.9479
100 69.3412 97.5973 83.0721 99.4681 51.7682 99.1142 53.1239 98.209
Figure 2.1 and Figure 2.2 shows the delivery rate of the data packets of this protocol is some what
significant in CBR traffic in RWM model. However, it is more significant in TCP traffic in
RPGM model (More than 99 percent irrespective of number of nodes).
Figure 2.1. Packet Delivery Fraction of AOMDV with CBR Traffic
9. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
41
Figure 2.2. Packet Delivery Fraction of AOMDV with TCP Traffic
7.2. Average End to End Delay
Table 3. Average End to End Delay (in ms)
Figure 3.1 and Figure 3.2 shows the end-to-end delay of this protocol is more significant in both
CBR and TCP traffics in RPGM model.
No.of
Nodes
Random Way point
Mobility
Reference Point
Group Mobility
Manhattan Grid
Mobility
Gauss-Markov
Mobility
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
25 0.689685 46.6322 12.9071 150.799 13.453 84.74 1.43374 0
50 35.303 102.126 2.90924 122.038 12.4105 9.14614 0.615091 101.84
75 58.8229 46.8142 45.9368 50.1088 60.1209 1576.36 68.8816 133.305
100 93.9716 72.9806 41.2503 40.4549 565.213 91.4236 630.539 1554.73
10. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
42
Figure 3.1. Average End-to-End Delay of AOMDV with CBR Traffic
Figure 3.2. Average End-to-End Delay of AOMDV with TCP Traffic
11. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
43
7.3. Average Throughput
Table 4. Throughput (in kbps)
No.of
Nodes
Random Way
point Mobility
Reference Point
Group Mobility
Manhattan
Grid Mobility
Gauss-Markov
Mobility
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
25 24.13 273.67 84.32 468.39 15.84 355.64 10.4 65.74
50 83.49 348.21 51.57 757.62 74.27 908.06 22.33 499.11
75 80.45 216.96 91.31 745.44 62.22 314.05 80.47 162.45
100 154.37 367.34 184.55 895.97 114.56 494.42 118.43 269.08
Figure 4.1 and Figure 4.2 shows the average throughput of this protocol is more
significant in both CBR and TCP traffics in RPGM model. However, it is some what
significant in both CBR and TCP traffics in RWM model.
Figure4.1. Throughput of AOMDV with CBR Traffic
Figure 4.2. Throughput of AOMDV with TCP Traffic
12. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
44
7.4. Packet Loss
Table 5. Packet Loss (in pkts)
Figure 5.1 and Figure 5.2 shows the Packet Loss of this protocol is significant in CBR
Traffic in RPGM model and in TCP Traffic in MGM model.
Figure 5.1. Packet Loss of AOMDV with CBR Traffic
Figure 5.1. Packet Loss of AOMDV with TCP Traffic
No.of
Node
s
Random Way
point Mobility
Reference Point
Group Mobility
Manhattan
Grid Mobility
Gauss-Markov
Mobility
CBR
Traffi
c
TCP
Traffic
CBR
Traffi
c
TCP
Traffic
CBR
Traffi
c
TCP
Traffi
c
CBR
Traffi
c
TCP
Traffic
25 1635 90 170 100 1871 61 2083 77
50 179 133 966 134 413 71 1688 79
75 269 58 1 133 707 122 274 168
100 1666 221 918 117 2605 108 2551 120
13. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
45
7.5. Routing Overhead
Table-6: Routing Overhead (in pkts)
Figure 6.1 and Figure 6.2 shows the Routing Overhead of this protocol is low in both CBR
and TCP traffics in RPGM model. However, it is some what high in both CBR and TCP
traffics in RWM model.
Figure 6.1. Routing Overhead of AOMDV with CBR Traffic
Figure 6.2. Routing Overhead of AOMDV with TCP Traffic
No.of
Nodes
Random Way point
Mobility
Reference Point
Group Mobility
Manhattan Grid
Mobility
Gauss-Markov
Mobility
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
CBR
Traffic
TCP
Traffic
25 1568 57 152 4 1757 49 1953 73
50 174 36 933 15 410 19 1627 28
75 250 49 0 15 680 92 264 120
100 1112 176 876 8 2084 95 1722 107
14. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
46
7.6. Normalized Routing Overhead
Table 6. Normalized Routing Overhead
No.of
Nodes
Random Way point
Mobility
Reference Point Group
Mobility
Manhattan Grid
Mobility
Gauss-Markov
Mobility
CBR
Traffic
TCP
Traffic
CBR
Traffic TCP Traffic
CBR
Traffic TCP Traffic
CBR
Traffic
TCP
Traffic
25 2.66214 0.008524 0.0738581 0.000349559 4.55181 0.00564256 13.6573 0.080308
50 0.0853778 0.0042308 0.741064 0.000810723 0.226145 0.000856628 2.98532 0.0022973
75 0.127291 0.0092856 0 0.000823859 0.447663 0.0119854 0.13442 0.0301659
100 0.295117 0.0196057 0.194451 0.000365614 0.745351 0.00786164 0.595642 0.0162614
Figure 7.1 and Figure 7.2 shows the Normalized Routing Overhead of this protocol is low in both
CBR and TCP traffics in RPGM model. However, it is some what high in both CBR and TCP
traffics in RWM model.
Figure 7.1. Normalized Routing Overhead of AOMDV with CBR Traffic
Figure 7.2. Normalized Routing Overhead of AOMDV with TCP Traffic
15. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
47
8. CONCLUSION
In both CBR traffic and TCP traffic, the AOMDV gives significant performance in RPGM model.
Due to randomness in mobility among mobile nodes, the RWM model is widely used in
MANETs. We have selected AOMDV for evaluation due to its edge over other protocols.
REFERENCES
[1] V.C.Patil, Rajashree, V.Biradar, R.R. Mudholkar, S.R.Sawant, “On-Demand Multipath Routing
Protocols for Mobile Ad Hoc Networks Issues and Comparison”, International Journal of Wireless
Communication and Simulation, 2010,Vol. 2(1), pp. 21-38.
[2] Thomas Clausen, Philippe Jacquet, Laurent Viennot, “Comparative study of CBR and TCP
Performance of MANET routing protocols”, Technical report, Project HiPERCOM, INRIA
Rocquencourt, 2002.
[3] R.L.Lagendijik, J.F.C.M.de Jongh, “Multipath Routing in Mobile Ad Hoc Networks”, Traineeship
Report, Version 1.2, TU-Delft/TNO, 2003.
[4] C.P.Agrawal, O.P.Vyas, M.K.Tiwari, “Evaluation of varying mobility models & network loads on
DSDV protocol of MANETs”, International Journal of Computer Science and Engineering, 2009,
Vol. 1(2), pp. 40-46.
[5] The Network Simulator ns-allinone-2.34, http://www.isi.edu/nsnam/ns/
[6] Elizabeth M. Royer, C-K Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless
Networks”, IEEE Personal Communications, April 1999, pp.46-55.
[7] Sapna S. Kaushik, P.R.Deshmukh, “Comparison of effectiveness of AODV, DSDV and DSR Routing
Protocols in Mobile Ad hoc Networks”, International Journal of Information Technology and
Knowledge Management, 2009, Vol. 2(2), pp.499-502.
[8] Kevin Fall, K. Varadhan, "The ns Manual", University of Southern California, Information Sciences
Institute (ISI), http://www.isi.edu/nsnam/ns/ns-documentation.html.
[9] Harminder S. Bindra1, Sunil K. Maakar, A. L. Sangal , “Performance Evaluation of Two Reactive
Routing Protocols of MANET using Group Mobility Model”, IJCSI International Journal of
Computer Science Issues, 2010,Vol. 7(10), pp.38-43.
[10] Anuj K. Gupta, Harsh Sadawarti, Anil K. Verma, “Performance analysis of AODV, DSR & TORA
Routing Protocols”, IACSIT International Journal of Engineering and Technology, 2010, Vol.2 (2),
pp.226-231.
[11] The Bonn Motion, http://bonnmotion.cs.uni-bonn.de/
[12] Mohd Izuan Mohd Saad, Zuriati Ahmad Zukarnain, “Performance Analysis of Random-based
Mobility Models in MANET Protocols”, European Journal of Scientific Research, 2009, Vol. 32(4),
pp. 444-454.
[13] Sujata V.Mallapur, Sujata .Terdal, Enhanced, “Ad-Hoc on Demand Multipath Distance Vector
Routing Potocol (EAOMDV)”, International Journal of Computer Science and Information Security,
2010,Vol. 7 (3), pp.166-170.
[14] Vikas Singla, Parveen Kakkar,“Traffic Pattern based performance comparison of Reactive and
Proactive protocols of Mobile Ad-hoc Networks”, International Journal of Computer Applications,
2010,Vol. 5(10), pp.16-20.
16. International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.1, No.6, December 2011
48
[15] S. R. Das, R. Castaeda, J. Yan, “Simulation-based performance evaluation of routing protocols for
mobile ad hoc networks”, Mobile Networks and Applications, 2000,Vol. 5, pp.179–189.
[16] S.Corson, J.Macker, “Routing Protocol Performance Issues and Evaluation Considerations”,
RFC2501, IETF Networking Group, January 1999.
[17] A.Valarmathi, RM.Chandrasekaran, “Congestion Aware and Adaptive Dynamic Source Routing
Algorithm with Load Balancing in MANETs”, International Journal of Computer Applications, 2010,
Vol. 8(5), pp.1-4.
[18] NS-2 with Wireless and Mobility Extensions, http://www.monarch .cs.cmu.edu.