.png){kind=icon}
返回
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
.png){kind=icon}
PRE
AI
DOI：10.1016/S0743-7315(02)00028-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algorithm based on homogeneous agents for constructing a random spanning tree. Our approach makes use of distributed random walks as a network traversal scheme, in order to handle dynamic topology changes in ad hoc wireless networks. Each random walk is represented by a mobile agent annexing a territory over the underlying network. These multiple random walks collapse into a final one that defines the random spanning tree. It will be shown that, compared to deterministically predetermined spanning trees, our algorithm is more resilient to transient failures that occur in ad hoc mobile networks. (C) 2003 Elsevier Science (USA). All rights reserved.
Keyword:
ad hoc wireless networks
mobile networks
mobile computing
mobile agents
distributed algorithms
random spanning tree
random walks
self-stabilizing algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Mechanism of intracellular allosteric β2AR antagonist revealed by X-ray crystal structure.png)
Nature
OAAI
NatureIF0
OAAI分享收藏
查看更多内容