The present application is related to provisional application Ser. No. 60/618,769, entitled “System and Method for Time Synchronizing Nodes in an Automotive Network,” filed Oct. 14, 2004, which is commonly owned and incorporated herein by reference in its entirety.
This invention in general relates to in-vehicle communication networks and particularly to a system and method for synchronizing nodes in an in-vehicle network using an input capture mechanism.
The commonly assigned United States patent application entitled “Vehicle Active Network,” Ser. No. 09/945,581, Publication No. US 20030043793, filed Aug. 31, 2001, the disclosure of which is hereby expressly incorporated herein by reference, introduces the concept of an active network that includes a switch fabric. The switch fabric is a web of interconnected switching devices or nodes. Control devices, sensors, actuators and the like are coupled to the switch fabric, and the switch fabric facilitates communication between these coupled devices.
The coupled devices may be indicator lights, vehicle control systems, vehicle safety systems, and comfort and convenience systems. A command to actuate a device or devices may be generated by a control element coupled to the switch fabric and is communicated to the device or devices via the switch fabric. The command may require simultaneous activation of two or more devices. However, the switch fabric may be a packet based communication medium making coordinating simultaneous events difficult.
To illustrate this difficulty take for example the need to capture data from multiple sensors at the same time. For example, it may be necessary to communicate various control parameters from a number of engine sensors to an engine controller so that it may then issue commands for the control of the engine. For example, to detect misfire, the engine controller receives data from several oxygen sensors, the crankshaft position sensor and potentially other sensors. To be certain that the misfire is detected for the correct engine cylinder so that control parameters may be varied to correct the misfire, the data must arrive to the engine controller in a coordinated manner or have a reliable time indication. Unless each of the sensors are time synchronized, there is no way to accurately time stamp the data packets or to effectively communicate them to the engine controller in a coordinated manner.
Another problem may involve the need for multiple devices to be activated at the same time or at a predefined time in the future. For example, there is a need to illuminate the left, right and center high-mounted brake lights on an automobile. Each of the brake lights should appear to illuminate substantially simultaneously. Each of the lights is coupled to the switch fabric. The command to illuminate the lights may be generated by a braking control module, which is also coupled to the switch fabric. The command is communicated from the braking control module to the three brake lights. However, the command may take different incremental amounts of time based upon the paths the command takes through the network to arrive at each of the three brake lights. If the brake lights act on the command when received, the lights may not appear to come on simultaneously. The command may give a time at which to activate, but if each of the brake lights are not time synchronized, they still will not actuate at the same coordinated time.
It is, therefore, desirable to provide a system and method to overcome or minimize most, if not all, of the preceding problems especially in the area of synchronizing elements of an in-vehicle network.
While the invention is susceptible to various modifications and alternative forms, specific embodiments have been shown by way of example in the drawings and will be described in detail herein. However, it should be understood that the invention is not intended to be limited to the particular forms disclosed. Rather, the invention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the invention as defined by the appended claims.
What is described is a system and method for time synchronizing nodes in a switch fabric network of a vehicle. The network has a plurality of nodes that are joined by communication links for the transmission of data there between. As explained in more detail below, each node of the switch fabric may include a processor, a memory, a clock, a transceiver, and an input capture. The memory is adapted to store and retain timer offsets associated with communication links with neighboring nodes. The transceiver is adapted to transmit and receive synchronization messages between the node and neighboring nodes. The input capture is adapted to capture timestamps associated with the transmission of synchronization messages. The processor is configured to compute the timer offsets associated with the communication links with neighboring nodes based on the captured timestamps by the input capture function. The computed offsets may then be broadcast and stored by the nodes for subsequent use in time synchronizing data packets through the switch fabric network.
Now, turning to the drawings,
The interfaces 26a-d are any suitable interface for coupling the particular vehicle device 24a-d to the network 22, and may be wire, optical, wireless or combinations thereof. The vehicle device 24a-d is particularly adapted to provide one or more functions associated with the vehicle 20. These vehicle devices 24a-d may be data producing, such as a sensor, data consuming, such as an actuator, or processing, which both produces and consumes data. Of course, an actuator, typically a data-consuming device, may also produce data, for example where the actuator produces data indicating it has achieved the instructed state, or a sensor may consume data, for example, where it is provided instructions for the manner of function. Data produced by or provided to a vehicle device 24a-d, and carried by the network 22, is independent of the function of the vehicle device 24a-d itself. That is, the interfaces 26a-d provide device independent data exchange between the coupled device 24a-d and the network 22.
The network 22 may include a switch fabric 28 defining a plurality of communication paths between the vehicle devices 24a-d. The communication paths permit multiple simultaneous peer-to-peer, one-to-many, many-to-many, etc. communications between the vehicle devices 24a-d. During operation of the vehicle 20, data exchanged, for example, between devices 24a and 24d may utilize any available path or paths between the vehicle devices 24a, 24d. In operation, a single path through the switch fabric 28 may carry all of a single data communication between one vehicle device 24a and another vehicle device 24d, or several communication paths may carry portions of the data communication. Subsequent communications may use the same path or other paths as dictated by the then state of the network 22. This provides reliability and speed advantages over bus architectures that provide single communication paths between devices, and hence are subject to failure with failure of the single path. Moreover, communications between other of the devices 24b, 24c may occur simultaneously using the communication paths within the switch fabric 28.
The network 22 may comply with transmission control protocol/Internet (TCP/IP), asynchronous transfer mode (ATM), Infiniband, RapidIO, or other packet data protocols. As such, the network 22 utilizes data packets, having fixed or variable length, defined by the applicable protocol. For example, if the network 22 uses asynchronous transfer mode (ATM) communication protocol, ATM standard data cells are used.
The vehicle devices 24a-d need not be discrete devices. Instead, the devices may be systems or subsystems of the vehicle and may include one or more legacy communication media, i.e., legacy bus architectures such as the Controller Area Network (CAN) protocol, the SAE J1850 Communication Standard, the Local Interconnect Network (LIN) protocol, the FLEXRAY Communications System Standard, Media Oriented Systems Transport or MOST Protocol, or similar bus structures. In such embodiments, the respective interface 26a-d may be configured as a proxy or gateway to permit communication between the network 22 and the legacy device.
Referring to
The cooperation of the nodes 30a-h and the connection media 32 define a plurality of communication paths between the devices 24a-d that are communicatively coupled to the network 22. For example, a route 34 defines a communication path from device 24a to device 24d. If there is a disruption along the route 34 inhibiting communication of the data packets from the device 24a to the device 24d, for example, if one or more nodes are at capacity or have become disabled or there is a disruption in the connection media joining the nodes along route 34, a new route, illustrated as route 36, can be used. The route 36 may be dynamically generated or previously defined as a possible communication path, to ensure the communication between device 24a and device 24d.
Some applications may require synchronized activity between multiple elements of the network or devices connected to the network. This synchronized activity requires timing information be available within the network 22.
As shown in
Referring initially to
In one embodiment, upon startup and during normal operation of the network 22, the first node 30a and the second node 30b will enter and remain in a state called SYNC_MODE_INACTIVE. When a node (such as the first node 30a) needs to enter into a synchronization dialogue with a neighboring node (such as the second node 30b), the node will exit the SYNC_MODE_INACTIVE state and begin traversing through a series of states that will walk the node through the synchronization dialogue process. When a node exits the SYNC_MODE_INACTIVE state, all outgoing messages not related to synchronization are held in an outgoing software buffer and not transmitted until the node re-enters the SYNC_MODE_INACTIVE state. As shown in box 102 of
In this case, the SYNC_MODE_NOW state allows the first node 30a to designate its role as the initiator of the synchronization dialogue. Accordingly, in one embodiment, the first node 30a may set a role parameter (sync_role_initiator=true) as shown in box 104. The first node 30a may then transition to a SYNC_MODE_PENDING state as shown in box 106.
When the first node 30a is in the SYNC_MODE_PENDING state (and designated as the initiator), it may then perform a series of tasks including transmitting a message to the neighboring second node 30b. This is shown in box 108 of
As illustrated in box 112 of
When the second node 30b is in the SYNC_MODE_READY state (and designated as the receiver), it may then perform a series tasks including transmitting a message to the initiating first node 30a. This is shown in box 120 of
As illustrated in box 124 of
When the first node 30a is in the SYNC_MODE_ARMED state (and designated as the initiator), it may then perform a series of tasks including transmitting a reference synchronization message to the neighboring second node 30b. This is shown in box 132 of
As illustrated in box 140 of
When the second node 30b is in the SYNC_MODE_POST state (and designated as the receiver), it may then perform a series of tasks including transmitting a synchronization post message to the initiating first node 30a. This is shown in box 144 of
As illustrated in box 148 of
In a further embodiment, the first node 30a may then transmit a synchronization complete message to the neighboring second node 30b. This is shown in box 156 of
As illustrated in box 160 of
In a further embodiment, the first node 30a may then proceed to do a similar process with any other immediate neighboring nodes. The first node 30a will store in its memory each computed offset with its immediate neighboring nodes. The first node 30a may then further be configured to broadcast its stored offsets with each node 30b-h in the network 22. Each node in the network 22 may then retain the timer offsets discovered by other nodes in the network 22. In one embodiment, as illustrated in
The benefit of the offset table 70 as illustrated in
Moreover, as shown in
What has been described is a system and method for time synchronizing nodes in a switch fabric network for a vehicle. A series of messages are exchanged that will begin a synchronization dialogue and, through the dialogue, a set of input captures on each node will arm. The input captures are connected to the bus and capture a set of timestamps on each node from a reference synchronization message transmitted during the dialogue. The timestamps are shared between nodes so that the nodes can calculate a timer offset value for each immediate neighbor. The timer offset values may then be shared with other nodes in the network so that a summed offset may be used to transmit network messages across a plurality of nodes. The above description of the present invention is intended to be exemplary only and is not intended to limit the scope of any patent issuing from this application. The present invention is intended to be limited only by the scope and spirit of the following claims.
The present application claims priority from provisional application Ser. No. 60/618,768, entitled “System and Method for Time Synchronizing Nodes in an Automotive Network Using Input Capture,” filed Oct. 14, 2004, which is commonly owned and incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4816989 | Finn et al. | Mar 1989 | A |
5151899 | Thomas et al. | Sep 1992 | A |
5195091 | Farwell | Mar 1993 | A |
5321689 | Suzuki et al. | Jun 1994 | A |
5566180 | Eidson et al. | Oct 1996 | A |
5612953 | Olnowich | Mar 1997 | A |
5802052 | Venkataraman | Sep 1998 | A |
6356823 | Iannotti et al. | Mar 2002 | B1 |
6373834 | Lundh et al. | Apr 2002 | B1 |
6420797 | Steele | Jul 2002 | B1 |
6430164 | Jones et al. | Aug 2002 | B1 |
6477453 | Oi et al. | Nov 2002 | B2 |
6559783 | Stoneking | May 2003 | B1 |
6611519 | Howe | Aug 2003 | B1 |
6611537 | Edens et al. | Aug 2003 | B1 |
6643465 | Bösinger et al. | Nov 2003 | B1 |
6732031 | Lightner et al. | May 2004 | B1 |
6747365 | Reinold | Jun 2004 | B2 |
6757521 | Ying | Jun 2004 | B1 |
6845416 | Chasmawala et al. | Jan 2005 | B1 |
7027773 | McMillin | Apr 2006 | B1 |
7210063 | Holcroft et al. | Apr 2007 | B2 |
7272496 | Remboski et al. | Sep 2007 | B2 |
20020077739 | Augsburger et al. | Jun 2002 | A1 |
20020080829 | Ofek | Jun 2002 | A1 |
20020087891 | Little et al. | Jul 2002 | A1 |
20030043739 | Reinold et al. | Mar 2003 | A1 |
20030043750 | Remboski et al. | Mar 2003 | A1 |
20030043779 | Remboski et al. | Mar 2003 | A1 |
20030043793 | Reinold et al. | Mar 2003 | A1 |
20030043799 | Reinold et al. | Mar 2003 | A1 |
20030043824 | Remboski et al. | Mar 2003 | A1 |
20030045234 | Remboski et al. | Mar 2003 | A1 |
20030045971 | Reinold et al. | Mar 2003 | A1 |
20030045972 | Remboski et al. | Mar 2003 | A1 |
20030046327 | Reinold et al. | Mar 2003 | A1 |
20030051131 | Reinold et al. | Mar 2003 | A1 |
20030065630 | Brown et al. | Apr 2003 | A1 |
20030091035 | Roy | May 2003 | A1 |
20030185201 | Dorgan | Oct 2003 | A1 |
20030188303 | Barman et al. | Oct 2003 | A1 |
20040001593 | Reinold et al. | Jan 2004 | A1 |
20040002799 | Dabbish et al. | Jan 2004 | A1 |
20040003227 | Reinold et al. | Jan 2004 | A1 |
20040003228 | Fehr et al. | Jan 2004 | A1 |
20040003229 | Reinold et al. | Jan 2004 | A1 |
20040003230 | Puhl et al. | Jan 2004 | A1 |
20040003231 | Levenson et al. | Jan 2004 | A1 |
20040003232 | Levenson et al. | Jan 2004 | A1 |
20040003233 | Reinold et al. | Jan 2004 | A1 |
20040003234 | Reinold et al. | Jan 2004 | A1 |
20040003237 | Puhl et al. | Jan 2004 | A1 |
20040003242 | Fehr et al. | Jan 2004 | A1 |
20040003243 | Fehr et al. | Jan 2004 | A1 |
20040003245 | Dabbish et al. | Jan 2004 | A1 |
20040003249 | Dabbish et al. | Jan 2004 | A1 |
20040003252 | Dabbish et al. | Jan 2004 | A1 |
20040042469 | Clark et al. | Mar 2004 | A1 |
20040131014 | Thompson, III et al. | Jul 2004 | A1 |
20040148460 | Steinmetz et al. | Jul 2004 | A1 |
20040213295 | Fehr | Oct 2004 | A1 |
20040227402 | Fehr et al. | Nov 2004 | A1 |
20040254700 | Fehr et al. | Dec 2004 | A1 |
20040258001 | Remboski et al. | Dec 2004 | A1 |
20050004727 | Remboski et al. | Jan 2005 | A1 |
20050038583 | Fehr et al. | Feb 2005 | A1 |
20050160285 | Evans | Jul 2005 | A1 |
20050251604 | Gerig | Nov 2005 | A1 |
20050251608 | Fehr et al. | Nov 2005 | A1 |
20060013263 | Fellman | Jan 2006 | A1 |
20060013565 | Baumgartner | Jan 2006 | A1 |
20060020717 | Remboski et al. | Jan 2006 | A1 |
20060083172 | Jordan et al. | Apr 2006 | A1 |
20060083173 | Jordan et al. | Apr 2006 | A1 |
20060083229 | Jordan et al. | Apr 2006 | A1 |
20060083250 | Jordan et al. | Apr 2006 | A1 |
20060083265 | Jordan et al. | Apr 2006 | A1 |
20060282549 | Vinnemann | Dec 2006 | A1 |
Number | Date | Country | |
---|---|---|---|
20060083264 A1 | Apr 2006 | US |
Number | Date | Country | |
---|---|---|---|
60618769 | Oct 2004 | US | |
60618768 | Oct 2004 | US |