Abstract

This paper proposes and evaluates a new aggregation algorithm in wireless sensor networks with time constraint. In the proposed algorithm, each aggregation node controls its aggregation time in order to aggregate and transfer data from child nodes within a given deadline of the sink node. The objective of the algorithm is to deliver the time constrained data within time bound while reducing the energy consumption resulted from the number of transmissions. Based on the aggregation tree, the proposed algorithm considers the number of the child nodes to determine the aggregation time. The performance of the proposed algorithm is evaluated using both the miss ratio and the aggregation gain.

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.