scholarly journals Tree Based Aggregation and Routing in WSN: A Multi-agent System Approach

2012 ◽  
pp. 226-234
Author(s):  
Ajit K. Bhovi ◽  
A. V. Sutagundar ◽  
S. S. Manvi ◽  
B. S. Halakarnimath
Keyword(s):  
Data Aggregation ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Sink Node ◽  
Aggregated Data ◽  
Agent Platform ◽  
Tree Construction ◽  
Network Aggregation ◽  
Aggregation Tree ◽  
Multi Agent

In WSN one of the issues is to route the data from the sensor nodes to sink node. The tree-based approach provides an efficient solution for establishing the path and in network aggregation. Tree is nonlinear structures, which have hierarchical levels in terms of parent-child combination. In this work the tree is constructed using the software agents. The proposed scheme uses multiagent system that comprises of both static and mobile agents. On every sensor node of WSN agent platform is running that coordinates the agent communication. Tree Construction Agent (TCA) is mobile agent that is generated at the sink node. TCA uses the angle of constraint for the construction of the tree. In the proposed work along the tree in network aggregation is done that saves the energy and reduces the delay. Aggregation Agent (AA) gets the routing information and visits the nodes along the path (tree) for data aggregation based the correlation of the sensor node data. Finally the aggregation agent routes the aggregated data to the sink node.

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

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.

The Gamification in Education, Healthcare, and Industry

2021 ◽  
pp. 206-232
Author(s):  
Puvvadi Baby Maruthi
Keyword(s):  
Data Aggregation ◽  
Mobile Element ◽  
Mobile Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Three Layer Architecture ◽  
Save Energy ◽  
Aggregation Technique ◽  
Entire Network

Wireless sensor networks (WSN) consist of large numbers of sensor nodes, which are limited in battery power and communication range and have multi-modal sensing capabilities. In this chapter, energy-efficient data aggregation technique is proposed to improve the lifetime of the sensor. Here, the author has used three layer architecture by deploying mobile element/node, which can periodically visit cluster heads (CHs) at which first level data aggregation has been applied to eliminate redundancy. After collecting data from all CHs, mobile element itself will perform second level of data aggregation to eliminate further redundancy. After collecting data from CHs, mobile element will move towards base station/sink and transmits data to base station/sink in order to save energy of entire network. Here, the author has made an attempt to prove that in WSN during data gathering if mobile elements are used to collect the aggregated data from CHs, energy consumption of the entire network will be reduced. The proposed data aggregation with mobile node helps in improving the lifetime of the WSN.

scholarly journals Security in wireless sensor networks

2019 ◽  
Vol 8 (1) ◽  
pp. 13
Author(s):  
Bahae ABIDI ◽  
Abdelillah JILBAB ◽  
Mohamed EL HAZITI
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Secure Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Aggregated Data ◽  
Secure Data ◽  
Secure Data Aggregation

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.

scholarly journals Qualification of Cluster Header and Cluster Member in Wireless Sensor Networks

2019 ◽  
Vol 8 (2S6) ◽  
pp. 101-105
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Sensor Node ◽  
Data Transfer ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node

Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.

scholarly journals Local Aggregation Scheme for Data Collection in Periodic Sensor Network

2019 ◽  
Vol 9 (2) ◽  
pp. 3583-3588
Keyword(s):  
Sensor Node ◽  
Cluster Head ◽  
Temporal Correlation ◽  
Sensor Nodes ◽  
Time Interval ◽  
Specific Time ◽  
Aggregated Data ◽  
Redundant Data ◽  
Local Aggregation ◽  
Local Outlier

Data aggregation is an important technique for data collection & aggregation in WSN where sensor nodes sense the raw data and sends the aggregated data to the sink node. In a cluster based periodic network, sensor node senses the data on a specific time interval, performs local aggregation and send aggregated data to Cluster Head (CH). Various Local aggregation algorithms are used to remove redundant data at sensor nodes but local outlier detection problem is still unsolved. Therefore, a local aggregation algorithm has been proposed which uses the temporal correlation property of WSN to eliminate redundant and local outlier data which improves the data sent ratio and data quality. Sensor measurement is collected at different time interval of a sensor, exhibits temporal correlation because measurements varies with small or same difference (δ) and measurements are treated as similar measurements. In proposed local aggregation approach, each sensor node finds similar measurements of sensors with their frequency (number of occurrence) in a specific time interval (Temporal correlation). Set having higher frequency is selected and transmitted the average values of measurements that lie in the selected set to the cluster head. If sensors don’t detect any reading between intervals it simple send a message ‘data not found’ instead of sending empty set. In this way we delete redundant and local outliers. The experimental result shows that algorithm improves the data quality and data sent ratio by eliminating redundant data and local outliers

Level and Cluster Based Routing for Wireless Sensor Network

2013 ◽  
Vol 321-324 ◽  
pp. 515-522 ◽  
Author(s):  
Kou Lin Yuan ◽  
Lin Qiao ◽  
Lei Han
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Sensor Node ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Method ◽  
Sink Node ◽  
Head Node ◽  
Cluster Based Routing

This paper proposes a level and cluster based routing approach for a wireless sensor network. Nodes in the network are divided into several levels according to their hops to sink node. Every sensor node has a level number. Using level information, a sensor node can send messages to a sink node in a more efficient way, and a sink node can easily locate other sensor nodes. To make network more balanced, the paper introduces a cluster method, which splits nodes in the same level into different clusters, and chooses a cluster head for every cluster, to switch nodes in the cluster to work in turn. Unlike all other cluster routing methods, a cluster head node takes schedule jobs of sensor nodes in the cluster according to their energy left, instead of sensing. The paper also presents several algorithms for constructing a wireless sensor network, querying and scheduling. The simulation experiment shows that the scalability of our method is approximately linear.

scholarly journals Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Yanfei Zheng ◽  
Kefei Chen ◽  
Weidong Qiu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Large Scale ◽  
Resource Constraints ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Detection Mechanism ◽  
Aggregation Tree

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.

Sign in / Sign up

Export Citation Format

Share Document