




































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
This presentation is for final year project to complete degree in Computer Science. It emphasis on Applications of Computer Sciences. It was supervised by Dr. Abhisri Yashwant at Bengal Engineering and Science University. It includes: Protocol, Selection, Achieved, Mobile, Adhoc, Networks, MANET, Applications, Simulation, Metric, Factors, Tools
Typology: Slides
1 / 44
This page cannot be seen from the preview
Don't miss anything!





































Firstly, I am going to give a fast & generalized overview of previous work done.
Secondly, In general I will discuss some of the issues which supports my further discussion.
Thirdly, Protocol selection & its working
And
At last reason’s for protocol, parameters selections with the support of work done in these issues.
Hundreds of research aspects have been developed and discussed in this field.
Various fundamental and frequently discussed aspects of MANETs are identified and grouped into fifteen categories
There are many qualitative factors related to MANETs. There are two purposes for qualitative analysis. First, qualitative analysis allows the researcher to discover some phenomena easily for study. Second, it allows the researcher to formulate a new explanation and theory by examining the phenomena's interrelationships.
**1. Adaptability
Reliability 17%
Security 14%
Heteogeneity 4%
Stability 20%
Flexibility 12%
Scalability 25%
Adaptability 8%
Reliability Security Heteogeneity Stability Flexibility Scalability Adaptability
There are more than twenty simulators used in MANETs.
Simulators utilization trend
GloMoSim 21%
User Designed 8%
Other 9%
PARSEC based other Simulators 4%
C++ based toolkit 8% BoNes 2% OPNET 9%
NS- 39% NS- GloMoSim OPNET BoNes C++ based toolkit User Designed Other PARSEC based other Simulators
They not only provide the simulation process for researchers but also help them test and debug many network protocols. From this figure, the three most popular simulators, NS (39%), GloMoSim (21%), and OPNET (9%), accounted for more than 2/3 of the simulators used. NS-2, GloMoSim, and OPNET are highly modular discrete event simulators. These simulators are provided for simulating the behavior of networks in a complex network topology.
Numerous protocols and algorithms have been proposed w.r.t application/utilization of Mobile Ad hoc Network e.g. Power-Aware Routing protocols Network Utilization & organization protocols Fading/Interference reduction protocols Routing protocols THE big topic in many research projects. Far more than 50 different proposals exists at the moment. There are three main types of routing protocols: Reactive, pro-active and Hybrid.
Reactive Routing Protocol: Determine route if and when needed Source initiates route discovery Example: DSR,AODV Proactive Routing Protocol: continuously evaluate the routes attempt to maintain consistent, up-to-date routing information when a route is needed, one may be ready immediately when the network topology changes the protocol responds by propagating updates throughout the network to maintain a consistent view Examples: DSDV ,OLSR ,CGSR. Hybrid protocols Adaptive; Combination of proactive and reactive Example : ZRP (zone routing protocol)
IETF community the MANET Published in November 2001 AODV Routing Protocol (Ad hoc On demand Distance Vector) Total 14 versions (Draft 00Draft 13) were published After passing through this evaluation period, IEFT at last published AODV as the RFC 3561 in 2004 Several implementations and advancements done New protocols are mostly based on the working of AODV Most of Routing protocols research is going on AODV after getting RFC standard.
On demand (with small delay) Unicast / Multicast / Broadcast provided Loop free Quick aging Link breakages efficiently repaired Distributed Routing Hop-by-hop Deterministic Single path State-dependent
Basic: Destination IP Destination Sequence Number Hop Count to Destination (cost per hope = 1) Next Hop Lifetime Last Hop Count Extended: Routing Flags Interface (i.e. eth0, eth1) List of Precursors Route entries may be updated if a route with greater sequence number or smaller hop count is discovered