Node Placement for Connected Coverage in Sensor Networks - Archive ouverte HAL Access content directly
Poster Communications Year :

Node Placement for Connected Coverage in Sensor Networks

(1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
kar-node.pdf (76.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00466114 , version 1 (22-03-2010)

Identifiers

  • HAL Id : inria-00466114 , version 1

Cite

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⟩

Collections

WIOPT2003
966 View
900 Download

Share

Gmail Facebook Twitter LinkedIn More