Topology control problems under symmetric and asymmetric power thresholds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2865, Issue , 2003, Pages 187-198

  Krumke, Sven O ^a   Liu, Rui ^b   Lloyd, Errol L ^b   Marathe, Madhav V ^c   Ramanathan, Ram ^d   Ravi, S S ^e  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b UNIVERSITY OF DELAWARE   (United States)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

^d BBN TECHNOLOGIES   (United States)

^e STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; MOBILE AD HOC NETWORKS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

BOUNDED DIAMETER; NODE DEGREE; NP-HARD; PERFORMANCE GUARANTEES; POWER THRESHOLDS; SPECIFIC PROPERTIES; TOPOLOGY CONTROL; TOTAL POWER;

WIRELESS AD HOC NETWORKS;

EID: 0142187753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39611-6_17     Document Type: Article

References (14)

1. 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.
2. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation Algorithms for Directed Steiner Problems", Journal of Algorithms, Vol. 33, No. 1, 1999, pp. 73-91.
3. W. Chen and N. Huang, "The Strongly Connecting Problem on Multihop Packet Radio Networks", IEEE Trans. Communication, Vol. 37, No. 3, Mar. 1989.
4. G. Calinescu, I. Mandoiu, and A. Zelikovsky. "Symmetric Connectivity with Minimum Power Consumption in Radio Networks", Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002.
5. A. E. F. Clementi, P. Penna and R. Silvestri. "Hardness Results for the Power Range Assignment Problem in Packet Radio Networks", Proc. Third International Workshop on Randomization and Approximation in Computer Science (APPROX 1999), Lecture Notes in Computer Science Vol. 1671, Springer-Verlag, July 1999, pp. 195-208.
6. G. Calinescu and P-J Wan. "Symmetric High Connectivity with Minimum Total Power Consumption in Multihop Packet Radio Networks", Submitted for journal publication, 2003.
7. S. Guha and S. Khuller, "Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets", Information and Computation, Vol. 150, 1999, pp. 57-74.
8. L. M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, "Power Consumption in Packet Radio Networks", Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS 97), Lecture Notes in Computer Science Vol. 1200, Springer-Verlag, Feb. 1997, pp. 363-374.
9. G. Kortsarz and D. Peleg, "Approximating the Weight of Shallow Light Trees", Discrete Applied Mathematics, Vol. 93, 1999, pp. 265-285.
10. (Preliminary version appeared in Proc. Eighth ACM-SIAM Symp. on Discrete Algorithms (SODA'97), New Orleans, LA, Jan. 1977, pp. 103-110.)
11. E. L. Lloyd, R. Liu, M. V. Marathe, R. Ramanathan and S. S. Ravi, "Algorithmic Aspects of Topology Control Problems for Ad hoc Networks", Proc. Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02), Laussane, Switzerland, June 2002.
12. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III, "Bicriteria Network Design Problems", Journal of Algorithms, Vol. 28, No. 1, July 1998, pp. 142-171.
13. R. Ramanathan, "On the Performance of Ad Hoc Networks with Beamforming Antennas", Proc. Second ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'01), Long Beach, CA, Oct. 2001.
14. R. Ramanathan and R. Rosales-Hain, "Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment", Proc. INFOCOM 2000.