Data Aggregation in Heterogeneous Wireless Sensor Networks by Using Local Tree Reconstruction Algorithm

Zhaohui Zhang,Xiaoli Yang,Jing Li

doi:10.1155/2020/3594263

Abstract

Aiming at the transmission of heterogeneous data in heterogeneous networks, a topology optimization algorithm of heterogeneous wireless sensor networks based on local tree reconstruction is proposed, which can achieve better data transmission in the heterogeneous networks. First, the algorithm divides the nodes of the network into different layers by their hops and chooses different numbers of nodes as relay nodes in different layers. Second, the nodes are set with different initial energies in different layers. Because the packets of different nodes have different sizes, we adopt the corresponding data aggregation coefficients according to the actual data requirements of the network in data transmission. Finally, the lifetime of the network is prolonged by real-time updating of the topology of the tree during the data transmission. The simulations indicate that after the aforementioned three steps, the proposed algorithm prolongs the lifetime of the heterogeneous networks and improves the nodes utilization effectively.

Highlights

In wireless sensor networks (WSNs), the transmission data collected by the sensor nodes will be classified as different types. e data are homogeneous if they have the same properties; otherwise, they are heterogeneous data with different properties
Most of the sources of their ideas are referred to the research on the graph theory. e building of the network topology must satisfy the requirements of the design of network topology optimization and destruction resistance of the network. e graph is an undirected graph because the communication between the nodes is mutual. erefore, the study of WSNs can be modelled as mathematical problems, such as connectivity, sparse, symmetry, node weights, and duality theory
In order to ensure that the more nodes a layer has, the more nodes are chosen as relay nodes, and the fewer nodes a layer has, the fewer nodes are chosen as relay nodes, the proportion of relay nodes is selected as ρi−hop according to the number of nodes in different layers, where ρi−hop is the proportion of relay nodes in the layer i, ni−hop is the number of nodes in the layer i, and N is the number of total nodes in the network. erefore, the number of relay nodes in the layer i is nrelay.i−hop

Summary

Introduction

In wireless sensor networks (WSNs), the transmission data collected by the sensor nodes will be classified as different types. e data are homogeneous if they have the same properties; otherwise, they are heterogeneous data with different properties. E heterogeneous data-transmitting network constructed in this paper is a tree topology network, which shows good performance in data transmission [5,6,7,8,9,10,11,12]. For the heterogeneous data transmission, data aggregation by using the local tree reconstruction algorithm (DALTRA) in the heterogeneous WSNs is proposed in this paper. Heterogeneous data transmission has a very high requirement for network topology in the context of big data, especially for the network in a specific application environment. E constructed routing model guarantees the low latency of data transmission and the low energy consumption of the nodes in the network at the same time and prolongs the lifetime of the network. E rest of the paper is arranged as follows. e second part introduces the network model and communication model. e third part is the theme algorithm of our scheme, which models and analyzes the local tree reconstruction technology. e fourth part is the simulation part. e fifth part summarizes this paper

Preliminaries

Theoretical Analysis on the Effectiveness of Energy Consumption of DA-LTRA

Findings

Simulation Experiment