.png){kind=icon}
返回
Maintaining a ring structure for mobile ad hoc computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2004.08.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In a mobile ad hoc (multi-hop) wireless network, the logical structure of a ring is likely to become volatile or expensive to maintain over time due to changeable network topology. Additional adverse effects take place when a process joins or leaves the computation in the presence of mobility. This paper presents a distributed algorithm that adapts a ring among mobile nodes to the network dynamics to reflect overall communication efficiency. This is achieved by modifying the ring structure in a localized, mutual exclusive fashion, thereby allowing for concurrent segment-wise modifications to proceed. Remarkably our proposal operates without global knowledge of the logical structure and can be embodied as an underlying protocol stratum that supports transparent deployments of conventional algorithms in mobile environment. Subsequent to correctness proof, simulation results show that our proposal is promising in several regards. (C) 2004 Elsevier Inc. All rights reserved.
Keyword:
mobile ad hoc wireless networks
distributed dining philosophers problem
logical ring
distributed mutual exclusion
Harary graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Overexpression of Ecm22 improves ergosterol biosynthesis inSaccharomyces cerevisiaeEcm22的过表达可改善 酿酒酵母 中麦角固醇的生物合成
PREAI
分享收藏ATP: An Aggregation and Transmission Protocol for Conserving Energy in Periodic Sensor Networks
PREAI
分享收藏 没有更多内容
没有更多内容