Scribd
Upload
11 views24 pages

Presentation MANETs

Mobile Ad-Hoc Networks (MANETs) are self-configuring networks where each node acts as a router, enabling dynamic and decentralized communication without fixed infrastructure. They are applicable in various fields such as military operations, disaster management, and urban networking, and require specialized routing protocols to handle their unique challenges. The Internet Engineering Task Force (IETF) is working on standardizing routing protocols for MANETs, including reactive, proactive, and hybrid approaches.

Uploaded by

sumit shelar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views24 pages

Presentation MANETs

Mobile Ad-Hoc Networks (MANETs) are self-configuring networks where each node acts as a router, enabling dynamic and decentralized communication without fixed infrastructure. They are applicable in various fields such as military operations, disaster management, and urban networking, and require specialized routing protocols to handle their unique challenges. The Internet Engineering Task Force (IETF) is working on standardizing routing protocols for MANETs, including reactive, proactive, and hybrid approaches.

Uploaded by

sumit shelar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Mobile Ad-Hoc Networks

(MANETs)

Victoria Sardi
AGENDA

 Characteristics

 Applications

 Routing Protocols Requirements

 Standardization

 MANET Routing Protocols


CHARACTERISTICS

 Each node serves as a router and forwards


packets for other nodes in the network.
 Rapidly deployable, self configuring.

 Independent of any fixed infrastructure or

centralized administration (no “access point”


or backbone).
 Topology can be very dynamic.

 Bandwidth-constrained variable-capacity
links
 Limited physical security

 Nodes with limited battery life and storage

capabilities
EXAMPLE….
APPLICATIONS

 Military
 Rapidly deployable battle-site networks
 Unmanned aerial vehicles
 Sensor Networks
 Disaster management
 Disaster relief teams
 Rescue Operations
 Neighborhood area networks (NANs)
 Shareable Internet access in high density urban settings
 Students on campus
 Impromptu communications among groups of people
 Meetings/conferences
 Wearable computing
 Automobile communications
ROUTING PROTOCOL REQUIREMENTS

 Why is it different from routing in other types


of network? Because both end nodes and
routers are mobile

 Self starting and self organizing


 Multi-hop operation with a routing
mechanism designed for mobile nodes
 Dynamic topology maintenance

 Rapid convergence

 Minimal network traffic overhead

 Scalable to large networks


STANDARDIZATION

 The Internet Engineering Task Force (IETF)


created the Mobile Ad-hoc Networks working
group.
 The purpose of the MANET working group is to
standardize IP routing protocol functionality
suitable for wireless routing applications within
dynamic topologies with increased dynamics due
to node motion or other factors.
 The working group also serve as a meeting place
and forum for those developing and
experimenting with MANET approaches.
 Currently the group is pursuing a reactive, a
proactive and hybrid protocol. No protocol has
been standardized yet.
MANET ROUTING PROTOCOLS
 Reactive
 Does not take initiative for finding routes
 Establishes routes “on demand” by flooding a query
 Less
routing overhead in average because, does not use
bandwidth except when needed (when finding a route)
 Much network overhead in the flooding process when
querying for routes
 Higher latency in establishing the path
 Example: Dynamic Source Routing (DSR)
DRS PROTOCOL

 Suppose node A wishes to send a packet to


node B, but does not currently have a valid
route to the destination
 Need for route discovery
 Node A broadcasts a ROUTE_REQUEST packet
 Each node forwards the packet to its neighbors unless they
are the destination or have a valid route to the destination
 As the packet traverses the network, each intermediate
node adds its address to the header, establishing the
reverse route
 The destination, node B, sends a
ROUTE_REPLY packet to node A
 If the links are not bi-directional, node B must perform its
own route discovery to respond to node A
DRS PROTOCOL
DRS PROTOCOL
DRS PROTOCOL

 Intermediate nodes may cache accumulated


route record contained in the
ROUTE_REQUEST packet headers in order to
reduce routing overhead
 Security concerns
 Confirmation of the receipt of a packet can
be done by passive acknowledgement
 Node overhears a downstream node forwarding the
packet
 DSR also contains provisions to avoid route
reply storms
MANET ROUTING PROTOCOLS

 Proactive
 Establish routes in advance
 Routes are set up based on continuous control traffic. All
routes are maintained all the time
 Constant overhead created by control traffic
 Routes are always available
 Example: Optimized Link State Routing Protocol (OLSR)
OLSR PROTOCOL

 The Optimized Link-State Routing protocol


can be divided in to three main modules:
 Neighbor/link sensing
 Optimized flooding/forwarding (Multi Point Relaying)
 Link-State messaging and route calculation
NETWORK / LINK SENSING

 Routers maintain awareness of current


network topology by exchanging “HELLO
messages”
 All nodes transmit HELLO messages on a

given interval.
 Each node tells the entire network about its

immediate neighbors
 So each node forms a picture of the entire network
topology
 Each node can then calculate the best route to any
destination
 These contain all heard-of neighbors grouped
by status.
MULTI-POINT RELAYING

 Flooding the network with HELLO messages


incurs too much overhead
 OLSRuses multi-point relay (MPR) nodes to decrease the
number of unnecessary broadcasts (only selected nodes
broadcast HELLO)
 Reduce the number of duplicate
retransmissions while forwarding a broadcast
packet.
 Restricts the set of nodes retransmitting a

packet from all nodes(regular flooding) to a


subset of all nodes.
 The size of this subset depends on the

topology of the network.


MULTI-POINT RELAYING
MULTI-POINT RELAYING
LINK STATE FUNCTIONALITY

 In a classic link-state scheme all nodes flood


the network with link-state information.
 OLSR has two link-state optimizations:
 OnlyMPR selectors are declared in link-state messages.
This minimizes the size of link-state messages.
 Only nodes selected as MPRs will generate link-state
messages. This minimizes the set of nodes emitting link-
state messages.
MANET ROUTING PROTOCOLS

 Hybrid
 Thistype of protocols combines the advantages of
proactive and of reactive routing.
 The routing is initially established with some proactively
prospected routes and then serves the demand from
additionally activated nodes through reactive flooding.
 Advantage depends on number of nodes activated.
 Example: Zone Routing Protocol (ZRP)
ZONE ROUTING PROTOCOL (ZRP)

 Proactive within the node’s local neighborhood,


reactive for inter-zone routing
 Intra-zone routing: Proactively maintain routes to all
nodes within the source node’s own zone.
 Inter-zone routing: Use an on-demand protocol (similar
to DSR or AODV) to determine routes to outside zone.
 Proposed to reduce the control overhead of
proactive routing protocols and decrease the
latency caused by route discovery in reactive
routing protocols
 Uses ‘Bordercast’ instead of neighbor broadcast
 Neighbor Discovery/Maintenance (NMD) and
Border Resolution Protocol (BRP) used for query
control, route accumulation etc.
ZONE ROUTING PROTOCOL (ZRP)

1 Hop

2 Hops

Multi Hops
B
F

A
C

D
E
G H
MORE AD HOC ROUTING
PROTOCOLS…
 Temporally Ordered Routing Algorithm (TORA)
 Linked Cluster Architecture (LCA)

 Reliable Ad hoc On-demand Distance Vector

Routing Protocol
 Ad hoc On-demand Routing Protocol (AORP)

 Hybrid Routing Protocol for Large Scale Mobile

Ad Hoc Networks with Mobile Backbones


(HRPLS)
 Multicast routing protocols
 Protocol Independent Multicast (PIM)
 Multicast Zone Routing (MZR)
 Multicast Optimized Link State Routing (MOLSR)
 On-demand Multicast Routing Protocol (OMRP)
REFERENCES

 MANET IETF working group http


://datatracker.ietf.org/wg/manet/charter/
 IETF DSR RFC: http

://tools.ietf.org/html/rfc4728
 IETF OLSR RFC: http://

tools.ietf.org/html/rfc3626
 INRIA OLSR page http
://hipercom.inria.fr/olsr/
 The Zone Routing Protocol Web Page http

://www.zrp.be/

You might also like