Skip to main content
SpringerLink
Log in

Coverage Subject to a Budget on Multi-Interface Networks with Bounded Carving-Width

  • Conference paper
  • First Online:
Book cover Web, Artificial Intelligence and Network Applications (WAINA 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1150))

Abstract

This paper studies a new variant of the so-called Coverage problem relative to the Multi-Interface networks model. Multi-Interface models have been extensively studied in the last decade, and concern networks of heterogeneous devices equipped with multiple communication interfaces. Each couple of directly linked devices can communicate with each other only if both activate at least one interface of the same type. We consider here a new variant of the Coverage, where each interface is associated with both a cost and a profit, and each established connection between two linked devices generates another profit. Similarly to previous studies, the number of the active interfaces on each device is limited by a constant q, but this new version of the Coverage also considers an additional global constraint that limits the cost over the entire network. This new version of the problem is \(\textit{NP}\)-hard even for the basic case of \(q=2\). We investigate the case of graphs with bounded Carving-width when q is still equal to 2, proposing two dynamic programming algorithms, both running in pseudo-polynomial time in the size of the input.

The work has been supported in part by the Italian MIUR PRIN 2017 Project ALGADIMAR “Algorithms, Games, and Digital Markets”.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 229.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 299.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aloisio, A., Arbib, C., Marinelli, F.: Cutting stock with no three parts per pattern: work-in-process and pattern minimization. Discrete Optim. 8, 315–332 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aloisio, A., Arbib, C., Marinelli, F.: On LP relaxations for the pattern minimization problem. Networks 57, 247–253 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aloisio, A., Autili, M., D’Angelo, A., Viidanoja, A., Leguay, J., Ginzler, T., Lampe, T., Spagnolo, L., Wolthusen, S., Flizikowski, A., Sliwa, J.: TACTICS: tactical service oriented architecture. In: 3rd International Conference in Software Engineering for Defence Applications, pp. 1–9 (2014)

    Google Scholar 

  4. Aloisio, A., Flammini, M., Vinci, C.: The impact of selfishness in hypergraph hedonic games. In: Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020) (2020, to appear)

    Google Scholar 

  5. Aloisio, A., Navarra, A.: Balancing energy consumption for the establishment of multi-interface networks. In: Proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). LNCS, vol. 8939, pp. 102–114. Springer (2015)

    Google Scholar 

  6. Aloisio, A., Navarra, A.: Budgeted constrained coverage on series-parallel multi-interface networks. In: 34th International Conference on Advanced Information Networking and Applications (AINA 2020). Springer (2020, to appear)

    Google Scholar 

  7. Aloisio, A., Navarra, A., Mostarda, L.: Distributing energy consumption in multi-interface series-parallel networks. In: Proceedings of 33rd International Conference on Advanced Information Networking and Applications (AINA Workshops). Advances in Intelligent Systems and Computing, vol. 927, pp. 734–744. Springer (2019)

    Google Scholar 

  8. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Energy-efficient communication in multi-interface wireless networks. Theory Comput. Syst. 52, 285–296 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Audrito, G., Bertossi, A., Navarra, A., Pinotti, C.: Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks. J. Discrete Algorithms 45, 14–25 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  10. Belmonte, R., van’t Hof, P., Kamiński, M., Paulusma, D., Thilikos, D.M.: Characterizing graphs of small carving-width. Discrete Appl. Math. 161(13), 1888–1893 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bretto, A.: Hypergraph Theory: An Introduction. Springer, Heidelberg (2013)

    Book  MATH  Google Scholar 

  12. 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 (2007)

    Google Scholar 

  13. D’Angelo, G., Di Stefano, G., Navarra, A.: Multi-interface wireless networks: complexity and algorithms. In: Ibrahiem, S.R., El Emary, M.M. (eds.) Wireless Sensor Networks: From Theory to Applications, pp. 119–155. CRC Press, Taylor & Francis Group (2013)

    Google Scholar 

  14. D’Angelo, G., Di Stefano, G., Navarra, A.: Flow problems in multi-interface networks. IEEE Trans. Comput. 63, 361–374 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. D’Angelo, G., Stefano, G.D., Navarra, A.: Minimize the maximum duty in multi-interface networks. Algorithmica 63(1–2), 274–295 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Flammini, M., Moscardelli, L., Navarra, A., Pérennes, S.: Asymptotically optimal solutions for small world graphs. In: Proceedings of 19th International Conference on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 3724, pp. 414–428. Springer (2005)

    Google Scholar 

  17. Gavoille, C., Klasing, R., Kosowski, A., Kuszner, L., Navarra, A.: On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1), 12–19 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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 

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

    Article  Google Scholar 

  20. Martello, S., Toth, P.: Knapsack Problems. Biddles Ltd., Guildford (1990)

    MATH  Google Scholar 

  21. Navarra, A., Pinotti, C.M.: Online knapsack of unknown capacity: how to optimize energy consumption in smartphones. Theory Comput. Sci. 697, 98–109 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  22. Perucci, A., Autili, M., Tivoli, M., Aloisio, A., Inverardi, P.: Distributed composition of highly-collaborative services and sensors in tactical domains. In: Proceedings of 6th International Conference in Software Engineering for Defence Applications (SEDA). LNCS, pp. 232–244. Springer (2019)

    Google Scholar 

  23. Voloshin, V.I.: Introduction to Graph and Hypergraph Theory. Nova Kroshka Books, North Miami Beach (2013)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Computer Science and Maths, University of L’Aquila, L’Aquila, Italy

    Alessandro Aloisio

  2. School of Advanced Studies, Gran Sasso Science Institute, L’Aquila, Italy

    Alessandro Aloisio

Authors
  1. Alessandro Aloisio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alessandro Aloisio .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. Department of Electrical Engineering and Information Technology, University of Naples “Frederico II”, Naples, Italy

    Flora Amato

  3. Department of Political Science, University of Campania Luigi Vanvitelli, Caserta, Italy

    Francesco Moscato

  4. Faculty of Business Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

  5. Department of Advanced Sciences, Hosei University, Tokyo, Japan

    Makoto Takizawa

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aloisio, A. (2020). Coverage Subject to a Budget on Multi-Interface Networks with Bounded Carving-Width. In: Barolli, L., Amato, F., Moscato, F., Enokido, T., Takizawa, M. (eds) Web, Artificial Intelligence and Network Applications. WAINA 2020. Advances in Intelligent Systems and Computing, vol 1150. Springer, Cham. https://doi.org/10.1007/978-3-030-44038-1_85

Download citation

Publish with us

Policies and ethics

Search

Navigation