Assign ranges in general ad-hoc networks

Journal of Parallel and Distributed Computing

Volumn 66, Issue 4, 2006, Pages 489-498

  Chlebíková, Janka ^a   Ye, Deshi ^b   Zhang, Hu ^c,d  

^a Physics and Informatics   (Slovakia)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c MCMASTER UNIVERSITY   (Canada)

^d MCMASTER UNIVERSITY   (Canada)

Author keywords

Ad hoc wireless networks; Algorithms; Energy conservation; Range assignment problem

Indexed keywords

AD-HOC WIRELESS NETWORKS; RANGE ASSIGNMENT PROBLEM;

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

COMPUTER NETWORKS;

EID: 33644979263     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.10.010     Document Type: Article

References (35)

1. C. Ambühl, A.E.F. Clementi, M. Di Ianni, A. Monti, G. Rossi, R. Silvestri, The range assignment problem in non-homogeneous static ad-hoc networks, in: Proceedings of the Fourth International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN 2004.
2. C. Ambühl, A.E.F. Clementi, M. Di Ianni, N. Lev-Tov, A. Monti, D. Peleg, G. Rossi, R. Silvestri, Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks, in: Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, pp. 418-427.
3. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, in: Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1996, pp. 184-193.
4. Y. Bartal, On approximating arbitrary metrics by tree metrics, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC 1998.
5. E.M. Belding-Royer, C.-K. Toh, A review of current routing protocols for ad-hoc mobile wireless networks, IEEE Personal Commun. Magazine (1999) 46-55.
6. G. Calinescu, S. Kapoor, A. Olshevsky, A. Zelikovsky, Network lifetime and power assignment in ad hoc wireless networks, in: Proceedings of the 11th Annual European Symposium, ESA 2003, pp. 114-126.
7. G. Calinescu, S. Kapoor, M. Sarwat, Bounded hops power assignment in ad-hoc wireless networks, in: Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC 2004.
8. I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem Inform. Process. Lett. 86 3 2003 149 154
9. M. Charikar, C. Chekuri, A. Goel, S. Guha, S. Plotkin, Approximating a finite metric by a small number of tree metrics, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 379-388.
10. I. Chlamtac, M. Conti, and J.J.-N. Liu Mobile ad hoc networking: imperatives and challenges Ad Hoc Networks 1 2003 13 64
11. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraph, in: Proceedings of the 18th Annual Symposium on Theoretical Aspect of Computer Science, STACS 2001, Lecture Notes in Computer Science, vol. 2010, pp. 121-131.
12. A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri The minimum range assignment problem on linear radio networks Algorithmica 35 2 2003 95 110
13. A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, Y.C. Verhoeven, Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks, ARACNE 2002, pp. 23-38.
14. A.E.F. Clementi, M. Di Ianni, and R. Silvestri The minimum broadcast range assignment problem on linear multi-hop wireless networks Theoret. Comput. Sci. 1-3 299 2003 751 761
15. A.E.F. Clementi, P. Penna, R. Silvestri, On the power assignment problem in radio networks, Technical Report TR00-054, Electronic Colloquium on Computational Complexity(ECCC), 2000.
16. K. Dhamdhere, A. Gupta, R. Ravi, Approximation algorithms for minimizing average distortion, in: Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, Lecture Notes in Computer Science, vol. 2996, pp. 234-245.
17. J. Fakcharoenphol, S. Rao, K. Talwar, A tight bound on approximating arbitrary metrics by tree metrics, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 448-455.
18. M. Garey, and D. Johnson Computer and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company NY
19. N. Garg, J. Könemann, Fast and simpler algorithms for multicommodity flow and other fractional packing problems, in: Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, pp. 300-309.
20. M.D. Grigoriadis, and L.G. Khachiyan Coordination complexity of parallel price-directive decomposition Math. Oper. Res. 2 1996 321 340
21. A. Gupta, Steiner points in tree metrics don't (really) help, in: Proceedings of the 12th ACM/SIAM Annual Symposium on Discrete Algorithms, SODA 2001, pp. 220-227.
22. K. Jansen, H. Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, in: Proceedings of Second IFIP International Conference on Theoretical Computer Science, TCS 2002.
23. L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc Power consumption in packet radio networks Theoret. Comput. Sci. 243 2000 289 305
24. G.S. Lauer Packet Radio Routing 1995 Prentice-Hall Englewood Cliffs, NJ (Chapter 11)
25. Q. Lu, H. Zhang, Implementation of approximation algorithms for the multicast congestion problem, in: Proceedings of the Fourth International Workshop on Efficient and Experimental Algorithms, WEA 2005, Lecture Notes in Computer Science, vol. 3503, pp. 152-164.
26. J. Matoušek Bi-lipschitz embeddings into low dimensional Euclidean spaces Comment. Math. Univ. Carolinae 31 3 1990 589 600
27. C.E. Perkins, P. Bhagwat, Highly dynamic destination-sequence distance-vector routing (DSDV) for mobile computers, Comput. Commun. Rev. (October 1994) 234-244.
28. S.A. Plotkin, D.B. Shmoys, and E. Tardos Fast approximation algorithms for fractional packing and covering problems Math. Oper. Res. 2 1995 257 301
29. Y. Rabinovich, and R. Raz Lower bounds on the distortion of embedding finite metric spaces in graphs GEOMETRY: Discrete Comput. Geometry 19 1998
30. S. Rao, A.W. Richa, New approximation techniques for some ordering problems, in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, pp. 211-218.
31. G. Rossi, The range assignment problem in static ad-hoc wireless networks, Ph.D. Thesis, 2003.
32. J. Villavicencio, M.D. Grigoriadis, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, in: P. Pardalos, D.W. Hearn, W.W. Hager (Eds.), Network Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 450, Springer, Berlin, 1997, 471-485.
33. D. Ye, H. Zhang, The range assignment problem in static ad-hoc networks on metric spaces, in: Proceedings of the 11th Colloquium on Structural Information and Communication Complexity, Sirocco 2004, Lecture Notes in Computer Science, vol. 3104, pp. 291-302.
34. N.E. Young, Randomized rounding without solving the linear program, in: Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 170-178.
35. H. Zhang, Packing: scheduling, embedding and approximating metrics, in: Proceedings of the 2004 International Conference on Computational Science and its Applications, ICCSA 2004, Lecture Notes in Computer Science, vol. 3045, pp. 764-775.