Mobile effect reduction in data-centric storage for wireless sensor networks

Le, Hung-Cuong; Guyennet, Hervé; Zerhouni, Noureddine

doi:10.1049/cp:20070385

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2017

Publication Types

Select...

Article5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another problem in GHTs is data retrieval may be failed when the nodes near the hashed points move. Reference [15] proposes a cluster-based approach named C-DCS to solve this problem. Moreover, reference [16] presents a data centric scheme which aims to make the storage space of the sensor nodes evenly.…”

Section: Related Workmentioning

confidence: 99%

Comparing and Analysis on Adaptive Information-brokerage Schemes in Wireless Sensor Networks

Ma¹,

Guo²,

Li³

et al. 2017

IJGDC

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Comparing and Analysis on Adaptive Information-brokerage Schemes in Wireless Sensor Networks

Ma¹,

Guo²,

Li³

et al. 2017

IJGDC

View full text Add to dashboard Cite

show abstract

“…Reference [10] applies diffuse caching on top of DCS to solve the problem of hot spot. C-DCS [11] proposes a cluster-based method.…”

Section: Introductionmentioning

confidence: 99%

Adaptive Information Brokerage in Wireless Sensor Networks with Virtual Rings

Chen

2014

AMM

View full text Add to dashboard Cite

We study the problem of information brokerage in wireless sensor networks, where each sensor node can be an information producer or an information consumer, or both an information consumer and information producer. Some sensor nodes in the sensor networks can be selected out as the storage nodes, where the producers can store their data and the consumers can retrieve the data they are interested in. Which node/nodes should be chosen as the storage node/nodes is a challenging problem, because many factors such as the data generating rates of the producers and the query frequencies of the consumer should be considered. In this paper, we proposed a novel data storage and retrieval scheme named SRVR (Storage and Retrieval with Virtual Rings). SRVR chooses the nodes in an optimal ring around the center of the sensor network field as the storage nodes, and achieves data storage and retrieval based on the ring. We show by simulation that SRVR achieves more balanced traffic load on sensor nodes and prolongs the lifetime of the senor networks.

show abstract