STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
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
Cost minimisation in multi-interface networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
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
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 |
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. A connection is satisfied when the endpoints of the corresponding edge share at least one active interface. Every node holds a subset of all the possible k interfaces. The problem is called Cost Minimisation in Unbounded Multi-Interface Networks and in [1] the case with bounded k was studied. In this paper we generalise the model by considering the unbounded version of the problem, i.e., k is not set a priori but depends on the given instance. 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 non-uniform. In general, we prove that the problemis not approximable within O(log k) while it holds min{⌈k+1/2⌉, 2m/n}-approximation factor for the uniform case and min{k - 1, √n(1 + ln n)}-approximation factor for the non-uniform case. Next, we also provide hardness and approximation results for several classes of networks: with bounded degree, trees, planar and complete graphs.