Energy-efficient big data storage and retrieval for wireless sensor networks with nonuniform node distribution

2015 ◽  
Vol 27 (18) ◽  
pp. 5765-5779 ◽  
Author(s):  
Jinhai Xu ◽  
Songtao Guo ◽  
Bin Xiao ◽  
Jing He
Author(s):  
Ajay Kaushik ◽  
S. Indu ◽  
Daya Gupta

Wireless sensor networks (WSNs) are becoming increasingly popular due to their applications in a wide variety of areas. Sensor nodes in a WSN are battery operated which outlines the need of some novel protocols that allows the limited sensor node battery to be used in an efficient way. The authors propose the use of nature-inspired algorithms to achieve energy efficient and long-lasting WSN. Multiple nature-inspired techniques like BBO, EBBO, and PSO are proposed in this chapter to minimize the energy consumption in a WSN. A large amount of data is generated from WSNs in the form of sensed information which encourage the use of big data tools in WSN domain. WSN and big data are closely connected since the large amount of data emerging from sensors can only be handled using big data tools. The authors describe how the big data can be framed as an optimization problem and the optimization problem can be effectively solved using nature-inspired algorithms.


2013 ◽  
Vol 5 (3) ◽  
pp. 34-54
Author(s):  
Shiow-Fen Hwang ◽  
Han-Huei Lin ◽  
Chyi-Ren Dow

In wireless sensor networks, due to limited energy, how to disseminate the event data in an energy-efficient way to allow sinks quickly querying and receiving the needed event data is a practical and important issue. Many studies about data dissemination have been proposed. However, most of them are not energy-efficient, especially in large-scale networks. Hence, in this paper the authors proposed an energy-efficient data dissemination scheme in large-scale wireless sensor networks. First, the authors design a data storage method which disseminates only a few amount event data by dividing the network into regions and levels, and thus reducing the energy consumption. Then, the authors develop an efficient sink query forwarding strategy by probability analysis so that a sink can query events easily according to its location to reduce the delay time of querying event data, as well as energy consumption. In addition, a simple and efficient maintenance mechanism is also provided. The simulation results show that the proposed scheme outperforms TTDD and LBDD in terms of the energy consumption and control overhead.


2014 ◽  
Vol 687-691 ◽  
pp. 3044-3047 ◽  
Author(s):  
Hong Ling Chen ◽  
Xing Po Ma

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.


Sign in / Sign up

Export Citation Format

Share Document