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.
KeywordsSink Node Communication Complexity Overlay Network Leader Election Short Path Tree
Unable to display preview. Download preview PDF.