The capability to query the topology of spatial regions is fundamental to today's centralized spatial computing systems, like spatial databases and GIS. By contrast, this paper explores decentralized algorithms for computing the topology of spatial regions in wireless sensor networks. The approach generates global topological information about regions, using only the local knowledge of nodes and their immediate network neighbors aggregated up through spatial boundary structures. Using three basic boundary structures (boundary nodes, boundary cycles, and boundary orientation), a family of decentralized algorithms is defined that can respond efficiently to snapshot queries about the topology of spatial regions, including containment and adjacency queries. The communication complexity of the algorithm is O(n) for realistic inputs. Empirical investigation of the performance of the approach, using simulation, also confirms the efficiency, scalability, and robustness of this approach.

Additional Metadata
Keywords adjacency, containment, decentralized spatial computing, geosensor networks, Qualitative spatial reasoning, wireless sensor networks
Persistent URL dx.doi.org/10.1109/TC.2010.177
Journal IEEE Transactions on Computers
Citation
Duckham, M. (Matt), Nussbaum, D, Sack, J.-R, & Santoro, N. (2011). Efficient, decentralized computation of the topology of spatial regions. IEEE Transactions on Computers, 60(8), 1100–1113. doi:10.1109/TC.2010.177