Trade-offs between mobility and density for coverage in wireless sensor networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
| Hi-index | 0.00 |
Starting from the Points and Vertices problem introduced in [9], given a graph G = (V,E) with |V | = n and a positive number , we consider the following problem. Place (1 - E)n points on the vertices V of G independently and uniformly at random. Once the points are placed, relocate them by movements along the edges E of G using a function from the points to the vertices that minimizes the maximum distance between the random place of the points and their target vertices. The aim is to obtain in the final setting at most one point for each vertex. We look for an upper bound on this maximum relocation distance that holds with high probability over the initial placements of the points. We study several topologies for the graph G like paths, trees, d-dimensional grids, hypercubes and general graphs.