Share Email Print

Proceedings Paper

Localized construction of aggregation trees in sensor networks
Author(s): Andra Kalyan; Raj Bhatnagar
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Sensor networks are fast-emerging as a powerful technology for many distributed surveillance and monitoring applications. The crux of these applications lies in being able to compute various global characteristics, like contour, trajectory, direction, velocity etc., of mobile phenomena. In this paper, we present algorithms based on in-network aggregation to efficiently compute these global characteristics of phenomena by representing them as functions amenable to in-network processing, at a very low communication cost. We present two versions of these algorithms; one for post-event querying and the other for real-time warnings and include simulation results for all our algorithms.

Paper Details

Date Published: 1 May 2008
PDF: 12 pages
Proc. SPIE 6961, Intelligent Computing: Theory and Applications VI, 696103 (1 May 2008); doi: 10.1117/12.782156
Show Author Affiliations
Andra Kalyan, Univ. of Cincinnati (United States)
Raj Bhatnagar, Univ. of Cincinnati (United States)

Published in SPIE Proceedings Vol. 6961:
Intelligent Computing: Theory and Applications VI
Kevin L. Priddy; Emre Ertin, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?