1 / 123

Exploitation of Path Diversity in Cooperative Multi-Hop Wireless Networks

Exploitation of Path Diversity in Cooperative Multi-Hop Wireless Networks. Dissertation Committee. Candidate Chair. : Jonghyun Kim : Dr. Bohacek. Department of Electrical and Computing Engineering University of Delaware. Dr. Cimini Dr. Cotton Dr. Shen Dr. Morris. (ECE Department)

kairos
Download Presentation

Exploitation of Path Diversity in Cooperative Multi-Hop Wireless 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. Exploitation of Path Diversity in Cooperative Multi-Hop Wireless Networks Dissertation Committee Candidate Chair : Jonghyun Kim : Dr. Bohacek Department of Electrical and Computing Engineering University of Delaware Dr. Cimini Dr. Cotton Dr. Shen Dr. Morris (ECE Department) (ECE Department) (CIS Department) (CERDEC)

  2. Outline • Introduction and challenges • Aggressive path quality monitoring • BSP • Efficient path quality monitoring • LBSP • Opportunistic forwarding • LBSP2, LOSP, LMOSP • Conclusion and future work

  3. Introduction and challenges Channel Activity Analysis 2007 ~ 2009 1 paper Cooperative Path Diversity 2005 ~ present 4 papers User Perceptual Quality Evaluation 2008 ~ 2009 0 paper Research Mobility Modeling 2004 ~ 2009 4 papers Application Traffic Identification & Modeling 2008 ~ 2011 1 paper

  4. Proactive (e.g., OLSR) Reactive (e.g., AODV) Introduction and challenges Routing Technique

  5. Introduction and challenges • Proactive : Routing control packet transmission : No transmission

  6. Introduction and challenges • Reactive : Routing control packet transmission : No transmission

  7. Introduction and challenges • Reactive : data packet from transport layer

  8. Proactive (e.g., OLSR) Reactive (e.g., AODV) Single path (e.g., AODV) Multiple paths (e.g., AOMDV) Introduction and challenges Routing Technique

  9. Introduction and challenges • Single path B A

  10. Introduction and challenges • Multiple paths B A

  11. Proactive (e.g., OLSR) Reactive (e.g., AODV) Cooperative path diversity (BSP, LBSP, LOSP, LMOSP) Introduction and challenges Routing Technique Single path (e.g., AODV) Multiple paths (e.g., AOMDV)

  12. Introduction and challenges • Cooperative path diversity A B

  13. Introduction and challenges • Cooperative path diversity A B One possible path

  14. Introduction and challenges • Cooperative path diversity A B Another possible path

  15. Introduction and challenges • Cooperative path diversity A B Many possible paths

  16. Introduction and challenges • Cooperative path diversity A B Best path

  17. Link quality varies Path quality varies Best path varies Introduction and challenges • Cooperative path diversity Nodes are moving

  18. Introduction and challenges • Challenges • How to define the path quality based on channel conditions? • How to monitor the time-varying path quality to determine the best path cooperatively?

  19. Aggressive path quality monitoring (BSP) Efficient path quality monitoring (LBSP) Opportunistic forwarding with path qualities (LOSP, LMOSP) Introduction and challenges • Overview Cooperative path diversity (BSP, LBSP, LOSP, LMOSP)

  20. Outline • Introduction and challenges • Aggressive path quality monitoring • BSP • Efficient path quality monitoring • LBSP • Opportunistic forwarding • LBSP2, LOSP, LMOSP • Conclusion and future work

  21. Aggressive path quality monitoring • Objectives • Define path quality • Monitor path quality aggressively/ideally to investigate maximally possible benefits offered by path diversity routing • Protocol proposed : BSP (best-select protocol)

  22. Aggressive path quality monitoring • Path quality • Depends on channel conditions • (e.g., channel loss, SNR, transmit power) • Depends on protocol designer’s routing objectives • Maximize the minimum SNR along the path • (max-min SNR) • Maximize delivery probability • Maximize throughput • Minimize end-to-end delay • Minimize total power • Minimize total energy

  23. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination

  24. Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0 Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination

  25. Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0 Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination 2,1 1,1 3,1 0,1 src dst 2,2 1,2

  26. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination 2,1 1,1 3,1 0,1 src dst 2,2 1,2

  27. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(1,1)= 30 2,1 1,1 30 3,1 0,1 20 2,2 1,2 J(1,2)= 20

  28. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(1,1)= 30 J(2,1)= 20 20 2,1 1,1 30 3,1 0,1 20 2,2 1,2 J(1,2)= 20

  29. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(1,1)= 30 J(2,1)= 20 20 2,1 1,1 30 J(2,1)= 10 3,1 0,1 10 20 2,2 1,2 J(1,2)= 20

  30. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(2,1)= 20 20 2,1 1,1 30 3,1 0,1 10 20 2,2 1,2

  31. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(2,1)= 20 20 2,1 1,1 30 3,1 0,1 10 20 2,2 1,2

  32. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination 2,1 1,1 3,1 0,1 2,2 1,2

  33. Previous step’s cost-to-go Stage information Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination

  34. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(1,1)= 30 20 2,1 1,1 3,1 0,1 J(1,2)= 20 10 2,2 1,2

  35. Aggressive path quality monitoring • Dynamic programming • Achieves routing objectives = cost-to-go from node (n,i) to destination J(1,1)= 30 20 2,1 1,1 3,1 0,1 J(1,2)= 20 10 2,2 1,2

  36. Aggressive path quality monitoring • Max-min SNR

  37. Aggressive path quality monitoring • Max delivery probability

  38. Aggressive path quality monitoring • Max delivery probability

  39. Aggressive path quality monitoring • Max delivery probability n-1,In-1(1) n,i n-1,In-1(2) n-1,In-1(3)

  40. Aggressive path quality monitoring • Max delivery probability n-1,In-1(1) n,i n-1,In-1(2) n-1,In-1(3)

  41. Aggressive path quality monitoring • Max delivery probability n-1,In-1(1) n,i n-1,In-1(2) n-1,In-1(3)

  42. Aggressive path quality monitoring • Max throughput

  43. Aggressive path quality monitoring • Min end-to-end delay

  44. Aggressive path quality monitoring • Min total power

  45. Aggressive path quality monitoring • Min total energy

  46. Aggressive path quality monitoring • Construction of relay-sets 2,1 1,1 3,1 0,1 2,2 1,2 AODV finds a traditional single path

  47. Aggressive path quality monitoring • Construction of relay-sets Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0 2,1 1,1 3,1 0,1 2,2 1,2

  48. Aggressive path quality monitoring • Construction of relay-sets Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0 2,1 1,1 3,1 0,1 2,2 1,2

  49. Aggressive path quality monitoring • Construction of relay-sets Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0 2,1 1,1 3,1 0,1 2,2 1,2

  50. Aggressive path quality monitoring • Construction of relay-sets Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0 2,1 1,1 3,1 0,1 2,2 1,2

More Related