Abstract
In a distributed network, the delivery of messages between its nodes is a basic task, and a mechanism is required that is able to deliver packages of data from any node of the network to any other node. To this end, usually a distributed algorithm runs on every node of the network, which properly forwards incoming packages, employing some information that is stored in the local memory of the node.
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
Dom, M. (2007). Compact Routing. 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-74991-2_10
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)