An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks

Author:

Ambühl Christoph

Publisher

Springer Berlin Heidelberg

Reference22 articles.

1. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time Complexity of Broadcast Operations in Multi-Hop Radio Networks: An Exponential Gap Between Determinism and Randomization. Journal of Computer and Systems Science 45, 104–126 (1992)

2. Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple Communication in Multi-Hop Radio Networks. SIAM Journal on Computing 22, 875–887 (1993)

3. Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome “Tor Vergata”, Math Department (2001)

4. Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 121–131 (2001)

5. Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In: Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23–38 (2002)

Cited by 43 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem;SIAM Journal on Discrete Mathematics;2024-02-09

2. Awake Complexity of Distributed Minimum Spanning Tree;Lecture Notes in Computer Science;2024

3. The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks;Structural Information and Communication Complexity;2023

4. The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms;Algorithmica;2019-04-05

5. A Role of Minimum Spanning Tree;Nonlinear Combinatorial Optimization;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3