Review of Target Paper and Related Work 2014 – 10 – 02

1. Mobile Computing Term ProjectAn Algorithms Approach to Geographic Routing in Ad Hoc and Sensor Networks Review of Target Paper and Related Work 2014 – 10 – 02 Group #1 Moon-sang Hwang Hae-su Hwang In-Hur mslab@welgate.co.kr seasky@skku.ac.kr oracle0307@skku.edu

2. Presentation Outline • Introduction (related stuffs, objective of the target paper) • Problem Formulation (optional) • Review of Related Studies/Schemes (summary of each) • Background/Preliminaries • Target Scheme (using its name here, e.g. GOAF+) • Pros and Cons/Your Findings (if any) • Conclusion and Future Work • References

3. Introduction Introducing of the WSN … Introducing of some related stuffs of the target problem …

4. Problem Formulation

5. Related Work (1/2)

6. Related Work (2/2)

7. PreliminariesAssumptions

8. PreliminariesGraph Models For our routing algorithms the network graph is required to be planar Without intersecting edges UDG(Unit Disk Graph) with lower bound d0 : The distance between any two nodes is bounded from below ( for all edges ) GG(Gabriel Graph) A GG contains an edge between two nodes u and v if and only if the disk having as a diameter does not contain a “witness node w “ w v X v u u

9. Target Scheme: GOAFR+ (1/2)(Greedy Other Adaptive Face Routing Plus) • Geographic Routing with combining greedy and face routingin MANET • Each node send a HELLO msg periodically • 2 mode of GOAFR+ • Greedy Routing Mode(GRM) • Locally optimal choice of next hop is the neighbor closest to the destination • Whenever possible, the GOAFR+ tries to route in GRM • Face Routing Mode(FRM) • Explore the complete boundary of the face employing right hand rule • In order to overcome local minima, mode change to FRM D D z x y x

10. Target Scheme: GOAFR+ (2/2) FALLBACK equation : p > σq (σ is constant factor ) 1. p = 0, q = 0 2. P = 0, q = 1 1. P = 0, q = 2 3. P = 0, q = 3 4. P = 0, q = 4 5. P = 1, q = 4 6. P = 2, q = 4 => Fallback to greedy mode 2 t s 1 F 6 3 5 4 C C

11. Advantages of GOAFR+ (1/2) • GOAFR+’s bounding circle C0( constant value) • Initial : ( when a sender begin sending a msg ) • Reduce a radius : • In Face routing mode, if a msg hit a boundary of circle C0, than enlarge double • Proposed bounding circle Cn • … (e.g. how it work) n11 n10 n8 n5 n6 n1 n3 s t n2 n4 n9 n2 n7 Cn Co

12. Advantages of GOAFR+ (2/2) • … • … • … n11 n10 n8 n5 n6 n1 n3 s t n2 n4 n9 n2 n7 Cn Co

13. Disadvantages of GOAFR+ (1/2) GOAFR+ uses only right hand rule Give some analysis … (e.g. how disadvantage it is) n11 n8 n10 n5 n8 n6 n1 n3 p s t n2 n4 n9 n2 n7 Co

14. Disadvantages of GOAFR+ (2/2) GOAFR+ uses only right hand rule Give some analysis … (e.g. how disadvantage it is) n11 n8 n10 n5 n8 n6 n1 n3 p s t n2 n4 n9 n2 n7 Co

15. Conclusion and Future Work • Conclusion • … • Future Work • Completing the implementations of the target scheme & proposed scheme in C++ (expected time) • Collecting and Analyzing the results (expected time)

16. References • F. Kuhn, R. Wattenhofer, and A. Zollinger, “An Algorithms Approach to Geographic Routing in Ad Hoc and Sensor Networks”, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 1, FEBRUARY 2008 • B. Karp and H. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in Proc. ACM MobiCom, 2000, pp. 243–254 [Online].Available: citeseer.nj.nec.com/karp00gpsr.html • F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-case optimal and average-case efficient geometric ad hoc routing,” in Proc. ACM MobiHoc, 2003. • F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric routing: Of theory and practice,” in Proc. 22nd ACM Symp. Principlesof Distributed Computing (PODC), 2003. • H. Frey and I. Stojmenovic, “On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks,” in Proc.ACM MobiCom, Los Angeles, CA, Sep. 2006.