1 May 2008 Localized construction of aggregation trees in sensor networks
Author Affiliations +
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andra Kalyan, Raj Bhatnagar, "Localized construction of aggregation trees in sensor networks", Proc. SPIE 6961, Intelligent Computing: Theory and Applications VI, 696103 (1 May 2008); doi: 10.1117/12.782156; https://doi.org/10.1117/12.782156
PROCEEDINGS
12 PAGES


SHARE
Back to Top