Zone sharing a hot spots decomposition scheme for data centric storage in sensor networks
This presentation is the property of its rightful owner.
Sponsored Links
1 / 22

Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks PowerPoint PPT Presentation


  • 117 Views
  • Uploaded on
  • Presentation posted in: General

Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks. Mohamed Aly, Nicholas Morsillo, Panos K. Chrysanthis, and Kirk Pruhs ACM International Workshop on Data Management for Sensor Networks(DMSN) , August 29, 2005, Trondheim, Norway. Outline. Introduction

Download Presentation

Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor 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.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


Zone sharing a hot spots decomposition scheme for data centric storage in sensor networks

Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks

Mohamed Aly, Nicholas Morsillo, Panos K. Chrysanthis, and Kirk Pruhs

ACM International Workshop on Data Management for Sensor Networks(DMSN), August 29, 2005, Trondheim, Norway.


Outline

Outline

  • Introduction

  • Related Work

  • Zone Sharing

    • Distributed Migration Criterion (DMC)

    • Single-Hop Zone Sharing (SHZS)

    • Multiple-Hop Zone sharing (MHZS)

  • Simulation

  • Conclusion


Introduction

Introduction

  • Event

    • One or more sensor compose

    • A set of attributes

  • In order to improve the lifetime of nodes

    • Propose data centric storage

  • Event to sensor mapping

    • Based on the attributes values of an event


Introduction1

Introduction

  • The problem is the storage hot-spot

    • Due to irregular data distribution

    • A high percentage of load assigns to small potion of the nodes

  • Propose Zone Sharing (ZS)

    • Hot-spot

    • Energy saving

    • Network lifetime


Related work multi dimensional range queries in sensor networks

E1= <0.8, 0.7>

2

9

6

7

8

5

4

3

1

Store E1

Related Work–Multi-dimensional Range Queries in Sensor networks

[0, 0.5)

[0.5, 1)

010

0111

110

1111

[0.75, 1)

[0.5, 1)

1110

[0.5, 0.75)

light

0110

[0.25, 0.5)

0001

[0, 0.5)

10

[0, 0.25)

001

0000

10

[0.25, 0.5)

[0.5, 0.75)

[0.75, 1)

[0, 0.25)

temperature


Related work multi dimensional range queries in sensor networks1

E1= <0.8, 0.7>

7

8

9

1

6

5

4

3

2

Store E1

Related Work–Multi-dimensional Range Queries in Sensor networks

010

0111

110

1111

  • Routing an event to its owner

  • Compare event code with node own zone code

  • Hand to GPSR

1110

0110

0001

10

001

0000

10


Related work multi dimensional range queries in sensor networks2

Q11= <.5-.75, . 5-1>

Q12= <.75-1, .75-1>

2

3

5

6

4

9

8

7

1

Q10= <.75-1, .5-.75>

Q1= <0.5-1, 0.5-1>

Related Work–Multi-dimensional Range Queries in Sensor networks

[0, 0.5)

[0.5, 1)

1111

010

0111

110

  • Range queries

  • Query initially routed

    • corresponding to the entire range

  • Split a large query into smaller subqueries

[0.75, 1)

[0.5, 1)

1110

[0.5, 0.75

0110

[0.25, 0.5)

0001

[0, 0.5)

10

[0, 0.25)

001

0000

10

[0.25, 0.5)

[0.5, 0.75)

[0.75, 1)

[0, 0.25)


Zone sharing basic idea

Zone sharing –Basic Idea

(migrator)

S2

5%

(receiver)

S2

35%

S1

70%

Z = 00

Z = 10

(donor)

S1

S3

35%

S3

25%

30%

Z = 0

Z = 11

Z = 01

Z = 1


Zone sharing distributed migration criterion dmc

3

1

2

3

2

1

Applied by the donor and the receiver

Zone sharing –Distributed Migration Criterion (DMC)

migrator

donor

5%

70%

25%

receiver

C1 should be greater than or equal to 2 to make sure that the donor is really falling in a hot-spot

Applied by the migrator

migrator

35%

30%

receiver

donor

35%

C2 should be greater than or equal to 2 to avoid cyclic migrations

  • lmigrator: the original load of the migrator

  • ldonor : the total load of the donor

  • T : the mount of load that the donor passes to the migrator


Zone sharing distributed migration criterion dmc1

1

1

2

3

3

2

1

3

2

Applied by the donor

Applied by the receiver

Applied by the migrator

Zone sharing –Distributed Migration Criterion (DMC)

E1 、E2 and E3must be less than or equal to 0.5

migrator

migrator

migrator

receiver

receiver

receiver

donor

donor

donor

To make sure in the migration process will not cause the death


Zone sharing single hop zone sharing shzs

Zone sharing –Single-Hop Zone Sharing (SHZS)

  • Goal: Overall minimal changes to the original DIM

  • Single Hop Zone Sharing:

    • A zone can be traded at most once

    • Periodic exchange of neighbors information

    • DMC applied locally by nodes

    • No changes needed to GPSR

  • Applicability: Small Hot Spots


Zone sharing single hop zone sharing shzs1

S2

35%

Z = 00

S1

35%

S3

30%

Z = 01

Z = 1

Zone sharing –Single-Hop Zone Sharing (SHZS)

Request to Migrate message

S2

5%

S1

70%

Inform migration decision

Z = 10

Accept to Migrate message

S3

25%

Z = 0

Z = 11


Zone sharing single hop zone sharing shzs2

Zone sharing –Single-Hop Zone Sharing (SHZS)

  • Problems:

    • Large hot-spots: overloaded neighbors

      • DMC hard to be satisfied

    • Zone traded only once

      • nodes still in hot-spots after migration process

    • Messages pass by donor before going to migrator

      • energy consumption overhead

  • Solution:

    • Allow a zone to be traded more than once


Zone sharing multiple hop zone sharing mhzs

10

Zone sharing –Multiple-Hop Zone Sharing (MHZS)

hot-spots

1101

110

111

010

0111

1111

5

3

6

1100

1110

migrator

2

4

4

1

0110

7

9

8

A Shared Zones List (each node)

0001

001

0000

10


Zone sharing multiple hop zone sharing mhzs1

10

Zone sharing –Multiple-Hop Zone Sharing (MHZS)

Multiple sharing of the same zone

migrator

1101

011

111

010

0111

1111

5

3

6

11000

11001

1100

2

2

4

1

0110

7

9

8

0001

001

0000

10


Zone sharing multiple hop zone sharing mhzs2

10

Zone sharing –Multiple-Hop Zone Sharing (MHZS)

Multiple sharing of the same zone

011

1101

111

010

5

3

6

11000

11001

2

4

A Shared Zones List (each node)

1

7

9

8

0001

001

0000

10


Simulation

Simulation


Simulation data persistence

Simulation—Data persistence

Networks with a 30% hot-spot


Simulation quality of data

Simulation—Quality of Data

Query size of a 50% query for networks with a 50% hot-spot


Simulation load balancing

Simulation—Load balancing

Networks with a 40% hot-spot


Simulation energy consumption

Simulation—Energy consumption

Networks with a 50% hot-spot


Conclusion

Conclusion

  • A novel scheme

    • Decomposing storage load of hot-spots

    • The hot-spots nodes toward their neighbor

  • In the future

    • Incremental load balancing throughout the network time


  • Login