Abstract
The first sensor network deployments mainly focused on data collection [274, 308]. Corresponding implementations [184, 161] commonly offer tree based routing, such as many-to-one and one-to-many communication patterns. Routing protocols to mention for this purpose are Directed Diffusion [194] and TAG [271]. These protocols build trees to broadcast commands from a base station to the sensor network and to collect and aggregate data along the path to the base station.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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
Landsiedel, O. (2007). Pseudo Geometric Routing for 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74991-2_11
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)