Power optimization for connectivity problems

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 349-361

  Hajiaghayi, Mohammad T ^a   Kortsarz, Guy ^b   Mirrokni, Vahab S ^a   Nutov, Zeev ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COSTS; GRAPH THEORY; INTEGER PROGRAMMING; MOTIVATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

CONNECTED SPANNING SUBGRAPH (CSS) PROBLEM; CONNECTIVITY PROBLEMS; MULTI-HOP NETWORKS; POWER OPTIMIZATION;

PROBLEM SOLVING;

EID: 24944538657     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_26     Document Type: Conference Paper

References (25)

1. E. ALTHAUS, G. CALINESCU, I. MANDOIU, S. PRASAD, N. TCHERVENSKI, AND A. ZELIKOVSKY, Power efficient range assignment in ad-hoc wireless networks, in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), 2003, pp. 1889-1894.
2. M. BAHRAMGIRI, M. HAJIAGHAYI, AND V. MIRROKNI, Fault-tolerant and 3-dimensional distributed topology control algorithms wireless multi-hop networks, in Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (ICCCN), IEEE Press, 2002, pp. 392-398.
3. D. M. BLOUGH, M. LEONCINI, G. RESTA, AND P. SANTI, On the symmetric range assignment problem in wireless ad hoc networks, in TCS '02: Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, Kluwer, B.V., 2002, pp. 71-82.
4. G. CALINESCU, I. I. MANDOIU, AND A. ZELIKOVSKY, Symmetric connectivity with minimum power consumption in radio networks, in TCS '02: Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, Kluwer, B.V., 2002, pp. 119-130.
5. G. CALINESCU AND P.-J. WAN, Range assignment for high connectivity in wireless ad hoc network, in Adhoc-Now, 2003, pp. 235-246.
6. J. CHERIYAN AND R. THURIMELLA, Fast algorithms for k-shredders and k-node connectivity augmentation, J. Algorithms, 33 (1999), pp. 15-50.
7. J. CHERIYAN, S. VEMPALA, AND A. VETTA, An approximation algorithm for the minimum-cost k-vertex connected subgraph, SIAM J. Comput., 32 (2003), pp. 1050-1055 (electronic).
8. A. CLEMENTI, G. HUIBAN, P. PENNA, G. ROSSI, AND Y. VERHOEVEN, Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks, 2002, pp. 23-38.
9. A. E. F. CLEMENTI, P. PENNA, AND R. SILVESTRI, Hardness results for the power range assignmet problem in packet radio networks, in RANDOM-APPROX '99: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Springer-Verlag, 1999, pp. 197-208.
10. A. FRANK AND É. TARDOS, An application of submodular flows, Linear Algebra Appl., 114/115 (1989), pp. 329-348.
11. M. HAJIAGHAYI, N. IMMORLICA, AND V. S. MIRROKNI, Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks, in Mobi-Com '03: Proceedings of the 9th annual international conference on Mobile computing and networking, ACM Press, 2003, pp. 300-312.
12. S. KHULLER AND B. RAGHAVACHARI, Improved approximation algorithms for uniform connectivity problems, J. Algorithms, 21 (1996), pp. 434-450.
13. S. KHULLER AND U. VISHKIN, Biconnectivity approximations and graph carvings, J. Assoc. Comput. Mach., 41 (1994), pp. 214-235.
14. L. M. KIROUSIS, E. KRANAKIS, D. KRIZANC, AND A. PELC, Power consumption in packet radio networks, Theoret. Comput. Sci., 243 (2000), pp. 289-305.
15. G. KORTSARZ, On the hardness of approximating spanners, Algorithmica, 30 (2001), pp. 432-450.
16. G. KORTSARZ AND Z. NUTOV, Approximating node connectivity problems via set covers, Algorithmica, 37 (2003), pp. 75-92.
17. G. KORTSARZ AND Z. NUTOV, Approximation algorithm for k-node connected subgraphs via critical graphs, in STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, ACM Press, 2004, pp. 138-145.
18. L. LI, J. Y. HALPERN, P. BAHL, Y.-M. WANG, AND R. WATTENHOFER, Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks, in PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, ACM Press, 2001, pp. 264-273.
19. E. L. LLOYD, R. LIU, M. V. MARATHE, R. RAMANATHAN, AND S. S. RAVI, Algorithmic aspects of topology control problems for ad hoc networks, Mob. Netw. Appl., 10 (2005), pp. 19-34.
20. W. MADER, Ecken vom grad n in minimalen n-fach zusammenhangenden Graphen, Arch. Math. (Basel), 23 (1972), pp. 219-224.
21. J. B. ORLIN, A faster strongly polynomial minimum cost flow algorithm, Oper. Res., 41 (1993), pp. 338-350.
22. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
23. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803 (electronic).
24. V. RODOPLU AND T. H. MENG, Minimum energy mobile wireless networks, IEEE J. Selected Areas in Communications, 17 (1999), pp. 1333-1344.
25. R. WATTENHOFER, L. LI, V. BAHL, AND Y. WANG, Distributed topology control for power efficient operation in multihop wireless ad hoc networks, in Proceedings of twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), IEEE Press, 2001, pp. 1388-1397.