A central challenge in designing of wireless ad hoc networks is the development of dynamic
routing protocols that can efficiently find routes between two communication nodes when nodes are
mobile. To accomplish this, a number of ad hoc routing protocols had been proposed and implemented.
In wireless ad hoc network the selected protocol should find best route which can insure packet delivery
and packet integrity. Performance evolution of the protocols is the key step before selecting a particular
protocol. In this paper, the performance is compared on Ad hoc On-demand Distance Vector (AODV)
and Dynamic Source Routing (DSR) at application layer by varying the pause time and number of nodes
using QualNet 5.0.2 simulator. The average jitter, end-to-end delay, throughput and packet delivery
fraction (PDF) are the four common measures used for the comparison of the performance of above
protocols. The experimental results show that DSR perform better in low load and high pause time but
in case of high load and less pause time AODV outperform DSR.
Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV...IOSR Journals
Wireless operations allow services, such as long-range communications, that are impossible or
impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol
[1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g.
radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic
energy, etc. to transfer information without the use of wires.[1] Information is transferred in this manner over
both short and long distances.In this, routes may be detached due to lively movement of nodes. So route
assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to
both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new
method using AODV protocol to find out good neighbour node and finding reliable path according to their
signal strength, flow capacity relative position of node in network.
This document summarizes and compares two routing protocols for wireless ad hoc networks: Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). It provides an overview of how each protocol functions, specifically noting that DSR uses source routing while AODV uses a table-driven approach with destination sequence numbers. It then discusses the motivation and goals for evaluating the performance and differences between the two protocols using network simulations.
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.
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).
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.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
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.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV...IOSR Journals
Wireless operations allow services, such as long-range communications, that are impossible or
impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol
[1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g.
radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic
energy, etc. to transfer information without the use of wires.[1] Information is transferred in this manner over
both short and long distances.In this, routes may be detached due to lively movement of nodes. So route
assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to
both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new
method using AODV protocol to find out good neighbour node and finding reliable path according to their
signal strength, flow capacity relative position of node in network.
This document summarizes and compares two routing protocols for wireless ad hoc networks: Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). It provides an overview of how each protocol functions, specifically noting that DSR uses source routing while AODV uses a table-driven approach with destination sequence numbers. It then discusses the motivation and goals for evaluating the performance and differences between the two protocols using network simulations.
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.
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).
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.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
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.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
EVALUATION OF PROACTIVE, REACTIVE AND HYBRID AD HOC ROUTING PROTOCOL FOR IEEE...cscpconf
This document evaluates the performance of proactive, reactive, and hybrid ad hoc routing protocols (OLSR, AODV, DYMO, ZRP) for IEEE 802.11 MAC and 802.11 DCF in a vehicular ad hoc network (VANET) simulation using Qualnet. It discusses the characteristics and operations of these four routing protocols. The simulation varies VANET parameters like speed and altitude. The results show that in real traffic scenarios, the proactive OLSR protocol performs more efficiently for IEEE 802.11 MAC and DCF compared to the reactive and hybrid protocols.
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.
Quality of service Routing Using Stable Nodes in Mobile Ad hoc Networksijceronline
An efficient and secured routing protocol design is the vital concern for mobile ad hoc networks in view of major problems raising on security issues and loss of the network resources is due to changes within the connections of the network like Node failures, link breakages in the network. Our proposed scheme enhances the secured and reliable transmission of data, which also improves the network constancy, efficient packet delivery ratio and network life time by integrating through the AODV Routing protocol. It unites the authentication, stable routes and signal strength of the nodes to attain the secure and reliable transmission of data through nodes.
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 (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
A study on performance comparison of dymo with aodv and dsrIAEME Publication
This document summarizes and compares the performance of the DYMO, AODV, and DSR routing protocols for mobile ad hoc networks (MANETs). It finds that DYMO has the highest throughput as it avoids expiring good routes by appropriately updating route lifetimes. AODV shows higher throughput than DSR due to avoiding loops and maintaining fresh routes. DSR initially has very high packet loss, but this decreases substantially over time. The document analyzes the protocols based on metrics like throughput, packet loss, end-to-end delay, packet delivery fraction, and routing overhead.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Bandwidth aware on demand multipath routing in manetsijwmn
The document proposes a modification to the AOMDV routing protocol to utilize available bandwidth in MANETs. It describes enhancing AOMDV to select multiple paths during route discovery based on available bandwidth, and using periodic detector packets to monitor bandwidth on alternate paths. Simulation results showed this bandwidth-aware multipath approach improves end-to-end throughput, packet delivery ratio, and end-to-end delay compared to the original AOMDV protocol.
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.t
Performance Comparison of AODV, DSR and LAR1 in Mobile Ad-hoc Network based o...IOSR Journals
Abstract: In the last couple of years, the use of wireless networks has become more and more popular. A
MANET is a collection of self-organizing mobile nodes which is infrastructure less, autonomous, and standalone
networks. Each node in a MANET is free to move independently in any direction and will therefore change its
links to other devices frequently. Each must forward traffic unrelated to its own use and therefore be a router.
Simulation result has been obtained by a performance comparison of three routing protocols i.e. Ad hoc Ondemand
Distance Vector (AODV), Dynamic Source Routing (DSR), Location Aided Routing (LAR1) against
Simulation time. The Result is obtained using QualNet simulator version 6.1. Different protocols are evaluated
based on measures such as Average End to End delay (s), Average Jitter(s), and Packet delivery ratio.
Keywords: MANET, AODV, DSR, LAR1, QualNet 6.1
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.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
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.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
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.
Comparison of routing protocols with performance parameters for different num...ijctet
This document compares the performance of three reactive routing protocols (Bellman-Ford, DSR, and WRP) in mobile ad hoc networks under different numbers of nodes. It analyzes the protocols based on four performance metrics: end-to-end delay, packet delivery ratio, drop ratio, and normalized routing load. The document finds that Bellman-Ford and WRP have lower delay than DSR, DSR has a higher delivery ratio and lower drop ratio than the other protocols, and DSR and Bellman-Ford have lower routing overhead than WRP. Increasing the number of nodes generally causes delay and routing overhead to increase, and the packet delivery ratio to decrease.
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAIJITE
Communication in and out the classroom is an essential component for education. As the technology
emerges, there is a need to adopt to the new technologies to enhance students’ learning experience. Social
media technologies provide informal communication methods that promote student engagement and
satisfaction by removing communication barriers. In this paper, we report our experience in using different
social media technologies to enhance students’ learning experience and satisfaction with the course. We
perform our experiment in software project management course and conduct a survey to assess the
students’ perspective towards using these different social media technologies in enhancing their learning
and satisfaction. Results show that students are satisfied and feel that their learning experience has
improved when using social media for class communication.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
EVALUATION OF PROACTIVE, REACTIVE AND HYBRID AD HOC ROUTING PROTOCOL FOR IEEE...cscpconf
This document evaluates the performance of proactive, reactive, and hybrid ad hoc routing protocols (OLSR, AODV, DYMO, ZRP) for IEEE 802.11 MAC and 802.11 DCF in a vehicular ad hoc network (VANET) simulation using Qualnet. It discusses the characteristics and operations of these four routing protocols. The simulation varies VANET parameters like speed and altitude. The results show that in real traffic scenarios, the proactive OLSR protocol performs more efficiently for IEEE 802.11 MAC and DCF compared to the reactive and hybrid protocols.
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.
Quality of service Routing Using Stable Nodes in Mobile Ad hoc Networksijceronline
An efficient and secured routing protocol design is the vital concern for mobile ad hoc networks in view of major problems raising on security issues and loss of the network resources is due to changes within the connections of the network like Node failures, link breakages in the network. Our proposed scheme enhances the secured and reliable transmission of data, which also improves the network constancy, efficient packet delivery ratio and network life time by integrating through the AODV Routing protocol. It unites the authentication, stable routes and signal strength of the nodes to attain the secure and reliable transmission of data through nodes.
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 (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
A study on performance comparison of dymo with aodv and dsrIAEME Publication
This document summarizes and compares the performance of the DYMO, AODV, and DSR routing protocols for mobile ad hoc networks (MANETs). It finds that DYMO has the highest throughput as it avoids expiring good routes by appropriately updating route lifetimes. AODV shows higher throughput than DSR due to avoiding loops and maintaining fresh routes. DSR initially has very high packet loss, but this decreases substantially over time. The document analyzes the protocols based on metrics like throughput, packet loss, end-to-end delay, packet delivery fraction, and routing overhead.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Bandwidth aware on demand multipath routing in manetsijwmn
The document proposes a modification to the AOMDV routing protocol to utilize available bandwidth in MANETs. It describes enhancing AOMDV to select multiple paths during route discovery based on available bandwidth, and using periodic detector packets to monitor bandwidth on alternate paths. Simulation results showed this bandwidth-aware multipath approach improves end-to-end throughput, packet delivery ratio, and end-to-end delay compared to the original AOMDV protocol.
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.t
Performance Comparison of AODV, DSR and LAR1 in Mobile Ad-hoc Network based o...IOSR Journals
Abstract: In the last couple of years, the use of wireless networks has become more and more popular. A
MANET is a collection of self-organizing mobile nodes which is infrastructure less, autonomous, and standalone
networks. Each node in a MANET is free to move independently in any direction and will therefore change its
links to other devices frequently. Each must forward traffic unrelated to its own use and therefore be a router.
Simulation result has been obtained by a performance comparison of three routing protocols i.e. Ad hoc Ondemand
Distance Vector (AODV), Dynamic Source Routing (DSR), Location Aided Routing (LAR1) against
Simulation time. The Result is obtained using QualNet simulator version 6.1. Different protocols are evaluated
based on measures such as Average End to End delay (s), Average Jitter(s), and Packet delivery ratio.
Keywords: MANET, AODV, DSR, LAR1, QualNet 6.1
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.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
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.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
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.
Comparison of routing protocols with performance parameters for different num...ijctet
This document compares the performance of three reactive routing protocols (Bellman-Ford, DSR, and WRP) in mobile ad hoc networks under different numbers of nodes. It analyzes the protocols based on four performance metrics: end-to-end delay, packet delivery ratio, drop ratio, and normalized routing load. The document finds that Bellman-Ford and WRP have lower delay than DSR, DSR has a higher delivery ratio and lower drop ratio than the other protocols, and DSR and Bellman-Ford have lower routing overhead than WRP. Increasing the number of nodes generally causes delay and routing overhead to increase, and the packet delivery ratio to decrease.
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAIJITE
Communication in and out the classroom is an essential component for education. As the technology
emerges, there is a need to adopt to the new technologies to enhance students’ learning experience. Social
media technologies provide informal communication methods that promote student engagement and
satisfaction by removing communication barriers. In this paper, we report our experience in using different
social media technologies to enhance students’ learning experience and satisfaction with the course. We
perform our experiment in software project management course and conduct a survey to assess the
students’ perspective towards using these different social media technologies in enhancing their learning
and satisfaction. Results show that students are satisfied and feel that their learning experience has
improved when using social media for class communication.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVEditor IJMTER
Mobile Ad-hoc networks are a key in the evolution of wireless networks. In mobile
ad hoc networks, there is no centralized infrastructure to monitor or allocate the resources
used by the mobile nodes. The absence of any central coordinator makes the routing a
complex one compared to cellular networks. The Ad hoc On Demand Distance Vector
(AODV) routing algorithm is a routing protocol designed for ad hoc mobile devices. AODV
uses an on demand approach for finding routes .A class of routing protocols called ondemand protocols has recently found attention because of their low routing overhead. The ondemand protocols depend on query floods to discover routes whenever a new route is needed.
Such floods take up a substantial portion of network bandwidth. The routing in Mobile ad hoc
network is difficult and number of reactive routing protocols like AODV, DSR, and DSDV
has been implemented. In this paper, an attempt has been made to thoroughly study all
AODVs and a new AODV is proposed called AR-AODV
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.
This document analyzes the performance of different routing protocols (AODV, DSR, DSDV) under various mobility models (random waypoint, random direction, random walk) and node speeds in mobile ad hoc networks. It finds that reactive protocols like AODV and DSR generally have higher packet delivery ratios than proactive DSDV, but end-to-end delays vary depending on the mobility model and node speed. The document proposes an algorithm to select the best routing protocol based on whether data delivery or time is the higher priority, and whether nodes are stationary or mobile. DSDV is preferred when data delivery is most important, while DSR performs better for time-critical applications.
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in a mobile ad hoc network simulation using the NS-3 simulator. It describes the key characteristics of each protocol and the simulation setup, which involved 50 nodes moving according to a random waypoint model. The performance metric studied was packet delivery ratio. The results showed that OLSR achieved the highest packet delivery ratio, performing better than AODV and DSDV in delivering packets from source to destination nodes over the 600 second simulation.
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...IOSR Journals
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in mobile ad hoc networks based on packet delivery ratio. It simulates the protocols using NS-3 simulator over 600 seconds with 50 nodes moving randomly. The results show that OLSR has the best performance with high and stable packet delivery ratio, while DSDV has the worst performance with many dropped packets. AODV shows average performance throughout the simulation.
Network Surveillance Based Data Transference in Cognitive Radio Network with ...IRJET Journal
The document compares different wireless routing protocols to find the most energy efficient for creating a cognitive radio network model with attacker nodes. It first describes cognitive radio networks and their ability to dynamically access unused radio spectrum. It then summarizes the characteristics of reactive, proactive, and hybrid routing protocols. Reactive protocols determine routes on demand through flooding, while proactive protocols constantly update routing tables. The document analyzes the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR) reactive protocols as well as the destination sequenced distance vector (DSDV) and optimized link state (OLSR) proactive protocols. It aims to compare these protocols and determine the most energy efficient for the cognitive radio network model.
Network Surveillance Based Data Transference in Cognitive Radio Network with ...IRJET Journal
This document compares different wireless routing protocols to find the most energy efficient for creating a cognitive radio network model with attacker nodes. It analyzes reactive, proactive, and hybrid routing protocols including AODV, DSR, DSDV, OLSR, and a hybrid protocol. Simulation results show the hybrid protocol consumes the least energy compared to other protocols, making it well-suited for an energy efficient cognitive radio network model.
This document compares the performance of three mobile ad hoc network (MANET) routing protocols: AODV, FSR, and IERP. It uses the QualNet network simulator to evaluate these protocols based on various metrics like throughput, average jitter, average end-to-end delay, and packet delivery ratio. The protocols are evaluated under different node speeds on a grid topology network with 90 nodes over an area of 1500x1500 meters. Simulation results show that AODV generally performs best in terms of throughput and packet delivery ratio across varying node speeds, while FSR performs worst for these metrics. IERP shows the worst performance for average end-to-end delay and average jitter as node speed increases.
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
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.
Performance Evaluation AODV, DYMO, OLSR and ZRPAD Hoc Routing Protocol for IE...pijans
In VANET high speed is the real characteristics which leads to frequent breakdown, interference etc.
Therefore Performance of adhoc routing protocols is helpful to improve the Quality of Service (QOS). In
this paper we studied various adhoc routing protocols, Reactive, Proactive & Hybrid, taking in to
consideration parameters like speed, altitude, mobility etc in real VANET scenario. The AODV and DYMO
(Reactive), OLSR (Proactive) and ZRP (hybrid) protocols are compared for IEEE 802.11(MAC) and IEEE
802.11(DCF) standard using Qualnet as a Simulation tool. Since IEEE 802.11, covers both physical and
data link layer. Hence performance of the protocols in these layers helps to make a right selection of
Protocol for high speed mobility. Varying parameters of VANET shows that in the real traffic scenarios
proactive protocol performs more efficiently for IEEE 802.11 (MAC) and IEEE 802.11(DCF).
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...IOSR Journals
This document analyzes the performance of the AODV, DSR, and IERP routing protocols in a mobile ad hoc network (MANET) with varying constant bit rate (CBR) traffic loads. It conducts simulations in QualNet 6.1 and evaluates the protocols based on average end-to-end delay, throughput, average jitter, and packet delivery ratio under different CBR values. The results show that AODV generally performs best with low and stable delay, jitter and high throughput and delivery ratio. DSR has better performance than IERP for throughput and delivery ratio. IERP shows the worst performance for delay and jitter as CBR increases. The document concludes by stating AODV is best overall but
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.
This document summarizes an article that proposes improvements to the Ad hoc On-Demand Distance Vector (AODV) routing protocol for use in Vehicular Ad hoc Networks (VANETs). It first provides background on VANETs and discusses different types of routing protocols used in VANETs, including topology-based, position-based, and hybrid protocols. It then focuses on improvements made to the reactive AODV routing protocol, including adding link layer security checks and a method to reduce packet delay called AODV_BD. The goal of these improvements is to create more stable routes and reduce packet delay for safety communications between vehicles.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a study that evaluates the performance of four routing protocols - FSR, STAR-LORA, DYMO, and DSR - in a mobile ad hoc network (MANET) simulation using QualNet. Two scenarios were tested: one with constant bit rate (CBR) client traffic and one with CBR server traffic. Performance metrics like throughput, average end-to-end delay, and average jitter were measured for 2, 4, 6, 8, and 12 nodes. The results showed that reactive protocols DYMO and DSR generally had lower delay but higher jitter than proactive protocols FSR and STAR-LORA. This study aims to help identify the most efficient routing
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
This document analyzes the performance of two on-demand routing protocols (AODV and DSR) in mobile ad hoc networks with varying network sizes up to 50 nodes. It simulates the protocols using the NS-2 network simulator and measures performance metrics like packet delivery fraction, end-to-end delay, normalized routing load, and throughput. The results show that the differences in AODV and DSR protocol mechanics lead to significant variations in performance for different network densities.
This document compares the performance of the AODV and DSR routing protocols under various network conditions through simulation. It finds that AODV performs better than DSR in terms of packet delivery ratio, with fewer packets lost over time. While DSR initially loses more packets, it is able to reduce packet loss over the course of the longer 20-second simulation compared to AODV.
Similar to EFFECT OF PAUSE TIME AND NODES ON PERFORMANCE OF AODV AND DSR ROUTING PROTOCOLS IN WIRELESS AD-HOC NETWORKS (20)
A NEW DATA ENCODER AND DECODER SCHEME FOR NETWORK ON CHIPEditor IJMTER
System-on-chip (soc) based system has so many disadvantages in power-dissipation as
well as clock rate while the data transfer from one system to another system in on-chip. At the same
time, a higher operated system does not support the lower operated bus network for data transfer.
However an alternative scheme is proposed for high speed data transfer. But this scheme is limited to
SOCs. Unlike soc, network-on-chip (NOC) has so many advantages for data transfer. It has a special
feature to transfer the data in on-chip named as transitional encoder. Its operation is based on input
transitions. At the same time it supports systems which are higher operated frequencies. In this
project, a low-power encoding scheme is proposed. The proposed system yields lower dynamic
power dissipation due to the reduction of switching activity and coupling switching activity when
compared to existing system. Even-though many factors which is based on power dissipation, the
dynamic power dissipation is only considerable for reasonable advantage. The proposed system is
synthesized using quartus II 9.1 software. Besides, the proposed system will be extended up to
interlink PE communication with help of routers and PE’s which are performed by various
operations. To implement this system in real NOC’s contains the proposed encoders and decoders for
data transfer with regular traffic scenarios should be considered.
A RESEARCH - DEVELOP AN EFFICIENT ALGORITHM TO RECOGNIZE, SEPARATE AND COUNT ...Editor IJMTER
Coins are important part of our life. We use coins in a places like stores, banks, buses, trains
etc. So it becomes a basic need that coins can be sorted, counted automatically. For this, there is
necessary that the coins can be recognized automatically. Automated Coin Recognition System for the
Indian Coins of Rs. 1, 2, 5 and 10 with the rotation invariance. We have taken images from the both
sides of coin. So this system is capable to recognizing coins from both sides. Features are taken from the
images using techniques as a Hough Transformation, Pattern Averaging etc.
Analysis of VoIP Traffic in WiMAX EnvironmentEditor IJMTER
This document reviews several studies that analyzed the performance of VoIP traffic over WiMAX networks using different VoIP codecs and WiMAX service classes. It summarizes the findings of various papers on how QoS parameters like throughput, delay, jitter compared for codecs like G.711, G.723, G.729 when using the UGS, rtPS, nrtPS and BE service classes. Most studies found that UGS generally performed best for VoIP due to its ability to guarantee bandwidth and minimize jitter and delay, while G.711 typically provided the best voice quality. The document aims to compare the results across different service classes and codecs.
A Hybrid Cloud Approach for Secure Authorized De-DuplicationEditor IJMTER
The cloud backup is used for the personal storage of the people in terms of reducing the
mainlining process and managing the structure and storage space managing process. The challenging
process is the deduplication process in both the local and global backup de-duplications. In the prior
work they only provide the local storage de-duplication or vice versa global storage de-duplication in
terms of improving the storage capacity and the processing time. In this paper, the proposed system
is called as the ALG- Dedupe. It means the Application aware Local-Global Source De-duplication
proposed system to provide the efficient de-duplication process. It can provide the efficient deduplication process with the low system load, shortened backup window, and increased power
efficiency in the user’s personal storage. In the proposed system the large data is partitioned into
smaller part which is called as chunks of data. Here the data may contain the redundancy it will be
avoided before storing into the storage area.
Aging protocols that could incapacitate the InternetEditor IJMTER
The biggest threat to the Internet is the fact that it was never really designed. For e.g., the
BGP protocol is used by Internet routers to exchange information about changes to the Internet's
network topologies. However, it also is among the most fundamentally broken; as Internet routing
information can be poisoned with bogus routing information. Instead, it evolved in fits and start,
thanks to various protocols that have been cobbled together to fulfill the needs of the moment. Few
of protocols from them were designed with security in mind. or if they were sported no more than
was needed to keep out a nosy neighbor, not a malicious attacker. The result is a welter of aging
protocols susceptible to exploit on an Internet scale. Here are six Internet protocols that could stand
to be replaced sooner rather than later or are (mercifully) on the way out.
A Cloud Computing design with Wireless Sensor Networks For Agricultural Appli...Editor IJMTER
1. The document proposes a design for using wireless sensor networks and cloud computing together for agricultural applications. It describes how sensor nodes can collect environmental data and send it to the cloud for storage, analysis and decision making.
2. The proposed system has three main components - a sensing cluster with various sensors to collect data, a cloud service cluster to process and analyze the data, and a mechanism cluster with actuator nodes that can take actions based on the cloud's decisions.
3. Some potential applications discussed are image processing of unhealthy plants, predicting crop diseases based on sensor readings, and automatically controlling the cultivation environment through actuators. The system is aimed to help farmers optimize resources and increase productivity.
A CAR POOLING MODEL WITH CMGV AND CMGNV STOCHASTIC VEHICLE TRAVEL TIMESEditor IJMTER
Carpooling (also car-sharing, ride-sharing, lift-sharing), is the sharing of car journeys so
that more than one person travels in a car. It helps to resolve a variety of problems that continue to
plague urban areas, ranging from energy demands and traffic congestion to environmental pollution.
Most of the existing method used stochastic disturbances arising from variations in vehicle travel
times for carpooling. However it doesn’t deal with the unmet demand with uncertain demand of the
vehicle for car pooling. To deal with this the proposed system uses Chance constrained
formulation/Programming (CCP) approach of the problem with stochastic demand and travel time
parameters, under mild assumptions on the distribution of stochastic parameters; and relates it with a
robust optimization approach. Since real problem sizes can be large, it could be difficult to find
optimal solutions within a reasonable period of time. Therefore solution algorithm using tabu
heuristic solution approach is developed to solve the model. Therefore, we constructed a stochastic
carpooling model that considers the in- fluence of stochastic travel times. The model is formulated as
an integer multiple commodity network flow problem. Since real problem sizes can be large, it could
be difficult to find optimal solutions within a reasonable period of time.
Sustainable Construction With Foam Concrete As A Green Green Building MaterialEditor IJMTER
This document discusses the use of foam concrete as a sustainable building material. Foam concrete is produced using cement, fine sand, water, and aluminium powder, which reacts to produce hydrogen gas bubbles that lighten the concrete. It has benefits like lower carbon dioxide emissions in production than traditional concrete, good thermal and sound insulation, fire resistance, and cost-effectiveness. The document reports on tests showing that foam concrete made with quarry dust has higher compressive strength than that made with sand. Strength generally decreases as aluminium powder content increases. Foam concrete is proposed as a sustainable alternative building material.
USE OF ICT IN EDUCATION ONLINE COMPUTER BASED TESTEditor IJMTER
A good education system is required for overall prosperity of a nation. A tremendous
growth in the education sector had made the administration of education institutions complex. Any
researches reveal that the integration of ICT helps to reduce the complexity and enhance the overall
administration of education. This study has been undertaken to identify the various functional areas
to which ICT is deployed for information administration in education institutions and to find the
current extent of usage of ICT in all these functional areas pertaining to information administration.
The various factors that contribute to these functional areas were identified. A theoretical model was
derived and validated.
Textual Data Partitioning with Relationship and Discriminative AnalysisEditor IJMTER
Data partitioning methods are used to partition the data values with similarity. Similarity
measures are used to estimate transaction relationships. Hierarchical clustering model produces tree
structured results. Partitioned clustering produces results in grid format. Text documents are
unstructured data values with high dimensional attributes. Document clustering group ups unlabeled text
documents into meaningful clusters. Traditional clustering methods require cluster count (K) for the
document grouping process. Clustering accuracy degrades drastically with reference to the unsuitable
cluster count.
Textual data elements are divided into two types’ discriminative words and nondiscriminative
words. Only discriminative words are useful for grouping documents. The involvement of
nondiscriminative words confuses the clustering process and leads to poor clustering solution in return.
A variation inference algorithm is used to infer the document collection structure and partition of
document words at the same time. Dirichlet Process Mixture (DPM) model is used to partition
documents. DPM clustering model uses both the data likelihood and the clustering property of the
Dirichlet Process (DP). Dirichlet Process Mixture Model for Feature Partition (DPMFP) is used to
discover the latent cluster structure based on the DPM model. DPMFP clustering is performed without
requiring the number of clusters as input.
Document labels are used to estimate the discriminative word identification process. Concept
relationships are analyzed with Ontology support. Semantic weight model is used for the document
similarity analysis. The system improves the scalability with the support of labels and concept relations
for dimensionality reduction process.
Testing of Matrices Multiplication Methods on Different ProcessorsEditor IJMTER
There are many algorithms we found for matrices multiplication. Until now it has been
found that complexity of matrix multiplication is O(n3). Though Further research found that this
complexity can be decreased. This paper focus on the algorithm and its complexity of matrices
multiplication methods.
Malware is a worldwide pandemic. It is designed to damage computer systems without
the knowledge of the owner using the system. Software‟s from reputable vendors also contain
malicious code that affects the system or leaks information‟s to remote servers. Malware‟s includes
computer viruses, spyware, dishonest ad-ware, rootkits, Trojans, dialers etc. Malware detectors are
the primary tools in defense against malware. The quality of such a detector is determined by the
techniques it uses. It is therefore imperative that we study malware detection techniques and
understand their strengths and limitations. This survey examines different types of Malware and
malware detection methods.
SURVEY OF TRUST BASED BLUETOOTH AUTHENTICATION FOR MOBILE DEVICEEditor IJMTER
Practical requirements for securely demonstrating identities between two handheld
devices are an important concern. The adversary can inject a Man-In- The-Middle (MITM) attack to
intrude the protocol. Protocols that employ secret keys require the devices to share private
information in advance, in which it is not feasible in the above scenario. Apart from insecurely
typing passwords into handheld devices or comparing long hexadecimal keys displayed on the
devices’ screen, many other human-verifiable protocols have been proposed in the literature to solve
the problem. Unfortunately, most of these schemes are unsalable to more users. Even when there are
only three entities attempt to agree a session key, these protocols need to be rerun for three times.
So, in the existing method a bipartite and a tripartite authentication protocol is presented using a
temporary confidential channel. Besides, further extend the system into a transitive authentication
protocol that allows multiple handheld devices to establish a conference key securely and efficiently.
But this method detects only the outsider attacks. Method does not consider the insider attacks. So,
in the proposed method trust score based method is introduced which computes the trust values for
the nodes and provide the security. The trust score is computed has a positive influence on the
confidence with which an entity conducts transactions with that node. Network the behavior of the
node will be monitored periodically and its trust value is also updated .So depending on the behavior
of the node in the network trust relation will be established between two nodes.
GLAUCOMA is a chronic eye disease that can damage optic nerve. According to WHO It
is the second leading cause of blindness, and is predicted to affect around 80 million people by 2020.
Development of the disease leads to loss of vision, which occurs increasingly over a long period of
time. As the symptoms only occur when the disease is quite advanced so that glaucoma is called the
silent thief of sight. Glaucoma cannot be cured, but its development can be slowed down by
treatment. Therefore, detecting glaucoma in time is critical. However, many glaucoma patients are
unaware of the disease until it has reached its advanced stage. In this paper, some manual and
automatic methods are discussed to detect glaucoma. Manual analysis of the eye is time consuming
and the accuracy of the parameter measurements also varies with different clinicians. To overcome
these problems with manual analysis, the objective of this survey is to introduce a method to
automatically analyze the ultrasound images of the eye. Automatic analysis of this disease is much
more effective than manual analysis.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
Step up DC-DC Impedance source network based PMDC Motor DriveEditor IJMTER
This paper is devoted to the Quasi Z source network based DC Drive. The cascaded
(two-stage) Quasi Z Source network could be derived by the adding of one diode, one inductor,
and two capacitors to the traditional quasi-Z-source inverter The proposed cascaded qZSI inherits all
the advantages of the traditional solution (voltage boost and buck functions in a single stage,
continuous input current, and improved reliability). Moreover, as compared to the conventional qZSI,
the proposed solution reduces the shoot-through duty cycle by over 30% at the same voltage boost
factor. Theoretical analysis of the two-stage qZSI in the shoot-through and non-shoot-through
operating modes is described. The proposed and traditional qZSI-networks are compared. A
prototype of a Quasi Z Source network based DC Drive was built to verify the theoretical
assumptions. The experimental results are presented and analyzed.
SPIRITUAL PERSPECTIVE OF AUROBINDO GHOSH’S PHILOSOPHY IN TODAY’S EDUCATIONEditor IJMTER
The paper reflects the spiritual philosophy of Aurobindo Ghosh which is helpful in today’s
education. In 19th century he wrote about spirituality, in accordance with that it is a core and vital part
of today’s education. It is very much essential for today’s kid. Here I propose the overview of that
philosophy.At the utmost regeneration of those values in today’s generation is the great deal with
education system. To develop the values and spiritual education in the youngers is the great moto of
mine. It is the materialistic world and without value redefinition among them is the harder task but not
difficult.
Software Quality Analysis Using Mutation Testing SchemeEditor IJMTER
The software test coverage is used measure the safety measures. The safety critical analysis is
carried out for the source code designed in Java language. Testing provides a primary means for
assuring software in safety-critical systems. To demonstrate, particularly to a certification authority, that
sufficient testing has been performed, it is necessary to achieve the test coverage levels recommended or
mandated by safety standards and industry guidelines. Mutation testing provides an alternative or
complementary method of measuring test sufficiency, but has not been widely adopted in the safetycritical industry. The system provides an empirical evaluation of the application of mutation testing to
airborne software systems which have already satisfied the coverage requirements for certification.
The system mutation testing to safety-critical software developed using high-integrity subsets of
C and Ada, identify the most effective mutant types and analyze the root causes of failures in test cases.
Mutation testing could be effective where traditional structural coverage analysis and manual peer
review have failed. They also show that several testing issues have origins beyond the test activity and
this suggests improvements to the requirements definition and coding process. The system also
examines the relationship between program characteristics and mutation survival and considers how
program size can provide a means for targeting test areas most likely to have dormant faults. Industry
feedback is also provided, particularly on how mutation testing can be integrated into a typical
verification life cycle of airborne software. The system also covers the safety and criticality levels of
Java source code.
Software Defect Prediction Using Local and Global AnalysisEditor IJMTER
The software defect factors are used to measure the quality of the software. The software
effort estimation is used to measure the effort required for the software development process. The defect
factor makes an impact on the software development effort. Software development and cost factors are
also decided with reference to the defect and effort factors. The software defects are predicted with
reference to the module information. Module link information are used in the effort estimation process.
Data mining techniques are used in the software analysis process. Clustering techniques are used
in the property grouping process. Rule mining methods are used to learn rules from clustered data
values. The “WHERE” clustering scheme and “WHICH” rule mining scheme are used in the defect
prediction and effort estimation process. The system uses the module information for the defect
prediction and effort estimation process.
The proposed system is designed to improve the defect prediction and effort estimation process.
The Single Objective Genetic Algorithm (SOGA) is used in the clustering process. The rule learning
operations are carried out sing the Apriori algorithm. The system improves the cluster accuracy levels.
The defect prediction and effort estimation accuracy is also improved by the system. The system is
developed using the Java language and Oracle relation database environment.
Software Cost Estimation Using Clustering and Ranking SchemeEditor IJMTER
Software cost estimation is an important task in the software design and development process.
Planning and budgeting tasks are carried out with reference to the software cost values. A variety of
software properties are used in the cost estimation process. Hardware, products, technology and
methodology factors are used in the cost estimation process. The software cost estimation quality is
measured with reference to the accuracy levels.
Software cost estimation is carried out using three types of techniques. They are regression based
model, anology based model and machine learning model. Each model has a set of technique for the
software cost estimation process. 11 cost estimation techniques fewer than 3 different categories are
used in the system. The Attribute Relational File Format (ARFF) is used maintain the software product
property values. The ARFF file is used as the main input for the system.
The proposed system is designed to perform the clustering and ranking of software cost
estimation methods. Non overlapped clustering technique is enhanced with optimal centroid estimation
mechanism. The system improves the clustering and ranking process accuracy. The system produces
efficient ranking results on software cost estimation methods.
Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...Transcat
Join us for this solutions-based webinar on the tools and techniques for commissioning and maintaining PV Systems. In this session, we'll review the process of building and maintaining a solar array, starting with installation and commissioning, then reviewing operations and maintenance of the system. This course will review insulation resistance testing, I-V curve testing, earth-bond continuity, ground resistance testing, performance tests, visual inspections, ground and arc fault testing procedures, and power quality analysis.
Fluke Solar Application Specialist Will White is presenting on this engaging topic:
Will has worked in the renewable energy industry since 2005, first as an installer for a small east coast solar integrator before adding sales, design, and project management to his skillset. In 2022, Will joined Fluke as a solar application specialist, where he supports their renewable energy testing equipment like IV-curve tracers, electrical meters, and thermal imaging cameras. Experienced in wind power, solar thermal, energy storage, and all scales of PV, Will has primarily focused on residential and small commercial systems. He is passionate about implementing high-quality, code-compliant installation techniques.
Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELijaia
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Software Engineering and Project Management - Software Testing + Agile Method...Prakhyath Rai
Software Testing: A Strategic Approach to Software Testing, Strategic Issues, Test Strategies for Conventional Software, Test Strategies for Object -Oriented Software, Validation Testing, System Testing, The Art of Debugging.
Agile Methodology: Before Agile – Waterfall, Agile Development.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Prediction of Electrical Energy Efficiency Using Information on Consumer's Ac...PriyankaKilaniya
Energy efficiency has been important since the latter part of the last century. The main object of this survey is to determine the energy efficiency knowledge among consumers. Two separate districts in Bangladesh are selected to conduct the survey on households and showrooms about the energy and seller also. The survey uses the data to find some regression equations from which it is easy to predict energy efficiency knowledge. The data is analyzed and calculated based on five important criteria. The initial target was to find some factors that help predict a person's energy efficiency knowledge. From the survey, it is found that the energy efficiency awareness among the people of our country is very low. Relationships between household energy use behaviors are estimated using a unique dataset of about 40 households and 20 showrooms in Bangladesh's Chapainawabganj and Bagerhat districts. Knowledge of energy consumption and energy efficiency technology options is found to be associated with household use of energy conservation practices. Household characteristics also influence household energy use behavior. Younger household cohorts are more likely to adopt energy-efficient technologies and energy conservation practices and place primary importance on energy saving for environmental reasons. Education also influences attitudes toward energy conservation in Bangladesh. Low-education households indicate they primarily save electricity for the environment while high-education households indicate they are motivated by environmental concerns.
Digital Twins Computer Networking Paper Presentation.pptxaryanpankaj78
A Digital Twin in computer networking is a virtual representation of a physical network, used to simulate, analyze, and optimize network performance and reliability. It leverages real-time data to enhance network management, predict issues, and improve decision-making processes.
Home security is of paramount importance in today's world, where we rely more on technology, home
security is crucial. Using technology to make homes safer and easier to control from anywhere is
important. Home security is important for the occupant’s safety. In this paper, we came up with a low cost,
AI based model home security system. The system has a user-friendly interface, allowing users to start
model training and face detection with simple keyboard commands. Our goal is to introduce an innovative
home security system using facial recognition technology. Unlike traditional systems, this system trains
and saves images of friends and family members. The system scans this folder to recognize familiar faces
and provides real-time monitoring. If an unfamiliar face is detected, it promptly sends an email alert,
ensuring a proactive response to potential security threats.
EFFECT OF PAUSE TIME AND NODES ON PERFORMANCE OF AODV AND DSR ROUTING PROTOCOLS IN WIRELESS AD-HOC NETWORKS
1. Scientific Journal Impact Factor (SJIF): 1.711
International Journal of Modern Trends in Engineering and
Research
www.ijmter.com
@IJMTER-2014, All rights Reserved 61
e-ISSN: 2349-9745
p-ISSN: 2393-8161
EFFECT OF PAUSE TIME AND NODES ON PERFORMANCE OF
AODV AND DSR ROUTING PROTOCOLS IN WIRELESS AD-HOC
NETWORKS
1
Pankaj Kumar Varshney, 2
G.S.Agrawal, 3
Sudhir Kumar Sharma
1, 2
Institute of Computer Applications, Mangalayatan University, Beswan, Aligarh-U.P. (India)
3
School of Engineering, Jaipur National University, Jaipur-Raj. (India)
_____________________________________________________________________________________________
Abstract: A central challenge in designing of wireless ad hoc networks is the development of dynamic
routing protocols that can efficiently find routes between two communication nodes when nodes are
mobile. To accomplish this, a number of ad hoc routing protocols had been proposed and implemented.
In wireless ad hoc network the selected protocol should find best route which can insure packet delivery
and packet integrity. Performance evolution of the protocols is the key step before selecting a particular
protocol. In this paper, the performance is compared on Ad hoc On-demand Distance Vector (AODV)
and Dynamic Source Routing (DSR) at application layer by varying the pause time and number of nodes
using QualNet 5.0.2 simulator. The average jitter, end-to-end delay, throughput and packet delivery
fraction (PDF) are the four common measures used for the comparison of the performance of above
protocols. The experimental results show that DSR perform better in low load and high pause time but
in case of high load and less pause time AODV outperform DSR.
Keywords: Average jitter, End-to-End delay, Packet delivery fraction, QualNet 5.0.2 Simulator, Routing
protocols, Throughput and Wireless Adhoc Network.
_________________________________________________________________________________________________________________
I. INTRODUCTION
Wireless ad hoc networks are collection of wireless nodes sharing a wireless channel without any base
station or centralized control. These nodes can act as a router as well as both end system. It has flexible
network architecture. There are variable routing paths to provide communication in case of limited
wireless connectivity range and resources constraints. Due to the rapidly changing the topology, routing
in wireless ad hoc networks can be challengeable task. A considerable amount of research has been done
in this area, and number of routing protocols have been developed [2, 3]. Most of these protocols such as
AODV, DSR, and DSDV use best effort to find out the routes. Routing protocol is the way to deliver the
message from source to the precise destination. Routing protocols can be categorized as proactive routing
protocol also known as table driven routing protocols and reactive routing protocols also known as on
demand routing protocol [4, 5]. Each of these types of protocols may behave differently on different
wireless scenarios. Hence, the performance evolution is main issue to know its behaviour in wireless
environment. The main objective of this paper to study the effects on characteristics of AODV and DSR
reactive routing protocols on varying the network load and pause time in the proposed scenarios shown in
2. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 62
table 1. We emphasized on the four major performance matrices i.e. average jitter, average end-to-end
delay, throughput, and packet delivery fraction for comparison of performance of AODV and DSR
protocols. The rest of the paper is organized as follows. Section 2 gives the brief idea of DSR and AODV
routing protocols used for performance evolution. Section 3 we present literature review. Section 4
describes the methodology and performance metrics. Section 5 discussions the simulation results. Section
6 gives the conclusion of the experimental results.
II. AD HOC NETWORK ROUTING PROTOCOLS
Routing protocol can be reactive and proactive. In Reactive or on-demand routing is a source initiative
routing protocols. All possible routing routes are only discovered when they are actually demanded by
source nodes. The reactive routing protocols have two major components i.e. route discovery and route
maintenance [6-9].
Route discovery: It is required when any source node desires to send a message to the destination; it first
looks at its route cache. If the required route is available in cache, the source node puts all the address of
the nodes for the path to destination in the header. If route is not present, source node initiate a route
discovery process through the broadcasts the packet having the destination address and the address of
intermediate nodes to the destination.
Route maintenance: Due to mobility of nodes, the nodes change their topology and hence route
maintenance is done through the use of acknowledgement.
In proactive routing protocols each node maintains its routing table. Tables are containing routing
information to every other node in the network. Since, the nodes are mobile, so they require updating
throughout the network periodically whenever change occurs.
2.1 AD HOC ON-DEMAND DISTANCE VECTOR ROUTING (AODV):
AODV is a reactive routing protocol, which is basically improvement of DSDV proactive routing
protocol. It minimizes the number of broadcasts by creating routes based on demand, which is not in the
case of DSDV. When any source node wants to send a packet to a destination, it broadcasts a route
request (RREQ) packet. The neighbouring nodes in turn broadcast the packet to their neighbours and the
process continues until the packet reaches the destination. During the process of forwarding the route
request, intermediate nodes record the address of the neighbour from which the first copy of the broadcast
packet is received. This record is stored in their route tables, which helps for establishing a reverse path.
If additional copies of the same RREQ are later received, these packets are discarded. The reply is sent
using the reverse path. If any intermediate node moves within a particular route, the neighbour of the
drifted node can detect the link failure and sends a link failure notification to its upstream neighbour. This
process continues until the failure notification reaches the source node. Based on the received
information, the source might decide to re-initiate the route discovery phase.
2.2 DYNAMIC SOURCE ROUTING (DSR):
DSR is a reactive protocol based on the source route approach. DSR allows the network to be self-
organizing without the need for any fixed network infrastructure or administration. Dynamic Source
Routing (DSR), the protocol is based on the link state algorithm in which source initiates route discovery
on demand basis. The sender determines the route from source to destination and it includes the address
of intermediate nodes to the route record in the packet. DSR was designed for multi hop networks for
small diameters.
3. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 63
III. LITERATURE REVIEW
During last few years’ lot of research work had been done in the area of wireless ad hoc network to
compare the performance of the popular routing protocols such as AODV and DSR on the basis of
different parametric matrices like Throughput, Average end-to-end delay, Average jitter, Packet delivery
fraction etc. Researchers had studied about performance of routing protocols in wireless ad hoc network
for different scenarios [10-20]. In [10], the author observed that when increase the pause time DSR
outperforms AODV in terms of packet delivery ratio. In that study, they have observed that DSR
performs better in both the case of packet delivery fraction and throughput over DSDV routing protocol
on varying the nodes [11]. It was seen that proactive routing protocol OLSR performed better than the
reactive routing protocols AODV, DSR and TORA for medium size MANETs [12]. In [13] researchers
analysed that in low mobility DSR are perform well but in case of high mobility AODV is better
performed over DSR. In [14], researcher mentions in result that the DSR shows best performance than
AODV, FSR and ZRP in terms of packet delivery ratio and throughput as a function of pause time. FSR
show lowest end-to-end delay and ZRP has less average jittering than DSR, AODV and FSR. DSR and
AODV performed the worst in case of average jitter and ZRP performed the worst in case of throughput.
The authors [15], conducted a comparative study for AODV and DSR, and indicated that the AODV
gives better PDF then DSR, while DSR gives better routing overhead and End- to- End delay in most
mobility scenarios. In DSR [16] performs better than AODV and WRP in terms of packet delivery ratio
and throughput when increase the pause time. In [17], that study, at low network load AODV performs
better in case of packet delivery fraction but it performs badly in terms of average end-end delay, routing
load and routing packets. At high network load and mobility OLSR performs well with respect to packet
delivery fraction. In that study authors [18], simulation results show that amongst all the protocols,
AODV has a stable End to End Delay despite mobility as it has the feature of On-Demand Routing
protocol and also maintains a Routing table. In [19], authors show that EAODV improves the
performance of AODV in most metrics, as the end to end delay, packet delivery fraction, average
throughput and packet loss especially in high data rate. Authors observed [20], that DSR and DSDV have
low and stable routing overhead as comparison to AODV that varies a lot. Avg. End to End delay of
DSDV is very high for pause time 0 but it starts decreasing as pause time increases.
IV. METHODOLOGY AND PERFORMANCE MATRICES
4.1. SIMULATION SETUP
The Our aim of this simulation study is to analyze the performance of AODV and DSR wireless ad hoc
routing protocol on the basis of varying nodes and pause time. The simulations have been performed
using QualNet version 5.0.2, software that provides scalable simulations of wireless ad hoc networks. The
simulation has carryout in terrine dimensions 500X500 with 100 nodes placed randomly and duration
fixed 100 sec for each of simulation. The nodes moved following the random waypoint mobility model
with 2 seed value and minimum and maximum speed of nodes are 2 and 20 metres per second
respectively. The MAC protocol is used the IEEE 802.11b with the 2.4 GHz channel frequency. The
nodes have application run on CBR (constant bit rate) traffic. We are taking 512 bytes size for the each
packet to send the 10,000 packets in the said environment with the interval of 50 milliseconds.
4. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 64
Table 1
Simulator Parameters
MAC Layer Protocol 802.11
Routing Protocols AODV, DSR
Traffic Type Constant bit rate (CBR)
Mobility Model Random Way Point
Radio Type 802.11 b Radio
Channel Frequency 2.4 GHz
Interval 50 m/s
Start Time 50 m/s
End Time 0 m/s
1. Scenario Parameters(Varying Number of Nodes)
Packet size 512
Item to be send 10000
Number of Nodes 10,30,50,70,90,100
Node Placement Random
Terrine Dimensions 500 X 500
Seed value 2
Simulation time 100 sec
Number of CBR 5
Pause Time 30 sec
Maximum Speed 20 m/s
Minimum Speed 2 m/s
Performance Matrices in Application Layer PDF, Average Jitter, Average End-to-End Delay,
Throughput
2. Scenario Parameters(Varying Pause Time)
Packet size 512
Item to be send 10000
Number of Nodes 100
Node Placement Random
Terrine Dimensions 500 X 500
Seed value 2
5. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 65
Simulation time 100 sec
Number of CBR 5
Pause Time 10 ,20,30,40,50sec
Maximum Speed 20 m/s
Minimum Speed 2 m/s
Performance Matrices in Application Layer PDF, Average Jitter, Average End-to-End Delay,
Throughput
4.2. PERFORMANCE MATRICES
To analyze the performance of routing protocols, metrics are needed. So, we use four different metrics to
compare the performance. They are:
Average Jitter: It is the variation in the time between packets arriving. Jitter is commonly used as an
indicator of consistency and stability of a network.
Throughput: Throughput is the number of packet that is passing through the channel in a particular unit
of time.
Average End-to-End Delay: End-to-end delay indicates how long it took for a packet to travel from the
source to the application layer of the destination.
Packet Delivery Fraction: The fraction of packets sent by the application that are received by the
receivers.
V. RESULTS AND DISCUSSION
In this paper the performance evaluation is carried out in wireless ad hoc network by varying two
parameters i.e. number of nodes and pause time while keeping other parameters fixed. AODV and DSR
protocols are considered for the analysis purpose.
Fig. 1(a): Comparison of AODV and DSR Protocols with respect to Nodes Vs Average Jitter in Application Layer.
10 30 50 70 90 100
AODV 0.00595467 0.0064117 0.00827641 0.00670838 0.00656872 0.0068889
DSR 0.00655302 0.00709 0.0288502 0.00755452 0.00756693 0.0154896
0
0.01
0.02
0.03
0.04
Nodes Vs Average Jitter
6. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 66
Fig. 1(b): Comparison of AODV and DSR Protocols with respect to Nodes Vs Throughput in Application Layer
Fig. 1(c): Comparison of AODV and DSR Protocols with respect to Nodes Vs Average End – to-End Delay in Application
Layer.
Table 2
Comparison of AODV and DSR Protocols with respect to PDF in Application Layer on the basis
of varying nodes.
AODV DSR
Nodes Packet Received Packet Send Nodes Packet Received
Packet
Send
10 1992.2 1999 10 1995.4 1999
30 1988.2 1999 30 1992.6 1999
50 1961.6 1999 50 1791.6 1999
70 1991.6 1999 70 1984.2 1999
90 1989 1999 90 1967.2 1999
100 1986.6 1999 100 1884.8 1999
11909.2 11994 11615.8 11994
PDF= 99.29297982 PDF= 96.84675671
5.1. NETWORK LOAD ANALYSIS:
In this analysis the number of nodes varied as 10, 30, 50, 70, 90, and 100 where as the pause time, terrain
dimension and simulation time are fixed at 30s, 500X500 and 100s respectively with 5 random CBR.
The performance plots i.e. Number of nodes Vs Average jitter, Number of nodes Vs Throughput, Number
of nodes Vs Average End-to-End delay, and Numbers of nodes Vs Packet delivery fraction is shown fig
1(a), (b), (c), and table 2 respectively. In terms of average jitter the DSR and AODV have slightly
differed up to 10 to 30 nodes but as increase the nodes the average jitter value of DSR is high as
compared to AODV. But it is not fixed; vary as increase the number of nodes. From fig 1(b) the
throughput of DSR is better than AODV up to 10 to 30 nodes but as increase number of nodes throughput
is better in case of AODV than DSR. So we are observed that AODV outperform the DSR when the
network load is high. Similarly the average end-to-end delay of DSR and AODV is likely similar up to 10
10 30 50 70 90 100
AODV 81662.2 81498.2 80449.2 81631.4 81525.4 81449.2
DSR 81838.6 81777.6 73676.8 81406.2 80717.6 77512
65000
70000
75000
80000
85000
Nodes Vs Throughput
10 30 50 70 90 100
AODV 0.0124669 0.0138207 0.0180919 0.0139813 0.0143166 0.0137643
DSR 0.0155418 0.0159059 0.914536 0.041726 0.0156589 0.47567
0
0.5
1
Nodes Vs Average End-to-End Delay
7. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 67
to 30 nodes. But as increase the number of nodes the average end-to-end is greater in case of DSR than
AODV shown in fig 1(c). The PDF calculated value of AODV and DSR is 99.29297982 and
96.84675671 respectively as shown in table 2. According to the result the PDF value of AODV is greater
than DSR as increase the network loads.
Fig. 2(a): Comparison of AODV and DSR Protocols with respect to Pause Time Vs Average Jitter in Application Layer
Fig. 2(b): Comparison of AODV and DSR Protocols with respect to Pause Time Vs Throughput in Application Layer
Fig. 2(c): Comparison of AODV and DSR Protocols with respect to Pause Time Vs Average End – to-End Delay in
Application Layer
Table 3
Comparison of AODV and DSR Protocols with respect to PDF in Application Layer on the basis
of varying pause times.
10 20 30 40 50
AODV 0.0068889 0.00610351 0.0061824 0.00843398 0.00601519
DSR 0.0154896 0.00686299 0.0075451 0.00930424 0.00657086
0
0.005
0.01
0.015
0.02
Pause Time Vs Average Jitter
10 20 30 40 50
AODV 81449.2 81706 81674.4 80376.2 81503.6
DSR 77512 82017 81557.8 81484.8 81445.4
74000
76000
78000
80000
82000
84000
Pause Time Vs Throughput
10 20 30 40 50
AODV 0.0137643 0.0118307 0.0133239 0.0182973 0.0111597
DSR 0.47567 0.0170689 0.0632807 0.0237423 0.0174015
0
0.1
0.2
0.3
0.4
0.5
Pause Time Vs Average End to End
8. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 68
AODV DSR
Pause Time Packet Received Packet Send Pause Time Packet Received Packet Send
10 1986.6 1999 10 1884.8 1999
20 1993.4 1999 20 1993.6 1999
30 1992.4 1999 30 1988.2 1999
40 1961 1999 40 1983.2 1999
50 1988 1999 50 1980.4 1999
PDF= 99.26363182 PDF= 98.35117559
5.2. PAUSE TIME ANALYSIS:
In simulation we considered the following pause times: 10s, 20s, 30s, 40s, and 50s with minimum and
maximum speed of nodes is 2s and 20s respectively. And the number of nodes is fixed at 100 for each
scenario of different pause time keeping all other parameters constant. The performance plots i.e. Pause
time Vs Average jitter, Pause time Vs Throughput, Pause time Vs Average End-to-End delay, and Pause
time Vs Packet delivery fraction is shown fig 2(a), (b), (c), and table 3 respectively. In terms of average
jitter when pause time (0-10 m/s) DSR has higher average jitter as compare to AODV but as increase the
pause time the average jitter of DSR is decreases but higher than AODV shown in fig 2(a). As shown in
fig 2(b) in case of throughput the DSR is better performing as compare to AODV when as increase the
pause time. But when the pause time less then 20m/s the AODV protocol is much better perform as
compare to DSR. According to result shown in fig 2(c) average end-to-end Delay of reactive routing
protocol DSR is higher than AODV at 10 m/s pause time. When as increase the pause time the average
end-to-end delay is decrease for DSR but it is not fixed for particular range. Similarly the packet delivery
fraction value on varying the pause time as shown in table 3 of AODV is better as compare to DSR
protocol. The calculated PDF value for AODV is 99.26363182 and 98.35117559 for DSR.
VI. CONCLUSION
This paper compares the performance of two reactive routing protocols according to the four performance
matrices i.e. Throughput, Average Jitter, Average End-to-End Delay, and Packet Delivery Fraction (PDF)
on the basis of varying the number of nodes and pause times respectively. In considered mobility
scenarios, AODV gives better PDF, Throughput and less average end-to-end delay, and average jitter than
DSR in high load of the nodes and less pause time. In low load DSR are perform better than AODV
routing protocol.
ACKNOWLEDGEMENTS
One of the authors P.K.V. thanks to Prof. Vijaya, Dr. Arun Prakash, Dr. Y.K.Prajapati, and Mr.
Maneesh Gupta ECE Deptt. MNNIT, Allahabad U.P. (India), for their kind support to perform the
simulation scenario on the QualNet 5.0.2 Simulator.
REFERENCES
10. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 70
[19]. Saini G.L., Panwar D.,and, Singh V.,” Modeling, Implementation and Performance investigation of Efficient-AODV Routing
Protocol in MANET using Data Rate”, International Journal of Enhanced Research in Science Technology &
Engineering,Vol. 3 Issue 1, 2014, pp. 76-82.
[20]. Lego K., Singh P.K., and Sutradhar D.,” Comparative Study of Adhoc Routing Protocol AODV,DSR and DSDV in Mobile
Adhoc NETwork” ,Indian Journal of Computer Science and Engineering ,Vol. 1, Issue 4, 2010. pp. 364-371.