SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks

leala avatar
leala
52 diapositives · 632 Views · Jul 21, 2014

Introducing a location-aware information brokerage scheme with retrieval guarantee and distance sensitivity for 3D wireless ad hoc networks, addressing limitations of existing schemes and achieving efficient data exchange. Simulations and conclusion analyze the scheme's performance and benefits.

#retrieval-guaranteed location-aware information brokerage scheme in 3d wireless ad hoc networks #retrieval-guaranteed location-aware information brokerage scheme in 3d wireless ad hoc networks ppt #powerpoint #presentation
Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks - slide 1
01 / 52Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks
1 / 17

Télécharger la présentation

Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks

  2. Outline • Introduction • Motivation, related works, and goals • Issue discussed in this dissertation • Information brokerage scheme with distance sensitivity • Information brokerage scheme in 3D wireless ad hoc networks • Simulations • Conclusion

  3. Information BrokerageScheme A B

  4. Information BrokerageScheme • Three types of nodes: • Broker • Producer • Consumer • DistanceSensitivity A B C

  5. Related Works • XYLS • FMMS iMesh • Double Rulings DRACA B A B A

  6. Distance Sensitivity in 3D

  7. Distance Sensitivity in 3D • A retrieval-guaranteed distance sensitive information brokerage scheme in 3D wireless ad hoc networks.

  8. Issue Discussed in This Dissertation • Information brokerage scheme with distance sensitivity • Existing schemes don’t work well in 3D. • Achieving distance sensitivity costs lots of message overhead. • Information brokerage scheme in 3D wireless ad hoc networks • The network is not a continuous domain. • Each node must finds a same agent node.

  9. Information Brokerage Scheme with Distance Sensitivity

  10. Information Brokerage Scheme with Distance Sensitivity (LAIB) X-axis 4 Replication-Retrieval Tree 2 6 1 3 5 7 4 7 8 3 6 1 2 5 7 8 7 5 6 6 5 4 3 4 3 1 2 2 1 0

  11. Construction of Replication-Retrieval Tree r ( 4 , [0,8] ) 4 α β ( 2 , [0,4] ) ( 6 , [4,8] ) 2 6 ( 1 , [0,2] ) ( 3 , [2,4] ) ( 5 , [4,6] ) ( 7 , [6,8] ) 1 3 5 7 ( 6 , [5,6] ) ( 7 , [6,7] ) ( 1 , [0,1] ) ( 2 , [1,2] ) ( 3 , [2,3] ) 4 ( 4 , [3,4] ) ( 5 , [4,5] ) 7 8 3 6 ( 8 , [7,8] ) 1 2 5 7 8 7 5 6 6 5 4 3 4 3 1 2 2 1 0

  12. Example of LAIB 6 3 8 2 5 7 9 7 8 1 4 9 6 10 3 1 2 2 3 4 5 5 6 6 7 7 8 8 9 9 10 5 0 1 1 2 3 4 4

  13. Example of LAIB 6 3 8 2 5 7 9 7 8 1 4 9 6 10 3 1 2 2 3 4 5 5 6 6 7 7 8 8 9 9 10 5 0 1 1 2 3 4 4 3, 4, 5, 6

  14. Example of LAIB 3 2 4 1 5 2 3 1 5 2 4 6 1 3 4 5 4 0 1 3 2 4 1 3 2 5 4 1 2 3 1 5 0 1 2 4 5 6 3 4 2 3 (3,2,2)、(3,2,3) 、(3,2,4) 、(3,3,2) 、(3,3,3)、(3,3,4) 、(3,4,2) 、(3,4,3) 、(3,4,4) … (6,4,2)、(6,4,3) 、(6,4,4)、(6,5,2) 、(6,5,3)、(6,5,4) 2, 3, 4, 52, 3, 4

  15. Example of LAIB 6 3 8 2 5 7 9 7 8 1 4 9 6 10 3 1 2 2 3 4 5 5 6 6 7 7 8 8 9 9 10 5 0 1 1 2 3 4 4 1, 2, 3, 6

  16. Example of LAIB 3 2 4 1 5 2 3 1 5 2 4 6 1 3 4 5 4 3 2 3 4 5 4 1 2 3 1 5 0 1 2 4 5 6 1 2 0 1 3 4 2 3 (1,1,1)、(1,1,2) 、(1,2,1)、(1,2,2) 、(1,3,1)、(1,3,2)…(6,1,1)、(6,1,2) 、 (6,2,1)、(6,2,2) 、(6,3,1)、(6,3,2) 1, 2, 31, 2

  17. Example of LAIB 6 3 8 2 5 7 9 7 8 1 4 9 6 10 3 1 2 2 3 4 5 5 6 6 7 7 8 8 9 9 10 5 0 1 1 2 3 4 4

  18. Example of LAIB 3 2 4 1 5 2 3 1 5 2 4 6 1 3 4 5 4 1 2 3 1 0 5 1 4 2 5 6 3 4 2 3 2 1 3 0 4 4 2 1 3 5 (3,2,2)、(3,3,2)、(6,2,2)、(6,3,2)

  19. Properties of LAIB • Retrieval guarantee • Bounded replication message overhead • Distance sensitivity 2 4 1 3 1 5 2 4 5 4 1 2 3 1 0 3 4 2 3

  20. Properties of LAIB • Retrieval guarantee • Bounded replication message overhead • Distance sensitivity • The expected values of retrieval latency, replication message overhead, and replication memory overhead.

  21. Properties of LAIB • Retrieval guarantee • Distance sensitivity • Bounded replication message overhead • The expected values of retrieval latency, replication message overhead, and replication memory overhead. 2 4 1 3 1 5 2 4 5 4 1 2 3 1 0 3 4 2 3

  22. Properties of LAIB 2 4 1 3 1 5 2 4 5 4 1 2 3 1 0 3 4 2 3

  23. Properties of LAIB 2 4 1 3 1 5 2 4 5 4 1 2 3 1 0 3 4 2 3

  24. Properties of LAIB • Retrieval guarantee • Distance sensitivity • Bounded replication message overhead • The expected values of retrieval latency, replication message overhead, and replication memory overhead.

  25. Information Brokerage Scheme in 3D Wireless Ad hoc Networks

  26. Information Brokerage Scheme in 3D Wireless Ad hoc Networks

  27. Information Brokerage Scheme in 3D Wireless Ad hoc Networks

  28. Information Brokerage Scheme in 3D Wireless Ad hoc Networks

  29. Information Brokerage Scheme in 3D Wireless Ad hoc Networks

  30. Dual Graph R. Flury and R. Wattenhofer, “Randomized 3D geographic routing,” in IEEE INFOCOM, 2008

  31. Dual Graph

  32. Dual Graph

  33. Implementation with Dual Graph

  34. Implementation with Dual Graph

  35. Locating the Holes • Find the corner of the hole. • Collect the information of the hole. • Notify the hole information to all nodes on the boundary of hole.

  36. Simulation • Assumption • Each node has a unique ID • Nodes are static • Network behaviors are not taken into consideration • Metrics • Replication memory overhead • Replication and retrieval message overhead • Retrieval latency stretch • Environment Setup • Size of deployed region is fixed • Density of networks: 6, 8, 10, 12, 14

  37. Replication Memory Overhead 37

  38. Replication and Retrieval Message Overhead 38

  39. Retrieval Latency Stretch 39

  40. Replication Memory Overhead (Voids)

  41. Replication Message Overhead (Voids)

  42. Retrieval Latency Stretch (Voids)

  43. Conclusion • We proposed the FIRST location-aware information brokerage scheme with a bounded data retrieval path length and bounded replication and retrieval message overhead costs available for use in 3D wireless ad hoc networks.

  44. Q&A

  45. Appendix

  46. Dual Graph l

  47. Example of Locating Holes h1 a h2 47

  48. Example of Locating Holes c b h1 a h2 48

  49. Example of Locating Holes b h1 a h2

  50. Example of Locating Holes h1 h2 a