Asymmetric topology control: Exact solutions and fast approximations

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 783-791

  Calinescu, G ^a   Qiao, K ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS NETWORKS; EXACT ALGORITHMS; EXACT SOLUTION; EXPERIMENTAL STUDIES; FAST APPROXIMATION; GREEDY APPROXIMATION ALGORITHMS; INTEGER LINEAR PROGRAMS; MINIMUM SPANNING TREES; NETWORK CONNECTIVITY; POWER ASSIGNMENT; RUNNING TIME; TOPOLOGY CONTROL; TRANSMISSION POWER; UNIDIRECTIONAL LINKS;

COMMUNICATION SYSTEMS; INTEGER PROGRAMMING;

APPROXIMATION ALGORITHMS;

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

References (20)

1. E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N.Tchervenski, and A. Zelikovsky. Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Networks, 12(3):287-299, 2006.
2. D.M. Blough, M. Leoncini, G. Resta, and P. Santi. On the symmetric range assignment problem in wireless ad hoc networks. In Proc. IFIP TCS 2002, pages 71-82. Kluwer Academic Publishers.
3. Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, and Laura Sanità. An improved LP-based approximation for Steiner tree. In Proc. STOC 2010, pages 583-592. ACM.
4. G. Calinescu. Min-power strong connectivity. In Proc. APPROX 2010 LNCS number 6302, pages 67-80. Springer.
5. Tiago Camilo, Jorge Sá Silva, André Rodrigues, and Fernando Boavida. Gensen: A topology generator for real wireless sensor networks deployment. In Proc. SEUS 2007, pages 436-445.
6. W.T. Chen and N.F. Huang. The strongly connecting problem on multihop packet radio networks. IEEE Transactions on Communi- cations, 37(3):293-295, 1989.
7. V. Chvatal. A greedy heuristic for the set covering problem. Mathematics of Operation Research, 4:233-235, 1979.
8. A.E.F. Clementi, P. Penna, and R. Silvestri. On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (ECCC), (054), 2000.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2. edition, 2001.
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry (second edition). Springer-Verlag, 2000.
11. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984. (Pubitemid 15493878)
12. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243:289-305, 2000.
13. Tobias Polzin and Siavash Vahdati Daneshmand. On steiner trees and minimum spanning trees in hypergraphs. Oper. Res. Lett., 31(1):12-20, 2003.
14. Ram Ramanathan and Regina Hain. Topology control of multihop wireless networks using transmit power adjustment. In Proc. IEEE INFOCOM 2010, pages 404-413.
15. T.S. Rappaport. Wireless Communications: Principles and Practices. Prentice Hall, 1996.
16. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM Journal on Computing, 17(6):1253-1262, 1988.
17. A. Schrijver. Combinatorial Optimization. Springer, 2003.
18. S. Singh, C.S. Raghavendra, and J. Stepanek. Power-aware broadcasting in mobile ad hoc networks. In Proceedings of IEEE PIMRC, 1999.
19. R.E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983.
20. J.E. Wieselthier, G.D. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proc. IEEE INFOCOM 2000, pages 585-594.