tseng:1

Introduction to Ad Hoc Networking

Perkin’s book: Ch 1 and Ch 2. Some data collected from the Internet

by Prof. Yu-Chee Tseng

tseng:2

Model of Operations

tseng:3

Assumptions

Symmetric Links: unidirectional links are difficult to dealt with,

and sometimes at the verge of failure

Layer-2 Routing: Most protocols are presented in layer-3

routing, but can be easily retooled as a layer-2 ones.

Proactive vs. Reactive Protocols (to be elaborated later)

tseng:4

Applications

ad hoc conferencing home networking emergency services personal area network (PAN) ubiquitous computing

“computers are all around us, constantly performing mundane tasks to make our lives a litter easier”

“Ubiquitous intelligent internetworking devices that detect their environment, interact with each other, and respond to changing environmental condition will create a future that is as challenging to imagine as a science fiction scenario.”

tseng:5

Sensor Dust: a large collection of tiny sensor devices

once situated, the sensors remain stationarylargely homogeneouspower is likely to be a scarce resource, which

determines the lifetime of the network can offer detailed information about terrain or

environmental dangerous conditions. Intelligent Transportation System:

may be integrated with cars, positioning devices, etc.

tseng:6

Technical Factors scalability power budget vs. latency protocol deployment and incompatibility

standards “Unless a miracle happens (e.g., the IETF manet working group is

able to promulgate a widely deployed ad hoc networking protocol), ad hoc networks will gain momentum only gradually because users will have to load software or take additional steps to ensure interoperability.

wireless data rate e.g., TCP over multi-hop wireless links

security issues

tseng:7

More Extensions (DoD’s Perspective)

could be a group of hosts supported by one or more radios

could across the Internet

tseng:8

IEFT MANET Working Group

goal: to standardize an interdomain unicast routing

protocol which provides one or more modes of operation, each mode specialized for efficient operation in a given mobile networking “context”, where a context is a predefined set of network characteristics.

a dozen candidate routing protocols have been proposed.

tseng:9

Applications of Ad Hoc Networks

tseng:10

Network Architectures No Infrastructure (ad hoc networks):

no base stations; no fixed network infrastructure

tseng:11

MANET

MANET = Mobile Ad Hoc Networks multi-hop communication needs support of dynamic routing protocols

tseng:13

Nokia Rooftop Product

tseng:14

Nokia RoofTop RoofTop solution (Nokia, Finland)

Wireless routera radio frequency (RF) modem a digital Internet protocol (IP) router

tseng:15

FHP

FHP Wireless, USA ad hoc network in a campus

tseng:16

FHP Wireless

tseng:17

FHP Wireless

tseng:18

MeshNetworks

MeshNetworks, USA

tseng:19

System – MeshNetworks Architecture

tseng:20

Networking Scenario :To Internet

tseng:21

SkyPilot NeighborNet

SkyPilot Network, USA

tseng:22

Routing = Ants Searching for Food

??

?

? ?

??

?

?? ? ? ?

? ? ? ? ?

? ? ??

? ? ? ? ?? ?

?? ?

tseng:23

tseng:24

Three Main Issues in Ants’ Life Route Discovery:

searching for the places with food

Packet Forwarding: delivering foods back home

Route Maintenance: when foods move to new place

tseng:25

Proactive vs. Reactive Routing

Proactive Routing Protocol:continuously evaluate the routesattempt to maintain consistent, up-to-date routing

informationwhen a route is needed, one may be ready immediately

when the network topology changes the protocol responds by propagating updates throughout the

network to maintain a consistent view Reactive Routing Protocol:

on-demand Ex: DSR, AODV

tseng:26

Ad hoc routing protocols

AD-HOC MOBILE ROUTING PROTOCOLS

ON-DEMAND-DRIVEN REACTIVE

HYBRIDDSDV

CGSR

TABLE DRIVEN/ PROACTIVE

DSR

AODV

ZRP

tseng:27

DSDV

Destination Sequenced Distance Vector Table-driven Based on the distributed Bellman-Ford routing

algorithm Each node maintains a routing table

Routing hops to each destinationSequence number

tseng:28

DSDV

ProblemA lot of control traffic in the network

Solution two types of route update packets

Full dumpAll available routing information

Incremental Only information changed since the last full

dump

tseng:29

Clustering Protocol

Cluster Gateway Switch Routing (CGSR) Table-driven for inter-cluster routing Uses DSDV for intra-cluster routing

C3

M2

C2

C1

tseng:30

AODV

Ad hoc On-demand Distance Vector On-demand driven Nodes that are not on the selected path do not

maintain routing information Route discovery

The source node broadcasts a route request packet (RREQ)

The destination or an intermediate node with “fresh enough” route to the destination replies a route reply packet (RREP)

tseng:31

AODV

N2

N4N1

N3

N5

N6

N7

N8

Source

Destination

N2

N4N1

N3

N5

N6

N7

N8

Source

Destination

(a) RREQ

(b) RREP

tseng:32

AODV

Problem A node along the route moves

Solution Upstream neighbor notices the move Propagates a link failure notification message

to each of its active upstream neighbors The source node receives the message and re-

initiate route discovery

tseng:33

DSR

Dynamic Source Routing On-demand driven Based on the concept of source routing Required to maintain route caches Two major phases

Route discovery Route maintenance

A route error packet

tseng:34

DSR

N2

N4N1

N3

N5

N6

N7

N8

N1

N1

N1-N2

N1-N3-N4

N1-N3-N4

N1-N3-N4-N7

N1-N3-N4-N6N1-N3

N1-N3-N4

N1-N2-N5

N2

N4N1

N3

N5

N6

N7

N8N1-N2-N5-

N8

N1-N2-N5-N8

N1-N2-N5-N8

tseng:35

ZRP

Zone Routing Protocol Hybrid protocol

On-demandProactive

ZRP has three sub-protocolsIntrazone Routing Protocol (IARP)Interzone Routing Protocol (IERP)Bordercast Resolution Protocol (BRP)

Zone Radius =

r Hops

Zone of Node Y

Zone of Node Y

Node X

Zone of Node X

Node Z

Zone of Node Z

Border Node

Border Node

Bordercasting

tseng:37

LAR

Location-Aided Routing Location information via GPS

ShortcomingGPS availability is not yet worldwide

Position information come with deviation

tseng:38

LAR

(Xs,Ys)

SRC

Request Zone Expected Zone

DEST

R

(Xd+R, Yd+R)

(Xd,Yd)

tseng:39

DREAM

Distance Routing effect Algorithm for mobility Position-based Each node

maintains a position databaseRegularly floods packets to update the position

Temporal resolution Spatial resolution

tseng:40

PAR Power-Aware Routing

+

–

+

–

+

–

+

–

+

–

+

–

SRC

N1 N2

DEST

N4N3