Multi-hop routing within TDMA slots for teams of cooperating robots

Luis Oliveira, L. Almeida, P. Lima
{"title":"Multi-hop routing within TDMA slots for teams of cooperating robots","authors":"Luis Oliveira, L. Almeida, P. Lima","doi":"10.1109/WFCS.2015.7160566","DOIUrl":null,"url":null,"abstract":"Small teams of cooperating robots have been shown to benefit from the increased reliability of synchronised message exchanges provided by TDMA-based schemes. However, such schemes may also impose a long propagation delay to communications between non neighbour robots. Such negative impact is further increased by long TDMA rounds, which favour reduced medium utilisation and energy consumption, and by decentralised mesh topologies, which increase the team coverage and layout flexibility. For small size teams, say up to 10 units, it is feasible to set-up a global TDMA framework as well as tracking the instantaneous network topology, making it available to each robot. In this work we use this knowledge to forward packets along their path within each TDMA slot. To that end, we present a novel communication protocol that combines global TDMA and multi-hop routing. It maintains the reliability benefits of the TDMA schemes while strongly reducing the end-to-end propagation delay of interactions between non neighbour robots. We validate our protocol with simulation results using OMNET++. In a worst-case topology scenario we achieved an end-to-end delay that can be as low as 35% that of a traditional TDMA implementation that forwards the packets to the immediate one-hop neighbours, only. In a concrete audio streaming application scenario reported in the literature for an alternative real-time token-passing protocol, our proposal achieves similar delays with significantly less management bandwidth.","PeriodicalId":6531,"journal":{"name":"2015 IEEE World Conference on Factory Communication Systems (WFCS)","volume":"42 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE World Conference on Factory Communication Systems (WFCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS.2015.7160566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Small teams of cooperating robots have been shown to benefit from the increased reliability of synchronised message exchanges provided by TDMA-based schemes. However, such schemes may also impose a long propagation delay to communications between non neighbour robots. Such negative impact is further increased by long TDMA rounds, which favour reduced medium utilisation and energy consumption, and by decentralised mesh topologies, which increase the team coverage and layout flexibility. For small size teams, say up to 10 units, it is feasible to set-up a global TDMA framework as well as tracking the instantaneous network topology, making it available to each robot. In this work we use this knowledge to forward packets along their path within each TDMA slot. To that end, we present a novel communication protocol that combines global TDMA and multi-hop routing. It maintains the reliability benefits of the TDMA schemes while strongly reducing the end-to-end propagation delay of interactions between non neighbour robots. We validate our protocol with simulation results using OMNET++. In a worst-case topology scenario we achieved an end-to-end delay that can be as low as 35% that of a traditional TDMA implementation that forwards the packets to the immediate one-hop neighbours, only. In a concrete audio streaming application scenario reported in the literature for an alternative real-time token-passing protocol, our proposal achieves similar delays with significantly less management bandwidth.
协作机器人团队的TDMA槽内多跳路由
小型协作机器人团队已被证明受益于基于tdma的方案提供的同步消息交换可靠性的提高。然而,这种方案也可能对非相邻机器人之间的通信施加较长的传播延迟。长TDMA回合有利于降低介质利用率和能耗,分散的网状拓扑增加了团队覆盖范围和布局灵活性,从而进一步增加了这种负面影响。对于规模较小的团队,比如10个单位,建立一个全局TDMA框架以及跟踪瞬时网络拓扑是可行的,使每个机器人都可以使用它。在这项工作中,我们使用这些知识来沿着每个TDMA槽内的路径转发数据包。为此,我们提出了一种结合全局TDMA和多跳路由的新型通信协议。它既保持了TDMA方案的可靠性优势,又大大降低了非相邻机器人之间交互的端到端传播延迟。我们用omnet++的仿真结果验证了我们的协议。在最坏的拓扑情况下,我们实现了端到端延迟,它可以低至传统TDMA实现的35%,仅将数据包转发到直接的一跳邻居。在文献中报道的用于替代实时令牌传递协议的具体音频流应用场景中,我们的建议以更少的管理带宽实现了类似的延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信