—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Abstract. We define geometric self-structuring in a large-scale networked system as the ability of the participating nodes to collaboratively impose a geometric structure to the ne...
—Distance sensitivity is a locality concept that is useful for designing scalable wireless sensor network applications. In this paper, we formally define distance sensitivity an...