Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published byArnold Sutton Modified over 9 years ago

Similar presentations

Presentation on theme: "Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks."— Presentation transcript:

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 2

3 Information Brokerage Scheme A B 3

4  Three types of nodes:  Broker  Producer  Consumer  Distance Sensitivity Information Brokerage Scheme A C B 4

5 Related Works  XYLS  FMMS iMesh  Double Rulings DRACA A B A B 5

6 Distance Sensitivity in 3D 6

7 Information Brokerage SchemeDistance sensitivity Dimension FMMS (IEEE ICCCN 2002) Yes2D Double Rulings (IEEE/ACM ToN 2009) Yes2D XYLS (IJCNDS 2008) Yes2D iMesh (IEEE ToC 2009) Yes2D DRACA (IEEE ICC 2009) Yes2D LAIBYes3D  A retrieval-guaranteed distance sensitive information brokerage scheme in 3D wireless ad hoc networks. 7

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. 8

9 Information Brokerage Scheme with Distance Sensitivity 9

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

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

12 Example of LAIB 2 2 1 1 3 3 3 3 6 6 5 5 1 1 2 2 0 0 1 1 3 3 4 4 4 4 5 5 5 5 6 6 2 2 3 3 1 1 2 2 6 6 5 5 4 4 4 4 8 8 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 7 7 8 8 9 9 7 7 9 9 Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 12

13 Example of LAIB 2 2 1 1 3 3 3 3 6 6 5 5 1 1 2 2 0 0 1 1 3 3 4 4 4 4 5 5 5 5 6 6 2 2 3 3 1 1 2 2 6 6 5 5 4 4 4 4 8 8 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 7 7 8 8 9 9 7 7 9 9 Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 3, 4, 5, 6 13

14 Example of LAIB 3 3 5 5 6 6 6 6 5 5 5 5 4 4 1 1 0 0 2 2 1 1 3 3 2 2 4 4 3 3 4 4 5 5 4 4 1 1 1 1 2 2 3 3 2 2 2 2 4 4 5 5 5 5 4 4 4 4 3 3 3 3 2 2 3 3 4 4 3 3 1 1 2 2 2 2 1 1 1 1 1 1 0 0 Producer(5,3,3) Consumer(1,1,1) (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) NodeX-SETY-SETZ-SET 3, 4, 5, 6 2, 3, 4, 5 2, 3, 4 14

15 Example of LAIB 2 2 1 1 3 3 3 3 6 6 5 5 1 1 2 2 0 0 1 1 3 3 4 4 4 4 5 5 5 5 6 6 2 2 3 3 1 1 2 2 6 6 5 5 4 4 4 4 8 8 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 7 7 8 8 9 9 7 7 9 9 Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 3, 4, 5, 62, 3, 4, 52, 3, 4 1, 2, 3, 6 15

16 Example of LAIB 3 3 5 5 6 6 6 6 5 5 5 5 4 4 1 1 0 0 2 2 1 1 3 3 2 2 4 4 3 3 4 4 5 5 4 4 1 1 1 1 2 2 3 3 2 2 2 2 4 4 5 5 5 5 4 4 4 4 3 3 3 3 2 2 3 3 4 4 3 3 1 1 2 2 2 2 1 1 1 1 1 1 0 0 Producer(5,3,3) Consumer(1,1,1) (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) NodeX-SETY-SETZ-SET 3, 4, 5, 62, 3, 4, 52, 3, 4 1, 2, 3, 6 1, 2, 3 1, 2 16

17 Example of LAIB 2 2 1 1 3 3 3 3 6 6 5 5 1 1 2 2 0 0 1 1 3 3 4 4 4 4 5 5 5 5 6 6 2 2 3 3 1 1 2 2 6 6 5 5 4 4 4 4 8 8 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 7 7 8 8 9 9 7 7 9 9 Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 3, 4, 5, 62, 3, 4, 52, 3, 4 1, 2, 3, 61, 2, 31, 2 17

18 Example of LAIB 3 3 5 5 6 6 6 6 5 5 5 5 4 4 1 1 0 0 2 2 1 1 3 3 2 2 4 4 3 3 4 4 5 5 4 4 1 1 1 1 2 2 3 3 2 2 2 2 4 4 5 5 5 5 4 4 4 4 3 3 3 3 2 2 3 3 4 4 3 3 1 1 2 2 2 2 1 1 1 1 1 1 0 0 Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 3, 4, 5, 62, 3, 4, 52, 3, 4 1, 2, 3, 61, 2, 31, 2 (3,2,2) 、 (3,3,2) 、 (6,2,2) 、 (6,3,2) 18

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

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. 20

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. 21 2 2 4 4 5 5 5 5 4 4 4 4 3 3 3 3 2 2 3 3 4 4 3 3 1 1 2 2 2 2 1 1 1 1 1 1 0 0

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

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

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. 24

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

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

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

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

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

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

31 Dual Graph 31

32 Dual Graph 32

33 Implementation with Dual Graph 33

34 Implementation with Dual Graph 34

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 36

37 Replication Memory Overhead 37

38 Replication and Retrieval Message Overhead 38

39 Retrieval Latency Stretch 39

40 Replication Memory Overhead (Voids) 40

41 Replication Message Overhead (Voids) 41

42 Retrieval Latency Stretch (Voids) 42

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. 43

44 Q&A 44

45 Appendix

46 Dual Graph l 46

47 Example of Locating Holes a h1 h2 47

48 Example of Locating Holes a b h1 h2 c 48

49 Example of Locating Holes a b h1 h2 49

50 Example of Locating Holes a h1 h2 50

51 Example of Locating Holes b a h1 h2 51

52 a is the owner of hole d a h1 h2 b c e f g h i 52

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

Similar presentations

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,

Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,
Good afternoon everyone.

Good afternoon everyone.
An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks Zhen Jiang Computer Science Department West Chester University.

An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks Zhen Jiang Computer Science Department West Chester University.
Small-world Overlay P2P Network

Small-world Overlay P2P Network
Routing, Anycast, and Multicast for Mesh and Sensor Networks Roland Flury Roger Wattenhofer RAM Distributed Computing Group.

Routing, Anycast, and Multicast for Mesh and Sensor Networks Roland Flury Roger Wattenhofer RAM Distributed Computing Group.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,

SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,

Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
SUMP: A Secure Unicast Messaging Protocol for Wireless Ad Hoc Sensor Networks Jeff Janies, Chin-Tser Huang, Nathan L. Johnson.

SUMP: A Secure Unicast Messaging Protocol for Wireless Ad Hoc Sensor Networks Jeff Janies, Chin-Tser Huang, Nathan L. Johnson.
Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.

Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.
Randomized 3D Geographic Routing Roland Flury Roger Wattenhofer Distributed Computing Group.

Randomized 3D Geographic Routing Roland Flury Roger Wattenhofer Distributed Computing Group.
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,

Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.

1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
Yashar Ganjali Joint work with: Abtin Keshavarzian June 4, 2003 Single-Path vs. Multi-Path Routing in Ad Hoc Networks.

Yashar Ganjali Joint work with: Abtin Keshavarzian June 4, 2003 Single-Path vs. Multi-Path Routing in Ad Hoc Networks.
Axis-Based Virtual Coordinate Assignment Protocol and Delivery- Guaranteed Routing Protocol in Wireless Sensor Networks M.J.Tsai, H.Y.Yang, and W.Q.Huang.

Axis-Based Virtual Coordinate Assignment Protocol and Delivery- Guaranteed Routing Protocol in Wireless Sensor Networks M.J.Tsai, H.Y.Yang, and W.Q.Huang.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
An Efficient Location Service for Mobile Ad Hoc Networks Roland Flury Roger Wattenhofer Distributed Computing Group MLS.

An Efficient Location Service for Mobile Ad Hoc Networks Roland Flury Roger Wattenhofer Distributed Computing Group MLS.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.

A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

Similar presentations

Ads by Google