Efficient algorithms for low-energy bounded-hop broadcast in Ad-Hoc wireless networks

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

Volumn 2996, Issue , 2004, Pages 418-427

  Ambühl, Christoph ^a   Clementi, Andrea E F ^b   Di Ianni, Miriam ^b   Lev Tov, Nissan ^c   Monti, Angelo ^d   Peleg, David ^c   Rossi, Gianluca ^b   Silvestri, Riccardo ^d  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; COMPLEX NETWORKS; COSTS; DYNAMIC PROGRAMMING; LOW POWER ELECTRONICS; POLYNOMIAL APPROXIMATION; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; BROADCAST OPERATIONS; GENERAL VERSION; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS; POSITIVE CONSTANT; RANGE ASSIGNMENT; TRANSMISSION COSTS;

WIRELESS AD HOC NETWORKS;

EID: 35048898779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_37     Document Type: Article

References (16)

1. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the Time Complexity of Broadcast Operations in Multi-Hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. of Computer and Systems Science, 45:104-126, 1992.
2. R. Bar-Yehuda, A. Israeli, and A. Itai. Multiple Communication in Multi-Hop Radio Networks. SIAM J. on Computing, 22:875-887, 1993.
3. G. Cǎlinescu, X.Y. Li, O. Frieder, and P.J. Wan. Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In Proc. 20th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), 1162-1171, 2001.
4. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. In Proc. 3th Workshop on Wireles, Mobile and Ad-Hoc Networks (WMAN-IPDPS), 2003.
5. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In Proc. 18th Symp. on Theoretical Aspects of Computer Science (STAGS), 121-131, 2001.
6. A.E.F. 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. In Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), 23-38, 2002.
7. A.E.F. Clementi, M. Di Ianni, and R. Silvestri. The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks. Theoretical Computer Science, 299:751-761, 2003.
8. A.E.F. Clementi, P. Penna, and R. Silvestri. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In Proc. End Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 197-208, 1999.
9. A. Ephremides, G.D. Nguyen, and J.E. Wieselthier. On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In Proc. 19th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), 585-594, 2000.
10. S. Guha and S. Khuller. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, 150:57-74, 1999.
11. Z. Haas and S. Tabrizi. On Some Challenges and Design Choices in Ad-Hoc Communications. In Proc. IEEE Military Communication Conf. (MILCOM), 1998.
12. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science, 243:289-305, 2000.
13. G.S. Lauer. Packet radio routing, Chapt. 11 of Routing in communication networks, M. Streenstrup (ed.), 351-396. Prentice-Hall, 1995.
14. K. Pahlavan and A. Levesque. Wireless information networks. Wiley-Interscience, 1995.
15. R. Raz and S. Safra. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In Proc. 29th ACM Symp. on Theory of Computing (STOC), 475-484, 1997.
16. M. Sharir and P.K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge-New York-Melbourne, 1995.