Routing

Moeller et al.

Routing Without Routes: The Backpressure Collection Protocol

Steffan Karger 5-10-2010

Delft University of Technology

Challenge the future

Presentation outline
Introduction Backpressure routing Adjustments for BCP (Backpressure Collection Protocol)
The weight function Queue optimization

Implementation Results Conclusion

Routing without Routes: The Backpressure Collection Protocol

Introduction
Network assumptions
Sensor nodes Data sinks

Collection Tree Protocol

Beaconing Builds MSTs

Routing without Routes: The Backpressure Collection Protocol

Backpressure routing
Routing without routes
Data packets flow to the sink in a natural fashion

Monticello Dam in northern California

Routing without Routes: The Backpressure Collection Protocol
4

Backpressure routing
Routing without routes
Data packets flow to the sink in a natural fashion Link weight Transmission threshold

Routing without Routes: The Backpressure Collection Protocol

Backpressure routing
Routing without routes
Use ETX as link usage penalty:

Minimizes ETX -> fast delivery

Routing without Routes: The Backpressure Collection Protocol

Backpressure routing
Routing without routes

Routing without Routes: The Backpressure Collection Protocol

Adjustments for BCP

FIFO vs LIFO (1)
Under FIFO, the average source-to-sink delay grows with decreased loading, why?

Routing without Routes: The Backpressure Collection Protocol

Adjustments for BCP

FIFO vs LIFO (2)
Under LIFO, data packets cascade towards sink Average source-to-sink delay does not grow under low load

Routing without Routes: The Backpressure Collection Protocol

Adjustments for BCP

Floating queues
Problem: Queue size grows with distance to the sink
Large networks -> large queues

Solution: introduce virtual queue

Discard oldest packet in real queue Record virtual queue size Null packets

Routing without Routes: The Backpressure Collection Protocol

10

Adjustments for BCP

Floating queues
With fixed queue size algorithm breaks down Floating queue preserves gradient

Routing without Routes: The Backpressure Collection Protocol

11

Implementation
23 KB footprint (vs 27 KB for CTP) Weight recalculation parameter

Performance/processor load tradeoff

= 50ms

Link metric estimation (ETXi->j and Ri->j )

Based on data transmissions and ACKs

Advertize queue size in data header

Neighborhood snoops headers

Routing without Routes: The Backpressure Collection Protocol

12

BCP vs CTP

BCP Forwarding policy Setup cost Perturbation cost Gradient advertizing Gradients from neighborhood Initial packetloss Header snooping

CTP ETX from neighborhood Rebuilding MST Beaconing

Routing without Routes: The Backpressure Collection Protocol

13

Results
Tutornet

Experiment details
40 nodes, indoor IEEE 802.15.4-based Tmote Sky devices -18 dBm transmit power Poisson traffic

Static network tests External interference Highly mobile sinks

Routing without Routes: The Backpressure Collection Protocol

14

Results

Static network Delay performance

BCP performs comparable to CTP on delay and delivery order

Source to sink delay CDF at 0.25 PPS for motes 4 and 40

The Reordering Distance for BCP under FIFO and LIFO servicing priorities.
15

Routing without Routes: The Backpressure Collection Protocol

Results

Static network Goodput

BCP performs better then CTP with higher loads

Goodput against load Routing without Routes: The Backpressure Collection Protocol
16

Results

External interference
Alternating: 20s on, 20s off

802.11 interference

CTP: 55% - 84% delivery ratio BCP: 88% - 96% delivery ratio

Routing without Routes: The Backpressure Collection Protocol

17

Results

Highly mobile sinks

Sink moves every second

Routing without Routes: The Backpressure Collection Protocol

18

Results

Highly mobile sinks

Sink moves every second BCP adjust very good and even profits from mobile sinks

Mobility BCP CTP Delivery ratio Average Tx/packet 0.996 1.73 9.5

Static BCP CTP 0.999 2.65 2.39

0.590 0.969

Routing without Routes: The Backpressure Collection Protocol

19

Results

Highly mobile sinks

Data is dumped when sink is nearby

A 200 second window of sink time versus source mote for sinks 8, 18 and 26 Routing without Routes: The Backpressure Collection Protocol
20

Conclusion
In static networks:
BCP performs comparable to CTP on delay and efficiency BCP can cope with hihger loads

Robust to external interference Very good performance with highly mobile sinks

Routing without Routes: The Backpressure Collection Protocol

21

Discussion

Duty cycled operation

What happens when we use a duty cycle operation?

BCP should work quite well with synchronized duty-cycle MACs like S-MAC A-synchronous duty-cycle MACs like LPL MAC need adjustments for packet snooping

Routing without Routes: The Backpressure Collection Protocol

22

Discussion

Transmission count

How about transmission count? Comparable to CTP

Per source average per packet transmission count to the sink Routing without Routes: The Backpressure Collection Protocol
23