1 / 51

On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks

On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks. Hannes Frey, Ivan Stojmenovic MobiCom 2006. Face Recovery Details. When to change current face traversal? How to decide the next face locally?. Example 1.

corin
Télécharger la présentation

On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks Hannes Frey, Ivan Stojmenovic MobiCom 2006

  2. Face Recovery Details • When to change current face traversal? • How to decide the next face locally?

  3. Example 1 Greedy Perimeter Stateless Routing GPSR [Karp, Kung, 2000]

  4. GPSR – The FACE Routing Part S T “On each face, the traversal uses the right hand rule to reach an edge that crosses line xT. At that edge, the traversal moves to the adjacent face crossed by xT. … The node forwards the packet along the first edge of this next face – by applying the right hand rule, …” [Karp & Kung 2000]

  5. x GPSR – The FACE Routing Part S T V “On each face, the traversal uses the right hand rule to reach an edge that crosses line xT. At that edge, the traversal moves to the adjacent face crossed by xT. … The node forwards the packet along the first edge of this next face – by applying the right hand rule, …” [Karp & Kung 2000]

  6. x GPSR – The FACE Routing Part S T F1 F2 V “On each face, the traversal uses the right hand ruleto reach an edge that crosses line xT. At that edge, the traversal moves to the adjacent face crossed by xT. … The node forwards the packet along the first edge of this next face – by applying the right hand rule, …” [Karp & Kung 2000]

  7. x GPSR – The FACE Routing Part S T V “On each face, the traversal uses the right hand rule to reach an edge that crosses line xT. At that edge, the traversal moves to the adjacent face crossed by xT. … The node forwards the packet along the first edge of this next face – by applying the right hand rule, …” [Karp & Kung 2000]

  8. x GPSR – The FACE Routing Part S T V “On each face, the traversal uses the right hand rule to reach an edge that crosses line xT. At that edge, the traversal moves to the adjacent face crossed by xT. … The node forwards the packet along the first edge of this next face – by applying the right hand rule, …” [Karp & Kung 2000]

  9. x GPSR – The FACE Routing Part S T “On each face, the traversal uses the right hand rule to reach an edge that crosses line xT. At that edge, the traversal moves to the adjacent face crossed by xT. … The node forwards the packet along the first edge of this next face – by applying the right hand rule, …” [Karp & Kung 2000]

  10. What about Delivery Guarantees? A B S T D C E

  11. What about Delivery Guarantees? A B S T D C E Outer Face

  12. What about Delivery Guarantees? A B S T D C E Outer Face

  13. What about Delivery Guarantees? A B S T D C E

  14. What about Delivery Guarantees? A x B S T D C E GPSR Forwarding Loop for GG, RNG, and LDT

  15. Is this an Issue for Greedy + PSR? A F1 P S T Q F2 E B C [Kim et al., 2005] D

  16. Example 2 Greedy-Face-Greedy GFG, [Bose et al., 1999]

  17. GFG – The face routing part P  S repeat Let F be the face with P on boundary and intersecting PT Traverse* F until reaching an edge that intersects PT at some point Q≠P P  Q until P=T *counterclockwise if inner, clockwise if outer face P S T F

  18. GFG – The face routing part P  S repeat Let F be the face with P on boundary and intersecting PT Traverse* F until reaching an edge that intersects PT at some point Q≠P P  Q until P=T *counterclockwise if inner, clockwise if outer face Q P S T F

  19. GFG – The face routing part P  S repeat Let F be the face with P on boundary and intersecting PT Traverse* F until reaching an edge that intersects PT at some point Q≠P P  Q until P=T *counterclockwise if inner, clockwise if outer face P S T F

  20. GFG – The face routing part P P  S repeat Let F be the face with P on boundary and intersecting PT Traverse* F until reaching an edge that intersects PT at some point Q≠P P  Q until P=T *counterclockwise if inner, clockwise if outer face S T F

  21. What about the GPSR Loop? A B S T D C E Outer Face

  22. What about the GPSR Loop? A B S T D C E Outer Face

  23. What about the GPSR Loop? Select face with P on boundary and intersecting PT A B S T D C E P Outer Face

  24. What about the GPSR Loop? A B S T D C E Outer Face

  25. Example 3 Greedy Path Vector Face Routing (GPVFR) [Leong, Mitra, Liskov, 2005]

  26. GPVFR – The Face Routing Part A S T F B 1. Find the face F containing the line segment ST. Let A and B be the clockwise and anti-clockwise nodes. If |AT| ≤ |BT|, forward the packet clockwise along F; if |AT| > |BT|, forward the packet anti-clockwise. 2. If any adjacent edge intersects the line segment ST then set S to current node C and go to step 1. [Leong, Mitra, Liskov, 2005]

  27. GPVFR – The Face Routing Part A S T B 1. Find the face F containing the line segment ST. Let A and B be the clockwise and anti-clockwise nodes. If |AT| ≤ |BT|, forward the packet clockwise along F; if |AT| > |BT|, forward the packet anti-clockwise. 2. If any adjacent edge intersects the line segment ST then set S to current node C and go to step 1. [Leong, Mitra, Liskov, 2005]

  28. GPVFR – The Face Routing Part S := C A C S T B 1. Find the face F containing the line segment ST. Let A and B be the clockwise and anti-clockwise nodes. If |AT| ≤ |BT|, forward the packet clockwise along F; if |AT| > |BT|, forward the packet anti-clockwise. 2. If any adjacent edge intersects the line segment STthen set S to current node C and go to step 1. [Leong, Mitra, Liskov, 2005]

  29. GPVFR – The Face Routing Part A S S T F B 1. Find the face F containing the line segment ST. Let A and B be the clockwise and anti-clockwise nodes. If |AT| ≤ |BT|, forward the packet clockwise along F; if |AT| > |BT|, forward the packet anti-clockwise. 2. If any adjacent edge intersects the line segment ST then set S to current node C and go to step 1. [Leong, Mitra, Liskov, 2005]

  30. GPVFR – The Face Routing Part A F S S T B 1. Find the face F containing the line segment ST. Let A and B be the clockwise and anti-clockwise nodes. If |AT| ≤ |BT|, forward the packet clockwise along F; if |AT| > |BT|, forward the packet anti-clockwise. 2. If any adjacent edge intersects the line segment ST then set S to current node C and go to step 1. [Leong, Mitra, Liskov, 2005]

  31. What about Delivery Guarantees? S T

  32. What about Delivery Guarantees? S A F T B

  33. What about Delivery Guarantees? S A T B C

  34. What about Delivery Guarantees? C B F T A S

  35. What about Delivery Guarantees? C B F T A B S

  36. What about Delivery Guarantees? T F S

  37. What about Delivery Guarantees? S GPVFR forwarding loop in arbitrary graphs F T

  38. Is this an Issue for Greedy + PVFR? B  Start here. S  F T A

  39. Example 4 • Greedy Other Adaptive Face Routing GOAFR, [Kuhn et al., 2003]

  40. Face Routing Part of GOAFR P  S repeat Explore the complete boundary of face F containing the line PT Advance to Q on F’s boundary which is closest to T and set P  Q until reaching T P S T F

  41. Face Routing Part of GOAFR P  S repeat Explore the complete boundary of face F containing the line PT Advance to Q on F’s boundary which is closest to T and set P  Q until reaching T P Q S T F

  42. Face Routing Part of GOAFR P  S repeat Explore the complete boundary of face F containing the line PT Advance to Q on F’s boundary which is closest to T and set P  Q until reaching T P Q S T F

  43. Face Routing Part of GOAFR P  S repeat Explore the complete boundary of face F containing the line PT Advance to Q on F’s boundary which is closest to T and set P  Q until reaching T F S T Q P

  44. What about the GPVFR Loop? S F T

  45. State of the Art • Counter examples for some well established mechanisms which are proved to be correct • Proofs do not consider the details of localized face selection • General question: Does face and combined greedy-face routing provide delivery guarantees???

  46. General Face Start Mechanism • Assumption • Planar graph • S and T are connected • Mechanism Select first edge SA in cw direction from ST; traverse by right hand rule Or select first edge SB in ccw direction from ST; traverse by left hand rule • Invariant: Always detects an ST-intersection P≠S S A B V U P T

  47. General Face Change Mechanism • Precondition • Planar Graph • S and T are connected • S and U are connected • UV intersects ST • Mechanism If UT right of UV then traverse by left hand rule else traverse by right hand rule • Invariant: Always detects a PT-intersection Q≠P (a) V left right T S cw<180° ccw≤180° U (b) V T Q S P U

  48. RNG and GG are Good Natured • Face change is not an issue in GG and RNG • Intersection Property of GG • RNG  GG applies to RNG as well U T WLOG: |UT| < |ST| S V

  49. Summary • Success of face routing applied on its own

  50. Summary • Success of combined greedy-face routing

More Related