Node Placement for Connected Coverage in Sensor NetworksReport as inadecuate

Node Placement for Connected Coverage in Sensor Networks - Download this document for free, or read online. Document in PDF available to download.

1 ESCE - Electrical, Computer, and Systems Engineering Department 2 Department of Computer Science College Park

Abstract : We address the problem of optimal node placement for ensuring connected coverage in sensor networks. We consider two different practical scenarios. In the first scenario, a certain region or a set of regions are to be provided connected coverage, while in the second case, a given set of n points are to be covered and connected. For the first case, we provide solutions that are within a small factor of the optimum. For the second case, we present an algorithm that runs in polynomial time, and guarantees a constant factor approximation ratio.

Author: Koushik Kar - Suman Banerjee -



Related documents