Energy consumption balancing in multi-interface networks

Abstract

In heterogeneous networks, devices can communicate by means of multiple interfaces. By choosing which interfaces to activate (switch-on) at each device, several connections might be established. A connection is established when the devices at its endpoints share at least one active interface. Interfaces are associated with a cost defining the percentage of energy consumed to switch-on the corresponding interface. In this paper, we consider the case where each device is limited to activate at most a fixed number p of its available interfaces in order to accomplish the required task. 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. Parameter p implies a sort of balanced consumption among devices so that none of them suffers—in terms of consumed energy—for being exploited in the network more than others. We provide a \(\mathrm {NP}\)-completeness proof for the feasibility of the problem even considering the basic case of \(p=2\) and unitary costs for all the interfaces. That is, each interface costs the same as all the others. Then we provide optimal algorithms that solve the problem in polynomial time for different graph topologies and general costs associated to the interfaces.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

References

  1. Ahmed S, Khan MA, Ishtiaq A, Khan ZA, Ali MT (2019) Energy harvesting techniques for routing issues in wireless sensor networks. IJGUC 10(1):10–21

    Article  Google Scholar 

  2. Aloisio A, Navarra A (2015) 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), vol 8939. LNCS. Springer, Berlin, pp 102–114

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

    MathSciNet  MATH  Article  Google Scholar 

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

    MathSciNet  MATH  Article  Google Scholar 

  5. Aloisio A, Autili M, D’Angelo A, Viidanoja A, Leguay J, Ginzler T, Lampe T, Spagnolo L, Wolthusen S, Flizikowski A, Sliwa J (2014) TACTICS: tactical service oriented architecture. In: 3rd international conference in software engineering for defence applications, pp 1–9

  6. Aloisio A, Navarra A, Mostarda L (2019) Distributing energy consumption in multi-interface series-parallel networks. In: Proceedings of 5th IEEE AINA international workshop on engineering energy efficient internetworked smart sensor (E3WSN), vol 927. Advances in intelligent systems and computing, Springer, Berlin, pp 734–744

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

    MathSciNet  MATH  Article  Google Scholar 

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

    MathSciNet  MATH  Article  Google Scholar 

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

    Article  Google Scholar 

  10. Caporuscio M, Charlet D, Issarny V, Navarra A (2007) Energetic performance of service-oriented multi-radio networks: issues and perspectives. In: Proceedings of the 6th international workshop on software and performance (WOSP), ACM, pp 42–45

  11. Cavalcanti D, Gossain H, Agrawal D (2005) 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), IEEE, pp 1322–1326

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

    MathSciNet  MATH  Article  Google Scholar 

  13. D’Angelo G, Di Stefano G, Navarra A (2013) Multi-interface wireless networks: complexity and algorithms. In: Ibrahiem MM, El Emary SR (eds) Wireless sensor networks: from theory to applications. CRC Press, Taylor & Francis Group, Boca Raton, pp 119–155

    Google Scholar 

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

    MathSciNet  MATH  Article  Google Scholar 

  15. Draves R, Padhye J, Zill B (2004) Routing in multi-radio, multi-hop wireless mesh networks. In: Proceedings of the 10th international conference on mobile computing and networking (MobiCom), ACM, pp 114–128

  16. Faragó A, Basagni S (2008) 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), IEEE, pp 1–5

  17. Flammini M, Moscardelli L, Navarra A, Pérennes S (2005) Asymptotically optimal solutions for small world graphs. In: Proceedings 19th international conference on distributed computing (DISC), vol 3724. Lecture notes in computer science, Springer, Berlin, pp 414–428

  18. Friedman R, Kogan A, Krivolapov Y (2011) On power and throughput tradeoffs of wifi and bluetooth in smartphones. In: Proceedings of the 30th international conference on computer communications (INFOCOM), IEEE, pp 900–908

  19. Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. W.H. Freeman and Company, New York

    Google Scholar 

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

    MathSciNet  MATH  Article  Google Scholar 

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

    MathSciNet  MATH  Article  Google Scholar 

  22. Korenblit M, Levit V (2003) On algebraic expressions of series-parallel and fibonacci graphs. In: Calude CS, Dinneen MJ, Vajnovszki V (eds) Discrete mathematics and theoretical computer science. Springer, Heidelberg, pp 215–224

    Google Scholar 

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

    Article  Google Scholar 

  24. Kosowski A, Navarra A, Pajak D, Pinotti C (2013) Maximum matching in multi-interface networks. Theor Comput Sci 507:52–60

    MathSciNet  MATH  Article  Google Scholar 

  25. Marques B, Coelho IM, da Costa Sena A, de Castro MCS (2019) A network coding protocol for wireless sensor fog computing. IJGUC 10(3):224–234

    Article  Google Scholar 

  26. Micheletti M, Mostarda L, Piermarteri A (2018) Rotating energy efficient clustering for heterogeneous devices (REECHD). In: 32nd IEEE international conference on advanced information networking and applications, AINA, IEEE Computer Society, pp 213–220

  27. Micheletti M, Mostarda L, Navarra A (2019) CER-CH: combining election and routing amongst cluster heads in heterogeneous WSNS. IEEE Access. https://doi.org/10.1109/ACCESS.2019.2938619

  28. Navarra A (2008) 3-Dimensional minimum energy broadcasting problem. Ad Hoc Netw 6(5):734–743

    Article  Google Scholar 

  29. Perucci A, Autili M, Tivoli M, Aloisio A, Inverardi P (2019) Distributed composition of highly-collaborative services and sensors in tactical domains. In: Proceedings of 6th international conference in software engineering for defence applications (SEDA), vol 925. Advances in intelligent systems and computing, Springer, Berlin, pp 232–244

  30. Valdes J, Tarjan R, Lawler E (1979) The recognition of series parallel digraphs. In: Proceedings 11th annual ACM symposium on theory of computing (STOC), ACM, pp 1–12

Download references

Funding

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, by the Italian MIUR PRIN 2017 Project ALGADIMAR “Algorithms, Games, and Digital Markets”, and by the Italian National Group for Scientific Computation (GNCS-INdAM).

Author information

Affiliations

Authors

Corresponding author

Correspondence to Alfredo Navarra.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Preliminary results appeared in the Proc. of th 41st Int.’l Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM) 2015, Aloisio and Navarra (2015) and in the Proc. of the 5th Int.’l Symp. on Engineering Energy Efficient InternetWorked Smart seNsors (E3WSN) 2019, Aloisio et al. (2019).

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Aloisio, A., Navarra, A. & Mostarda, L. Energy consumption balancing in multi-interface networks. J Ambient Intell Human Comput 11, 3209–3219 (2020). https://doi.org/10.1007/s12652-019-01486-w

Download citation

Keywords

  • Multi-interface networks
  • Energy optimization
  • NP-completeness
  • Optimal algorithms