2010
DOI: 10.3390/s101110328
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Load Balancing Data Centric Storage for Wireless Sensor Networks

Abstract: In this paper, a new data centric storage that is dynamically adapted to the work load changes is proposed. The proposed data centric storage distributes the load of hot spot areas to neighboring sensor nodes by using a multilevel grid technique. The proposed method is also able to use existing routing protocols such as GPSR (Greedy Perimeter Stateless Routing) with small changes. Through simulation, the proposed method enhances the lifetime of sensor networks over one of the state-of-the-art data centric stor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…In some of existing DCSs such as DIM [ 3 ], KDDCS [ 4 ] and GDCS [ 7 ], similar data is stored in geographically adjacent sensor nodes. On these DCSs, data are ordered by their values.…”
Section: Introductionmentioning
confidence: 99%
“…In some of existing DCSs such as DIM [ 3 ], KDDCS [ 4 ] and GDCS [ 7 ], similar data is stored in geographically adjacent sensor nodes. On these DCSs, data are ordered by their values.…”
Section: Introductionmentioning
confidence: 99%
“…Many studies have been proposed techniques for energy efficient data processing, communication and storage. As a result, a dynamic balancing between these functions is necessary [4], [5], [6].…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm processes a query in three stages on the basis of four assumptions: (1) choice of DCS framework is limited to KDDCS [27], GDCS [28] and DIM [29]; (2) all nodes are identified by unique ID; (3) each node knows the geographic location of its own and its neighbor nodes; and (4) each node knows the range of data stored in its neighbor nodes. In the first stage, the base station locates the Start Node (SN) where the query is to commence.…”
Section: Of 22mentioning
confidence: 99%