Power assignment for k-connectivity in wireless ad hoc networks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2005, Pages 2206-2211

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

^a WUHAN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c Indiana University Purdue University Indianapolis   (United States)

^d The University of Toledo   (United States)

^e Illinois Institute of Technology   (United States)

Author keywords

K connectivity; Power assignment; Wireless ad hoc sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; K-CONNECTIVITY; POWER ASSIGNMENT; WIRELESS AD HOC SENSOR NETWORKS;

ALGORITHMS; NETWORKS (CIRCUITS); PROBLEM SOLVING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 25844456012     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498495     Document Type: Conference Paper

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 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, 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, 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 9:507-537, 1988.
6. J.Cheriyan, S.Vempala and A.Vetta, Approximation algorithms for minimum-cost k-vertex connected subgraphs, Proc. 34th Ann. ACM STOC, pp. 306-312, May 2002.
7. Y. Dinitz, and Z. Nutov, A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs, Journal of Algorithms 32, 31-40, 1999.
8. A. Frank and E. Tardos, An application of submodular flows, Linear Algebra and its Applications, vol. 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, pp. 202-211, Austin, TX, 1993.
10. M. T. Hajiaghayi, N. Immorlica, V. S. Mirrokni, Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks, Proceedings of the 9th annual international conference on Mobile computing and networking, Pages: 300 - 312, 2003.
11. G.Kortsarz and Z. Nutov, Approximating node connectivity problems via set covers, Third International Workshop on Approximation Algorithms for Combinatorial Optimization, (APPROX 2000), Springer, LNCS 1913, 2000, pp. 194-205.
12. W. Mader, Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen, Arch. Math. 23 (1972), 219-224.
13. W. Mader: Degree and local connectivity in finite graphs. Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Academia, Prague (1975), 341-344.
14. W. Mader, On k-con-Critically n-Connected Graphs, Journal of Combinatorial Theory, Series B 86, 296-314 (2002).
15. A. Zehavi and A. Itai, Three Tree-Paths. J. of Graph Theory, vol. 13(2), 177-188, (1989).