Routing in Networks of Varying Connectivity Andrew Grundy - - PowerPoint PPT Presentation

▶

Jan 18, 2024 237 likes •453 views

Routing in Networks of Varying Connectivity Andrew Grundy amg@cs.nott.ac.uk http://cs.nott.ac.uk/~amg Supervisors: Dr Milena Radenkovic Prof Uwe Aickelin 1 Overview The Problem Domain Existing Solutions My Work The

SLIDE 1

Andrew Grundy

amg@cs.nott.ac.uk http://cs.nott.ac.uk/~amg Supervisors: Dr Milena Radenkovic Prof Uwe Aickelin

Routing in Networks of Varying Connectivity

SLIDE 2

Overview

The Problem Domain
Existing Solutions
My Work
The Evaluation
Questions

SLIDE 3

The Problem Domain

Wired Networks Wireless Networks

AP Node Node

Wireless Ad-Hoc Networks

Node Node Node

SLIDE 4

Node Node

Mobile Wireless Ad-Hoc Networks Mobile Ad-hoc NETwork (MANET)

Node

Disconnected Mobile Wireless Ad-Hoc Networks Disconnection Tolerant Network (DTN)

The Problem Domain

SLIDE 5

The Problem Domain

Mobile Ad-hoc NETwork (MANET)

End-to-end connectivity is assumed
Topology is not Fixed
One-hop set (neighboring nodes) may change

Disconnection Tolerant Network (DTN)

End-to-end connectivity is not assumed
Topology is not Fixed
One-hop set is likely to vary considerably

SLIDE 6

Existing Solutions

MANET Routing Pro-active Re-active

Constantly maintain a view of the entire network. Acquire a route when you need it.

Dynamic Source Routing [2]

SLIDE 7

Existing Solutions

DTN Forwarding [5] Wait Controlled Flood

Hold onto a packet, until you connect to the destination.

Restricted Flood

Only forward to a subset of nodes, selected based on previous experiences forwarding packets to them. Beacon the packet hop by hop decrementing the time to live.

SLIDE 8

Existing Solutions

Integrating DTN and MANET routing [3]

Node Bridge Node MANET Node MANET Node DTN

Gently [6]

Node DTN

Two Classifications of Node Proactive Routing & Forwarding Reactive Routing and Forwarding

SLIDE 9

Dynamic Source Routing (DSR) Route Acquisition

A C B

ID: Route: 1 A

Route To A?

ID: Route: 1 A,C

RREQ Route To B?

Route Request

RREQ / RREP

ID: Route: RREP: 1 B A,C

Route To A?

ID: Route: RREP: 1 B,C A,C

Update Routing Table

Route Request / Reply Piggyback

RREP

ID: RREP: 2 B, C ID: RREP: 2 B,C

Forward Update Routing Table

Route Reply

SLIDE 10

Dynamic Source Routing (DSR) Route Failure

A C B

Receive? Data Forward

Send Data Route Fail

Update Routing Table RFAIL

SLIDE 11

My Work [1]

Disconnection Tolerant Route Acquisition
Disconnection Tolerant Data Forwarding
Packet Scheduling / Duty Cycling

Why Dynamic Source Routing? What are the assumptions? Why not TCP? Why is this needed?

SLIDE 12

Route Acquisition Over Time

History

A C C` C`` B

id=2 id=2 id=2 id=2 A A,C A,C,C` A,C,C`,C``

D D` D ` ` D` ` `

id=2 id=2 id=2

B

id=2 A,D,D`,D``,D``` A,D,D`,D`` A,D,D` A,D A id=2

E E` B

id=2 id=2 id=2 A A,E A,E,E’

SLIDE 13

Route Acquisition - Acknowledgement

A C B

ID: Route: 1 A

Route To A?

ID: Route: 1 A,C

RREQ Route To B? RQAK

ID: 1

Update Knowledge

ID: 2

Update Knowledge RQAK RREQ / RREP

ID: Route: RREP: 1 B A,C

Route To A?

ID: Route: RREP: 1 B,C A,C

Update Routing Table RREP

ID: RREP: 2 B, C ID: RREP: 2 B,C

Forward Update Routing Table

SLIDE 14

Disconnection Tolerant Data Forwarding

Receive Packet Forward Packet Resend Packet

On Fail

Send Route Failure Packet Drop Packet

Yes No TTL > 0

Pass Packet To Application Level

We Are Destination We Are Source We Are On Route On Fail 14

SLIDE 15

Packet Scheduling / Duty Cycling

C D E B F G C B C D E B F G

On OFF

C D E B F G C B C D E B F G

Day 2 Day 3 Day 1

On OFF On OFF

Based on Efficient Node Discovery Algorithm [4]

SLIDE 16

The Evaluation

SLIDE 17

The Evaluation

40 60 80 100 1 2 3 4 5 Number of Nodes Average Delay

DSR & Zigbee

DSR & 802.11 DSRR & Zigbee DSRR & 802.11

Average Delay (Seconds)

40 60 80 100 0.0 0.2 0.4 0.6 0.8 1.0 Number of Nodes Success Ratio

DSR & Zigbee

DSR & 802.11 DSRR & Zigbee DSRR & 802.11

Success Ratio (%)

SLIDE 18

The Evaluation

802.11 Routing Packet Count

MDSR.10 MDSR.25 MDSR.50 MDSR.75 MDSR.90 MDSRR.100 5000 10000 15000 20000 25000 30000 Number of Nodes RoutingPacketCount

MDSR

MDSRR

Data Packet Count

MDSR.10 MDSR.25 MDSR.50 MDSR.75 MDSR.90 MDSRR.100 20 40 60 80 100 Number of Nodes DataPacketCount

MDSR

MDSRR

SLIDE 19

The Evaluation

Zigbee

MDSR.10

MDSR.25 MDSR.50 MDSR.75 MDSR.90 MDSRR.100 200000 600000 1000000 1400000 Number of Nodes RoutingPacketCount

MDSR

MDSRR

Routing Packet Count

MDSR.10 MDSR.25 MDSR.50 MDSR.75 MDSR.90 MDSRR.100 20 40 60 80 100 Number of Nodes DataPacketCount

MDSR

MDSRR

Data Packet Count

SLIDE 20

References

1. Andrew Grundy and Milena Redankovic. Routing In Wireless Networks Of Varying

Connectivity. In The Fifth International Conference on Wireless and Mobile Communications, 2009.

D. Johnson, D. Maltz, J. Broch et al., “DSR: The dynamic source routing protocol for multi-

hop wireless ad hoc networks,” Ad hoc networking, vol. 5, pp. 139–172, 2001. 3.

J. Ott, D. Kutscher, and C. Dwertmann, “Integrating DTN and MANET routing,” in Proceedings
f the 2006 SIGCOMM workshop on Chal lenged networks. ACM New York, NY, USA, 2006, pp. 221–

228. 4.

V. Dyo and C. Mascolo, “Effjcient Node Discovery in Mobile Wireless Sensor Networks,”

Lecture Notes in Computer Science, vol. 5067, pp. 478–485, 2008. 5.

Z. Zhang, “Routing in intermittently connected mobile ad hoc networks and delay

tolerant networks: Overview and challenges,” IEEE Communications Surveys & Tutorials,

vol. 8, no. 1, pp. 24–37, 2006.

M. Musolesi, P. Hui, C. Mascolo, and J. Crowcroft. “Writing on the clean slate: Implementing a

socially-aware protocol in Haggle”. In World of Wireless, Mobile and Multimedia Networks,

2008. WoWMoM 2008. 2008 International Symposium on a, pages 1–6, 2008.

SLIDE 21

Thank You! Any Questions?

Andrew Grundy

amg@cs.nott.ac.uk http://cs.nott.ac.uk/~amg