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.
Type de document :
Poster
WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 2 p
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00466114
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : lundi 22 mars 2010 - 16:29:24
Dernière modification le : lundi 22 mars 2010 - 16:32:19
Document(s) archivé(s) le : vendredi 25 juin 2010 - 11:54:04

Fichier

kar-node.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

892

Téléchargements de fichiers

713