Cost Minimisation in Multi-interface Networks

  • Ralf Klasing
  • Adrian Kosowski
  • Alfredo Navarra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4465)


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 non-uniform. In general, we show that the problem is APX-hard while we obtain an approximation factor of \(\min\{\lceil \frac {k+1} 2 \rceil,\frac {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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Caporuscio, M., Carzaniga, A., Wolf, A.L.: Design and evaluation of a support service for mobile, wireless publish/subscribe applications. IEEE Transactions on Software Engineering 29(12), 1059–1071 (2003)CrossRefGoogle Scholar
  2. 2.
    Cilibrasi, R., Lotker, Z., Navarra, A., Perennes, S., Vitanyi, P.: About the lifespan of peer to peer networks. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 288–302. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Adya, A., Bahl, P., Padhye, J., Wolman, A., Zhou, L.: Multi-radio unification protocol for IEEE 802.11 wireless networks. In: Proceedings of the 1st International Conference on Broadband Networks (BroadNets), pp. 344–354 (2004)Google Scholar
  4. 4.
    Caporuscio, M., Charlet, D., Issarny, V., Navarra, A.: Energetic Performance of Service-oriented Multi-radio Networks: Issues and Perspectives. In: Proceedings of the 6th International Workshop on Software and Performance (WOSP), pp. 42–45. ACM Press, New York (2007)CrossRefGoogle Scholar
  5. 5.
    Even, S.: Graph Algorithms. Computer Science Press (1979)Google Scholar
  6. 6.
    Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. Journal of the ACM 35(4), 921–940 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Brooks, R.L.: On coloring the nodes of a network. Proceedings of Cambridge Philosophical Society 37, 194–197 (1941)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM 30(3), 417–427 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  11. 11.
    Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41(1), 153–180 (1994)zbMATHCrossRefGoogle Scholar
  12. 12.
    Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepistö, T., Salomaa, A. (eds.) Automata, Languages and Programming. LNCS, vol. 317, pp. 105–118. Springer, Heidelberg (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ralf Klasing
    • 1
  • Adrian Kosowski
    • 2
  • Alfredo Navarra
    • 1
    • 3
  1. 1.LaBRI - Université Bordeaux 1 - CNRS, 351 cours de la Liberation, 33405, Talence cedexFrance
  2. 2.Department of Algorithms and System Modeling, Gdańsk University of Technology, Narutowicza 11/12, 80952 GdańskPoland
  3. 3.Dipartimento di Matematica e Informatica, Universitá degli Studi di Perugia, Via Vanvitelli 1, 06123 PerugiaItaly

Personalised recommendations