A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
Graph Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Energetic performance of service-oriented multi-radio networks: issues and perspectives
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Design and Evaluation of a Support Service for Mobile, Wireless Publish/Subscribe Applications
IEEE Transactions on Software Engineering
About the lifespan of peer to peer networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Cheapest Paths in Multi-interface Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Connectivity in Multi-interface Networks
Trustworthy Global Computing
Cost minimisation in unbounded multi-interface networks
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Exploiting multi-interface networks: Connectivity and Cheapest Paths
Wireless Networks
Minimizing the maximum duty for connectivity in multi-interface networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Hi-index | 0.00 |
The paper focuses on the problem of minimisation of energy consumption by wireless devices. Since wireless communications are some of the main causes of battery drainage, connections must be carefully established. We study complexity issues of the so called Cost Minimisation in Multi-Interface Networks problem. Given a graph G = (V,E) with |V| = n and |E| = m, which models a set of wireless devices (nodes V ) connected by multiple radio interfaces (edges E), the aim is to switch on the minimum cost set of interfaces at the nodes in order to satisfy all the connections. Every node holds a subset of all the possible k interfaces. A connection is satisfied when the endpoints of the corresponding edge share at least one active interface. We distinguish two main variations of the problem by treating the cost of maintaining an active interface as uniform (i.e., the same for all interfaces), or nonuniform. In general, we show that the problem is APX-hard while we obtain an approximation factor of min{⌈k+1/2⌉, 2m/n} for the uniform case and a (k -1)-approximation for the non-uniform case. Next, we concentrate our attention on several classes of networks: with bounded degree, planar, with bounded treewidth and complete.