Abstract: A communication method between a master and a device, the master transmits in a subcycle a received condition message (RCM) for an immediately prior subcycle, wherein the RCM is an ACK when a transmission from the device in the preceding subcycle was correctly received and the RCM is a NACK when a transmission from the device in the preceding subcycle was not correctly received, comprising: including in each transmitted condition message a current priority data acknowledgement flag (CPDAF), the CPDAF being transmitted set in each condition message for each subcycle of an offset cycle after the master correctly received in a current cycle a priority data message, the offset cycle being defined as the second and subsequent subcycles of a current cycle and the first subcycle of a next cycle, the CPDAF being transmitted as cleared otherwise.

Abstract: A communication method between a master and a device, the master transmits in a subcycle a received condition message (RCM) for an immediately prior subcycle, wherein the RCM is an ACK when a transmission from the device in the preceding subcycle was correctly received and the RCM is a NACK when a transmission from the device in the preceding subcycle was not correctly received, comprising: including in each transmitted condition message a current priority data acknowledgement flag (CPDAF), the CPDAF being transmitted set in each condition message for each subcycle of an offset cycle after the master correctly received in a current cycle a priority data message, the offset cycle being defined as the second and subsequent subcycles of a current cycle and the first subcycle of a next cycle, the CPDAF being transmitted as cleared otherwise.

Abstract: A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.

Abstract: A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.

Abstract: A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.

Abstract: A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.