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

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

Information Brokerage Scheme A B 3

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

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

Distance Sensitivity in 3D 6

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

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

Information Brokerage Scheme with Distance Sensitivity 9

Information Brokerage Scheme with Distance Sensitivity (LAIB) X-axis Replication-Retrieval Tree 10

Construction of Replication-Retrieval Tree ( 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

Example of LAIB Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 12

Example of LAIB Producer(5,3,3) Consumer(1,1,1) NodeX-SETY-SETZ-SET 3, 4, 5, 6 13

Example of LAIB 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

Example of LAIB 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

Example of LAIB 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

Example of LAIB 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

Example of LAIB 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

Properties of LAIB  Retrieval guarantee  Bounded replication message overhead  Distance sensitivity

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

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

Properties of LAIB

Properties of LAIB

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

Information Brokerage Scheme in 3D Wireless Ad hoc Networks 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

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

Dual Graph 31

Dual Graph 32

Implementation with Dual Graph 33

Implementation with Dual Graph 34

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.

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

Replication Memory Overhead 37

Replication and Retrieval Message Overhead 38

Retrieval Latency Stretch 39

Replication Memory Overhead (Voids) 40

Replication Message Overhead (Voids) 41

Retrieval Latency Stretch (Voids) 42

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

Q&A 44

Appendix

Dual Graph l 46

Example of Locating Holes a h1 h2 47

Example of Locating Holes a b h1 h2 c 48

Example of Locating Holes a b h1 h2 49

Example of Locating Holes a h1 h2 50

Example of Locating Holes b a h1 h2 51

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