analysis and design of link metrics for quality routing in wireless multi-hop networks phd thesis...

Analysis and Design of Link Metrics for Quality Routing in Wireless Multi-hop Networks

PhD Thesis Defense byNadeem JAVAID

Dec 15, 2010

Thesis DirectorProf. Karim DJOUANI

Jury :Rapporteur B.J. VAN WYK Prof. Tshwane University of Technology - South Africa Rapporteur J. BEN-

OTHMANMDC (HDR), Université de Versailles - France

Examinateur K. BARKAOUI Prof. CNAM, Paris - FranceExaminateur O. BRUN Directeur de recherche, LAAS-CNRS, Toulouse -

France Dir. de thèse K. DJOUANI Prof. Université Paris Est – France

Outlineo Performance Evaluation of Routing Protocols- Mobility/Speed Analysis- Scalability Analysis

- Traffic Analysiso Modeling Routing Overhead of Reactive Protocolso Design Requirements for Routing Link Metricso Min Hop-counto ETX-based Metrics- Expected Transmission Count (ETX)- Expected Link Performance (ELP)- Expected Throughput (ETP)o New Link Metric IBETX

PhD Defense by Nadeem JAVAID, Dec 15, 2010

Outline

o Performance Evaluation of Routing Protocols- Mobility/Speed Analysis- Scalability Analysis

Routing Protocols for Wireless Networks

o Reactive protocols- Reactive protocols perform RD and RM- Take an action when request arrives- More suitable for mobile scenarios- AODV, DSR, DYMO

o Proactive protocols- Periodically exchange information- More scalable- More suitable for less dynamic networks- DSDV, FSR, OLSR

Protocol

Performance

Reasons

AODV +++•Provides multiple timely routes in RT•Time association•LLR quickly repairs link

DSR ++•Multiple routes in RC •Promiscuous listening mode.•Highest speed and highest mobility, low convergence

DYMO +•Not suitable for highly dynamic scenarios•Absence of grat. RREPs •Absence of supplementary maintenance strategies

Reactive ProtocolsMobility/Speed/Scalability/Traffic Analyses

Protocol

Performance

Reasons

DSDV +++•Delay advertisement for route stabilization (Periodic, Nghbr)•Keep data for route settling time •Periodic and triggers updates

OLSR ++•More suitable for static or less dynamic networks•MPR-redundancy provides convergence in high mobility •Periodic updates

FSR +•Suitable for mobile scenarios as compared to static scenarios •Graded-frequency mechanism

Proactive ProtocolsMobility/Speed Analysis

Protocol

Performance

Reasons

OLSR +++•More density, more optimization through MPRs•Absence of trigger updates•Retransmission reduction through MPRs

FSR ++•Exchange link state messages by GF (<MPR)•Absence of trigger updates •Broadcasting messages only to neighbors; no flooding

DSDV + •Transmission of trigger updates utilize more bandwidth

Proactive ProtocolsScalability Analysis

Protocol

Performance

Reasons

FSR +++•Exchange link state messages by GF •Absence of trigger updates •no flooding

OLSR ++ •Absence of trigger updates•Retransmission reduction by MPRs (better in dense)

DSDV + •Transmission of trigger updates utilize more bandwidth

Proactive ProtocolsTraffic Analysis

Outline

o [Park06] define cost for routing overhead for reactive protocols;

o No evaluation for CE and CT,

o We define Energy Consumed per packet,

o We define Time Consumed per packet,

Modeling Routing Overhead-Motivation

o [sal10] considered: - only RREQ;- modeled only RD- evaluated energy-cost

o We consider: - both RREQ, RREP and RERR

overheads- both RD and RM- evaluate both energy and time-cost

of RD and RM

Modeling Routing Overhead-Motivation

o Flooding exchanges topological information in a networkoPlain flooding

- Each received packet is (re)transmittedoSuper flooding

- A packet is (re)transmitted, if it has a shorter path

oMPRs flooding- Only MPR nodes flood

oBlind flooding- Each packet is (re)transmitted for first time

Flooding

Energy-cost for RDo Energy-cost for a single ring,

o We consider routing overhead for ERS,o Energy-cost for RD ,

o AODV and DYMO

waiting_time = 2 × NODE_TRAVERSAL_TIME ×(TTL_VALUE + TIME_OUT_BUFFER)

o For DSR- τ = 30ms - For TTL=TTL x 2, τ= τ x 2

Time-cost for RD

Route maintenance

Route maintenanceo S establishes path to D

Route maintenanceo S establishes path to Do AODV and DYMO use

HELLO messages to check connectivity

o DSR uses link level feed-back

o Node 7 detects link break

o Node 7 detects link breako AODV starts LLRo LLR repairs the broken

linkso Reduces chance of route

re-discoveryo More suitable in large

networksAnalysis and Design of Link Metrics for Quality Routing in Wireless Multi-hop Networks

Local Link Repairo S establishes path to Do AODV and DYMO use

o S establishes path to Do AODV and DYMO use

networks

Local Link Repair

RERR in reactive protocolsAODVo If LLR fails then send

RERR messages to neighbors

o A RERR message is broadcasted (if there are many precursors)

o Or unicasted (if there is only 1 precursor)

o a node send upto RERR_RATELIMIT (=10) RERR messages per second

RERR in reactive protocolsDSRo Success of PSo Node returns a RERR to

sender of packeto Then salvages packeto Node 7 is the

originating node for RERR

RERR in reactive protocolsDSRo Success of PSo Node returns a RERR to

sender of packeto Then salvages packeto Node 7 is the

originating node for RERR

RERR in reactive protocolsDYMOo Broadcast RERR

messages at link failureo MsgHdr.HopLimit is to

NET_DIAMETER (=10)o MsgHdr.HopCnt is set

to one

Re-RD in reactive protocolsAODV (LLR)o RREQ_RETRIES = 2 to

start new RDDSR (PS)o Source piggy-backs

RERR with new RREQo Initiating RREQ based

on MaxMainRexmt=2DYMOo Decision based on

RREQ_TRIES =3 in DYMO to start new RD

Energy-cost of RMAODV

Time cost for RM

Outline

Routing Link Metric oTo have appreciable performance from a

wireless network, a routing protocol (RP) plays an important role

oKey component of a RP is link metric (LM)oLM helps a RP first to find all possible

end-to-end paths and then selects the fastest path

Routing Link Metric oMinimum Hop-count (Min-HC) is the most

popular and IETF standard metric and is appropriately used by wireless RP’s

oMin-HC rapidly finds new paths; where quality paths could not be found in due time due to higher rates of node mobility

oMin-HC is the simplest to calculate, as it avoids any computational burden on RP

Designing a routing metricoMinimum-hop pathoBalancing traffic loadoMinimizing delayoMaximizing data delivery/aggregating

bandwidthoMinimizing energy consumptionsoMinimizing channel/interface switching

Designing a routing metricoMinimizing interferenceoMaximizing route stabilityoMaximizing fault tolerance/minimizing

route sensitivityoAvoiding short and long lived loopsoConsidering performance trade-offsoMinimizing the Computational

overhead

Computational Overhead

Throughput

ETXMLInvETX

Plane Flooding

MPR Flooding

OLSR-ETX/InvETX/ML

OLSR-MD

End-to-end Delay

InvETXETX

End-to-end Delay

ETXInvETXML

Outline

ETX-based Metrics

Issues Solution

Links have different characteristics

Link asymmetry

Low bit-rate links effect faster links

Bandwidth

Congestion and Collisions Interference

Issue(s) not considered Link metricInterference ETT, DBETX, EETT, EstdTT, MCR,

METX, ETPBandwidth ELP, WCETT, MIC, iAWARE,

EDR, ETX DistLink asymmetry MTM

Bandwidth and Interference ETX, mETX and ENT Link asymmetry

+Bandwidth

+Interference

No Metric yet

ETX-based Metrics

Min Hop-count

ETX-based Metrics - ELP

ETX-based Metrics - ETP

Outline

IBETX - Motivationo In a WMN-backbone, either stationary or

minimally mobile nodes are interconnected

oThus, WMNs demand low end-to-end delay and high throughput paths from its operating RP

oSo, RP must choose a Quality LM to select the quality links

IBETX - Motivation

Simulation parametersParameters ValuesNS version NS 2.34Protocol DSDVLink metrics ETX, ELP, ETP, IBETXNetwork area 1000m x 1000mNumber of nodes 50Source-destination pairs 20CBR packet size 640BytesData traffic rates 2pack/s to 10pack/sTopologies Mean of 5 random topologies is

usedTotal simulation time 900s

Simulations-Throughput

ETPIBETX

ETPIBETX 10%

10%IBETX

Simulations-End-to-end Delay

ETXELP

ETPIBETX

ETXELP

ETPIBETX

ETXELP

IBETX15%

ETXELP

IBETX15%

Conclusiono Performance Evaluation and Comparison of:

- 3 reactive protocols- 3 proactive protocols

o Modeling cost paid by reactive routing protocols for RD and RM in the form of time-spent and energy-consumed

o Performance study of ETX-based metrics

o Designing a Quality Link Metric and InvETX

o IBETX: Proposal and validationAnalysis and Design of Link Metrics for Quality Routing

in Wireless Multi-hop Networks PhD Defense by Nadeem JAVAID, Dec 15, 2010

analysis and design of link metrics for quality routing in wireless multi-hop networks phd thesis...

routing link metrics

design of link metrics

quality routing

olsr analysis

outline analysis

new metric analysis

dynamic networks dsdv

dymo proactive protocols

Documents

danial javaid-e-learning

mh-deec: towards efficient energy utilization in wireless...

scanned by camscanner · abdul majeed nadeem est(at) jamil...

usman javaid, phd vodafone, uk

structural polymer composites for energy storage devices...

javaid ocd trem paper

mr yasser javaid

nadeem msc-thesis presentation.ppt

r rks - about me |nadeem javaid

nadeem amjad,

nadeem s.f

haan main baghi hoon-javaid hashmi

nadeem firdous

nadeem ali

nadeem project

javaid final

islamiyat 7 (3rd term) - javaid publishers

nadeem kureshi

nadeem polani

faisla by tahir javaid mugal