BVR - Beacon Vector Routing: Scalable Point-to-Point...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets R. Fonseca, Berkeley; S. Ratnasamy, Intel Research; J. Zhao, ICI; C. T. Ee, D. Culler, S. Shenker, and I. Stoica, Berkeley NSDI 2005
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
The BVR Algorithm Algorithm in three distinct parts: Greedy forwarding Fallback Mode Scoped Flooding
Background image of page 2
The BVR Algorithm Define location based on number of hops to the routing beacons Each node stores its location as a vector of hop counts. P(q) = <q1,q2,q3,…qr> e.g. <5,1,6,4,3,5,7,9,3> Packets are routed based on these vectors
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
The BVR Algorithm Nodes retain the position of their neighboring nodes. A nodes neighborhood is the collection of nodes one hop away, for most nodes.
Background image of page 4
The BVR Algorithm The algorithm compares the difference between the packet’s destination and the current node’s neighbors. Main Rule: Minimize the sum of the differences for the beacons that are closer to the destination d than to the current routing node p Ties in the Above are broken by this rule: Minimize the sum of the distances to the farther beacons Distance function
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
BVR Algorithm
Background image of page 6
Algorithm in operation
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
9 14 3 1 b 1 b 2 Beacon Source Destination <4,1,2> <1,4,7> <1,2,5> <5,2,3> <5,2,1> <5,3,2> 2 <2,5,8> 4 <1,3,3> 5 <2,3,4> 13 b 3 <4,4,3> 7 8 12 10 6 15 11 <3,4,4> <1,4,6> <0,3,6>
Background image of page 8
9 14 3 1 b 1 b 2 Beacon Source Destination <4,1,2> <1,4,7> <1,2,5> <5,2,3> <5,2,1> <5,3,2> 2 <2,5,8> 4 <1,3,3> 5 <2,3,4> 13 b 3 <4,4,3> 7 8 12 10 6 15 11 <3,4,4> <1,4,6> <0,3,6> Hop 1: - only one decision
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
9 14 3 1 b 1 b 2 Beacon Source Destination <4,1,2> <1,4,7> <1,2,5>
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 38

BVR - Beacon Vector Routing: Scalable Point-to-Point...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online