Exploiting multi-interface networks: connectivity and cheapest paths (Rapporti tecnici, manuali, carte geologiche e tematiche e prodotti multimediali)

Type
Label
  • Exploiting multi-interface networks: connectivity and cheapest paths (Rapporti tecnici, manuali, carte geologiche e tematiche e prodotti multimediali) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Alternative label
  • Kosowski A.; Navarra A.; Pinotti M. C. (2009)
    Exploiting multi-interface networks: connectivity and cheapest paths
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Kosowski A.; Navarra A.; Pinotti M. C. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • Technical report, 2009. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • ABSTRACT: Let G = (V , E) be a graph which models a set of wireless devices (nodes V ) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at least one active interface. In general, every node holds a subset of all the possible k interfaces. Such networks are known as multi-interface networks. In this setting, we study two basic problems: Connectivity and Cheapest Path. The Connectivity problem corresponds to the well-known Minimum Spanning Tree problem in graph theory. In practice, we need to cover a subgraph of G of minimum cost which contains a spanning tree of G. The problem turns out to be APX -hard in general and for many restricted graph classes, however it is possible to provide ap (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#supporto
  • Altro (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • LaBRI - Université Bordeaux - Department of Algorithms and System Modeling, Gdansk University of Technology, Poland, Dipartimento di Matematica e Informatica, Università di Perugia (literal)
Titolo
  • Exploiting multi-interface networks: connectivity and cheapest paths (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it