scholarly journals Hybrid Recovery Strategy Based on Random Terrain in Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-19 ◽  
Author(s):  
Xiaoding Wang ◽  
Li Xu ◽  
Shuming Zhou ◽  
Wei Wu

Providing successful data collection and aggregation is a primary goal for a broad spectrum of critical applications of wireless sensor networks. Unfortunately, the problem of connectivity loss, which may occur when a network suffers from natural disasters or human sabotages, may cause failure in data aggregation. To tackle this issue, plenty of strategies that deploy relay devices on target areas to restore connectivity have been devised. However, all of them assume that either the landforms of target areas are flat or there are sufficient relay devices. In real scenarios, such assumptions are not realistic. In this paper, we propose a hybrid recovery strategy based on random terrain (simply, HRSRT) that takes both realistic terrain influences and quantitative limitations of relay devices into consideration. HRSRT is proved to accomplish the biconnectivity restoration and meanwhile minimize the energy cost for data collection and aggregation. In addition, both of complexity and approximation ratio of HRSRT are explored. The simulation results show that HRSRT performs well in terms of overall/maximum energy cost.

2014 ◽  
Vol 556-562 ◽  
pp. 6311-6315
Author(s):  
Yong Qing Wang ◽  
Jing Tian Tang ◽  
Xing Po Ma

We study data aggregation for region-based top-k queries in wireless sensor networks, which is one kind of internet of things. Because the energy of sensor nodes is limited and a sensor node will die if it has no energy left, one of the important targets for all protocols in wireless sensor networks is to decrease the energy consumption of the sensor nodes. For a sensor node, communication cost is much more than other kinds of energy cost such as energy cost on computation and data storage. Thus, a very efficient way to decrease the energy cost of the sensor nodes is to decrease the quality of the sensing data that will be transmitted to the base station. In this paper, we use the technique of data aggregation to achieve this goal, and propose an algorithm to construct a novel Data Aggregation Tree (DAT) in the query region. To check the efficiency of DAT, we have made a simulation on OMNET, and the results show that DAT can shrink large quality of data when they are transmitted to the base station, and the life time of the sensor networks can thus be prolonged..


2017 ◽  
Vol 63 (2) ◽  
pp. 209-216
Author(s):  
Radosław O. Schoeneich ◽  
Marcin Golański ◽  
Michał Kucharski ◽  
Marek Franciszkiewicz ◽  
Dawid Zgid

Abstract This paper describes an idea and realisation of hidden data transmision using Tiny Aggregation Covert Channel (TAGCC)in Wireless Sensor Networks. Our solution uses data aggregation mechanism called Tiny Aggregation (TAG). The protocol is based on idea of hidden messages sending without generate additional data packets and encryption. The paper describes details of proposed algorithm and simulation results obtained during testing of the sensor networks with hidden channel TAGCC.


2018 ◽  
Vol 14 (03) ◽  
pp. 172
Author(s):  
Demin Gao ◽  
Jinchi Zhang ◽  
Fuquan Zhang ◽  
Haifeng Lin

<p class="0abstract"><span lang="EN-US">In Rechargeable Wireless Sensor Networks(R-WSNs), it is critical for data collection because a sensor has to operate in a very low and dynamic duty cycle owing to sporadic availability of energy. In this work, we propose a distribute maximum rate allocation based on data aggregation to compute an upper data generation rate by maximizing it as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms are guaranteed to converge to an optimal value with low computational complexity. Through extensive simulation and experiments, we demonstrate our algorithm is efficient to maximize data collection rate in rechargeable wireless sensor networks.</span></p>


2014 ◽  
Vol 1049-1050 ◽  
pp. 1828-1831
Author(s):  
Guang Yu Fan ◽  
Wen Hong Liu

The wireless sensor networks (WSNs) are usually deployed among widely area for environmental monitoring, data collection and other applications. In order to reduce the energy consumption and extend the lifetime of WSNs, as well as receive the data quickly, a source-based data aggregation algorithm (SBDA) for clustering wireless sensor networks is proposed. The method aggregated the data from sensor nodes and marked different transmission priority for the data. Simulation results show that, compared to existing protocols, the proposed method achieves a longer life time, and a lower packet drop ratio.


Sign in / Sign up

Export Citation Format

Share Document