36
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation

On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

  • Upload
    tamra

  • View
    58

  • Download
    0

Embed Size (px)

DESCRIPTION

On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing. Argyrios Tasiopoulos MSc , student, AUEB. Introduction. Many networks are characterized by: Intermittent Connectivity. Long or variable delays. In both cases traditional TCP/IP protocols fail. - PowerPoint PPT Presentation

Citation preview

Page 1: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Argyrios Tasiopoulos MSc, student, AUEB

Master Thesis presentation

Page 2: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Introduction• Many networks are characterized by:

– Intermittent Connectivity.– Long or variable delays.

• In both cases traditional TCP/IP protocols fail.

• Delay Tolerant Networking addresses these issues. 4 to 20 minutes

Master Thesis presentation

Page 3: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Delay Tolerant Networks (DTNs)

• In Delay-Tolerant Networks each node can hold packets indefinitely in a persistent buffer.

• The previous problems are addressed by store-and-forward message switching.

Page 4: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Mobile Delay Tolerant Networks• In mobile DTNs, nodes can carry a packet

physically in their buffer.• Therefore, we actually have store-carry-

and-forward packet switching.

Source Destination

Buffer

Packet

4Master Thesis presentation

Page 5: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

DTNs Protocol Design• In DTNs we have an extra degree of freedom

regarding the delay in data delivery.• We can trade off delay in order to improve

other metrics.• Our case of study concerning the improvement

of aggregate transmission cost.– We care about the behavior of aggregate

transmission cost of a packets given a delivery delay.

5WoWMoM San Francisco 2012

Page 6: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Aggregate Transmission Cost• What we mean in this work when we talk

about aggregate transmission cost?– The cost of interference (typically proportional

to transmission area), and/or– the energy consumption of a transmission

(typically fixed).

6Master Thesis presentation

Page 7: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Coming next• Part A: Optimal Cost/Delay Tradeoff

Formulation• Part B: Cost/Delay Tradeoffs in

Geographic Routing• Part C: Simulation Environments and

Results

7Master Thesis presentation

Page 8: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Part A: Optimal Cost/Delay Tradeoff Formulation.

8Master Thesis presentation

Page 9: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Optimal Cost/Delay Tradeoff• We take the typical approach of evolving

graphs (Ferreira 2004).• We divide the time into discrete time

intervals, called epochs.• We make the assumptions that during each

epoch:– the network topology remains fixed, hence

creates a network replica for the specific epoch, and

– all packet transmissions can take place.9Master Thesis presentation

Page 10: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Cost/Delay Evolving Graph

• We define as Cost/Delay Evolving Graph (C/DEG) the graph comprised by:– consecutive replicas,– link arcs, which

connect nodes along the same replica, and

– storage arcs, which connect the same nodes along consecutive replicas.

10

11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

24

11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

24

11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

24

Master Thesis presentation

Page 11: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Punctual vs. Optimal Cost/Delay Curve

• Given a packet source we can execute any one-to-many shortest path algorithm.

• We define the Punctual Cost/Delay Curve (PC/DC), as the minimum-cost journey of exactly t epochs, between two nodes.

• We define the Optimal Cost/Delay Curve (OC/DC), as the minimum-cost journey of all journeys with the maximum duration of t epochs.

WoWMoM San Francisco 2012 11

Page 12: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Punctual Cost/Delay Curve Example11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

24

WoWMoM San Francisco 2012 12

1

PC/DC point

Agg

rega

te tr

ansp

ort c

ost

Delay, in epochs2 3 4

11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

241

PC/DC point

Agg

rega

te tr

ansp

ort c

ost

Delay, in epochs2 3 4

11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

241

PC/DC point

Agg

rega

te tr

ansp

ort c

ost

Delay, in epochs2 3 4

11

41

31

21

12

42

32

22

13

43

33

23

14

44

34

241

PC/DC point

Agg

rega

te tr

ansp

ort c

ost

Delay, in epochs2 3 41

PC/DC point

PC/DC

Agg

rega

te tr

ansp

ort c

ost

Delay, in epochs2 3 4

Page 13: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

13

Punctual vs. Optimal Cost/Delay Curve Example

1 2 3 4 5 6 7 8

PC/DC point

PC/DC OC/DC

9

Agg

rega

te tr

ansp

ort c

ost

Delay, in epochsMaster Thesis presentation

Page 14: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Part B: Cost/Delay Tradeoffs in Geographic Routing.

14Master Thesis presentation

Page 15: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Geographic routing• In geographic routing a source sends a

message to the geographic location of the destination.

15

Destination

R

Master Thesis presentation

Page 16: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Geographic routing• Then, the packet route from source to

destination is calculated “on the fly”.

16

Source Destination Source Destination

Holder

DestinationHolder

DestinationPacket

Master Thesis presentation

Complete network topology

Page 17: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Protocol family• Each node which executes a protocol of

this family:– Applies a Neighbor Evaluation Rule (NER)

to its immediate neighbor nodes, which returns the best of them.

– Calculates the minimum-cost path to the best neighbor.

– Forwards the packet to the next hop node along the minimum-cost path.

17Master Thesis presentation

Page 18: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Protocol Family Example

18

Execute NERFind the bestCalculate

shortest-cost path

Forward the packet to the

next hop node

Packet

Master Thesis presentation

Page 19: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Protocol Family Variations• Next we define 5 member of this protocol

family.• All rules differ on NER.• For the rest of this presentation:

– node A is the packet holder which performs the NER,

– node B is a candidate neighbor of A, and– node D the packet destination.

19Master Thesis presentation

Page 20: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Motion Vector (MoVe)(LeBrun et al.,2005)

• MoVe NER: Select as best the node with the current or future closest distance from the destination.

A

D

Z

B vB

|AD||BD|

|ZD|

Minimizes |ZD|

20Master Thesis presentation

Page 21: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

AeroRP (Peters et al., 2011)

• AeroRP NER: Selects as best the node with the biggest relative velocity towards destination

A

D

Z

vB

|AD||BD|

|ZD|

B

vRBMaximizes vRB

21Master Thesis presentation

Page 22: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Minimum Cost-per-Progress (MCpPR)

• MCpPR NER minimizes the ratio:

BDADCr BA

AB '

D

Z

vB

|AD||BD|

|ZD|

A

B22Master Thesis presentation

Page 23: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Balance Ratio Rule (BRR)• Our first novel protocol minimizes the ratio:

• We define α as the conversion coefficient.– Which strikes a balanced between cost and

delay by trying to keep them both low.

ZDADdCr ZBBA

AB

''

A

D

Z

B vB

|AD||BD|

|ZD|

23Master Thesis presentation

Page 24: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Composite Rule (CR)• MCpPR rule tries to maximize the

immediate transmission gains.• BRR tries to maximize the benefits of the

physical transportation of store-carry-and-forward packet switching.

• Hence, we define Composite Rule (CR) as the best of two worlds which minimizes simultaneously the ratios of MCpPR and BRR :

24

ABABAB rrC '','min

Master Thesis presentation

Page 25: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Achievable Cost/Delay Curve (AC/DC)

• We define the AC/DC as the curve that give for each epoch, the minimum aggregate transmission cost that a protocol can achieve for a pair of nodes.

• If the protocol has tunable parameters concerning the tradeoff, an achievable cost/delay curve (AC/DC) is calculated in a similar way to OC/DC, over the complete range of results of these parameters.

25Master Thesis presentation

Page 26: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Achievable Cost/Delay Tradeoff Example

26

1 t0 t0+2 t0+3 t0+4 t0+5 t0+6

Tunable parameters results

AC/DC

t0+7t0+1Delay, in epochs

Agg

rega

te tr

ansp

ort c

ost

Master Thesis presentation

Page 27: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Part C: Simulation Environments and Results.

27Master Thesis presentation

Page 28: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Performance Evaluation Settings

• We evaluate our protocols in the 3 following settings:– empty space setting,– home region setting, and– urban setting.

28Master Thesis presentation

Page 29: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Simulation parameters• The common tunable parameter for all these

protocols is the restricted radius R’ which determines the maximum transmission hop length.

• CR and BRR have the extra tunable parameter α.

• Standard case: The nodes move with random velocities and we have a quadratic aggregate transmission cost function (equal to d2 where d the transmission distance).

29Master Thesis presentation

Page 30: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

30

Empty Space Setting

Master Thesis presentation

50 100 150 200 250 3000

5

10

15x 10

5

Delay (in epochs)

Cos

t (in

m2 )

MCpPRMoVeAeroRPBRRCROC/DC

1

Page 31: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

31

Empty Space Setting – Fixed velocities and cost function

Master Thesis presentation

30 40 50 60 70 80 90 1000

0.5

1

1.5

2

2.5x 10

6

Delay (in epochs)

Cos

t (in

m2 )

MCpPRMoVeAeroRPBRRCROC/DC

21

Page 32: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

32

Home Region Setting

Master Thesis presentation

50 100 150 200 250 3000

5

10

15x 10

5

Delay (in epochs)

Cos

t (in

m2 )

MCpPRMoVeAeroRPBRRCROC/DC

1

Page 33: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Urban Setting

Master Thesis presentation

50 100 150 200 250 300 3500

5

10

15x 10

5

Delay (in epochs)

Cos

t (in

m2 )

MCpPRMoVeAeroRPBRRCROC/DC

1

Page 34: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

34

Urban Setting-Fixed velocities

Master Thesis presentation

20 40 60 80 100 1200

5

10

15x 10

5

Delay (in epochs)

Cos

t (in

m2 )

MCpPRMoVeAeroRPBRRCROC/DC

1

Page 35: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Conclusions• Our immediate contributions:

– The formulation of optimal tradeoff between the packet delivery delay and the aggregate transmission cost existing in all DTNs.

– The study of this tradeoff in the context of geographic routing

– Our two novel rules with results close to the optimal.• Our most important contribution:

– We set the agenda for a systematic evaluation of cost/delay tradeoffs in a variety of DTNs settings.

35Master Thesis presentation

Page 36: On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing

Thank you