An evolutionary algorithm for data aggregation tree construction in three-dimensional wireless sensor networks

In the architecture of wireless sensor network, routing technology at the network layer is essential. Since the clustering routing leads in good performance on data aggregation, energy minimization and so on, it has become the focus of the study routing. In this paper, a cluster-based routing tree construction algorithm for Wireless Sensor Networks is proposed. The detail of how to select the intermediate nodes to build the routing gathering tree is also described. The experiments show that the algorithm is effective to extend the network lifetime.

Download Full-text

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

Journal of Applied Mathematics ◽

10.1155/2013/502381 ◽

2013 ◽

Vol 2013 ◽

pp. 1-12 ◽

Cited By ~ 9

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.

Download Full-text

Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks

Mathematical Problems in Engineering ◽

10.1155/2010/732892 ◽

2010 ◽

Vol 2010 ◽

pp. 1-11 ◽

Cited By ~ 7

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.

Download Full-text

Aggregation Tree Based Data Aggregation Algorithm in Wireless Sensor Networks

International Journal of Online Engineering (iJOE) ◽

10.3991/ijoe.v12i06.5408 ◽

2016 ◽

Vol 12 (06) ◽

pp. 10

Author(s):

Hu Yanhua ◽

Xincai Zhang

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Aggregation ◽

Scheduling Algorithm ◽

Energy Utilization ◽

Sensor Nodes ◽

Wireless Sensor ◽

Trade Off ◽

Redundant Data ◽

Aggregation Tree

Abstract: In wireless sensor networks, efficient and effective data aggregation algorithms can prolong the network lifecycle by reducing communication of redundant data and improve the security of the networks. Tradition data aggregation algorithms in wireless sensor networks mainly aim to improve the energy utilization, and ignore the security and lifecycle. In order to get a good trade-off between these requirements, we proposed a data aggregation algorithm based on constructing a data aggregation tree. After give a formalism description of the problem, we proposed a data aggregation tree constructing algorithm. By minimize the maximal energy consumption of nodes, the algorithm can prolong the lifecycle. In data aggregation scheduling algorithm, we select the number of communications carefully to get the trade-off between low weighted delay and high network lifecycle. The simulation experiments show that, the proposed data aggregation algorithm consumes less energy while aggregating data from sensor nodes, and thus can prolong the network lifecycle.

Download Full-text