On the Construction of Data Aggregation Tree With Maximizing Lifetime in Large-Scale Wireless Sensor Networks

Abstract

Abstract-Data aggregation protocols are generally utilized to extend the lifetime of sensor networks by reducing the communication cost. Traditionally, tree-based structured approaches that is a basic operation for the sink to periodically collect reports from all sensors were concerned about many applications. Since the data aggregation process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs when maintaining the routing tables of sensors. In our previous work, we have demonstrated that multiple trees, as well as split trees, can provide additional lifetime extensions when certain nodes are deployed in a wireless sensor network. In this paper, we explore how the number of the family-set of trees influences the lifetime gain, and we work on the problem of constructing data aggregation trees that minimizes the total energy cost of data transmission under diverse set of scenarios and network query region. Through dividing query area, the sensory and aggregation data has been returned through a number of different forwarding trees within each sub query area, which reduces the network "hot spots". To evaluate the performance of the proposed approach, we have compared and analyzed an angular division routing algorithm and query region division routing with LEACH. Theoretical and experimental results illustrate that the query region division algorithm based on angle leads to lower energy cost in comparison with the models reported in the literatures.Index Terms-Energy efficiency, query region division, LEACH, tree structure, wireless sensor networks.

Data compression in ViSAR sensor networks using non-linear adaptive weighting

“…We observe that the proposed scheme based on a full-adaptive approach causes a suitable impact in real ViSAR dataset and outperforms the other methods. In the recent years, data processing for IoT became an interesting topic of research [27][28][29][30]. In our study, we proposed ALMMSE interpolation algorithm for the remote sensing ViSAR frames captured by imaging radars in an IoT-enabled radar networks of drones and airplanes [31].…”

NTRU Implementation of Efficient Privacy‐Preserving Location‐Based Querying in VANET

“…However, in order to ensure the functionality of the QSP, it is impossible to find an all-sided protection scheme purely based on coordinate transformation because the service provider has to be able to determine the relative position of objects and areas to each other [17]. In addition, to preserve the trajectory of user, a great deal of spatiotemporal location obfuscation schemes are also proposed, which also took the temporal information associated with positions into account [18][19][20][21][22][23][24][25]. [26] who split up the location information into shares of strictly limited precision.…”

Secured Data Aggregation Methods in Wireless Sensor Networks Using Homomorphic Operation - A Review

“…The routing structure determines the efficiency of aggregation process [4]. Nodes are classified as three types in related with aggregation: Sensor nodes, aggregator node which does aggregation function, and a querier, which sends the query.…”