Honeywell International Inc.

Honeywell G.m.b.h.

Tttech Computertechnik Ag

Kevin Raymond Driscoll

Brendan Hall

Michael Ray Elgersma

Michael Paulitsch

Philip Zumsteg

Srivatsan Varadarajan

Kenneth Paul Hoyme

Dwayne Michael Benson

Paul Frederick Dietrich

Ted Bonk

William Todd Smithgall

Harald Angelow

Matthias Wachter

Dwayne (Dewey) Benson

Phil Rose

Kelly Dean Morrell

Brendan Halll

Systems and methods for strobe-light-based navigation are provided. In one embodiment, a reflected strobe light navigation system for a vehicle comprises: a vehicle navigation system; a reflection processing system coupled to the vehicle navigation system, wherein the reflection processing system is configured to output a navigation solution to the vehicle navigation system; a strobe light generator system configured to transmit a light pulse from the vehicle; and a reflected strobe image capturing system coupled to the reflection processing system, wherein the reflected strobe image capturing system is configured to capture images of reflected strobe light pulses received from a retro-reflector array, wherein the reflected strobe light pulses comprise reflections of the light pulse reflected by the retro-reflector array; wherein the reflection processing system evaluates one or more image frames each comprising a pattern of reflected light pulse images produced from the reflected strobe light pulses to calculate the navigation solution.

Systems and methods for strobe-light-based navigation

In an example, a node in a network includes four ports coupled to respective nodes via respective links. A first port and a third port are coupled to respective nodes via respective near links and a second port and a fourth port are coupled to respective nodes via respective skip links. The node further includes at least one processor configured to send a first message in a first direction via the second port, and the first message includes a first destination address that corresponds to the second side of the node. The at least one processor is further configured to send a second message in a second direction via the fourth port, and the second message includes a second destination address that corresponds to the first side of the node.

Unicast addressing for redundant communication paths

In an example, a method includes forming a first self-checking pair including a self-checking node and a first node adjacent to the self-checking node in a network. The method further includes forming a second self-checking pair including the self-checking node and a second node adjacent to the self-checking node in the network, wherein the self-checking node is between the first node and the second node. The method further includes transmitting a first paired broadcast with the first self-checking pair and transmitting a second paired broadcast with the second self-checking pair.

Self-checking node

Systems and methods for a controller area network braided ring are provided. In certain embodiments, a node within a controller area network braided ring includes a controller area network (CAN) controller that transmits and receives CAN messages according to CAN protocol. The node also includes braided ring availability integrity network (BRAIN) circuitry coupled to the CAN controller, wherein the BRAIN circuitry alters the received CAN messages from the CAN controller for transmission to other nodes within a BRAIN network and alters BRAIN messages received from the other nodes into CAN messages for processing by the CAN controller.

Controller area network braided ring

In some examples, a method includes receiving a plaintext message including plaintext data and error detection bits. The method also includes encrypting the plaintext message based on a feedback algorithm to generate an encrypted message including a set of encrypted bits for error detection, cryptographic integrity, and cryptographic authentication. The set of encrypted bits for error detection, cryptographic integrity, and cryptographic authentication can replace the error detection bits in whole or in part. A receiver can confirm the cryptographic integrity and the cryptographic authentication of the encrypted message by decrypting the set of encrypted bits.

Using error detection bits for cryptographic integrity and authentication

In an example, a node in a network includes four ports coupled to respective nodes via respective links. Two of the ports are coupled to respective nodes via respective near links and two of the port are coupled to respective nodes via respective skip links. The node further includes a processor configured to compare first and second data streams, sourced from a self-checking pair of nodes, received in a first direction and to compare third and fourth data streams, sourced from the self-checking pair of nodes, received in a second direction. The processor is configured to relay the second data stream in the first direction and fourth data stream in the second direction and a hop count at the end of the respective data stream that is indicative of integrity of the respective data stream.

Compressed and efficient byzantine agreement

A network includes a plurality of nodes and a plurality of links communicatively coupling each of the nodes to at least one respective adjacent node via a first communication channel and to another respective adjacent node via a second communication channel. The nodes and links have a braided ring topology. First and second nodes of the plurality of nodes source data, are adjacent nodes, and at least one is a source node. The first node sends a first communication to the second node via a third node that is adjacent the first node and via a fourth node that is adjacent the second node. The second node sends a second communication to the first node via the third node and via the fourth node. At least one of the first and second nodes terminates transmission of the first and second communications when the first and second communications do not match.

Dual fault-tolerant network using guardian interlocking

In an embodiment, a computing node includes a computing circuit, a comparing circuit, and an indicator circuit. The computing circuit is configured to receive each of at least one input-data message. The comparing circuit is configured to compare each of the at least one received input-data message to a list of input-data-message identifiers. And the indicator circuit is configured, for each of the at least one input-data message that corresponds to a respective input-data-message identifier, to generate a respective portion of a first status message, the respective portion indicating that the input-data message was received. For example, such computing node can determine the congruency of a received input-data message between coupled redundancy circuits with reduced processing overhead, reduced message delay, and reduced message latency as compared to existing computer nodes.

Efficient ingress-congruency determination in a network

In an embodiment, a computing node includes a computing circuit, a comparing circuit, and an indicator circuit. The computing circuit is configured to generate a first redundant message that corresponds to, and that is independent of, a source message propagating over a network during at least one time period. The comparing circuit is configured to compare information content of one or more corresponding portions of the source message and the first redundant message during each of the at least one time period to generate a comparison result. And the indicator circuit is configured to indicate whether the source message is valid or invalid in response to the comparison result. For example, such computing node can determine the validity of a redundant result with reduced processing overhead, reduced message delay, and reduced message latency as compared to existing computer nodes.

Efficient self-checking redundancy comparison in a network

Devices, methods, systems, and computer-readable media for auto-commissioning of devices in a communication network are described herein. One or more embodiments include a method for auto-commissioning of a device added to a communication network, comprising: determining properties of signal transitions of the communication network via a device added to the network while the signal transitions of the communication network are passing unchanged, and processing the signal transitions of the communication network, via the device, based on the properties of the signal transitions.

Methods and systems for auto-commissioning of devices in a communication network

A method comprises transmitting a plurality of copies of a message from each of a first transmission node and a second transmission node, each copy having a respective identification and forwarding each of the plurality of copies of the message among other nodes in the network based, at least in part, on the respective identification of each copy such that each copy of the message traverses a predetermined communication path among the other nodes. A respective first received copy is compared to a respective second received copy at each of the other nodes. The integrity of the respective first and second copies is validated at each of the other nodes if the copies match and the copies traversed disjoint communication paths.

Disjoint data path routing for integrity and availability augmentation

A method of communicating data in a network comprises receiving a copy of a message on a first channel via at least one of a first port and a second port, the first port coupled to a first neighbor node and the second port coupled to a first neighbor's neighbor node; and selecting either the copy of the message received via the first port or the copy of the message received via the second port if a copy of the message is received via both the first port and the second port. If a copy of the message is only received via one of the first port or the second port, the received copy of the message is selected. The selected copy of the message is forwarded on the first channel to a second neighbor node via a third port and to a second neighbor's neighbor node via a fourth port; and the integrity of the selected copy of the message is determined based on supplemental integrity data received from another node, wherein the supplemental integrity data is exclusive of a copy of the message communicated on a second channel.

System and method for integrity reconstitution

A network comprises a plurality of nodes; and a plurality of links communicatively coupling each of the plurality of nodes to at least one respective adjacent node of the plurality of nodes via a first communication channel and to another respective adjacent node of the plurality of nodes via a second communication channel. At least one of the plurality of nodes is a source node configured to source data. The source node is configured to form a virtual self-checking pair with one of the respective adjacent node on the first communication channel or the respective adjacent node on the second communication channel to achieve a consistent broadcast of data on the first and second communication channels. Data exchanged between the source node and the respective adjacent node in the virtual self-checking pair is only sourced by the source node.

Virtual pairing for consistent data broadcast

One embodiment comprises a network that includes a plurality of bi-directional links and a plurality of nodes. Each node is communicatively coupled to two neighbor nodes and to two skip nodes using the plurality of bi-directional links. Three neighboring nodes of the plurality of nodes form a triple modular redundant (TMR) set having a first end node, a second end node, and a center node, the first end node configured to transmit output data in a first direction and the second end node configured to transmit output data in a second direction. At least one of the plurality of nodes that is not in the redundant set determines the integrity of data received from the redundant set based on at least: (i) a comparison of data received on a first logical communication channel from a respective first neighbor node with data received on the first logical communication channel from a respective first skip node; (ii) a comparison of data received on a second logical communication channel from a respective second neighbor node with data received on the second logical communication channel from a respective second skip node; and (iii) a comparison of data received on the first logical communication channel from one of the respective first neighbor node and the respective first skip node with data received on the second logical communication channel from one of the respective second neighbor node and the respective second skip node.

Growing community of inventors

Maple Grove, MN, United States of America

Kevin Raymond Driscoll