.png){kind=icon}
返回
Constructing special k-dominating sets using variations on the greedy algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.pmcj.2008.09.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper focuses on the efficient selection of a special type of subset of network nodes, which we call a k-SPR set, for the purpose of coordinating the routing of messages through a network. Such a set is a special k-hop-connected k-dominating set that has an additional property that promotes the regular occurrence of routers in all directions. The distributed algorithms introduced here for obtaining a k-SPR set require that each node broadcast at most three messages to its k-hop neighbors. These transmissions can be made asynchronously. The time required to send these messages and the sizes of the resulting sets are compared by means of data collected from simulations. The main contribution is the adaptation of some variations of the distributed greedy algorithms to the problem of generating a small k-SPR set. These variations are much faster than the standard distributed greedy algorithm. Yet, when used with a sensible choice for a certain parameter, our empirical evidence strongly suggests that the resulting set size will generally be very close to the set size for the standard greedy algorithms. (C) 2008 Elsevier B. V. All rights reserved.
Keyword:
Distributed greedy algorithm
Ad hoc network
Routing
Dominating set
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
1.5K
被引数:
2.2K
机构
引用论文
Prognostic significance of non-urothelial carcinoma of bladder: analysis of nationwide hospital-based cancer registry data in Japan膀胱非尿路上皮癌的预后意义：基于日本全国医院癌症登记数据的分析
OAAI
OAAI分享收藏VLSI implementation of greedy-based distributed routing schemes for ad hoc networks.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Trends in management of ureteral urothelial carcinoma and effects on survival: a hospital-based registry study尿路上皮癌的管理趋势及其对生存的影响：一项基于医院的登记研究
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容