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 an \(\mathcal{NP}\)-completeness proof for the feasibility of the problem even considering the basic case of p = 2 and unitary costs for all the interfaces. Then we provide optimal algorithms that solve the problem in polynomial time for different graph topologies and general costs associated to the interfaces.
Work partially supported by Research Grant 2010N5K7EB - PRIN 2010 - “ARS TechnoMedia”, and “Reti di sensori e architetture distribuite di controllo e comunicazione wireless”, MIUR Art 10, DM 593 - Prot MIUR DM38036.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aloisio, A., Arbib, C., Marinelli, F.: Cutting stock with no three parts per pattern: Work-in-process and pattern minimization. Discrete Optimization 8, 315–332 (2011)
Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Energy-efficient communication in multi-interface wireless networks. Theory of Computing Systems 52, 285–296 (2013)
Bahl, P., Adya, A., Padhye, J., Walman, A.: Reconsidering wireless systems with multiple radios. SIGCOMM Computer Communication Review 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: Proc. of the 6th Int’l 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: Proc. of the 16th Int’l Symp. 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: Ibrahiem, S.R., El Emary, M.M. (eds.) Wireless Sensor Networks: From Theory to Applications, pp. 119–155. CRC Press, Taylor & Francis Group (2013)
D’Angelo, G., Di Stefano, G., Navarra, A.: Flow problems in multi-interface networks. IEEE Transactions on Computers 63, 361–374 (2014)
D’Angelo, G., Di Stefano, G., 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: Proc. of the 10th Int’l Conf. on Mobile Computing and Networking (MobiCom), pp. 114–128. ACM (2004)
Faragó, A., Basagni, S.: The effect of multi-radio nodes on network connectivity–a graph theoretic analysis. In: Proc. of the 19th Int’l Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1–5. IEEE (2008)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
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)
Kosowski, A., Navarra, A., Pajak, D., Pinotti, C.M.: Maximum matching in multi-interface networks. Theoretical Computer Science 507, 52–60 (2013)
Kosowski, A., Navarra, A., Pinotti, M.C.: Exploiting Multi-Interface Networks: Connectivity and Cheapest Paths. Wireless Networks 16(4), 1063–1073 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aloisio, A., Navarra, A. (2015). Balancing Energy Consumption for the Establishment of Multi-interface Networks. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, JJ., Wattenhofer, R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46078-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-46078-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46077-1
Online ISBN: 978-3-662-46078-8
eBook Packages: Computer ScienceComputer Science (R0)