Abstract
We study communication problems in wireless networks supporting multiple interfaces. In such networks, two nodes can communicate if they are close and share a common interface. The activation of each interface has a cost reflecting the energy consumed when a node uses this interface. We distinguish between the symmetric and non-symmetric case, depending on whether all nodes have the same activation cost for each interface or not. For the symmetric case, we present a (3/2 + ε)–approximation algorithm for the problem of achieving connectivity with minimum activation cost, improving a previous bound of 2. For the non-symmetric case, we show that the connectivity problem is not approximable within a sublogarithmic factor in the number of nodes and present a logarithmic approximation algorithm for a more general problem that models group communication.
This work is partially supported by the European Union under IST FET Integrated Project FP6-015964 AEOLUS, by the General Secretariat for Research and Technology of the Greek Ministry of Development under programme PENED, and by a “Caratheodory” basic research grant from the University of Patras.
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
Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for generalized Steiner tree Problem on Networks. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 1991), pp. 131–144 (1991)
Bahl, P., Adya, A., Padhye, J., Walman, A.: Reconsidering wireless systems with multiple radios. SIGCOMM Comput. Commun. Rev. 34(5), 39–46 (2004)
Cǎlinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Energy-efficient wireless network design. Theory of Computing Systems 39(5), 593–617 (2006)
Cavalcanti, D., Gossain, H., Agrawal, D.: Connectivity in multi-radio, multi-channel heterogeneous ad hoc networks. In: Proceedings of the IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2005), pp. 1322–1326. IEEE, Los Alamitos (2005)
Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom 2004), pp. 114–128. ACM, New York (2004)
Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of the ACM 45(4), 634–652 (1998)
Faragó, A., Basagni, S.: The effect of multi-radio nodes on network connectivity: a graph theoretic analysis. In: Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2008). IEEE, Los Alamitos (2008)
Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing 24, 296–317 (1995)
Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation 150(1), 57–74 (1999)
Klasing, R., Kosowski, A., Navarra, A.: Cost minimisation in wireless networks with bounded and unbounded number of interfaces. Networks 53(3), 266–275 (2009)
Kosowski, A., Navarra, A., Pinotti, M.C.: Connectivity in multi-interface networks. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol. 5474, pp. 159–173. Springer, Heidelberg (2009)
Prömel, H.J., Steger, A.: A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. Journal of Algorithms 36, 89–101 (2000)
Raz, R., Safra, S.: A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), pp. 475–484 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E. (2009). Energy-Efficient Communication in Multi-interface Wireless Networks. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)