Node Placement for Connected Coverage in Sensor Networks

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.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00466114
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Monday, March 22, 2010 - 4:29:24 PM
Last modification on : Friday, August 2, 2019 - 2:30:10 PM
Long-term archiving on : Friday, June 25, 2010 - 11:54:04 AM

File

kar-node.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00466114, version 1

Collections

Citation

Koushik Kar, Suman Banerjee. Node Placement for Connected Coverage in Sensor Networks. WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 2 p. ⟨inria-00466114⟩

Share

Metrics

Record views

1153

Files downloads

1169