Algorithmic aspects of topology control problems for ad hoc networks

Mobile Networks and Applications

Volumn 10, Issue 1, 2005, Pages 19-34

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

^a University of Delaware   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c BBN TECHNOLOGIES   (United States)

^d State University of New York   (United States)

Author keywords

Approximation algorithms; Power control; Topology

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POWER CONTROL; PROBLEM SOLVING; TOPOLOGY; TRANSCEIVERS;

AD HOC NETWORKS; APPROXIMATION ALGORITHM; EDGE CONNECTIVITIES; TOPOLOGY CONTROL;

TELECOMMUNICATION NETWORKS;

EID: 17444425744     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MONE.0000048543.95178.f5     Document Type: Article

References (33)

1. A. Agrawal, P. Klein and R. Ravi, When trees collide: An approximation algorithm for the generalized Steiner problem on networks, SIAM J. Computing 24(3) (1995) 440-456.
2. D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: Proc. of the 2nd IFIP Internat. Conf. on Theoretical Computer Science, Montreal (August 2002) pp. 71-82.
3. G. Calinescu, I. Mandoiu and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. of the 2nd IFIP Internat. Conf. on Theoretical Computer Science, Montreal (August 2002) pp. 119-130.
4. G. Calinescu and P.-J. Wan, Symmetric high connectivity with minimum total power consumption in multihop packet radio networks, in: Proc. of the Internat. Conf. on Ad Hoc and Wireless Networks (ADHOC-NOW'03), eds. S. Pierre, M. Barbeau and E. Kranakis, Montreal, Canada (October 2003) Lecture Notes in Computer Science, Vol. 2865 (Springer, New York, 2003) pp. 235-246.
5. W. Chen and N. Huang, The strongly connecting problem on multihop packet radio networks, IEEE Trans. Commun. 37(3) (1989) 293-295.
6. X. Cheng, B. Narahari, R. Simha, M. Cheng and D. Liu, Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics, IEEE Trans. Mobile Computing 2(3) (2003) 248-256.
7. A.E.F. Clementi, P. Penna and R. Silvestri, Hardness results for the power range assignment problem in packet radio networks, in: Proc. of the 3rd Internat. Workshop on Randomization and Approximation in Computer Science (APPROX 1999) (July 1999), Lecture Notes in Computer Science, Vol. 1671 (Springer, New York, 1999) pp. 195-208.
8. A.E.F. Clementi, P. Penna and R. Silvestri, The power range assignment problem in packet radio networks in the plane, in: Proc. of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000) (February 2000) pp. 651-660.
9. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, 2nd ed. (MIT Press/McGraw-Hill, Cambridge, MA, 2001).
10. G.A. Dirac, Minimally 2-connected graphs, J. Reine Angewandte Math. 228 (1967) 204-216.
11. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
12. M. Goemans and D.P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Computing 24(2) (1995) 296-317.
13. L. Hu, Topology control for multi-hop packet radio networks, IEEE Trans. Commun. 41(10) (1993) 1474-1481.
14. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. Algorithms 21 (1996) 434-450.
15. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, J. ACM 41 (1994) 214-235.
16. L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, in: Proc. of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS 97) (Feb ruary 1997) Lecture Notes in Computer Science, Vol. 1200 (Springer, New York, 1997) pp. 363-374.
17. S.O. Krumke, R. Liu, E.L. Lloyd, M.V. Marathe, R. Ramanathan and S.S. Ravi, Topology control problems under symmetric and asymmetric power thresholds, in: Proc. of the Internat. Conf. on Ad Hoc and Wireless Networks (ADHOC-NOW'03), eds. S. Pierre, M. Barbeau and E. Kranakis, Montreal, Canada (October 2003), Lecture Notes in Computer Science, Vol. 2865 (Springer, New York, 2000) pp. 187-198.
18. M. Kubisch, H. Karl, A. Wolisz, L. Zhong and J. Rabaey, Distributed algorithms for transmission power control in wireless sensor networks, in: Proc. of the IEEE Wireless Communications and Networking Conference (WCNC 2003), New Orleans, LA (March 2003) pp. 558-563.
19. L. Li and J.Y. Halpern, Minimum energy mobile wireless networks revisited, in: Proc. of the IEEE Conf. on Communications (ICC'01) (June 2001) pp. 278-283.
20. L. Li, J.Y. Halpern, P. Bahl, Y. Wang and R. Wattenhofer, Analysis of cone-based distributed topology control algorithm for wireless multihop networks, in: Proc. of the ACM Principles of Distributed Computing Conference (PODC'01) (August 2001) pp. 264-273.
21. M.D. Plummer, On minimal blocks, Trans. AMS 134 (October-December 1968) 85-94.
22. V. Radoplu and T.H. Meng, Minimum energy mobile wireless networks, IEEE J. Selected Areas Commun. 17(8) (1999) 1333-1344.
23. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. of the IEEE INFOCOM 2000, Tel Aviv, Israel (March 2000) pp. 404-113.
24. T.S. Rappaport, Wireless Communications: Principles and Practice (Prentice-Hall, Englewood Cliffs, NJ, 1996).
25. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proc. of the 11th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), San Francisco, CA (2000) pp. 770-779.
26. E.M. Royer, P. Melliar-Smith and L. Moser, An analysis of the optimum node density for ad hoc mobile networks, in: Proc. of the IEEE Internat. Conf. on Communication (ICC'01), Helsinki, Finland (June 2001) pp. 857-861.
27. E.M. Royer and C. Perkins, Transmission range effects on AODV multicast communication, ACM Mobile Networks Appl. (Special Issue on Multipoint Communication in Wireless Networks) 7(6) (2002) 455-470.
28. H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Trans. Commun. 32(3) (1984) 246-257; also see in: Multiple Access Communications, Foundations for Emerging Technologies, ed. N. Abramson (IEEE Press, New York, 1992) pp. 342-353.
29. H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Trans. Commun. 32(3) (1984) 246-257; also see in: Multiple Access Communications, Foundations for Emerging Technologies, ed. N. Abramson (IEEE Press, New York, 1992) pp. 342-353.
30. TRANSIMS, http://transims.tsasa.lan1.gov/.
31. J. van Leeuwen, Graph algorithms, in: Handbook of Theoretical Computer Science, Vol. A, ed. J. van Leeuwen (MIT Press/Elsevier, Cambridge, MA, 1990) chapter 10.
32. R. Wattenhofer, L. Li, P. Bahl and Y. Wang, Distributed topology control for power efficient operation in multihop wireless ad hoc networks, in: Proc. of the IEEE INFOCOM 2001, Anchorage, Alaska (April 2001) pp. 1388-1397.
33. D.B. West, Introduction to Graph Theory (Prentice-Hall, Englewood Cliffs, NJ, 1996).