Abstract
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The properties considered are connectivity, bounded diameter and minimum node degree. The optimization objective is to minimize the total power assigned to nodes. As these problems are NP-hard in general, our focus is on developing approximation algorithms with provable performance guarantees. We present results under both symmetric and asymmetric power threshold models.
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
Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (August 2002)
Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation Algorithms for Directed Steiner Problems. Journal of Algorithms 33(1), 73–91 (1999)
Chen, W., Huang, N.: The Strongly Connecting Problem on Multihop Packet Radio Networks. IEEE Trans. Communication 37(3) (March 1989)
Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (August 2002)
Clementi, E.F., Penna, P., Silvestri, R.: Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 195–208. Springer, Heidelberg (1999)
Calinescu, G., Wan, P.-J.: Symmetric High Connectivity with Minimum Total Power Consumption in Multihop Packet Radio Networks (2003) (submitted for journal publication)
Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation 150, 57–74 (1999)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 363–374. Springer, Heidelberg (1997)
Kortsarz, G., Peleg, D.: Approximating the Weight of Shallow Light Trees. Discrete Applied Mathematics 93, 265–285 (1977); (Preliminary version appeared in Proc. Eighth ACM-SIAM Symp. on Discrete Algorithms (SODA 1997), New Orleans, LA, January 1977, pp. 103–110.)
Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic Aspects of Topology Control Problems for Ad hoc Networks. In: Proc. Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobi- Hoc 2002), Laussane, Switzerland (June 2002)
Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria Network Design Problems. Journal of Algorithms 28(1), 142–171 (1998)
Ramanathan, R.: On the Performance of Ad Hoc Networks with Beamforming Antennas. In: Proc. Second ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001), Long Beach, CA (October 2001)
Ramanathan, R., Rosales-Hain, R.: Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment. In: Proc. INFOCOM 2000 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumke, S.O., Liu, R., Lloyd, E.L., Marathe, M.V., Ramanathan, R., Ravi, S.S. (2003). Topology Control Problems under Symmetric and Asymmetric Power Thresholds. In: Pierre, S., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2003. Lecture Notes in Computer Science, vol 2865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39611-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-39611-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20260-8
Online ISBN: 978-3-540-39611-6
eBook Packages: Springer Book Archive