Abstract
Nowadays, communication networks are composed by heterogeneous devices that can communicate by means of multiple interfaces. By choosing which interfaces to activate (switch-on) at each device, several connections might be established. That is, the devices at the endpoints of each connection share at least one active interface. This is at the basis of a new but well-investigated model referred in the literature to as Multi-Interface networks. In this paper, we consider a new variant of the original model where each device is limited to activate at most a fixed number p of its available interfaces. In particular, we consider the so-called Coverage problem. Given a network \(G=(V,E)\), nodes V represent devices, edges E represent connections that can be established. The aim is to activate at most p interfaces at each node in order to establish all the connections defined by E. A connection is established whenever the two endpoints activate one common interface. Recently, the problem has been proved to be \(\textit{NP}\)-hard even for the basic case of \(p=2\). Then, various resolution algorithms have been provided for different graph topologies. Here we keep on investigating on the case \(p=2\) when the underlying graph represents a so-called Series-Parallel network. We provide an optimal resolution algorithm based on dynamic programming for this intriguing graph class.
The work has been supported in part by the European project “Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies” (GEO-SAFE), contract no. H2020-691161, and by the Italian National Group for Scientific Computation (GNCS-INdAM).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
Aloisio, A., Arbib, C., Marinelli, F.: On LP relaxations for the pattern minimization problem. Networks 57, 247–253 (2011)
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)
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)
Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Energy-efficient communication in multi-interface wireless networks. Theory Comput. Syst. 52, 285–296 (2013)
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)
Bahl, P., Adya, A., Padhye, J., Walman, A.: Reconsidering wireless systems with multiple radios. SIGCOMM Comput. Commun. Rev. 34(5), 39–46 (2004)
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)
Cavalcanti, D., Gossain, H., Agrawal, D.: Connectivity in multi-radio, multi-channel heterogeneous ad hoc networks. In: Proceedings of the 16th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1322–1326. IEEE (2005)
D’Angelo, G., Di Stefano, G., Navarra, A.: Multi-interface wireless networks: complexity and algorithms. In: Ramakrishnan, S., El Emary, I.M.M. (eds.) Wireless Sensor Networks: From Theory to Applications, pp. 119–155. CRC Press/Taylor & Francis Group, Boca Raton (2013)
D’Angelo, G., Di Stefano, G., Navarra, A.: Flow problems in multi-interface networks. IEEE Trans. Comput. 63, 361–374 (2014)
D’Angelo, G., Stefano, G.D., Navarra, A.: Minimize the maximum duty in multi-interface networks. Algorithmica 63(1–2), 274–295 (2012)
Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: Proceedings of the 10th International Conference on Mobile Computing and Networking (MobiCom), pp. 114–128. ACM (2004)
Duffin, R.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303–318 (1965)
Faragó, A., Basagni, S.: The effect of multi-radio nodes on network connectivity—a graph theoretic analysis. In: Proceedings of the 19th International Symposium on Personal, Indoor and Mobile Radio Communications, (PIMRC), pp. 1–5. IEEE (2008)
Flammini, M., Moscardelli, L., Navarra, A., Pérennes, S.: Asymptotically optimal solutions for small world graphs. In: Proceedings of the 19th International Conference on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 3724, pp. 414–428. Springer (2005)
Friedman, R., Kogan, A., Krivolapov, Y.: On power and throughput tradeoffs of WiFi and Bluetooth in smartphones. In: Proceedings of the 30th International Conference on Computer Communications (INFOCOM), pp. 900–908. IEEE (2011)
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)
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)
Korenblit, M., Levit, V.: On algebraic expressions of series-parallel and Fibonacci graphs. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) Discrete Mathematics and Theoretical Computer Science, pp. 215–224. Springer, Heidelberg (2003)
Kosowski, A., Navarra, A., Pajak, D., Pinotti, C.: Maximum matching in multi-interface networks. Theor. Comput. Sci. 507, 52–60 (2013)
Kosowski, A., Navarra, A., Pinotti, M.: Exploiting multi-interface networks: connectivity and cheapest paths. Wirel. Netw. 16(4), 1063–1073 (2010)
Perucci, A., Autili, M., Tivoli, M., Aloisio, A., Inverardi, P.: Distributed composition of highly-collaborative services and sensors in tactical domains. In: Proceedings of the 7th International Conference in Software Engineering for Defence Applications, (SEDA), LNCS. Springer (2018, to appear)
Valdes, J., Tarjan, R., Lawler, E.: The recognition of series parallel digraphs. In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC), pp. 1–12. ACM (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Aloisio, A., Navarra, A., Mostarda, L. (2019). Distributing Energy Consumption in Multi-interface Series-Parallel Networks. In: Barolli, L., Takizawa, M., Xhafa, F., Enokido, T. (eds) Web, Artificial Intelligence and Network Applications. WAINA 2019. Advances in Intelligent Systems and Computing, vol 927. Springer, Cham. https://doi.org/10.1007/978-3-030-15035-8_71
Download citation
DOI: https://doi.org/10.1007/978-3-030-15035-8_71
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15034-1
Online ISBN: 978-3-030-15035-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)