scholarly journals Data Aggregation Framework on Wireless Sensor Networks

Sensors are subjectively spread in the flighty conditions. Sensor nodes are self-sufficient, mindful and self-configurable objects for data accumulation and transmission. Sensor nodes are battery-worked devices. The battery reinforcement time depends on the computational capacity and their detecting range. Joint effort is fundamental one where the nodes deal with the data stream in network in vitality productive way. Sensors in WSN are composed to detect the data. The sensors are fit for calculations and contain wireless correspondence parts. Nodes consolidate the data gathered from each sensor hub in network. The gathered data are sent to the base station where it gives helpful data. The objective of the suggested paper is to contrast the efficiency of TAG in regards to power performance in contrast with and also without information gathering in wireless sensor networks as well as to evaluate the viability of the protocol in an atmosphere where sources are restricted.

2012 ◽  
Vol 04 (03) ◽  
pp. 1250013 ◽  
Author(s):  
YI HONG ◽  
HONGWEI DU ◽  
DEYING LI ◽  
WENPING CHEN

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.


Author(s):  
Bahae ABIDI ◽  
Abdelillah JILBAB ◽  
Mohamed EL HAZITI

Even in difficult places to reach, the new networking technique allows the easy deployment of sensor networks, although these wireless sensor networks confront a lot of constraints. The major constraint is related to the quality of information sent by the network. The wireless sensor networks use different methods to achieve data to the base station. Data aggregation is an important one, used by these wireless sensor networks. But this aggregated data can be subject to several types of attacks and provides security is necessary to resist against malicious attacks, secure communication between severely resource constrained sensor nodes while maintaining the flexibility of the topology changes. Recently, several secure data aggregation schemes have been proposed for wireless sensor networks, it provides better security compared with traditional aggregation. In this paper, we try to focus on giving a brief statement of the various approaches used for the purpose of secure data aggregation in wireless sensor networks.


2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Yanfei Zheng ◽  
Kefei Chen ◽  
Weidong Qiu

Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs). A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.


2017 ◽  
Vol 7 (1.1) ◽  
pp. 594
Author(s):  
P. Balamurugan ◽  
M. Shyamala Devi ◽  
V. Sharmila

At present scenario, sensor devices are used in various fields for gathering information so all those data should be secured safely. Securing data is an important role in Wireless Sensor Networks (WSN). WSN is extremely essential for the purpose of reducing the complete redundancy and energy consumption during gathering data among sensor nodes. Optimized data aggregation is needed at cluster head and Base Station (BS) for secured data transmission. Data aggregation is performed in all routers while forwarding data from source to destination node. The complete life time of sensor networks is reducing because of using energy inefficient nodes for the purpose of aggregation. So this paper introduces the optimized methods for securing data (OMSD) which is trust based weights and also completely about the attacks and some methods for secured data transmission. 


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..


2019 ◽  
Vol 16 (9) ◽  
pp. 3961-3964
Author(s):  
Charu Sharma ◽  
Rohit Vaid

In designing Wireless Sensor Networks, energy efficiency and security should be considered very critically. Energy efficiency is achieved through data aggregation which eliminates the transmission of redundant data while security is achieved by preserving confidentiality among sensor node and the base station. In this paper, an energy efficient and secure cluster based aggregation mechanism is presented. In this model, for energy efficiency the network is divided into tracks and sectors so the cluster head’s are uniformly selected from the whole network. To achieve security the cluster head’s perform data aggregation with the help of some pattern codes and only distinctive data is transmitted from sensor nodes in encrypted form. To perform aggregation, the sensor nodes do not need to know about the actual sensor data therefore there is no need to use any encryption or decryption schemes between nodes and cluster head. Performance evaluation shows proposed model works better to enhance the network lifetime, security, average residual energy, and average packet transmission ratio than conventional data aggregation models.


2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.


Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).


2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Fan Chao ◽  
Zhiqin He ◽  
Renkuan Feng ◽  
Xiao Wang ◽  
Xiangping Chen ◽  
...  

Tradition wireless sensor networks (WSNs) transmit data by single or multiple hops. However, some sensor nodes (SNs) close to a static base station forward data more frequently than others, which results in the problem of energy holes and makes networks fragile. One promising solution is to use a mobile node as a mobile sink (MS), which is especially useful in energy-constrained networks. In these applications, the tour planning of MS is a key to guarantee the network performance. In this paper, a novel strategy is proposed to reduce the latency of mobile data gathering in a WSN while the routing strategies and tour planning of MS are jointly optimized. First, the issue of network coverage is discussed before the appropriate number of clusters being calculated. A dynamic clustering scheme is then developed where a virtual cluster center is defined as the MS sojourn for data collection. Afterwards, a tour planning of MS based on prediction is proposed subject to minimizing the traveling distance to collect data. The proposed method is simulated in a MATLAB platform to show the overall performance of the developed system. Furthermore, the physical tests on a test rig are also carried out where a small WSN based on an unmanned aerial vehicle (UAV) is developed in our laboratory. The test results validate the feasibility and effectiveness of the method proposed.


Sign in / Sign up

Export Citation Format

Share Document