Rajiv RamdhanyAdhoc Routing Protocols PhD Research Proposal Idris Skloul Ibrahim Supervisors: Dr. Peter King Prof. Rob Pooley

Rajiv Ramdhany Adhoc Routing Protocols

PhD Research Proposal

Idris Skloul Ibrahim

Supervisors:

Dr. Peter King Prof. Rob Pooley


Problem Statement & Objective Introduction MANET-based Applications MANET Routing Approaches Related Work & Issues Conclusion & Research Direction

Proposal OutlinesProposalProposal Outlines:Outlines:


Ad Hoc Wireless Networks Architecture & ProtocolsAd Hoc Wireless Networks Architecture & Protocols

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

Proposal Proposal OutlineOutline



Low overhead => few control messages

Provide a highly reactive service to help ensure successful delivery of data packets in spite of node movement or other changes in network conditions

Conserve battery power– by not sending periodic advertisements and by not needing to

receive them – Hosts wake-up from their sleep/standby modes to periodically

check for messages

Scalability and Zone Radius relationship in networks with thousands of nodes e.g. WSNs (main objective)

Proposal Proposal Objective:Objective:



Computer Network Classifications:

Wired Wireless

Wireless Communication 1 Wireless Communication 2

Infrastructure Non Infrastructure Mobile Ad Hoc N.

(MANET)

Introduction Introduction



Infrastructure Based Networks Uses fixed base stations (infrastructure) which are responsible for

coordinating communication between the mobile hosts (nodes)

IntroductionIntroduction



Ad-Hoc NetworksConsists of mobile nodes which communicate with each other through

wireless medium without any fixed infrastructure



AP

Ad hoc Mode

Ad Hoc Wireless Networks Architecture & ProtocolsAd Hoc Wireless Networks Architecture & ProtocolsWireless Net. Wireless Net. Basic Basic Architecture Architecture

Infrastructure 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.

A mobile ad-hoc network 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.




The first generationfirst generation goes back to 19721972. At the time, they were called PRNETPRNET and were sponsored by DARPA DARPA

The second generationsecond generation of ad-hoc networks emerged in 1980s1980s,when the ad-hoc network systems were further enhanced and implemented as a part of the SURAN SURAN (Survivable Adaptive Radio Networks) program. This provided a PSNPSN to the mobile battlefield in an environment without infrastructure. This program proved to be beneficial in improving the radios' performance by making them smaller and cheaper

In the 1990s1990s, the concept of commercial ad-hoc networks arrived with NBCNBC. and other communications equ. At the same time, the idea of a collection of mobile nodes was proposed at several research conferences. The IEEE IEEE 802.11802.11 subcommittee had adopted the term "ad-hoc networks".

Mobile ad-hoc network was also be named as MANETMANET by IETFIETF.

History Of

MANETMANET



Easy of deployment

Speed of deployment

Decreased dependence on infrastructure


Why we are need to Use Ad-Hoc NetworkWhy we are need to Use Ad-Hoc Network ?



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 ?

MANET MANET CharacteristicsCharacteristics & & TradeoffsTradeoffs



Hidden Terminal ProblemTwo nodes, out of each others’ radio range; simultaneously try to

transmit data to an intermediate node, which is in radio range of both the sending nodes.

None of the sending nodes will be aware of the other node’s transmission, causing a collisioncollision to occur at the intermediate node.

MANETMANET Medium Medium IssuesIssues

ReceiveReceiverr

SendeSenderr

SendeSenderr



RTS-CTS handshake protocol A node that wishes to send data is required to ask for permission first,

by sending a RTS to the receiving node. The receiving node then replies with a CTS message.

The CTS message can be heard by all nodes within radio range of the receiving node, and instructs them not to use the wireless medium since another transmission is about to take place.

The node that requested the transmission can then begin sending data to the receiving node

The Hidden The Hidden TerminalTerminal ProblemProblem SolutionSolution

ReceiveReceiverr

SendeSenderr

SendeSenderr

RTS

CTS

Data



Exposed node problemWhen a node overhears another transmission and hence refrains to refrains to

transmit any data of its owntransmit any data of its own, even though such aa transmission would not transmission would not cause a collisioncause a collision due to the limited radio range of the nodes.

Data

XX YY SS DD

MANETMANET Medium Medium IssuesIssues



Directional Antennas / separate ChannelsThe exposed node problem is leads to sub-optimal utilization of the

wireless medium. Some proposed solutions are the usage of directional directional antennasantennas (instead of omni-directional antennas) or separate channelsseparate channels for control messages and data.

A technique called transmission power controltransmission power control could serve a dual purpose in this context. By adjusting the transmission power of nodes, interference can be reduced at the same time as nodes save valuable energy.

ExposedExposed NodeNode ProblemProblem SolutionSolution



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

MANETMANET ApplicationApplication


Hmm, A MANETmakes sense.

Dad, you can useNelson if I am

too fast.Hi, Marge.I miss you.

I can hear u, Lisa.Can u hear me?

Yes. What areyou doing,

Nelson?

Be home early,Homer.

The Simpson'sThe Simpson's


MANET

Difficulties for routing limited connectivity due to transmission range of signal Low bandwidth Higher error rates Vulnerable to interference Power consumption No specific devices to do routing Dynamic nature - high mobility and frequent topological changes

Adhoc routingAdhoc routing

Traditional routingTraditional routing

AODVAODV DSRDSR

DYMODYMO

DSDVDSDV CommonCommon

A D

G

C

F

B

E

H

X X

X


MANET Routing Protocols Classification

Source: MINEMA

Uniform routing

Proactive routing

Wireless Routing Protocol (WRP)

Destination Sequence Distance Vector (DSDV) routing protocol

Fisheye State Routing (FSR)

Distance Routing Effect Algo. for Mobility (DREAM) Location-based routing

Reactive routing

Dynamic Source Routing (DSR) protocol

Temporally-Ordered Routing Algorithm (TORA)

Adhoc On-demand Distance Vector Routing (AODV)

Location Aided Routing (LAR) Location-based routing

Associativity Based Routing (ABR) protocol Link-stability based routing protocol

Signal Stability-base adaptive Routing (SSR) Link-stability based routing protocol

Non-uniform routing

Zone-based routing

Zone Routing Protocol (ZRP) Hybrid routing protocol

Hybrid Adhoc Routing Protocol (HARP) Hybrid routing protocol

Zone-based Hierarchical Link State routing (ZHLS) Hybrid routing protocol

Grid Location Service (GLS) Location service

Cluster-based routing

Clusterhead Gateway Switch Routing (CGSR)

Hierarchical State Routing (HSR)

Cluster Based Routing Protocol (CBRP)

Core-node based routing

Landmark Adhoc Routing (LANMAR) Proactive routing

Core-Extraction Distributed Adhoc Routing (CEDAR) Proactive routing

Optimised Link State Routing protocol (OLSR) Proactive routing

AdhocAdhoc routingrouting


AODVAODV DSRDSR

DYMODYMO



MANET Main Classification

Reactive Reactive On-DemandOn-Demand

Proactive Proactive Table-DrivenTable-Driven Hybrid Hybrid

•DSDV•WARP•DREAM

•DSR•AODV•TORA

•ZRP•HARP

Adhoc routingAdhoc routing


AODVAODV DSRDSR

DYMODYMO


Ad Hoc Routing Protocols Main Classification


Aim Of Proposed Protocol

-Multipath Distance Vector Zone Routing Protocol MDVZRP MDVZRP

-Using BroadcastBroadcast, and UnicastUnicast propagation techniques

-We assume a SymmetricalSymmetrical links network. Unidirectional Problem

-Node uses a Hello messageHello message to discover its zone (R. table driven)

RelatedRelated Work &Work & IssuesIssues

-Node uses Route RequestRoute Request to discover any node outside its zone. (on demand)

-Proactive Table DrivenTable Driven distance<=Zone Radius ,and reactive On demand On demand distance>Zone’s Radius

-Node should get InformationInformation from any route pass through it.


Aim Of Proposed Protocol

-Number of Optimum RoutesOptimum Routes depends on the Number of neighbours where maximum number of routes from each neighbour is less than or equal Radius SizeRadius Size

RelatedRelated Work &Work & IssuesIssues

-Any node effected by Err msgErr msg.. Deletes the specific route and Rebroadcasts Err msg.Err msg. again and so on till reaches to a node which has no that route ( to prevent flooding the network by Err msg.)

-In case of broken link node generates Err msgErr msg. Including the Segment_No.Segment_No. (Route No.) to identify the right broken link.

-Node broadcasts a forward UpdateUpdate message when gets a new route where one of hop < R only (to reduce No. of messages.)


5

2

1 4

6

7

8

3

Source

Destination

1-2-4-3-8 1-2-4-7-8 1-2-4-3-7-8 1-2-4-7-3-8 1-2-5-4-3-8 1-2-5-4-7-8 1-2-5-4-3-7-8 1-2-5-4-7-3-8 1-3-8 1-3-7-8 1-3-4-7-81-4-7-8 1-4-3-8 1-4-7-3-8 1-4-3-7-8

ExampleExample 11Routing Algorithm

1

8

4hops

2hops

3hops

√

√


R>2

Node's Zone & Radius metric

R=2

R=1

6

5

4

2

3

1

Symmetric Symmetric NetworkNetwork


A Simple network

1-2 1-3

5

4

2

3

1

Example 2Example 2


Nodes Routing Tables

Node(1) Node(2) Node(3)Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ………

1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ……….2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ……….

3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ……….

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 ……….

Example2Example2 ROUTINGROUTING TablesTables


A New Node Joins The Network

Ds Nx No.h Seg_No

6 6 0 6-6 Initialization

5 5 1 5-6

4 4 1 4-6

2 5 2 2-5

3 4 2 3-4

1-2 1-3

2-5

3-4

5-6 Hello

Hello 4-6

5

4

2

3

1

ROUTING ROUTING TABLE TABLE DRIVENDRIVEN

R.Upadte

R.U

padt

e


The New Node’s Routing Table


1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ……….2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ……….

3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ………. 6 5 2 5-6 ………. RUP 6 4 2 4-6 ………. RUP


1 3 2 1-3 ………. 1 2 2 1-2 ………. 2 5 2 2-5 ……….A H M 3 3 1 3-4 ………. 2 2 1 2-5 ………. 3 4 2 3-4 ……….A H M4 4 0 4-4 ………. 5 5 0 5-5 ………. 4 4 1 4-6 ……….A H M6 6 1 4-6 ………. Hello 6 6 1 5-6 ……….Hello 5 5 1 5-6 ……….A H M

6 6 0 6-6 ……….Initialization

ROUTING ROUTING TABLE TABLE CREATIONCREATION


Route Request

Ds Nx No.h Seg_No

6 6 0 6-6

5 5 1 5-6

4 4 1 4-6

2 5 2 2-5

3 4 2 3-4

1 4 3 1-3

1 5 3 1-2

1-2 1-3

2-5

3-4

5-6 Hello Hello 4-6

6

5

4

2

3

1

ROUTE ROUTE ON-ON- DEMANDDEMAND

RREQRREQ

RRPL

RRPL


New Node’s Entire Routing Table


1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ……….2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ……….

3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ………. 6 5 2 5-6 ………. RUP 6 4 2 4-6 ………. RUP


1 3 2 1-3 ………. 1 2 2 1-2 ………. 2 5 2 2-5 ……….A H M 3 3 1 3-4 ………. 2 2 1 2-5 ………. 3 4 2 3-4 ……….A H M4 4 0 4-4 ………. 5 5 0 5-5 ………. 4 4 1 4-6 ……….A H M6 6 1 4-6 ………. Hello 6 6 1 5-6 ……….Hello 5 5 1 5-6 ……….A H m

6 6 0 6-6 ……….Initialization 1 4 3 1-3 …….…RREQ

1 4 3 1-3 ….……RREQ

ROUTING ROUTING TABLE TABLE CREATIONCREATION


Broken Link Error

1-2

1-3

2-5

3-4

5-6 4-6

6

5

4

2

3

1

REERREER ErrorError MessageMessage

REER

REER

REER

REE

R

REERREER

REER


Nodes Routing Tables After RERR


1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ……….2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ……….

3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ………. 6 5 2 5-6 ………. RERR 6 4 2 4-6 ………. RUP


1 3 2 1-3 ………. 1 2 2 1-2 ………. 2 5 2 2-5 ……….RERR 3 3 1 3-4 ………. 2 2 1 2-5 ………. 3 4 2 3-4 ……….FULLD4 4 0 4-4 ………. 5 5 0 5-5 ………. 4 4 1 4-6 ……….FULLD6 6 1 4-6 ………. Hello 6 6 1 5-6 ……….RERR 5 5 1 5-6 ……….RERR

6 6 0 6-6 ……….Initialization 1 4 3 1-3 …….…RREQ

1 5 3 1-2 ….……RREQ

ROUTING ROUTING TABLESTABLES AFTERAFTER RERRRERR


ConclusionConclusion

We proposedWe proposed MDVZRPMDVZRP for MANET based on DV,AODV for MANET based on DV,AODV Allows sending packets byAllows sending packets by alternative pathsalternative paths and and backward backward

RERRRERR to the source in case of unknown broken linkto the source in case of unknown broken link Number ofNumber of Optimum RoutesOptimum Routes depends on the Number of depends on the Number of

neighbours where Maximum Number from each neighbour is neighbours where Maximum Number from each neighbour is less than or equal less than or equal Radius SizeRadius Size

Low overheadLow overhead and and FasterFaster than the standard protocols: than the standard protocols: LatencyLatency is less than AODV is less than AODV (N( c/b +t ) – t R) (N( c/b +t ) – t R) Routing Routing table sizetable size is less than DSDV is less than DSDV ((<DSDV messages<DSDV messages)) No No periodic route updateperiodic route update packets.(< ZRP control traffic ) packets.(< ZRP control traffic ) Network Network PerformancePerformance v v Radius sizeRadius size regarding to evaluation regarding to evaluation

metrics metrics data throughput, packet delivery ratio, routing overhead and average packet delay.

MDVZRPMDVZRP FORFOR MANETMANET

Documents

Rajiv RamdhanyAdhoc Routing Protocols PhD Research Proposal Idris Skloul Ibrahim Supervisors: Dr. Peter King Prof. Rob Pooley