Lifetime Analysis of Data Aggregation Tree with Unreliable Sensor Node

2006 ◽  
Author(s):  
Yan Jin ◽  
Ling Wang ◽  
Yoohwan Kim ◽  
Xiaozong Yang
Keyword(s):  
Data Aggregation ◽  
Sensor Node ◽  
Lifetime Analysis ◽  
Aggregation Tree

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 IESDAD :improved energy efficient structure- free data aggregation and delivery protocol in WSN

2018 ◽  
Vol 7 (2.27) ◽  
pp. 132
Author(s):  
Avneet Kaur ◽  
Neeraj Sharma
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Sensor Node ◽  
Base Station ◽  
Wireless Sensor ◽  
Gateway Node ◽  
Free Data

The wireless sensor is deployed to sense large amount of data from the far places. With the large deployment of the sensor networks, it faces major issues like energy consumption, dynamic routing and security. The Energy efficient structure-free data aggregation and delivery (ESDAD) is the protocol which is hierarchal in nature. The ESDAD protocol can be further improved to increase lifetime of wireless sensor networks. The base station localizes the position of each sensor node and defines level of each node for the data transmission. In the ESDAD protocol, the next hop node is selected based on cost function for the data transmission. In this research work, improved in ESDAD protocol is proposed in which gateway nodes are deployed after each level for the data transmission. The sensor node will sense the information and transmit it to gateway node. The gateway node aggregates data to the base station and simulation results show that improved ESDAD protocol performs well in terms of energy consumption and number of throughput. 

scholarly journals Layer-Based Data Aggregation and Performance Analysis in Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Hongju Cheng ◽  
Yongzhao Chen ◽  
Naixue Xiong ◽  
Feifei Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Dimensional Space ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Efficient Scheme ◽  
Aggregation Tree ◽  
Practical Performance ◽  
And Performance

Due to the similarity and correlation among sensed data in wireless sensor network, it is an important way to reduce the number of packets transmitted with data aggregation technology so as to prolong the network lifetime. However, data aggregation is still a challenging issue since quality-of-service, such as end-to-end delay, is generally considered as a severe criterion required in many applications. We focus on the minimum-latency data aggregation problem and proposed a new efficient scheme for it. The basic idea is that we first build an aggregation tree by ordering nodes into layers, and then we proposed a scheduling algorithm on the basis of the aggregation tree to determine the transmission time slots for all nodes in the network with collision avoiding. We have proved that the upper bound for data aggregation with our proposed scheme is bounded by(15R+Δ-15)for wireless sensor networks in two-dimensional space. Extensive simulation results have demonstrated that the proposed scheme has better practical performance compared with related works.

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