Professional Documents
Culture Documents
The Problem:
Routing (and adaptation) challenges in dynamic and mobile ad-hoc networks
(in addition to common constraints in a mobile ad-hoc environment);
extended to self-composable networks
Wired Wireless
Ad-Hoc Networks
Consists of mobile nodes which communicate with each other through
wireless medium without any fixed infrastructure
AP
Infrastructure Mode
Ad hoc Mode
Meaning of the word Ad hoc is for this, means for this purpose
only, implies it is a special network for a particular application.
In the 1990s,
1990s the concept of commercial ad-hoc networks arrived with NBC.
NBC
and other communications equ. At the same time, the idea of a collection of
mobile nodes was proposed at several research conferences. The IEEE
802.11 subcommittee had adopted the term "ad-hoc networks".
Easy of deployment
Speed of deployment
Characteristics
Decentralized
Self-organized
Self-deployed
Dynamic network topology
Tradeoffs
Bandwidth limited
Multi-hop router needed
Energy consumption problem
Security problem
Why traditional routing protocols are not suitable for MANET networks ?
Receive Sende
Sende r
r r
RTS
Data
Receive Sende
Sende r
r r
CTS
Data
Y X S D
Emergency operations
Search and rescue
Policing and fire fighting
Civilian environments
Taxi cab network
Meeting rooms
Sports stadiums
Boats, aircrafts
Military use
On the battle field
X X
A
X D
Proactive Reactive
Table-Driven On-Demand Hybrid
-Using Broadcast,
Broadcast and Unicast propagation techniques
-We assume a Symmetrical links network. Unidirectional Problem
-Node uses a Hello message to discover its zone (R. table driven)
-Node should get Information from any route pass through it.
1-2-4-3-8
5 1-2-4-7-8
4hops
1-2-4-3-7-8
2 6 1-2-4-7-3-8
Source 1-2-5-4-3-8
1-2-5-4-7-8
1 4 1-2-5-4-3-7-8
1-2-5-4-7-3-8
1-3-8 2hops
7 1-3-7-8
3 1-3-4-7-8
1-4-7-8
3hops
1-4-3-8
8 1-4-7-3-8
1-4-3-7-8
Destination
Rajiv Ramdhany Adhoc Routing Protocols
Symmetric
Node's Zone & Radius metric Network
5 2
1
R>
3 2
6
R=1 4
R=2
2 1-
5 2
1
1-
3
Node(4) Node(5)
Ds 1st No.h S_No . Ds 1st No.h S_No .
1 3 2 1-3 . 1 2 2 1-2 .
3 3 1 3-4 . 2 2 1 2-5 .
4 4 0 4-4 . 5 5 0 5-5 .
Ds Nx No.h Seg_No
6 6 0 6-6 Initialization
5 5 1 5-6
2 1-
4 4 1 4-6 2-5 2 1
2 5 2 2-5 5 R.Upadte
3 4 2 3-4
1-
3
5-6
3
Hello
dte
3-4
pa
R.U
Hello
4-6 4
Ds Nx No.h Seg_No
6 6 0 6-6
2 1-
5 5 1 5-6
2-5 2 1
5
4 4 1 4-6
2 5 2 2-5 1-
RRPL 3
3 4 2 3-4 5-6
3
1 4 3 1-3 Hello
RREQ
1 5 3 1-2 6 RREQ 3-4
Hello
RRPL4-6 4
REER
REER
2-5 2 1-
5 2 1
E ER
R
ER
1-
RE
5-6 3
ER
3
RE
REER
6
4-6 3-4
RE
ER
4