Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Reconsidering wireless systems with multiple radios
ACM SIGCOMM Computer Communication Review
Energetic performance of service-oriented multi-radio networks: issues and perspectives
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Energy-Efficient Communication in Multi-interface Wireless Networks
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
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
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
Operations Research Letters
Maximum matching in multi-interface networks
Theoretical Computer Science
Hi-index | 0.00 |
In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost, and provides a communication bandwidth. In this paper, we consider the problem of activating the cheapest set of interfaces among a network G = (V, E) in order to guarantee a minimum bandwidth B of communication between two specified nodes. Nodes V represent the devices, edges E represent the connections that can be established. In practical cases, a bounded number k of different interfaces among all the devices can be considered. Despite this assumption, the problem turns out to be NP-hard even for small values of k and Δ, where Δ is the maximum degree of the network. In particular, the problem is NP-hard for any fixed k ≥ 2 and Δ 3, while it is polynomially solvable when k = 1, or Δ ≤ 2 and k = O(1). Moreover, we show that the problem is not approximable within η log B or Ω(log log |V|) for any fixed k ≥ 3, Δ ≥ 3, and for a certain constant η, unless P = NP. We then provide an approximation algorithm with ratio guarantee of bmax, where bmax is the maximum communication bandwidth allowed among all the available interfaces. Finally, we focus on particular cases by providing complexity results and polynomial algorithms for Δ ≤ 2.