Algorithmica

, Volume 63, Issue 1–2, pp 274–295 | Cite as

Minimize the Maximum Duty in Multi-interface Networks

  • Gianlorenzo D’Angelo
  • Gabriele Di Stefano
  • Alfredo Navarra
Article

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.

Keywords

Multi-interface network Energy saving Computational complexity Approximation algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2(2), 153–177 (2006) MathSciNetCrossRefGoogle Scholar
  2. 2.
    Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discrete Math. 108(1–3), 231–252 (1992) MathSciNetMATHCrossRefGoogle Scholar
  3. 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. 4.
    Bahl, P., Adya, A., Padhye, J., Walman, A.: Reconsidering wireless systems with multiple radios. Comput. Commun. Rev. 34(5), 39–46 (2004) CrossRefGoogle Scholar
  5. 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. 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) CrossRefGoogle Scholar
  7. 7.
    Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996) MathSciNetMATHCrossRefGoogle Scholar
  8. 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) MathSciNetMATHCrossRefGoogle Scholar
  9. 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) CrossRefGoogle Scholar
  10. 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) CrossRefGoogle Scholar
  11. 11.
    Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243–266 (1991) MathSciNetMATHCrossRefGoogle Scholar
  12. 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. 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. 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. 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) CrossRefGoogle Scholar
  16. 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. 17.
    Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single-source shortest path trees. Algorithmica 22(3), 250–274 (1998) MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    Gabow, H., Westermann, H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7, 465–497 (1992) MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979) MATHGoogle Scholar
  20. 20.
    Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256–278 (1974) MATHCrossRefGoogle Scholar
  21. 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) MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    Kosowski, A., Navarra, A., Pinotti, M.C.: Exploiting multi-interface networks: connectivity and cheapest paths. Wirel. Netw. 16(4), 1063–1073 (2010) CrossRefGoogle Scholar
  23. 23.
    Malitz, S.M.: Genus g graphs have pagenumber \(O(\sqrt{g})\). J. Algorithms 17(1), 85–109 (1994) MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Gianlorenzo D’Angelo
    • 1
  • Gabriele Di Stefano
    • 1
  • Alfredo Navarra
    • 2
  1. 1.Department of Electrical and Information EngineeringUniversity of L’AquilaL’AquilaItaly
  2. 2.Department of Mathematics and Computer ScienceUniversity of PerugiaPerugiaItaly

Personalised recommendations