Presentation for wireless communication course

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)

which are responsible for coordinating

communication between the mobile hosts
(nodes)

2
Wireless communication-2
„ Ad-hoc networks
„ Consists of mobile nodes which

communicate with each other through

wireless medium without any fixed
infrastructure

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.

„ A mobile ad-hoc network (MANET) is a self-

configuring network of mobile routers (and
associated hosts) connected by wireless links—the
union of which form an arbitrary topology.

„ The routers are free to move randomly and organize

themselves arbitrarily; thus, the network's wireless
topology may change rapidly and unpredictably.
4
History of ad-hoc network
„ The earliest mobile ad-hoc networks (MANETs) were
called “packet radio" networks, and were sponsored
by DARPA in the early 1970s.

„ SURAN（Survivable Adaptive Network） was proposed

by DARPA in 1983 to support a larger scale network.

„ Ad-hoc was used to describe that kind of network by

IEEE802.11 standard committee. Mobile ad-hoc
network was also be named as MANET by IETF.

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

DSDV WRP AODV DSR LMR ABR

CGSR TORA SSR

9
Table-Driven routing protocols
„ Table-Driven routing protocols include:
„ DSDV:Destination-sequenced Distance-vector Routing
„ CGSR: Clusterhead Gateway Switch Routing
„ WRP: Wireless Routing Protocol

„ Requires each node to maintain one or more tables to store

routing information.

„ Relies on an underlying routing table update mechanism that

involves the constant propagation of routing information.

„ Packets can be forwarded immediately since the routes are

always available.

„ Cause substantial signaling traffic and power consumption

problems
10
Source-Initiated On-Demand
routing protocols
„ Source-Initiated On-Demand Rounting
„ AODV: Ad-hoc On-Demand Distance Vector Routing
„ DSR: Dynamic Source Routing
„ TORA: Temporally-Ordered Routing Algorithm
„ ABD: Associativity-Based Routing
„ SSR: Signal Stability Routing

„ Creates Routing only when desired by the source

node.

„ Packet on source node must wait until a route can be

discovered.

„ Periodic route updates are not required.

11
 DSDV: Destination-sequenced
Distance-vector Routing
B
„ Distance-Vector routing
A E
protocol (table driven)
D
C
F
„ For each reachable
node in the network the Destination Next Hop Distance Sequence Number

routing entry contains: A A 0 S205_A

„ Destination Address B B 1 S334_B

„ Next Hop C C 1 S198_C

„ Distance D D 1 S567_D

„ Sequence Number E D 2 S767_E

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.

„ Useful to find a good route.

„ Helps to make the data aggregation more efficient.

„ Becomes a very important and popular issue now.

15
Ad-hoc localization algorisms
Centroid

X i1 + X i 2 + L X ik Yi1 + Yi 2 + LYik
( X est , Yest ) = ( , )
k k

( X im , Yim ) = position of the beacon

k= the beacon number the receiver node can hear
16
 DV-hop

A,B,C are beacons with

A-B length: 12
B positions already known
3 hops
avg hop size: 4 From the known position of any
two beacons, say, A and B, the
D distance between these two
beacons can be calculated.
C Count the hops and average
hop size obtained.
A
By knowing the hops to a
beacon, the distance from the
node to that beacon can be
obtained.
17
Beacon propagation

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

• APIT employs a novel • A node’s presence inside or

area-based approach. outside of these triangular regions
Anchors divide terrain into allows a node to narrow the area
triangular regions in which it can potentially reside
19
APIT- Approximate Point In
Triangle Test

If the angle contains the node,

then in area the angle
covered,the number add 1.
If the node is outside the angle,
then minus 1.
Aggregation provides a good
accuracy, even results by
individual tests are coarse and
error prone.
APIT grid SCAN approach

20
In-out test-1

If there exists a direction in which M is departure from points A,

B, and C simultaneously, then M is outside of ∆ABC. Otherwise,
M is inside ∆ABC.

A
A
M

C
B
C
B

Inside Case Outside Case

21
In-out test-2

If no neighbor of M is further from/closer to all three

anchors A, B and C simultaneously, M assumes that it
is inside triangle ∆ABC. Otherwise, M assumes it
resides outside ∆ABC.
A

A
1

3 M
2
1
4

3 M
2

4
C
B
B

Inside Case OutSide Case

22
ROCRSSI

ROCRSSI only compares the relative strength of RSSI and

does not depend on absolute RSSI values 23
Thank You!

24