| Résumé | A multi-interface network is modeled by a graph whose nodes correspond to
a set of wireless devices communicating by means of multiple radio
interfaces, according to the proximity and common interfaces. A connection
is covered (activated) when the endpoints of the corresponding edge share
at least one active interface. In this context, we study centralized and
distributed algorithms for the problem of covering a spanning subgraph, and
also look at two other important networking problems: covering all the
connections, and covering a specified communication path. The applied
optimization criterion is motivated by issues of energy consumption
minimization. |