retrieval guaranteed location aware information brokerage scheme in 3d wireless ad hoc networks n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks PowerPoint Presentation
Download Presentation
Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks

Loading in 2 Seconds...

play fullscreen
1 / 52

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


  • 74 Views
  • Uploaded on

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

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks' - leala


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
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

outline
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
information brokerage scheme1
Information BrokerageScheme
  • Three types of nodes:
    • Broker
    • Producer
    • Consumer
  • DistanceSensitivity

A

B

C

related works
Related Works
  • XYLS
  • FMMS iMesh
  • Double Rulings DRACA

B

A

B

A

distance sensitivity in 3d1
Distance Sensitivity in 3D
  • A retrieval-guaranteed distance sensitive information brokerage scheme in 3D wireless ad hoc networks.
issue discussed in this dissertation
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.
information brokerage scheme with distance sensitivity laib
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

construction of replication retrieval tree
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

example of laib
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

example of laib1
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

example of laib2
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

example of laib3
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

example of laib4
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

example of laib5
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

example of laib6
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)

properties of laib
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

properties of laib1
Properties of LAIB
  • Retrieval guarantee
  • Bounded replication message overhead
  • Distance sensitivity
  • The expected values of retrieval latency, replication message overhead, and replication memory overhead.
properties of laib2
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

properties of laib3
Properties of LAIB

2

4

1

3

1

5

2

4

5

4

1

2

3

1

0

3

4

2

3

properties of laib4
Properties of LAIB

2

4

1

3

1

5

2

4

5

4

1

2

3

1

0

3

4

2

3

properties of laib5
Properties of LAIB
  • Retrieval guarantee
  • Distance sensitivity
  • Bounded replication message overhead
  • The expected values of retrieval latency, replication message overhead, and replication memory overhead.
dual graph
Dual Graph

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

locating the holes
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
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
conclusion
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.