Abstract

Data aggregation has been considered as an effective way to decrease the data to be transferred in sensor networks. Particularly for wearable sensor systems, smaller battery has less energy, which makes energy conservation in data transmission more important. Nevertheless, wearable sensor systems usually have features like frequently dynamic changes of topologies and data over a large range, of which current aggregating methods can’t adapt to the demand. In this paper, we study the system composed of many wearable devices with sensors, such as the network of a tactical unit, and introduce an energy consumption-balanced method of data aggregation, named LDA-RT. In the proposed method, we develop a query algorithm based on the idea of ‘happened-before’ to construct a dynamic and energy-balancing routing tree. We also present a distributed data aggregating and sorting algorithm to execute top-k query and decrease the data that must be transferred among wearable devices. Combining these algorithms, LDA-RT tries to balance the energy consumptions for prolonging the lifetime of wearable sensor systems. Results of evaluation indicate that LDA-RT performs well in constructing routing trees and energy balances. It also outperforms the filter-based top-k monitoring approach in energy consumption, load balance, and the network’s lifetime, especially for highly dynamic data sources.

Highlights

  • Wearable sensor systems consist of devices with one or many sensor nodes

  • In order to reach this goal, we propose a top-k query approach basing on routing tree, which includes two parts, local data aggregation and routing tree construction, as presented below

  • For a given k value, the length of path has no linear effect on the mean value of residual energy. This means energy consumption of nodes is balanced in the direction of routing path under microscope, which is very important for keeping the whole network alive, because the further demonstrates that Local Data Aggregation (LDA)-RT performs well in terms of balancing the energy load

Read more

Summary

Introduction

Wearable sensor systems consist of devices with one or many sensor nodes. Each sensor node is usually equipped with a low-speed microprocessor, limited memory, and a radio transceiver and receiver [1,2,3]. The proposed method utilizes the ‘happened-before’ relation of received messages, which is a concept used in distributed system and means one event happening before another [17], to determine which paths should be used, and constructs, on demand, a dynamic routing tree that considers the remaining energy, processing load, and the time drift of sensor nodes to avoid overconsumption of energy. This is specially designed for dynamic topology of wearable sensor systems.

Related Work
Problem
Local Data Aggregation
Top-k Query Based on a Tree
Routing
Simulation Setup
Construction of Routing Tree
Routing constructed by by LDA-RT
Average
Number
Mean of energy with length in network random network
Results areare summarized in Figure
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.