Localized construction of aggregation trees in sensor networks

Andra Kalyan; Raj Bhatnagar

doi:10.1117/12.782156

1 May 2008 Localized construction of aggregation trees in sensor networks

Andra Kalyan, Raj Bhatnagar

Proceedings Volume 6961, Intelligent Computing: Theory and Applications VI; 696103 (2008) https://doi.org/10.1117/12.782156
Event: SPIE Defense and Security Symposium, 2008, Orlando, Florida, United States

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.

Citation Download Citation

Andra Kalyan and Raj Bhatnagar "Localized construction of aggregation trees in sensor networks", Proc. SPIE 6961, Intelligent Computing: Theory and Applications VI, 696103 (1 May 2008); https://doi.org/10.1117/12.782156

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available