Vous êtes sur la page 1sur 30

Contents :

Introduction Routing TCP/IP MENET NS2 Challenges

A Comparison and Performance Evaluation of TCP Variants Using Different Routing Protocols with Varying MANET Scenario

Aim of The Project


The aim of the project is to analyze various TCP variant using different Routing Protocols using following matrices : Packet Delivery Ratio Routing Overhead Jitter Average Delay Energy Consumption Throughput

TCP Variant & Routing Protocols


TCP Variant
Tahoe Reno New Reno Sack Vegas

Routing Protocols
AODV DSDV DSR

ROUTING PROTOCOL
An ad hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network.

Types of ROUTING Algorithms


1. 2. 3. 4. Table-driven (protective) routing. On-demand (reactive) routing. Flow-oriented routing. Hybrid (protective & reactive) routing.

Table-driven Routing:- This type of protocols maintains fresh list of destinations and their routes by periodically distributing routing tables throughout the network. On-demand Routing :- This type of protocols find a route on demand by floating the network with Route Request Packets. Flow-Oriented Routing :- This type of protocol find a route on demand By following present flows. One option is to unicast consecutively when forwarding data while promoting a new link.

Hybrid Routing

This type of protocol combines the advantage of protective and reactive routing .The routing is initially established with same protectively prospected routes & then serves the demand from additionally activated nodes through reactive flooding.

Different Types of Routing Protocol


1. DSR (Dynamic Source Routing) Protocol 2. AODV (Ad hoc On Demand Distance Vector) routing protocol 3. DSDV (Destination Sequenced Distance Vector) routing protocol

DSR (Dynamic Source Routing ) Protocol This protocol is a simple & efficient routing protocol .
Designed specifically for use in multi-hop wireless ad hoc network. Allows the network to be completely self-organizing & self-configuring. The protocol allows multiple routes to any destination & allow each sender to select & control.

AODV (Ad hoc On Demand Distance Vector) Routing Protocol : This protocol is intended for used by mobile nodes in an ad hoc network . It offers quick to dynamic link condition, low processing and memory overhead, low network utilization, and determines unicast routes to destination within the ad hoc network . It uses destination sequence no. to ensure loop freedom at all times avoiding problems (such as counting to infinity) associated with distance vector protocol.

TCP/IP
TCP stand for Transmission Control Protocol. TCP is the set of rules used along with Internet Protocol(IP) to send the data between two computers over the internet. While IP takes care of handling the actual delivery of the data ,TCP takes care of keeping track of the individual unites of data(called Packets) that a message is divided into for efficient routing through the internet.

TCP Variant
TCP variant is the reliable connection oriented end to end protocols. It contains within itself mechanism for ensuring the reliability by requiring the receiver the acknowledge the segments that it receives.

Different TCP Variant


TAHOE : Tahoe refers to the TCP congestion control algorithm. TCP Tahoe is based on a principle of conservation of packets, i.e. if the connection is running at the available bandwidth capacity then a packet is not injected into the network unless a packet is taken out as well.

Different TCP Variant


RENO : Reno retains the basic principle of Tahoe such as slow start. Here the lost packets are detected earlier and the pipeline is not emptied every time a packet is lost.

Different TCP Variant


New RENO : New Reno is the slight modification over TCP-Reno. It is able to detect multiple packet losses and thus is more efficient that Reno in the event of multiple packet losses.

Different TCP Variant


SACK : Sack retains the slow start and fast retransmit parts of Reno. It also has the coarse grained timeout of Tahoe to fall back on increase a packet loss is not detected by the modified algorithm.

Different TCP Variant


VEGAS : VEGAS is the TCP implementation which is a modification of RENO. It tried to get around the problem of coarse grain time out by suggesting and algorithm which checks for time out at a very efficient schedule. Also it over comes the problem of requiring enough duplicate acknowledge to detect a packet loss and it also suggest a modified slow start algorithm which prevent it from congesting network.

MANET
A mobile ad hoc network (MANET) is a selfconfiguring infrastructure less network of mobile devices which is connected without any wired network. In a MANET each devices are free to move independently in any direction and thats why it changes its links to other devices frequently.

Types of MANET
1. Vehicular Ad hoc Networks (VANETs) 2.internet based Mobile Ad hoc Networks (iMANET) 3.Intelligent Vehicular Ad hoc Networks (InVANETS) 4.WSN(Wireless Sensor Network)

Vehicular Ad hoc Networks (VANETs) VANETs are used for communication among vehicles and between vehicles and roadside equipment. internet based Mobile Ad hoc Network (iMANET):iMANET are ad hoc networks that link mobile nodes and fixed internet-gateway nodes. Intelligent Vehicular Ad hoc Networks (InVANETs):InVANETs are a kind of artificial intelligence that helps vehicles to behave in intelligent manners during vehicle-to-vehicle collisions , accidents, drunken driving etc.

Mobile ad hoc Network


Application
Emergency services Commercial environments

Possible Services
Policing and fire fighting E-commerce: electronic payments anytime and anywhere Personal area networks (PAN) Universities and campus settings ,Virtual classrooms

Home and enterprise Education

NS2

Network Simulator version 2

A package of tools that simulates the behavior of ad hoc network. - Creates network topologies - Log event that happen under any load - Analyze events to understand the network behavior
Continue

NS2
The simulation of wired as well as wireless network functions and protocols (e.g., Routing algorithms such as (Distance Vector Algorithm, Link State Algorithm) TCP(Transmission Control Protocols) , UDP(User Datagram Protocols)) can be done using NS2.

Distance Vector Algorithm


n1 2 mbps n2

S
1 mbps

256 kbps n3

n4 n5

n6

Link State Algorithm


n1 2 mbps n2

S
1 mbps

256 kbps n3

n4 n5

n6

Hybrid Algorithm
n1 2 mbps n2

S
1 mbps

2 mbps n3 n4

n5 n6

n7

Why Simulation?
Real system is not available ,is complex / costly or may be dangerous. Quickly evaluate design. Evaluate complex function for which closed form formulas or numerical techniques are not available.

Language Used In NS2


NS2 consists of two key languages: C++ and Object-oriented Tool Command Language i.e. OTcl. The C++ defines the internal mechanism of the simulation objects, the OTcl sets up simulation by assembling and configuring the objects as well as scheduling discrete events. The C++ and the OTcl are linked together using TclCL.

Advantages of NS2
Open source tool. Complex scenarios can be easily tested. Results can be quickly obtained more ideas can be tested in a smaller time duration. Supported protocols Modular nature Popularity

Vous aimerez peut-être aussi