Summary
Evaluating efficiency helps us understand how much of a system’s resources will be consumed by an algorithm. But efficient algorithms must also be robust: able to reliably generate useful information under a range of different circumstances. Most algorithms must strike a balance between efficiency and robustness; it is frequently possible to increase an algorithm’s robustness at the cost of decreased efficiency. Robustness becomes especially important in the practical contexts of algorithms for geosensor network deployments. Geosensor networks are also expected to operate in environments of uncertainty, for example, where sensors are inaccurate or network coverage is sparse. Further, it is in many cases desirable that decentralized algorithms continue to operate at some level even if the the assumptions upon which they are founded are violated, for example, when communication becomes unreliable.
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
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Duckham, M. (2013). Simulating Robust Decentralized Spatial Algorithms. In: Decentralized Spatial Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30853-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-30853-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30852-9
Online ISBN: 978-3-642-30853-6
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)