MOBILE ADHOC NETWORK

Prepared By :

SHOVAN DAS
0601212510 CSEB

CONTENTS
1. Introduction 2. MANET 3. Architecture of MANET 4. Characteristics of MANET 5. MANET Routing Protocols 6. Desirable Qualitative Properties of MANRT routine protocols 7. Categorization of ad-hoc routing protocols 8. Table driven protocols 9.On demand driven protocols 10.Comparision between protocols 11.Application 12.Conclusion

INTRODUCTION

Since 1970s wireless network become popular as it

enables mobility

There are currently 2 variations of wireless network

Infrastructured network. Infrastructure less network.

An Wireless Adhoc Network is a decentralized or

infrastructure less network

Wireless Adhoc Network can be further classified by

their application:

Mobile adhoc networks (MANETs)

Wireless mesh networks Wireless sensor networks
3

MANET

Definition:- An mobile ad-hoc

network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis.

MANETs are self-forming, self-maintained, and self-healing,

allowing for extreme network flexibility

A MANET consists of mobile platforms (e.g., a router with

multiple hosts and wireless communications devices) known as"nodes"--which are free to move about arbitrarily.

ARCHITECTURE OF MANET

It differs from traditional centralized wireless network as MANET has

No centralized control. Nodes itself has to provide routing and MAC layers functions.

CHARACTERISTICS OF MANETS

Dynamic topologies. Bandwidth-constrained, variable capacity links. Energy-constrained operation. Limited physical security. Peer to-peer connectivity

MANET ROUTING PROTOCOLS

The following is a list of quantitative metrics that can be used to assess the performance of any routing protocol.

End-to-end data throughput and delay. Route Acquisition Time. Efficiency.

Factors affecting efficiency of a protocol:

Average number of data bits transmitted/data bit
delivered. Average number of control bits transmitted/data bit delivered

DESIRABLE QUALITATIVE PROPERTIES OF MANET ROUTING PROTOCOLS

The desirable qualitative properties of MANET routing protocols are given below.

Distributed operation. Loop-freedom. Demand-based operation. Security. "Sleep" period operation.

CATEGORIZATION OF AD-HOC ROUTING PROTOCOLS

10

DESTINATION-SEQUENCED DISTANCEVECTOR ROUTING (DSDV)

Here Every mobile node in the network maintains a routing table. Table contains:-

All of the possible destinations within the network. The number of hops to each destination are recorded. Each entry is marked with a sequence number assigned by the destination node.

Update table can be sent in 2 ways

Full dump.
Incremental update.
11

CLUSTERHEAD GATEWAY SWITCH ROUTING(CGSR)

12

WIRELESS ROUTING PROTOCOL (WRP)

The Wireless Routing Protocol (WRP)

is a table-based protocol with the goal of maintaining routing information among all nodes in the network.

Each node in the network is responsible for maintaining

four tables:

Distance table Routing table. Link-cost table. Message retransmission list (MRL) table.
12

ADHOC ON-DEMAND DISTANCE VECTOR ROUTING

These protocols are also called reactive protocols since they dont maintain routing information or routing activity at the network nodes if there is no communication. If a node wants to send a packet to another node then this protocol searches for the route in an ondemand manner and establishes the connection in order to transmit and receive the packet .

13

DYNAMIC SOURCE ROUTING (DSR)

The protocol consists of two major phases:

Route discovery and Route maintenance

14

TEMPORALLY-ORDERED ROUTING ALGORITHM

Fig (a) Foot creation (showing link direction assignment) (b) Route maintenance (showing link reversal phenomenon) in TORA. 15

ASSOCIATIVITY-BASED ROUTING (ABR)

Fig-Route Maintenance for Source and Destination Movement in ABR. 16

SIGNAL STABILITY ROUTING (SSR)

SSR selects routes based on the signal strength between nodes and on a node's location stability. This route selection criteria has the effect of choosing routes that have stronger" connectivity. SSR can be divided into two cooperative protocols:

Dynamic Routing Protocol (DRP) and Static Routing Protocol (SRP).

The DRP is responsible for the maintenance of the Signal Stability Table (SST) and the Routing Table (RT). The SRP processes packets by looking up the destination in the RT and then forwards the packet. 17

COMPARISON OF TABLE-DRIVEN PROTOCOLS

PARAMETER Time Complexity (link addition / failure) Communication Complexity (link addition / failure) Routing Philosophy Loop Free Multicast Capability Number of Required Tables Frequency of Update Transmissions Updates Transmitted to
Utilizes Sequence Numbers

DSDV O(d) O(x=N) Flat Yes No Two Periodically& as needed Neighbors

Yes

CGSR O(d) O(x=N) Hierarchical Yes No Two Periodically Neighbors& cluster head
Yes

WRP O(h) O(x=N) Flat Yes, but not instantaneous No Four Periodically& as needed Neighbors
Yes

Utilizes Hello Messages Critical Nodes Routing Metric

Yes No Shortest Path

No Yes (cluster head) Shortest Path

Yes No Shortest Path

18

COMPARISONS OF THE SOURCE-INITIATED ON-DEMAND AD-HOC ROUTING PROTOCOLS.

Performance Parameters
Time Complexity (initialization) Time Complexity (post failure) Communication Complexity (initialization) Communication Complexity (post failure) Routing Philosophy Loop Free Multicast Capability Beaconing Re uirements Multiple Route Possibilities Routes Maintained in Utilizes Route Cache/Table Expiration Timers Route Reconfiguration Methodology Routing Metric

AODV
O(2d) O(2d)

DSR
O(2d) O(2d) or 0(cache hit) O(2N)

TORA
O(2d) O(2d)

ABR
O(d+z) O(l+z)

SSR
O(d+z) O(l+z)

O(2N)

O(2N)

O(N+y)

O(N+y)

O(2N) Flat Yes Yes No No route table Yes Erase Route; Notify Source Freshest & Shortest Path

O(2N) Flat Yes No No Yes route table No Erase Route; Notify Source Shortest Path

O(2x) Flat Yes No No Yes route table No Link Reversal Route Repair Shortest Path

O(x+y) Flat Yes No Yes No route table No Localized Broadcast Query Associativity & Shortest Path & others

O(x+y) Flat Yes No Yes No route table No Erase Route; Notify Source Associativity & Stability

19

TABLE-DRIVEN VS ON-DEMAND ROUTING

Parameters -Demand able-Dri en

Availability of Routing Information

Available hen needed

Al ays available regardless of need

Routing Philosophy

Flat

Mostly flat except for CSGR

Periodic route updates

Not re uired Yes

Coping ith mobility

Using localized route discovery as in ABR and SSR

Inform other nodes to achieve consistent routing table

Signaling traffic generated

Gro s ith increasing mobility of active routes (as in ABR)

Greater than that of on-demand routing.

Quality of Service Support

Fe can support QoS

Mainly Shortest Path as QoS metric

20

APPLICATIONS

Military

Search and Rescue operations

Restoring communication in Natural disaster hit areas

CONCLUSION
work is being done and prototype protocols are available for experiments, mobile ad-hoc networks still have difficulties.

Although While

some basic network control functions and routing procedures have been developed, many other issues require attention.

Rapidly changing topology, network partitions, higher error rates,

collision interference, bandwidth constraints, and power limitations together pose new challenges in network control; especially in the design of higher level Protocols for routing and in implementing applications with quality of service requirements.

21

BIBLIOGRAPHY

www.cs.uc.edu www.informit.com www.nova-eng.com www.csail.mit.edu www.cs.uni.lu

THANK U !!!