Neighborhood-based algorithms have access to only the most basic spatial information. Location-based algorithms, however, relax this restriction and assume access to a broader range of spatial information, such as the coordinate locations of nodes. As a result, location-based algorithms can provide a much broader range of functionality, including generating planar network topologies; efficient geographic routing; computing the area and centroid of regions; and identifying the topological structure of complex areal objects.
KeywordsMinimum Span Tree Overlay Network Boundary Node Leader Election Short Path Tree
Unable to display preview. Download preview PDF.