Range assignment for high connectivity in wireless ad hoc networks

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

Volumn 2865, Issue , 2003, Pages 235-246

  Calinescu, Gruia ^a   Wan, Peng Jun ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; DIRECTED GRAPHS; MOBILE AD HOC NETWORKS; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS AD HOC NETWORKS;

APPROXIMATION RATIOS; BI-DIRECTIONAL LINKS; CONSTANT APPROXIMATION ALGORITHMS; DISTRIBUTED IMPLEMENTATION; EDGE CONNECTIVITY; HIGH CONNECTIVITY; NODE CONNECTIVITY; UNIDIRECTIONAL LINKS;

APPROXIMATION ALGORITHMS;

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

References (28)

1. E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski, and A. Zelikovsky, Power Efficient Range Assignment in Ad-hoc Wireless Networks, Proc. IEEE Wireless Communications and Networking Conference, 2003.
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. T. Calamoneri, and R. Petreschi, An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs, COCOON'95, Lectures Notes in Computer Science 959, Springer-Verlag, pages 31-40, 1995.
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. W.T. Chen and N.F. Huang, The Strongly Connecting Problem on Multihop Packet Radio Networks, IEEE Transactions on Communications, vol. 37, no. 3, pp. 293-295, Oct. 1989.
6. A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs, 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010, 2001, pages 121-131.
7. A. Clementi, P. Penna and R. Silvestri, Hardness Results for The Power Range Assignment Problem in Packet Radio Networks, Proc. 3rd International Workshop Randomization, Approximation and Combinatorial Optimization, Lecture Notes in Computer Science 1671, pp. 197-208, 1999.
8. A. Clementi, P. Penna and R. Silvestri, The Power Range Assignment Problem in Radio Networks on the Plane, Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1770, pp. 651-660, 2000.
9. A. Clementi, G. Huiban, P. Penna, G. Rossi and Y.C. Verhoeven, Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks, 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, 2002.
10. R. Diestel, Graph Theory, 2nd Edition, Graduate Texts in Mathematics, Volume 173, Springer-Verlag, New York, February 2000.
11. J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, R. Rustin, Ed., pp. 91-96. Algorithmics Press, New York, 1972.
12. J. Edmonds, Matroid intersection, Annals of Discrete Mathematics, No. 4, pp. 185-204, 1979.
13. A. Frank and E. Tardos, An application of submodular flows, Linear Algebra and its Applications, vol. 114/115, pp. 329-348, 1989.
14. H. N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, Proc. 23rd ACM Symposium on Theory of Computing, pp. 112-122, May 1991.
15. 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.
16. M.R. Garey, D.S. Johnson and R.E. Tarjan, The Planar Hamiltonian Circuit Problem is NP-complete, SIAM J. Comput., vol. 5, pp. 704-714, 1976.
17. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms 21, pp. 433-450, 1996.
18. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM, vol. 41, no. 2, pp. 214-235, 1994.
19. L. M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power Consumption in Packet Radio Networks, Theoretical Computer Science, vol. 243, no. 1-2, pp. 289-305, 2000.
20. A preliminary version of this papers also appeared in Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1200, pp. 363 - 374, 1997.
21. E. L. Lawler, Matroid intersection algorithms, Mathematical Programming 9, pp. 31-56, 1975.
22. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, and S.S. Ravi, Algorithmic Aspects of Topology Control Problems for Ad hoc Networks, Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Lausanne, Switzerland, June 2002.
23. T.S. Rappaport, Wireless Communications: Principles and Practices, Prentice Hall, 1996.
24. R. Ramanathan and R. Rosales-Hain, Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment, IEEE INFOCOM 2000.
25. J.H. van Lint, R.M. Wilson, A course in combinatorics, Cambridge University Press, 1992.
26. P-J. Wan, G. Calinescu, X-Y. Li, and O. Frieder, Minimum Energy Broadcast Routing in Static Ad Hoc Wireless Networks, IEEE INFOCOM 2001.
27. R.W. Whitty, Vertex-disjoint paths and edge-disjoint branchings in directed graphs, J. Graph Theory, 11(3):349-358, 1987.
28. J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. IEEE INFOCOM 2000.