Flooding-assisted threshold assignment for aggregate monitoring in sensor networks

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The research community has witnessed a large interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition which is defined as a function of local network elements parameters. In this paper, we address Aggregate Threshold Queries in sensor networks, which are used to detect when an aggregate value of all sensor measurements crosses a predetermined threshold. The major constraint in designing monitoring applications is reducing the amount of communication burden which is the dominant factor of energy drain in wireless sensor networks. In this study, we address the aggregate threshold monitoring problem by proposing a distributed algorithm to set local thresholds on each sensor node so as to minimize the probability of global polling. We adopt the FPTAS optimization formulation of the problem [2] and propose a distributed algorithm as the solution to the problem. Simulation results demonstrate the validity of the proposed distributed algorithm in attaining very close performance as the centralized schema. © 2009 Springer.

Cite

CITATION STYLE

APA

Abbasi, A., Khonsari, A., & Talebi, M. S. (2009). Flooding-assisted threshold assignment for aggregate monitoring in sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5408 LNCS, pp. 414–424). https://doi.org/10.1007/978-3-540-92295-7_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free