Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Multi-hop routing within TDMA slots for teams of cooperating robots
Publication

Publications

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

Title
Multi-hop routing within TDMA slots for teams of cooperating robots
Type
Article in International Conference Proceedings Book
Year
2015
Authors
Oliveira, L
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Lima, P
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 1-8
2015 11th IEEE World Conference on Factory Communication Systems, WFCS 2015
27 May 2015 through 29 May 2015
Indexing
Other information
Authenticus ID: P-00G-NZJ
Abstract (EN): 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.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 8
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-06 at 11:41:06 | Privacy Policy | Personal Data Protection Policy | Whistleblowing