Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 37

Mobile Ad-hoc Networks (MANET)

Overview
1. INTRODUCTION
2. WHAT IS AD-HOC NETWORK
3. MANET
4. HISTORY
5. WORKING
6. CLASSIFICATIONS
7. REQUIREMENTS
8. WHAT IS ROUTING
9. CHARACTERISTICS
10. CELLULAR N\W VS MANET
11. COMPARISON
12. APPLICATIONS
13. LIMITATIONS
14. SCOPE
15. FUTURE WORK
Introduction

Wireless Networks

With Infrastructure Without Infrastructure


Introduction

Wireless Networks
With Infrastructure Without Infrastructure
What is an Ad Hoc Network?
Infrastructure Network (cellular or Hot spot)

Ad Hoc, Multihop wireless Network


Multi-hop Ad Hoc Network
 If communication is required between two
nodes which are out of range of each other,
intermediary nodes can forward the
packets.

Source Destination
What is a MANET?
 MANET – (Mobile Ad-Hoc NETwork) a system of
mobile nodes (laptops, sensors, etc.) interfacing
without the assistance of centralized infrastructure
(access points, bridges, etc.)
History of MANETs
 Earliest MANETs were called “packet radio”
networks, sponsored by DARPA (1970)

 1990s – the advent of inexpensive 802.11 radio


cards for personal computer

 Current MANETs were designed for military


utility,later extended to commercial & home
sectors.
Why MANETs ?

 Ease of deployment

 Speed of deployment

 Decreased dependence
on infrastructure

 Self-configuring
Mobile Ad Hoc Networks
 Wireless mobile hosts (mainly standard 802.11)
 Self-configuring with no infrastructure
 Limited resources (i.e. power, BW, range)
 Nodes behave as hosts and as routers

1- Hop 2- Hops 3- Hops

Wireless link
How MANET Works?
 Routing protocols are required for the proper data transfer
among mobile nodes.

 Each device in a MANET is free to move independently in


any direction, and will therefore change its links to other
devices frequently. Each must forward traffic unrelated to
its own use, and therefore be a router. The primary
challenge in building a MANET is equipping each device to
continuously maintain the information required to properly
route traffic.
Classification (cont.)

Ad Hoc Routing Protocols


Proactive Hybrid Reactive
Table driven Hybrid Source-initiated
on-demand
DSDV OLSR WRP ZRP

CGSR AODV DSR TORA ABR

SSR
Requirements
 HARDWARE IEEE stds Data rate Typical
(Mbps) range
 Wireless Radio (Feet)
supporting 802.11a 54 75
802.11a/b/g 802.11b 11 100
802.11g 54 150
 SOFTWARE 802.11n 600 150
 Linux Kernel 2.6 or
later
 Windows CE, XP, Vista
 Any OS with ad hoc
support (eg: Symbian)
What is Routing ?
 Mechanism for finding paths from source host to
destination host.
 Routing Protocol: Facilitates the exchange of
information to support routing.
 Routing information is stored in “routing tables” at
each router.
Routing Table at router A
Dest Next
A C
B B

C B
B
MANET Routing Approaches

Proactive Approach DSDV routing* (CGSR)


(table-driven) OLSRouting

Reactive Approach AODV routing*


(on-demand) DSR
Proactive Routing
 Each node maintains a route (via tables) to every other node
 Periodic & event-triggered routing updates
 High mobility  impacts update frequency
 Check routing table; begin packet transmission (no delay)
 Control overhead in large & mobile networks
 unless multiple data sessions exist

 Approach:- DSDV (Bellman-Ford routing) [E.M. Royer]


 Utilizes per-node sequence numbers (destination choice)
 avoids routing loops formation
 Utilizes both forms of updates
 SN + <dest. IP, dest. SN, next hop, hop count>
 most recent SN
 Op1: full (dump) & incremental updates
 Op2: reduce routing fluctuations
Reactive Routing

 Source-initiated On-demand routing


 discovers routes as and when needed
 Check routing table; begin route discovery
 Global search procedure
 Network-wide flooding of request message
 Reduced signaling overhead (moderate traffic)
 More data sessions  overhead; route acquisition
latency
Messages
 Route Request: “I need a route”
 Route Response: “Route advertisement”
 Route Error: “Withdraw route”

 Periodic route response to neighbors acts as


“hello”, installing and refreshing route
 Nodes record the source of the first RREQ
received to establish a reverse path.
Dynamic Source Routing (DSR)

Consists of Two Phases:


-Route Discovery
-Route Maintenance : accomplished through use of error packets.
Advantages:
-Source Routing (routing information in source node only)
-Routes created on demand
-Use of route cache
-Presence of multiple routes
-No periodic checking of routes
Disadvantages:
-Initial delay in transmission, may not be acceptable in certain
situations
-Longer paths possible
-May not be suitable for large networks.
Dynamic Source Routing (DSR)
Consists of Two Phases:
-Route Discovery

Route reply

N1-N2-N5-N8
N1-N2-N5-N8
N2 Destination
N5
N1-N2-N5-N8 N8

Source N1

N7
N4

N3
N6
Dynamic Source Routing (DSR)

Consists of Two Phases:


-Route Discovery : Start with checking route cache.
Then start RRP with a unique identifier

Route Request
N1-N2 N1-N2-N5
N2 Destination
N5
N1 N8

N1-N3-N4-N7
Source N1 N1-N3-N4

N7
N1
N4
N1-N3-N4
N3
N1-N3 N1-N3-N4-N6
N6
N1-N3-N4
General MANET Characteristics
 Instantly deployable, reconfigurable.
 Created to satisfy temporary needs.
 Node portability, mobility.
 Dynamic n/w topology.
 Limited battery power.
Cellular Networks vs MANET

Cellular Networks MANET


Fixed Infrastructure Infrastructure-less
Single-hop wireless links Multi-hop wireless links
Centralized routing Distributed Routing
Single point of failure Recover readily
High cost and long Quick and cost effective
deployment time setup
Simple Mobile, Complex Fairness: own vs other's
Base traffic
Characteristics Comparisons
 [E.M. Royer]
Parameter Reactive Proactive

Routing information Available when Always available


needed regardless of need

Routing philosophy Flat Mostly flat


Periodic route Not required Required
updates

Mobility scenarios Use localized route Achieve consistent


discovery routing table

Signaling traffic Grows with increasing Greater than reactive


mobility of routes routing
Examples of such networks
 Sensor networks
 Automotive networks
 Military applications
Mobile Applications
 Web access
 Location aware services
 Information services
 WLAN hotspot extension
 Entertainment
 During network failure
 Deserted Areas
 Network Gaming
Sensor networks
 Networks deployed in
random distribution
 Low power
 Delivering sensor data
to a central site for
some purpose
Automotive networks
 “Smart cars” and
“smart roads”
 Onboard systems “talk”
to the “road”:
Map obstacles and
delays
Obtain maps
Inform the road of its
actions
Military applications

 Combat regiment in the field


 Intercommunication of forces
 Advantages
Low probability of detection
Random association and topology
Applications
 Factory floor  Disaster
automation
recovery

 Search-and-rescue
 Personal area networking (watch, PDA, medical
appliance, …)
Applications

 Laptops in a
conference room –
a single-hop ad hoc
network
Adopted by one
laptop per child
project
Applications
 Emergency, military, extended Wifi,
transportation

•Peer-to-Peer Ad Hoc Mode


Limitations
 Communication is only possible between nodes
which are directly in range of each other
 Limitations Imposed by Mobility
 lack of mobility awareness by system/applications
 route breakages

 Limitations of the Mobile Computer


 short battery lifetime
 limited capacities
Scope
 MANETs are proposed for 2008 Beijing
Olympics.
 Researchers at Motorola has developed
prototype for mobile phones using MANETs.
Related Work & Issues
 MANET technology optimizations in
dynamically composable networks in fairly
new

 Main Issues:
 Location-aided routing
 Interoperability
 Multicasting
 QoS support and Scalability
Future Work
 Measure the actual number of bytes sent for
control messages (instead of measuring the
number of packets).

 Perform simulation for different node


movement speeds.
Thank You!

You might also like