Documente Academic
Documente Profesional
Documente Cultură
An Introduction on
Ad-hoc Networks
WAN Chunfeng
ID: 80423623
Mita Lab, System Design Department,
School of Science for Open and Environmental systems, Keio University
1
Wireless communication-1
Infrastructure based networks
Uses fixed base stations (infrastructure)
2
Wireless communication-2
Ad-hoc networks
Consists of mobile nodes which
3
Mobile ad-hoc network
Meaning of the word “Ad hoc” is “for this”, means “for
this purpose only”, implies it is a special network for
a particular application.
5
Why use ad-hoc network
Easy of deployment
Speed of deployment
Decreased dependence on
infrastructure
6
Characteristics and tradeoffs
Characteristics
Decentralized
Self-organized
Self-deployed
Dynamic network topology
Tradeoffs
Bandwidth limited
Multi-hop router needed
Energy consumption problem
Security problem
7
Applications
Personal area networking
Cell phone, laptop, ear phone
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
8
Ad-hoc routing protocols
Ad-hoc routing protocols
Source-initiated On-
Table Driven
demand Driven
Distance D D 1 S567_D
F D 2 S45_F
12
CGSR: Clusterhead Gateway
Switch Routing
CGSR is a clustered multihop mobile wireless
network with several heuristic routing systems.
Cluster member table should be stored and
broadcasted periodically using DSDV algorism.
E
D : Node
H
F
: Gateway
A C
G : Clusterhead
B
CGSR: Routing from node A to node H 13
DSR: Dynamic Source Routing
It is an on-demand routing protocol that is based on the
concept of source routing.
Initiate route discovery process by
sending a route request message
which contains:
• Destination and Source Addresses
B • Request ID
• History of nodes it has visited
C E
D If the receiving node is not the
A destination:
F • Check to see if it has already
received the route request by
checking the request ID.
• Add its address to the hop list
and broadcast the message to its
neighbours 14
Node localization
Nodes of Ad-hoc network systems are always
coupled to the physical world. Spatial information
is necessary for the raw data.
15
Ad-hoc localization algorisms
Centroid
X i1 + X i 2 + L X ik Yi1 + Yi 2 + LYik
( X est , Yest ) = ( , )
k k
In order to know
how many hops
between two
beacons, beacon
propagation should
be applied.
18
APIT- Approximate Point In
Triangle Test
IN
IN Out
20
In-out test-1
A
A
M
C
B
C
B
A
1
3 M
2
1
4
3 M
2
4
C
B
B
24