Neighborhood-Based Algorithms

  • Matt Duckham

Summary

This chapter introduces the most basic type of decentralized spatial algorithm: neighborhood-based algorithms. In a neighborhood-based algorithm, nodes are assumed to have access only to minimal spatial information: the identities of their neighbors. Despite this simplicity, neighborhood-based algorithms can provide a range of important functionality, including the dissemination and routing of information, the construction of network topologies, and some basic qualitative spatial functionality, including operations on region boundaries.

Keywords

Sink Node Communication Complexity Overlay Network Leader Election Short Path Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Matt Duckham
    • 1
  1. 1.Department of Infrastructure EngineeringThe University of MelbourneMelbourneAustralia

Personalised recommendations