.png){kind=icon}
返回
Distributed algorithms for connected domination in wireless networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2007.04.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present fast distributed local control connected dominating set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CDSTop which take into account the effect of wireless interference and the consequent loss of messages during the execution of the algorithm. These algorithms produce a CDS of constant size and constant stretch ratio with high probability, and converge in polylogarithmic running time. Specifically, algorithm CDSColor requires the nodes to know (estimates of) the maximum degree A and the size of the network n and converges in O (Delta log(2) n) time. Algorithm CDSTop requires the nodes to know their three-hop topology and (an estimate of) the network size n and converges in O (log(2) n) time. To the best of our knowledge, these are the first distributed interference-aware CDS algorithms for wireless ad hoc networks which break the linear running-time barrier. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
wireless networks
interference
connected dominating set
distributed algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Dissociable effects of anterior and mediodorsal thalamic lesions on spatial goal-directed behavior
PREAI
分享收藏分享收藏分享收藏
查看更多内容