SlideShare una empresa de Scribd logo
1 de 42
Descargar para leer sin conexión
An alternative Routing Mechanisms for Mobile
Ad-hoc Networks
Awos Khazal Ali
Supervisor
Dr. Shukor abd. Razak
Faculty of Computer Science & Information
Systems
Universiti Teknologi Malaysia
An alternative Routing Mechanisms for Mobile Ad-hoc NetworksPresentation2
Outlines
 Introduction
 Problem background
 Problem Statement
 Project Objectives
 Project scopes
 METHODOLOGY
- Operational Framework
 Results & Discussion
 Conclusion
 Future work
Introduction
 There are two kinds of mobile
wireless networks.
 The first is known as
infrastructure network, with
mobile nodes and base station.
 The base station is responsible
for routing, security and all
issues in this kind of network.
 The second type of mobile wireless network is the
infrastructure-less mobile network, commonly known as
the mobile ad-hoc network (MANET).
 ad-hoc network are collections of mobile nodes,
dynamically forming a temporary network without pre-
existing network infrastructure or centralized base station.
 These nodes can be arbitrarily located and are free to
move randomly at any given time.
 Network topology is changing because of node’s moving.
 Ad-hoc networks is self-
organizing and self-configuring
“multi-hop” network.
 ad-hoc does not require any
fixed infrastructure such as
transceiver base stations or
even cables. This figure
illustrates an example of ad-hoc
network with four nodes
 Ad-hoc networks are suited for use in situations where
infrastructure is either not available, not trusted, or should
not be relied on in times of emergency.
 few examples for ad-hoc networks: military solders and
equipments in the battlefield ("open environment"), sensor
networks for various research purposes, emergency rescue
after an earthquake or flood, and temporary offices,
conference or meeting in such company ("close or limited
environment").
Problem background
 The concept of routing can be described as the process of path
finding.
 In (MANETs) the main problem in routing mechanism, is how
to send a packet from one node to another when there is no
direct link exist between source and destination nodes.
 Routing in ad-hoc networks has always been a challenging
task.
 The major reason for this is because of the characteristics of
MANET itself that consists of high degree of node mobility,
limited bandwidth, variable capacity links, energy-constrained
operation, limited physical security.
 There are several techniques that have been proposed so
far and all of them have their own advantages and
limitations.
 Each technique tries to determine the optimal path for
packets delivery from source to destination nodes in
reliable and fast manner.
 Some of the proposed routing mechanisms are suitable to
be used in various MANET environments (i.e. open,
localized, and organized environments), while some others
are only suitable to be deployed in a specific environment.
Problem Statement
 Routing is one of the most important open issues in
MANET research.
 The problem of routing can be divided into two areas:
route discovery and route maintenance.
 The high mobility, low bandwidth, and limited computing
capability characteristics of mobile hosts make the design
of routing protocols very challenging.
 The protocols must be able to keep up with unpredictable
changes in network topology with as minimal message
exchanges as possible and in the most efficient way.
 This project proposes an alternative solution for ad-hoc
network routing mechanism which aims to improve the
reliability of the path chosen between source and
destination nodes.
Project Objectives
 This project had accomplished the following objectives:
1- Investigate existing routing mechanisms in MANET
environment.
2- Propose an alternative routing mechanism based upon
existing schemes.
3- To analyze the performance of the proposed mechanism
compared to the existing schemes.
Project scopes
 The scope of this project is as follow.
 The investigation of existing MANET’s routing
mechanisms is focusing upon open environment.
 The proposed routing mechanism will focus upon the
route discovery performance not on the security issues.
 The analyses of the proposed routing mechanism will be
conducted in simulation experiments .
METHODOLOGY
 Project Structure
- Introduction for ad-hoc networks.
- Defining the problem background.
- Determining the problem statement.
- Scopes of project.
 This study start by, Data collecting and analysis existing
routing protocols.
 Then, a new routing protocol (Hybrid), for mobile ad-hoc
network (MANET) was proposed.
 Simulate the new routing protocol using Network Simulator
2 (NS2) in order to evaluate the performance.
 Finally, is compared the performance of new routing
protocol with previous protocols to see the differences
between them. The following figure illustrates the project
structure.
Project Structure Steps
Problem Definition
Data collection and
analysis
Simulate the new protocol
(NS2)
Findings and Result
Propose New routing
Protocol
Operational Framework
Project Operational Framework
 Initial Study covered mobile ad-hoc network (MANET)
sequentially to define the problem statement through
deferent altitudes.
 Reviewed Related Literature, the main related work for
routing in mobile ad-hoc network was reviewed from
books, journals, and some Internet articles. Reviewing was
focused on ad-hoc routing protocols.
 Propose New Routing Protocol, based on previous
protocols had been done.
 Simulation, The new proposed routing protocol was
simulated to present the performance of the overall system.
The simulation was done using, Network Simulator 2
(NS2) tools.
 Comparison, Results of this project are measured by
comparing the performance of new ad-hoc routing protocol
that proposed in this study, and previous routing protocols;
to see the differences between these protocols.
 The following flowchart illustrates the research
methodology steps for this study.
Research Methodology Steps
Results & Discussion
 Simulation was done by using
network simulator 2 (NS2), v
2.30. the following Table
illustrates the simulation setup.
Simulation parameter Value
Channel type Wireless Channel
MAC type 802.11
Link layer type Traditional Link Layer (LL)
Antenna model Omni-directional (unity
gain)
No. of nodes 50
No. of sending nodes 1
No. of receive nodes 1
Simulation time 300 Sec
Size of simulation area 800m x 800m
Initial Power level 104000 watt
Power consumption /packet 228.0 joules
 AODV, DSDV, and Hybrid (proposed protocol) were
implemented under same scenario.
 50 wireless nodes.
 The nodes are placed randomly within an 800m x 800m
simulation area.
 The mobility model used was the random waypoint
model.
 The simulation time is set to 300s.
 The initial battery energy = 104000 watt.
 Power consumption 228 joules for each
send/receive/forward packet from node to node.
 Drop rate: The ratio of lost TCP DATA packets over sent
TCP DATA packets.
 Lost rate: Packet loss is the failure of one or more
transmitted packets to arrive at their destination.
 Packets generation.
 End –to-end delay: the average delay time of all
successfully delivered packets from source node to
destination.
Metrics
Results
 AODV:
No. of dropped packets = 117 packets.
 No. of packets
generations = 26875
packets.
 No. of lost packets =
30 packets.
AODV:
 No. of dropped packets = 149 packets.
DSDV:
DSDV:
 No. of packets
generations = 20598
packets.
 No. of lost packets = 37
packets.
Hybrid:
 No. of dropped packets = 102 packets.
 No. of packets
generations = 28507
packets.
 No. of lost packets = 24
packets.
Hybrid:
End-to End Delay:
 DSDV has the lowest ratio in
average of delay of delivering
packets to destination node.
 While AODV shows the higher
delay during simulation because;
when mobility is high, more
packets may travel over non-
optimal routes with larger hop
counts.
 Hybrid approach gives better
performance in terms of end-to-end
delay than AODV (reactive).
AODV vs. DSDV
 DSDV perform badly at high mobility pattern, because
DSDV cannot maintain its routing table update process
with high topology changes.
 In terms end-to-end delay, DSDV have very low delay
compare with AODV
 AODV suffer from long delay, which effect badly on
routing performance.
 AODV manages the packets generation rate better than
DSDV. The number of packets generating by AODV is
26875 packets, when DSDV generate 20598 packets only.
 the rate of loss packets by DSDV is greater than loss rate
by AODV. The number of loss packets in DSDV is 37
packets, when number of loss packets by AODV is 30
packets.
 AODV has a better drop packet ratio compare with DSDV.
The number of packets that dropped during simulation
time by using AODV is 117 packets; while the number of
packet that dropped using DSDV is 149 packets.
AODV vs. DSDV
Hybrid vs. AODV
 in terms of drop packet rate. The number of dropped
packets by AODV is 117 packets, while in hybrid
approach its 102 packets only.
 The number of packets that were generated by AODV is
26875, while in hybrid, the number of packets generation
was 28507 packets.
 In terms of packet loss hybrid approach has a better rate
compare with AODV. The number of lost packets in
hybrid is 24 packets and in AODV is 30 packets.
 the average of end-to-end delay in AODV is much higher
than hybrid
Hybrid vs. DSDV
 the hybrids approach perform well in high mobility model
unlike DSDV.
 the number of dropped packets by DSDV during
simulation is 149 packets, when in hybrid it just 102
packets.
 the number of generating packets, it can be easily seen that
hybrid approach perform better than DSDV.
 The number of generating packets by hybrid is 28507
packets, while DSDV generate 20598 packets only.
 DSDV loss 37 packets during simulation, on the other
hand hybrid approach shows a good performance with loss
packets rate, hybrid just loss 24 packets.
 The average end-to-end delay, DSDV shows a good delay
ratio compare with hybrid approach.
Hybrid vs. DSDV
Hybrid Performance
 Hybrid protocol contains two sub protocols, one of them
act proactively (DSDV) and the other one act reactively
(AODV).
 The switching mechanism between hybrid protocol
components should fulfill under specific criteria.
 based on these criteria, the hybrid routing protocol decide
when to act proactively or reactively.
Hybrid Performance
 The criteria are as follow:
 Power Consumption
 Mobility
 Vicinity
 The following algorithms illustrate the switching mechanism in
proposing hybrid technique basic on the previous criteria.
if Power = high and Vicinity = high then
If the node is not in "DSDV", it switches to "DSDV".
else
if Power = high and mobility = low then
If the node is not in "DSDV", it switches to "DSDV".
else
if Vicinity = high and Mobility = low then
If the node is not in "DSDV", it switches to "DSDV"
Otherwise, switch to AODV.
Conclusion:
 Proposing a new hybrid routing technique for mobile ad
hoc networks.
 this new hybridization routing strategy is combined
between proactive (DSDV) and reactive (AODV)
techniques.
 this new hybrid technique has its own switching
mechanism to switch between AODV and DSDV.
 this switching process fulfill under specific criteria.
 base on these criteria, the hybrid routing protocol decide
when act proactively (utilize DSDV) or reactively (utilize
AODV).
Conclusion:
 These criteria as follow:
 Power Consumption
 Mobility
 Vicinity
 This proposed hybrid technique is performing well in large
scale networks and high mobility models.
Future work
 Implementing real world scenario to see the results of
having the proposed hybrid mechanism.
 Hopefully the concept of this study can be a motivation for
further investigation in ad hoc networks routing field with
considering more switching criteria like connectivity, and
so on.
 Hopefully this study gives at list an idea and spreading the
knowledge in the ad hoc routing field.
An alternative Routing Mechanisms for Mobile Ad-hoc NetworksPresentation2

Más contenido relacionado

La actualidad más candente

Black Hole Detection in AODV Using Hexagonal Encryption in Manet’s
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sBlack Hole Detection in AODV Using Hexagonal Encryption in Manet’s
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
 
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...IDES Editor
 
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...Editor IJCATR
 
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKS
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSEFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKS
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
 
Enhanced Multicast routing for QoS in delay tolerant networks
Enhanced Multicast routing for QoS in delay tolerant networksEnhanced Multicast routing for QoS in delay tolerant networks
Enhanced Multicast routing for QoS in delay tolerant networksIRJET Journal
 
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
 
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...IOSR Journals
 
A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...
A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...
A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...IJCNCJournal
 
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
 
5113jgraph01
5113jgraph015113jgraph01
5113jgraph01graphhoc
 
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK ijiert bestjournal
 
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 Simulation
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationPerformance Evaluation of ad-hoc Network Routing Protocols using ns2 Simulation
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
 
Dynamic control of coding for progressive packet arrivals in dt ns
Dynamic control of coding for progressive packet arrivals in dt nsDynamic control of coding for progressive packet arrivals in dt ns
Dynamic control of coding for progressive packet arrivals in dt nsIEEEFINALYEARPROJECTS
 

La actualidad más candente (18)

Black Hole Detection in AODV Using Hexagonal Encryption in Manet’s
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sBlack Hole Detection in AODV Using Hexagonal Encryption in Manet’s
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’s
 
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...
 
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
 
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKS
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSEFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKS
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKS
 
Enhanced Multicast routing for QoS in delay tolerant networks
Enhanced Multicast routing for QoS in delay tolerant networksEnhanced Multicast routing for QoS in delay tolerant networks
Enhanced Multicast routing for QoS in delay tolerant networks
 
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
 
Fa25939942
Fa25939942Fa25939942
Fa25939942
 
E42062126
E42062126E42062126
E42062126
 
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
 
94
9494
94
 
A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...
A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...
A Retrial Queueing Model with Scheduling Admission Control in QoS Supporting ...
 
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)
 
5113jgraph01
5113jgraph015113jgraph01
5113jgraph01
 
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK
 
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 Simulation
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationPerformance Evaluation of ad-hoc Network Routing Protocols using ns2 Simulation
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 Simulation
 
DTN
DTNDTN
DTN
 
MyThesis
MyThesisMyThesis
MyThesis
 
Dynamic control of coding for progressive packet arrivals in dt ns
Dynamic control of coding for progressive packet arrivals in dt nsDynamic control of coding for progressive packet arrivals in dt ns
Dynamic control of coding for progressive packet arrivals in dt ns
 

Destacado

A Review of Ad hoc on demand distance vector routing and proposed AR-AODV
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVA Review of Ad hoc on demand distance vector routing and proposed AR-AODV
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVEditor IJMTER
 
Use of NS-2 to Simulate MANET Routing Algorithms
Use of NS-2 to Simulate MANET Routing AlgorithmsUse of NS-2 to Simulate MANET Routing Algorithms
Use of NS-2 to Simulate MANET Routing AlgorithmsGiancarlo Romeo
 
Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34Shaikhul Islam Chowdhury
 
Protocol implementation on NS2
Protocol implementation on NS2Protocol implementation on NS2
Protocol implementation on NS2amreshrai02
 
Porting aodv uu implementation to ns-2
Porting aodv uu implementation to ns-2Porting aodv uu implementation to ns-2
Porting aodv uu implementation to ns-2Xaris1985
 

Destacado (7)

A Review of Ad hoc on demand distance vector routing and proposed AR-AODV
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVA Review of Ad hoc on demand distance vector routing and proposed AR-AODV
A Review of Ad hoc on demand distance vector routing and proposed AR-AODV
 
JUF0646518
JUF0646518JUF0646518
JUF0646518
 
Use of NS-2 to Simulate MANET Routing Algorithms
Use of NS-2 to Simulate MANET Routing AlgorithmsUse of NS-2 to Simulate MANET Routing Algorithms
Use of NS-2 to Simulate MANET Routing Algorithms
 
Ns2programs
Ns2programsNs2programs
Ns2programs
 
Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34Simulation and Performance Analysis of AODV using NS-2.34
Simulation and Performance Analysis of AODV using NS-2.34
 
Protocol implementation on NS2
Protocol implementation on NS2Protocol implementation on NS2
Protocol implementation on NS2
 
Porting aodv uu implementation to ns-2
Porting aodv uu implementation to ns-2Porting aodv uu implementation to ns-2
Porting aodv uu implementation to ns-2
 

Similar a An alternative Routing Mechanisms for Mobile Ad-hoc NetworksPresentation2

Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
 
A modified approach for secure routing and power aware in mobile ad hoc network
A modified approach for secure routing and power aware in mobile ad hoc networkA modified approach for secure routing and power aware in mobile ad hoc network
A modified approach for secure routing and power aware in mobile ad hoc networkDiksha Katiyar
 
Computing localized power efficient data
Computing localized power efficient dataComputing localized power efficient data
Computing localized power efficient dataambitlick
 
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
 
Adaptive opportunistic routing for wireless ad hoc networks
Adaptive opportunistic routing for wireless ad hoc networksAdaptive opportunistic routing for wireless ad hoc networks
Adaptive opportunistic routing for wireless ad hoc networksJPINFOTECH JAYAPRAKASH
 
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
 
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
An Adaptive Routing Algorithm for Communication Networks  using Back Pressure...An Adaptive Routing Algorithm for Communication Networks  using Back Pressure...
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...IJMER
 
Hybrid networking and distribution
Hybrid networking and distribution Hybrid networking and distribution
Hybrid networking and distribution vivek pratap singh
 
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...iosrjce
 
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORK
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKBETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORK
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKcscpconf
 
Energy efficiency cross layer protocol for wireless mesh network
Energy efficiency cross layer protocol for wireless mesh networkEnergy efficiency cross layer protocol for wireless mesh network
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
 
Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...
Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...
Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...IJECEIAES
 
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
 

Similar a An alternative Routing Mechanisms for Mobile Ad-hoc NetworksPresentation2 (20)

D017252327
D017252327D017252327
D017252327
 
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
 
A modified approach for secure routing and power aware in mobile ad hoc network
A modified approach for secure routing and power aware in mobile ad hoc networkA modified approach for secure routing and power aware in mobile ad hoc network
A modified approach for secure routing and power aware in mobile ad hoc network
 
AWN_FINAL_TERM_PAPER
AWN_FINAL_TERM_PAPERAWN_FINAL_TERM_PAPER
AWN_FINAL_TERM_PAPER
 
Computing localized power efficient data
Computing localized power efficient dataComputing localized power efficient data
Computing localized power efficient data
 
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
 
Adaptive opportunistic routing for wireless ad hoc networks
Adaptive opportunistic routing for wireless ad hoc networksAdaptive opportunistic routing for wireless ad hoc networks
Adaptive opportunistic routing for wireless ad hoc networks
 
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
 
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
An Adaptive Routing Algorithm for Communication Networks  using Back Pressure...An Adaptive Routing Algorithm for Communication Networks  using Back Pressure...
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
 
Hybrid networking and distribution
Hybrid networking and distribution Hybrid networking and distribution
Hybrid networking and distribution
 
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...
 
H017615563
H017615563H017615563
H017615563
 
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORK
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKBETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORK
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORK
 
Energy efficiency cross layer protocol for wireless mesh network
Energy efficiency cross layer protocol for wireless mesh networkEnergy efficiency cross layer protocol for wireless mesh network
Energy efficiency cross layer protocol for wireless mesh network
 
Ijetcas14 488
Ijetcas14 488Ijetcas14 488
Ijetcas14 488
 
Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...
Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...
Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless ...
 
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...
 

Último

Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1DianaGray10
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsSeth Reyes
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...DianaGray10
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IES VE
 
Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.francesco barbera
 
GenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation IncGenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation IncObject Automation
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopBachir Benyammi
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfDianaGray10
 
Introduction to Quantum Computing
Introduction to Quantum ComputingIntroduction to Quantum Computing
Introduction to Quantum ComputingGDSC PJATK
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesDavid Newbury
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 

Último (20)

Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and Hazards
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
 
Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.
 
GenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation IncGenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation Inc
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 Workshop
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
 
Introduction to Quantum Computing
Introduction to Quantum ComputingIntroduction to Quantum Computing
Introduction to Quantum Computing
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond Ontologies
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 

An alternative Routing Mechanisms for Mobile Ad-hoc NetworksPresentation2

  • 1. An alternative Routing Mechanisms for Mobile Ad-hoc Networks Awos Khazal Ali Supervisor Dr. Shukor abd. Razak Faculty of Computer Science & Information Systems Universiti Teknologi Malaysia
  • 3. Outlines  Introduction  Problem background  Problem Statement  Project Objectives  Project scopes  METHODOLOGY - Operational Framework  Results & Discussion  Conclusion  Future work
  • 4. Introduction  There are two kinds of mobile wireless networks.  The first is known as infrastructure network, with mobile nodes and base station.  The base station is responsible for routing, security and all issues in this kind of network.
  • 5.  The second type of mobile wireless network is the infrastructure-less mobile network, commonly known as the mobile ad-hoc network (MANET).  ad-hoc network are collections of mobile nodes, dynamically forming a temporary network without pre- existing network infrastructure or centralized base station.  These nodes can be arbitrarily located and are free to move randomly at any given time.  Network topology is changing because of node’s moving.
  • 6.  Ad-hoc networks is self- organizing and self-configuring “multi-hop” network.  ad-hoc does not require any fixed infrastructure such as transceiver base stations or even cables. This figure illustrates an example of ad-hoc network with four nodes
  • 7.  Ad-hoc networks are suited for use in situations where infrastructure is either not available, not trusted, or should not be relied on in times of emergency.  few examples for ad-hoc networks: military solders and equipments in the battlefield ("open environment"), sensor networks for various research purposes, emergency rescue after an earthquake or flood, and temporary offices, conference or meeting in such company ("close or limited environment").
  • 8. Problem background  The concept of routing can be described as the process of path finding.  In (MANETs) the main problem in routing mechanism, is how to send a packet from one node to another when there is no direct link exist between source and destination nodes.  Routing in ad-hoc networks has always been a challenging task.  The major reason for this is because of the characteristics of MANET itself that consists of high degree of node mobility, limited bandwidth, variable capacity links, energy-constrained operation, limited physical security.
  • 9.  There are several techniques that have been proposed so far and all of them have their own advantages and limitations.  Each technique tries to determine the optimal path for packets delivery from source to destination nodes in reliable and fast manner.  Some of the proposed routing mechanisms are suitable to be used in various MANET environments (i.e. open, localized, and organized environments), while some others are only suitable to be deployed in a specific environment.
  • 10. Problem Statement  Routing is one of the most important open issues in MANET research.  The problem of routing can be divided into two areas: route discovery and route maintenance.  The high mobility, low bandwidth, and limited computing capability characteristics of mobile hosts make the design of routing protocols very challenging.  The protocols must be able to keep up with unpredictable changes in network topology with as minimal message exchanges as possible and in the most efficient way.
  • 11.  This project proposes an alternative solution for ad-hoc network routing mechanism which aims to improve the reliability of the path chosen between source and destination nodes.
  • 12. Project Objectives  This project had accomplished the following objectives: 1- Investigate existing routing mechanisms in MANET environment. 2- Propose an alternative routing mechanism based upon existing schemes. 3- To analyze the performance of the proposed mechanism compared to the existing schemes.
  • 13. Project scopes  The scope of this project is as follow.  The investigation of existing MANET’s routing mechanisms is focusing upon open environment.  The proposed routing mechanism will focus upon the route discovery performance not on the security issues.  The analyses of the proposed routing mechanism will be conducted in simulation experiments .
  • 14. METHODOLOGY  Project Structure - Introduction for ad-hoc networks. - Defining the problem background. - Determining the problem statement. - Scopes of project.  This study start by, Data collecting and analysis existing routing protocols.  Then, a new routing protocol (Hybrid), for mobile ad-hoc network (MANET) was proposed.
  • 15.  Simulate the new routing protocol using Network Simulator 2 (NS2) in order to evaluate the performance.  Finally, is compared the performance of new routing protocol with previous protocols to see the differences between them. The following figure illustrates the project structure.
  • 16. Project Structure Steps Problem Definition Data collection and analysis Simulate the new protocol (NS2) Findings and Result Propose New routing Protocol
  • 18.  Initial Study covered mobile ad-hoc network (MANET) sequentially to define the problem statement through deferent altitudes.  Reviewed Related Literature, the main related work for routing in mobile ad-hoc network was reviewed from books, journals, and some Internet articles. Reviewing was focused on ad-hoc routing protocols.  Propose New Routing Protocol, based on previous protocols had been done.
  • 19.  Simulation, The new proposed routing protocol was simulated to present the performance of the overall system. The simulation was done using, Network Simulator 2 (NS2) tools.  Comparison, Results of this project are measured by comparing the performance of new ad-hoc routing protocol that proposed in this study, and previous routing protocols; to see the differences between these protocols.  The following flowchart illustrates the research methodology steps for this study.
  • 21. Results & Discussion  Simulation was done by using network simulator 2 (NS2), v 2.30. the following Table illustrates the simulation setup. Simulation parameter Value Channel type Wireless Channel MAC type 802.11 Link layer type Traditional Link Layer (LL) Antenna model Omni-directional (unity gain) No. of nodes 50 No. of sending nodes 1 No. of receive nodes 1 Simulation time 300 Sec Size of simulation area 800m x 800m Initial Power level 104000 watt Power consumption /packet 228.0 joules
  • 22.  AODV, DSDV, and Hybrid (proposed protocol) were implemented under same scenario.  50 wireless nodes.  The nodes are placed randomly within an 800m x 800m simulation area.  The mobility model used was the random waypoint model.  The simulation time is set to 300s.  The initial battery energy = 104000 watt.  Power consumption 228 joules for each send/receive/forward packet from node to node.
  • 23.  Drop rate: The ratio of lost TCP DATA packets over sent TCP DATA packets.  Lost rate: Packet loss is the failure of one or more transmitted packets to arrive at their destination.  Packets generation.  End –to-end delay: the average delay time of all successfully delivered packets from source node to destination. Metrics
  • 24. Results  AODV: No. of dropped packets = 117 packets.
  • 25.  No. of packets generations = 26875 packets.  No. of lost packets = 30 packets. AODV:
  • 26.  No. of dropped packets = 149 packets. DSDV:
  • 27. DSDV:  No. of packets generations = 20598 packets.  No. of lost packets = 37 packets.
  • 28. Hybrid:  No. of dropped packets = 102 packets.
  • 29.  No. of packets generations = 28507 packets.  No. of lost packets = 24 packets. Hybrid:
  • 30. End-to End Delay:  DSDV has the lowest ratio in average of delay of delivering packets to destination node.  While AODV shows the higher delay during simulation because; when mobility is high, more packets may travel over non- optimal routes with larger hop counts.  Hybrid approach gives better performance in terms of end-to-end delay than AODV (reactive).
  • 31. AODV vs. DSDV  DSDV perform badly at high mobility pattern, because DSDV cannot maintain its routing table update process with high topology changes.  In terms end-to-end delay, DSDV have very low delay compare with AODV  AODV suffer from long delay, which effect badly on routing performance.  AODV manages the packets generation rate better than DSDV. The number of packets generating by AODV is 26875 packets, when DSDV generate 20598 packets only.
  • 32.  the rate of loss packets by DSDV is greater than loss rate by AODV. The number of loss packets in DSDV is 37 packets, when number of loss packets by AODV is 30 packets.  AODV has a better drop packet ratio compare with DSDV. The number of packets that dropped during simulation time by using AODV is 117 packets; while the number of packet that dropped using DSDV is 149 packets. AODV vs. DSDV
  • 33. Hybrid vs. AODV  in terms of drop packet rate. The number of dropped packets by AODV is 117 packets, while in hybrid approach its 102 packets only.  The number of packets that were generated by AODV is 26875, while in hybrid, the number of packets generation was 28507 packets.  In terms of packet loss hybrid approach has a better rate compare with AODV. The number of lost packets in hybrid is 24 packets and in AODV is 30 packets.  the average of end-to-end delay in AODV is much higher than hybrid
  • 34. Hybrid vs. DSDV  the hybrids approach perform well in high mobility model unlike DSDV.  the number of dropped packets by DSDV during simulation is 149 packets, when in hybrid it just 102 packets.  the number of generating packets, it can be easily seen that hybrid approach perform better than DSDV.  The number of generating packets by hybrid is 28507 packets, while DSDV generate 20598 packets only.
  • 35.  DSDV loss 37 packets during simulation, on the other hand hybrid approach shows a good performance with loss packets rate, hybrid just loss 24 packets.  The average end-to-end delay, DSDV shows a good delay ratio compare with hybrid approach. Hybrid vs. DSDV
  • 36. Hybrid Performance  Hybrid protocol contains two sub protocols, one of them act proactively (DSDV) and the other one act reactively (AODV).  The switching mechanism between hybrid protocol components should fulfill under specific criteria.  based on these criteria, the hybrid routing protocol decide when to act proactively or reactively.
  • 37. Hybrid Performance  The criteria are as follow:  Power Consumption  Mobility  Vicinity
  • 38.  The following algorithms illustrate the switching mechanism in proposing hybrid technique basic on the previous criteria. if Power = high and Vicinity = high then If the node is not in "DSDV", it switches to "DSDV". else if Power = high and mobility = low then If the node is not in "DSDV", it switches to "DSDV". else if Vicinity = high and Mobility = low then If the node is not in "DSDV", it switches to "DSDV" Otherwise, switch to AODV.
  • 39. Conclusion:  Proposing a new hybrid routing technique for mobile ad hoc networks.  this new hybridization routing strategy is combined between proactive (DSDV) and reactive (AODV) techniques.  this new hybrid technique has its own switching mechanism to switch between AODV and DSDV.  this switching process fulfill under specific criteria.  base on these criteria, the hybrid routing protocol decide when act proactively (utilize DSDV) or reactively (utilize AODV).
  • 40. Conclusion:  These criteria as follow:  Power Consumption  Mobility  Vicinity  This proposed hybrid technique is performing well in large scale networks and high mobility models.
  • 41. Future work  Implementing real world scenario to see the results of having the proposed hybrid mechanism.  Hopefully the concept of this study can be a motivation for further investigation in ad hoc networks routing field with considering more switching criteria like connectivity, and so on.  Hopefully this study gives at list an idea and spreading the knowledge in the ad hoc routing field.