| ROS Resources: Documentation | Support | Discussion Forum | Index | Service Status | ros @ Robotics Stack Exchange |
I want to check whether data send by the publisher is the same as received by the subscriber. So is this check already done by the ROS or i have to use CRC , checksum like methods within the messages to ensure that data is correct .
If your publisher and subscriber are using TCPROS as the transport, then I'd say payload integrity is taken care of by the checksumming and retransmits inherent to TCP itself.
As to UDPROS, it uses UDP (..), which does have checksumming, but no reliability mechanisms (retransmitting corrupted datagrams fi). The checksum is also optional.
For any other transports (rosserial comes to mind), you'll have to investigate the included recovery mechanisms yourself (for rosserial, see rosserial/Overview/Protocol - Packet Format, which indicates there is a checksum included).
Thanks.I have to send the messages from raspberrypi to arduino through rosserial . How to access the checksum value from the packet. According to the link u have given above,does size of a packet of N byte message data is N+8 bytes
I don't know the details, but according to the screenshots in ROS Arduino message type restrictions? fi, rosserial already checks for corruptions. I think it then drops those packets.
In addition to what @gvdhoorn already stated I'd like to mention that if using TCPROS you can safely assume that messages received are transmitted correctly, unique (meaning for a single publish() the subscriber callback won't be called twice) and that for a single publisher/single subscriber connection you can safely assume that you will receive them in the same order as published; its stated here: http://answers.ros.org/question/46713... ....; Note that message loss (due to limited bandwidth or long running subscriber callbacks) is still possible.
Asked: 2014-12-15 23:39:23 -0500
Seen: 407 times
Last updated: Dec 16 '14
ROS Answers is licensed under Creative Commons Attribution 3.0 Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
