Home /Research /A Packet Loss Tolerant Rendezvous Algorithm for Wireless Networked Robot Systems
OTHER

A Packet Loss Tolerant Rendezvous Algorithm for Wireless Networked Robot Systems

Sabato Manfredi, Enrico Natalizio, Claudio Pascariello, Nicola Roberto Zema

Year
2017
Citations
12

Abstract

Abstract This paper studies the coordination problem for a wireless networked robot (WNR) system. The objective is to drive the robots to keep a desired formation through local exchange of information. Nevertheless, packet losses may occur during communications among robots, thus preventing the system to reach its specific target. Specifically, the effects of an unreliable channel on the WNR performance are analyzed by considering the simulation of a corrective consensus algorithm into a network simulator. The use of a packet‐loss‐tolerant protocol is suggested to cope with heavy communication disruption. Network Simulator (NS‐3) simulation results validate the effectiveness of the proposed approach.

Keywords

RendezvousComputer scienceNetwork packetRobotPacket lossComputer networkWirelessWireless ad hoc networkDistributed computingReal-time computing

Related papers

Browse all OTHER papers