Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks

Wireless Networks

Volumn 12, Issue 3, 2006, Pages 287-299

  Althaus, E ^a,e   Calinescu G ^b   Mandoiu I I ^c   Prasad, S ^d,f,g   Tchervenski, N ^b   Zelikovsky, A ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Illinois Institute of Technology   (United States)

^c UNIVERSITY OF CONNECTICUT   (United States)

^d GEORGIA STATE UNIVERSITY   (United States)

^e LORIA   (France)

^f Mobile and Embedded Systems   (United States)

^g GSU Team   (United States)

Author keywords

Ad hoc wireless networks; Algorithms; Power range assignment; Symmetric connectivity

Indexed keywords

CONSTRAINT THEORY; ENERGY EFFICIENCY; GRAPH THEORY; PERFORMANCE; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

AD HOC WIRELESS NETWORKS; ASYMMETRIC CONNECTIVITY REQUIREMENTS; BIDIRECTIONAL LINKS; SYMMETRIC CONNECTIVITY;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33646753392     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-005-5275-x     Document Type: Article

References (32)

1. E. Althaus, G. Cǎlinescu, I.I. Mǎndoiu, S. Prasad, N. Tchervenski and A.Z. Zelikovsky, Power efficient range assignment in ad-hoc wireless networks, in: Proc. IEEE Wireless Communications and Networking Conference (WCNC) (2003) pp. 1889-1894.
2. P. Berman and V. Ramaiyer, Improved approximations tor the Steiner tree problem, Journal of Algorithms 17 (1994) 381-408.
3. D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), (Kluwer Academic Publishers, 2002) pp. 71-82.
4. A. Borchers and D.-Z. Du, The k-Steiner ratio in graphs, SIAM Journal on Computing 26 (1997) 857-869.
5. P.M. Camerini, G. Galbiati and F. Maffioli, Random pseudopolynomial algorithms for exact matroid problems, Journal of Algorithms 13 (1992) 258-273.
6. E.-A. Choukhmane, Une heuristique pour le probleme de l'arbre de Steiner, RAIRO Rech. Oper 12 (1978) 207-212.
7. T. Chu and I. Nikolaidis, Energy efficient broadcast in mobile ad hoc networks, in: Proc. AD-HOC Networks and Wireless (2002).
8. A.E.R Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Symposium on Theoretical Aspects of Computer Science, (2001) pp. 121-131.
9. 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.
10. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, Massachusetts, 2001).
11. G. Cǎlinescu, I.I. Mǎndoiu and A.Z. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), Kluwer Academic Publishers, 2002, pp. 119-130.
12. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf, Computational Geometry - Algorithms and Applications (Springer Verlag, Berlin, 1997).
13. D.-Z. Du, Y.-J. Zhang and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, in: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science (1991) pp. 431-439.
14. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 374-387.
15. A. B. Kahng and G. Robins, A new class of iterative Steiner tree heuristics with good performance, IEEE Transactions on Computer-Aided Design 11 (1992) 893-902.
16. L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243 (2000) 289-305.
17. L. Kou, G. Markowsky and L. Berman, A fast algorithm tor Steiner trees, Acta Informatica 15 (1981) 141-145.
18. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. ACM MobiHoc (2002) pp. 123-134.
19. L. Lovász and M.D. Plummer, Matching Theory. (North-Holland, Amsterdam-New York, 1986).
20. M. Padberg and L. Wolsey, Trees and cuts, Anals of Discrete Mathematics 17 (1983) 511-517.
21. H.J. Promel and A. Steger, A new approximation algorithm for the Steiner tree problem with performance ratio 5/3, Journal of Algorithms 36 (2000) 89-101.
22. R. Ramanathan and R. Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM (2000) pp. 404-413.
23. T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).
24. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms (2000) pp. 770-779.
25. SCIL-Symbolic Constraints for Integer Linear programming. www.mpi-sb.mpg.de/SCIL.
26. S. Singh, C.S. Raghavendra and J. Stepanek, Power-aware broadcasting in mobile ad hoc networks, in: Proceedings of IEEE PIMRC, 1999.
27. A.S. Tanembaum, Computer Networks, 3rd ed. (Prentice Hall, 1996).
28. Mikkel Thorup, Undirected single-source shortest paths with positive integer weights in linear time, Journal of the ACM 46 (1999) 362-394.
29. P.-J. Wan, G. Calinescu, X.-Y. Li and O. Frieder, Minimum energy broadcast routing in static ad hoc wireless networks, in: Proc. IEEE INFOCOM (2001) pp. 1162-1171.
30. 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) pp. 585-594.
31. A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993) 463-470.
32. A. Zelikovsky, Better approximation bounds for the network and Euclidean Steiner tree problems, Technical Report CS-96-06, Department of Computer Science, University of Virginia, 1996.