Routing, Anycast, and Multicast for Mesh and Sensor Networks

1
Routing, Anycast, and Multicast for Mesh and
Sensor Networks

• Presented By Bo Li

2
Introduction

• What is the problem
• Efficient single destination routing, anycast,
  and multicast.
• 1. How fast a message is delivered.
• 2.How much overhead the algorithm generates
  (Routing table size)
• The goal is to trade off the two properties in
  order to get a high performance.

3
Introduction

• How to solve
• Simple routing
• Require O (n) routing tables.
• Geographic routing (require no routing tables)
• The length of the path may be the square of opt
• Presume precise position
• Only suitable for UDG model.
• Labeled routing
• Small routing tables of bounded size
• Close to optimal unicasting and constant
  approximation to any cast.

4
Introduction

• Why multicast?
• To build a Steiner tree to connect the original
  and the destination nodes.

5
Definition And Preliminaries
6
Definition And Preliminaries
7
Definition And Preliminaries
8
Definition And Preliminaries
9
Dominance Net

• The dominance net has the following properties

10
Dominance Net
11
Dominance Net

• Dominance

12
Dominance Net

• B. Naming Scheme

13
Dominance Net

• C. Dominance Labeling

14
Dominance Net

• D. Cover Tree
• Each node of the cover tree carries at most 2a
  bits.
• There are at most 22a net-centers per level
  covering node v.
• The depth of the tree is at most v-1.
• The cover tree holds at most a22a1v bits.
• Primary/Secondarygt (2a3)22av bits

15
Dominance Net

• E. Distance Approximation

16
Dominance Net

• E. Distance Approximation

17
Dominance Net

• E. Distance Approximation

18
The End

Thank you! Any questions?