Power efficient range assignment in ad-hoc wireless networks

IEEE Wireless Communications and Networking Conference, WCNC

Volumn 3, Issue , 2003, Pages 1889-1894

  Althaus, E ^a   Celinescu G ^b   Mendoiu I I ^c   Prasad, S ^d   Tchervenski, N ^b   Zelikovsky, A ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Illinois Institute of Technology   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS NETWORKS; POWER EFFICIENT; RANGE ASSIGNMENT;

EID: 35248824443     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2003.1200675     Document Type: Conference Paper

References (21)

1. D. 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.
2. T. Chu and I. Nikolaidis, "Energy efficient broadcast in mobile ad hoc networks," in Proc. AD-HOC NetwOrks and Wireless, 2002.
3. A. 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. [Online]. Available: citeseer.nj.nec.com/442218.html
4. A. Clementi, P. Penna, and R. Silvestri, "On the power assignment problem in radio networks," Electronic Colloquium on Computational Complexity (ECCC), no. 054, 2000. [Online]. Available: citeseer.nj.nec.com/clementi00power.html
5. L. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, "Power consumption in packet radio networks," Theoretical Computer Science, vol. 243, pp. 289-305, 2000.
6. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, and S. Ravi, "Algorithmic aspects of topology control problems for ad hoc networks," in Proc. ACM MobiHoc, 2002, pp. 123-134.
7. R. Ramanathan and R. Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proc. IEEE INFOCOM, 2000, pp. 404-413. [Online]. Available: citeseer. nj.nec.com/ramanathan00topology.html
8. S. Singh, C. Raghavendra, and J. Stepanek, "Power-aware broadcasting in mobile ad hoc networks," in Proceedings of IEEE PIMRC, 1999.
9. 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.
10. J. Wieselthier, G. 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.
11. T. Rappaport, Wireless Communications: Principles and Practices. Prentice Hall, 1996.
12. A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. Verhoeven, "Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks," in Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), 2002.
13. A. Tanembaum, Computer Networks (3rd edition). Prentice Hall, 1996.
14. G. Calinescu, I. Mandoiu, and A. 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.
15. A. Zelikovsky, "Better approximation bounds for the network and Euclidean Steiner tree problems," Department of Computer Science, University of Virginia, Tech. Rep. CS-96-06, 1996.
16. -, "An 11/6-approximation algorithm for the network Steiner problem," Algorithmica, vol. 9, pp. 463-470, 1993.
17. 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.
18. M. Padberg and L. Wolsey, "Trees and cuts," Anals of Discrete Mathematics, vol. 17, pp. 511-517, 1983.
19. L. Lovász and M. Plummer, Matching theory. Amsterdam-New York: North-Holland, 1986.
20. U. Feige, "A treshold of ln n for approximating set cover," Journal of the ACM, vol. 45, pp. 634-652, 1998.
21. "SCIL-Symbolic Constraints for Integer Linear programming," www.mpi-sb.mpg.de/SCIL.