Abstract
In this chapter we consider sensor networks, in which all nodes periodically produce some amount of information by sensing an extended geographic area. In each round all data from all nodes needs to be transmitted to an information sink for processing. Because of limited transmission ranges of the nodes, multi-hop routing techniques are applied to transmit the data from all nodes to the sink. Since different nodes partially monitor the same spacial region, data is often correlated. In this case and in order to save energy, data can be processed on its way to the sink. This technique is referred to as in-network data aggregation. For most algorithms presented here, we will assume that the energy cost required by data aggregation is negligible compared to transmission costs, though [270] presents a network model, which incorporates data aggregation and communication costs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Scharf, L. (2007). Data Gathering in Sensor Networks. In: Wagner, D., Wattenhofer, R. (eds) Algorithms for Sensor and Ad Hoc Networks. Lecture Notes in Computer Science, vol 4621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74991-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-74991-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74990-5
Online ISBN: 978-3-540-74991-2
eBook Packages: Computer ScienceComputer Science (R0)