Abstract
The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the total power is the lowest. In this paper, we present several approximation algorithms for this problem. Specifically, we propose a 3k-approximation algorithm for any k≥, a (k + 12H (k)) -approximation algorithm for k(2k−1) ≤ n where n is the network size, a (k+2⌈(k + 1)/2⌉) -approximation algorithm for 2≤ k≤7, a 6-approximation algorithm for k = 3, and a 9-approximation algorithm for k = 4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. Auletta, Y. Dinitz, Z. Nutov, and D. Parente, “A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph,” J. Algorithms, vol. 31, pp. 21–30, 1999.
D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “On the symmetric range assignment problem in wireless ad hoc networks,” in Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002.
G. Calinescu, I. Mandoiu, and A. Zelikovsky, “Symmetric connectivity with minimum power consumption in radio networks submitted for journal publication, preliminary results appeared,” in Proc. 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 119–130.
G. Calinescu and P.-J. Wan, High Connectivity with Minimum Total Power in Wireless Ad Hoc Netowrks, Ad Hoc Now, 2003.
J. Cheriyan and S.N. Maheshwari, “Finding nonseparating induced cycles and independent spanning trees in connected graphs,” J. Algorithms, vol. 9, pp. 507–537, 1988.
J.Cheriyan, S. Vempala, and A.Vetta, “Approximation algorithms for minimum-cost $k$-vertex connected subgraphs,” in Proc. 34th Ann. ACM STOC, May 2002, pp. 306–312.
Y. Dinitz and Z. Nutov, “A 3-approximation algorithm for finding optimum 4/5-vertex-connected spanning subgraphs,” Journal of Algorithms, vol. 32, pp. 31–40, 1999.
A. Frank and É. Tardos, “An application of submodular flows,” Linear Algebra and its Applications, vols. 114/115, pp. 329–348, 1989.
H.N. Gabow, “A representation for crossing set families with applications to submodular flow problems,” in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, pp. 202–211.
M.T. Hajiaghayi, N. Immorlica, and V.S. Mirrokni, “Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks,” in Proceedings of the 9th annual international conference on Mobile computing and networking, 2003, pp. 300–312.
G.Kortsarz and Z. Nutov, “Approximating node connectivity problems via set covers,” in Third International Workshop on Approximation Algorithms for Combinatorial Optimization, (APPROX 2000), Springer, LNCS, vol. 1913, 2000, pp. 194–205.
W. Mader, “Ecken vom Grad $n$ “in minimalen $n$-fach zusammenhängenden Graphen,” Arch. Math, vol. 23, pp. 219–224, 1972.
W. Mader “Degree and local connectivity in finite graphs,” Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974, Academia, Prague 1975), pp. 341–344.
W. Mader, “On $k$-con-critically $n$-connected Graphs,” Journal of Combinatorial Theory, Series B, vol. 86, pp. 296–314, 2002.
A. Zehavi and A. Itai, “Three tree-paths,” J. of Graph Theory, vol. 13, no. 2, pp. 177–188, 1989.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported in part by Hong Kong Research Grant Council under grant No. CityU 1149/04E.
This work is partially supported by NSF CCR-0311174.
Rights and permissions
About this article
Cite this article
Jia, X., Kim, D., Makki, S. et al. Power Assignment for k-Connectivity in Wireless Ad Hoc Networks. J Comb Optim 9, 213–222 (2005). https://doi.org/10.1007/s10878-005-6858-2
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-6858-2