登录 注册 会员服务 联系我们

Optimal gathering protocols on paths under interference constraints

  • Published:2009-09 Issue:18 Volume:309 Page:5574-5587
  • ISSN:0012-365X
  • Container-title:Discrete Mathematics
  • language:en
  • Short-container-title:Discrete Mathematics

Author:

Bermond Jean-Claude,Corrêa Ricardo C.,Yu Minli

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference16 articles.

1. J.-C. Bermond, R. Corrêa, M. Yu, Gathering algorithms on paths under interference constraints, in: 6th Conference on Algorithms and Complexity, in: LNCS, vol. 3998, Roma, Italy, May 2006, pp. 115–126

2. Hardness and approximation of gathering in static radio networks;Bermond;Parallel Processing Letters,2006

3. Fast gossiping by short messages;Bermond;SIAM Journal on Computing,1998

4. Efficient gathering in radio grids with interference;Bermond,2005

5. Accès haut débit en zone rurale: Une solution “ad hoc”;Bertin;France Telecom R&D,2005

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

1. Round weighting problem and gathering in radio networks with symmetrical interference;Discrete Mathematics, Algorithms and Applications;2016-05-26

2. Data gathering and personalized broadcasting in radio grids with interference;Theoretical Computer Science;2015-01

3. Optimal time data gathering in wireless networks with multidirectional antennas;Theoretical Computer Science;2013-10

4. GATHERING RADIO MESSAGES IN THE PATH;Discrete Mathematics, Algorithms and Applications;2013-03

5. Optimal gathering in radio grids with interference;Theoretical Computer Science;2012-10
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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