Skip to main content
SpringerLink
Log in

Minimize the Maximum Duty in Multi-interface Networks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider devices equipped with multiple wired or wireless interfaces. By switching of various 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. In this paper, we consider two basic networking problems in the field of multi-interface networks. The first one, known as the Coverage problem, requires to establish the connections defined by a network. The second one, known as Connectivity problem, requires to guarantee a connecting path between any pair of nodes of a network. Both are subject to the constraint of keeping as low as possible the maximum cost set of active interfaces at each single node. We study the problems of minimizing the maximum cost set of active interfaces among the nodes of the network in order to cover all the edges in the first case, or to ensure connectivity in the second case. We prove that the Coverage problem is NP-hard for any fixed Δ≥5 and k≥16, with Δ being the maximum degree, and k being the number of different interfaces among the network. We also show that, unless P=NP, the problem cannot be approximated within a factor of ηln Δ, for a certain constant η. We then provide a general approximation algorithm which guarantees a factor of O((1+b)ln Δ), with b being a parameter depending on the topology of the input graph. Interestingly, b can be bounded by a constant for many graph classes. Other approximation and exact algorithms for special cases are presented. Concerning the Connectivity problem, we prove that it is NP-hard for any fixed Δ≥3 and k≥10. Also for this problem, the inapproximability result holds, that is, unless P=NP, the problem cannot be approximated within a factor of ηln Δ, for a certain constant η. We then provide approximation and exact algorithms for the general problem and for special cases, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2(2), 153–177 (2006)

    Article  MathSciNet  Google Scholar 

  2. Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discrete Math. 108(1–3), 231–252 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Energy-efficient communication in multi-interface wireless networks. In: Proc. of the 34th Int. Symp. on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 5743, pp. 102–111. Springer, Berlin (2009)

    Google Scholar 

  4. Bahl, P., Adya, A., Padhye, J., Walman, A.: Reconsidering wireless systems with multiple radios. Comput. Commun. Rev. 34(5), 39–46 (2004)

    Article  Google Scholar 

  5. Barsi, F., Navarra, A., Pinotti, M.C.: Cheapest paths in multi-interface networks. In: Proc. of the 10th Int. Conf. on Distributed Computing and Networking (ICDCN). Lecture Notes in Computer Science, vol. 5408, pp. 37–42. Springer, Berlin (2009)

    Google Scholar 

  6. Basagni, S., Nidito, F., Farago, A.: The multi-radio advantage. In: Proc. of the IEEE Radio and Wireless Symposium (RWS), pp. 478–481. IEEE, New York (2009)

    Chapter  Google Scholar 

  7. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bruera, F., Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Math. Comput. Sci. 1(4), 709–736 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Caporuscio, M., Charlet, D., Issarny, V., Navarra, A.: Energetic performance of service-oriented multi-radio networks: issues and perspectives. In: Proc. of the 6th Int. Workshop on Software and Performance (WOSP), pp. 42–45. ACM Press, New York (2007)

    Chapter  Google Scholar 

  10. Cavalcanti, D., Gossain, H., Agrawal, D.: Connectivity in multi-radio, multi-channel heterogeneous ad hoc networks. In: IEEE 16th Int. Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1322–1326. IEEE, New York (2005)

    Chapter  Google Scholar 

  11. Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243–266 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. D’Angelo, G., Di Stefano, G., Navarra, A.: Minimizing the maximum duty for connectivity in multi-interface networks. In: Proc. of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA). Lecture Notes in Computer Science, Part II, vol. 6509, pp. 254–267. Springer, Berlin (2010)

    Google Scholar 

  13. D’Angelo, G., Di Stefano, G., Navarra, A.: Bandwidth constrained multi-interface networks. In: Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science, vol. 6543, pp. 202–213. Springer, Berlin (2011)

    Google Scholar 

  14. D’Angelo, G., Di Stefano, G., Navarra, A.: Min-max coverage in multi-interface networks. In: Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science, vol. 6543, pp. 190–201. Springer, Berlin (2011)

    Google Scholar 

  15. Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: Proc. of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 114–128. ACM, New York (2004)

    Chapter  Google Scholar 

  16. Faragó, A., Basagni, S.: The effect of multi-radio nodes on network connectivity—a graph theoretic analysis. In: Proc. of the IEEE Int. Workshop on Wireless Distributed Networks (WDM). IEEE, New York (2008)

    Google Scholar 

  17. Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single-source shortest path trees. Algorithmica 22(3), 250–274 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Gabow, H., Westermann, H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7, 465–497 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  19. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  20. Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256–278 (1974)

    Article  MATH  Google Scholar 

  21. Klasing, R., Kosowski, A., Navarra, A.: Cost minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53(3), 266–275 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kosowski, A., Navarra, A., Pinotti, M.C.: Exploiting multi-interface networks: connectivity and cheapest paths. Wirel. Netw. 16(4), 1063–1073 (2010)

    Article  Google Scholar 

  23. Malitz, S.M.: Genus g graphs have pagenumber \(O(\sqrt{g})\). J. Algorithms 17(1), 85–109 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Information Engineering, University of L’Aquila, Via Gronchi 18, 67100, L’Aquila, Italy

    Gianlorenzo D’Angelo & Gabriele Di Stefano

  2. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123, Perugia, Italy

    Alfredo Navarra

Authors
  1. Gianlorenzo D’Angelo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gianlorenzo D’Angelo.

Additional information

Preliminary results concerning this paper appeared in the proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA’10) [12] and in the proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’11) [14].

Rights and permissions

Reprints and permissions

About this article

Cite this article

D’Angelo, G., Di Stefano, G. & Navarra, A. Minimize the Maximum Duty in Multi-interface Networks. Algorithmica 63, 274–295 (2012). https://doi.org/10.1007/s00453-011-9531-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-011-9531-4

Keywords

Search

Navigation