Minimizing the joining delay for cooperation in mobile robot networks

Kyunghwi Kim, Heejun Roh, Wonjun Lee
{"title":"Minimizing the joining delay for cooperation in mobile robot networks","authors":"Kyunghwi Kim, Heejun Roh, Wonjun Lee","doi":"10.1109/ICUFN.2010.5547228","DOIUrl":null,"url":null,"abstract":"In this paper, we propose two joining delay minimization schemes (JDMS) and their hybrid version to minimize the delay that is caused by joining more robots to a cooperative working group of mobile-networked robots. The first scheme can operate without any feedback from the coordinator of the group, and therefore it utilizes a shorter time slot than does the second scheme. However, the second scheme can provide a stable slope of the joining delay, while the delay of the first scheme is rapidly increased when the number of the required robots approaches the number of the neighboring robots. We extensively analyze and evaluate these two schemes in terms of their joining delays, and then we derive the criteria for combining them for exploiting their opposite characteristics.","PeriodicalId":434322,"journal":{"name":"2010 Second International Conference on Ubiquitous and Future Networks (ICUFN)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Ubiquitous and Future Networks (ICUFN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUFN.2010.5547228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we propose two joining delay minimization schemes (JDMS) and their hybrid version to minimize the delay that is caused by joining more robots to a cooperative working group of mobile-networked robots. The first scheme can operate without any feedback from the coordinator of the group, and therefore it utilizes a shorter time slot than does the second scheme. However, the second scheme can provide a stable slope of the joining delay, while the delay of the first scheme is rapidly increased when the number of the required robots approaches the number of the neighboring robots. We extensively analyze and evaluate these two schemes in terms of their joining delays, and then we derive the criteria for combining them for exploiting their opposite characteristics.
移动机器人网络协作的最小加入延迟
在本文中,我们提出了两种加入延迟最小化方案(JDMS)及其混合版本,以最大限度地减少将更多机器人加入移动网络机器人合作工作组所造成的延迟。第一种方案可以在没有协调器反馈的情况下运行,因此比第二种方案占用的时间更短。然而,第二种方案可以提供稳定的连接延迟斜率,而当所需机器人数量接近相邻机器人数量时,第一种方案的延迟迅速增加。通过对这两种方案的连接延迟进行广泛的分析和评价,得出了利用它们的相反特性进行组合的准则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信