Power assignment for k-connectivity in wireless ad hoc networks

Journal of Combinatorial Optimization

Volumn 9, Issue 2, 2005, Pages 213-222

  Jia, Xiaohua ^a   Kim, Dongsoo ^b   Makki, Sam ^c   Wan, Peng Jun ^d,e   Yi, Chih Wei ^d  

^a WUHAN UNIVERSITY   (China)

^b Indiana University Purdue University Indianapolis   (United States)

^c The University of Toledo   (United States)

^d Illinois Institute of Technology   (United States)

^e CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

k connectivity; Power assignment; Wireless ad hoc sensor networks

Indexed keywords

K-CONNECTIVITY; POWER ASSIGNMENT; WIRELESS AD HOC SENSOR NETWORK;

ALGORITHMS; APPROXIMATION THEORY; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

TELECOMMUNICATION NETWORKS;

EID: 24144472248     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-005-6858-2     Document Type: Article

References (15)

1. 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.
2. 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.
3. 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.
4. G. Calinescu and P.-J. Wan, High Connectivity with Minimum Total Power in Wireless Ad Hoc Netowrks, Ad Hoc Now, 2003.
5. 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.
6. 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.
7. 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.
8. A. Frank and E. Tardos, "An application of submodular flows, Linear Algebra and its Applications, vols. 114/115, pp. 329-348, 1989.
9. 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.
10. 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.
11. 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.
12. W. Mader, "Ecken vom Grad n "in minimalen n-fach zusammenhängenden Graphen," Arch. Math, vol. 23, pp. 219-224, 1972.
13. 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.
14. W. Mader, "On k-con-critically n-connected Graphs," Journal of Combinatorial Theory, Series B, vol. 86, pp. 296-314, 2002.
15. A. Zehavi and A. Itai, "Three tree-paths," J. of Graph Theory, vol. 13, no. 2, pp. 177-188, 1989.