Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/44108
Title: Energy-efficient big data storage and retrieval for wireless sensor networks with nonuniform node distribution
Authors: Xu, J
Guo, S
Xiao, B 
He, J
Keywords: Big data
Data storage and retrieval
Nonuniform distribution
Wireless sensor networks
Issue Date: 2015
Publisher: John Wiley & Sons
Source: Concurrency computation practice and experience, 2015, v. 27, no. 18, p. 5765-5779 How to cite?
Journal: Concurrency computation practice and experience 
Abstract: Summary Distributed data-centric storage in wireless sensor networks (WSNs) is considered as a promising big data storage approach, because it contributes to reducing the communication overhead inside the networks. However, most of the existing distributed methods rely on locating systems, which consume more energy, and assume that sensors are uniformly distributed, which is clearly not applicable for the scenarios with nonuniform sensor distribution. To address these issues, in this paper, we propose a big data storage and retrieval algorithm for WSNs with nonuniform node distribution, which aims at estimating the real distribution and the addresses of sensor nodes. In particular, we consider the data redundancy among neighbor nodes in the proposed algorithm and exploit a simple routing based on the algorithm. Experimental results show that our approach outperforms other approaches in terms of data querying efficiency and data loss rate.
URI: http://hdl.handle.net/10397/44108
ISSN: 1532-0626 (print)
1532-0634 (online)
DOI: 10.1002/cpe.3645
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
Citations as of Sep 15, 2017

Page view(s)

24
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.