Improved approximation results for the minimum energy broadcasting problem

Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04

Volumn , Issue , 2004, Pages 85-91

  Flammini, Michele ^a   Navarra, Alfredo ^a   Klasing, Ralf ^b   Pérennes, Stéphane ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

Ad Hoc Networks; Broadcasting; Energy Conservation

Indexed keywords

APPROXIMATION THEORY; BROADCASTING; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; HEURISTIC METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING;

AD HOC NETWORKS; ENERGY BROADCASTING PROBLEMS; ENERGY SAVING; TRANSMISSION POWER;

ROUTERS;

EID: 14844323168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1022630.1022644     Document Type: Conference Paper

References (16)

1. CALINESCU, G., KAPOOR, S., OLSHEVSKY, A., AND ZELIKOVSKY, A. Network liftime and power assignment in ad-hoc wireless networks. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA) (2003), pp. 114-126.
2. CALINESCU, G., MANDOIU, I., AND ZELIKOVSKY, A. Symmetric connectivity with minimum power consumption in radio networls. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (2002), pp. 119-130.
3. CLEMENTI, A., CRESCENZI, P., PENNA, P., ROSSI, G., AND VOCCA, P. On the complexity of computing minimum energy consumption broadcast subgraph. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (2001), vol. 2010 of Lecture Notes in Computer Science, Springer-Verlag, pp. 121-131.
4. CLEMENTI, A., HUIBAN, G., PENNA, P., ROSSI, G., AND VERHOEVEN, Y. C. On the approximation ratio of the mst-based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks. In Proceedings of the 3rd IEEE IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN) (2003).
5. CONWAY, J. H., AND SLOANE, N. J. A. "The Kissing Number Problem" and "Bounds on Kissing Numbers". Ch. 2.1 and Ch. 13 in: Sphere Packings, Lattices, and Groups. Springer-Verlag, New York, 3rd edition, 1998.
6. DOSHI, S., BHANDARE, S., AND BROWN, T. X. An on-demand minimum energy routing protocol for a wireless ad hoc network. SIGMOBILE Mobile Computing and Communication Review 6, 3 (2002), 50-66.
7. EDMONDS, J. Optimal branchings. Journal of Research of the National Bureau of Standards B71 (1967), 233-240.
8. FRIEZE, A. M., AND MCDIARMID, C. J. H. On random minimum length spanning trees. Combinatorica 9 (1989), 363-374.
9. KIROUSIS, L., KRANAKIS, E., KRIZANC, D., AND PELC, A. Power consumption in packet radio networks. Theoretical Computer Science 243, 1-2 (2000), 289-305.
10. KLASING, R., NAVARRA, A., PAPADOPOULOS, A., AND PERENNES, S. Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem. In Proc. of the 3rd IFIP-TC6 Int. Networking Conf. (2004), vol. 3042 of Lecture Notes in Computer Science, Springer Verlag, pp. 866-877.
11. Li, X., AND WAN, P. Constructing minimum energy mobile wireless networks. SIGMOBILE Mobile Computing and Communication Review 5, 4 (2001), 55-67.
12. LIANG, W. Constructing minimum-energy broadcast trees in wireless ad hoc networks. In Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking and computing (MOBIHOC) (2002), ACM Press, pp. 112-122.
13. RAPPAPORT, T. Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs, NY, 1996.
14. Rossi, G. The Range Assignment Problem in Static Ad-Hoc Wireless Networks. PhD thesis, Universitá degli Studi di Siena, 2002.
15. WAN, P. J., CALINESCU, G., LI, X., AND FRIEDER, O. Minimum energy broadcast routing in static ad hoc wireless networks. Wireless Networks 8, 6 (2002), 607-617.
16. WIESELTHIER, J. E., NGUYEN, G. D., AND EPHREMIDES, A. On the construction of energy-efficient broadcast and multicast trees in wireless networks, In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2000), IEEE Computer Society, pp. 585-594.