Procedure for the determination of message identification in the data transmission network of an elevator system

• US 5,502,818 A
• Filed: 06/15/1994
• Issued: 03/26/1996
• Est. Priority Date: 01/17/1991
• Status: Expired due to Term

• Current Assignee: KONE Elevator GmbH
• Original Assignee: KONE Elevator GmbH
• Inventors: Lamberg, Lauri
• Primary Examiner(s): Bowler, Allyssa H.
• Assistant Examiner(s): Rinehart, Mark H.
• Application Number:
  US08/261,209
• Time in Patent Office: 650 Days
• Field of Search: 340/825.06, 340/825.07, 340/825.08, 340/825.52, 340/825.53, 340/825.5, 370/85.1, 370/85.2, 395/200.16, 395/829
• US Class Current: 709/225
• CPC Class Codes: B66B 1/34 Details , e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
• CPC Class Codes: B66B 1/3415 Control system configuration and the data transmission or communication within the control system
• CPC Class Codes: B66B 1/3453 Procedure or protocol for the data transmission or communication
• CPC Class Codes: H04L 61/5038 for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
• CPC Class Codes: H04L 61/5046 Resolving address allocation conflicts; Testing of addresses testing when self-assigning an address H04L61/5092
• CPC Class Codes: H04L 61/5092 by self-assignment, e.g. picking addresses at random and testing if they are already in use

Abstract

A procedure is disclosed for determining the message identifiers in a control area network CAN data transmission network of an elevator system where message identifiers are used in the transmission of messages. Each node in the network monitors the data transmissions in the network and stores the other message identifiers in use by the other nodes. When selecting a message identifier, the node makes use of a random number to select an unused identifier from an identifier table.

Claims

1. A method for determining message identifiers in a controller area network (CAN) of an elevator system having a plurality of nodes, wherein a predetermined number of predetermined message identifiers are used in the transmission of messages between nodes of said network, said method being implemented simultaneously by each node in the network and comprising the steps of:

monitoring data transmissions taking place in the network, and storing those message identifiers being used by other nodes of the network, and storing a respective message state of each message identifier being used by other nodes of the network;

selecting a message identifier, from among said predetermined message identifiers, that is not among those message identifiers being used by other nodes of the network, and waiting for a first delay period, the duration of said first delay period being equal to a predetermined delay period plus a random delay period;

following expiry of the first delay period, performing an availability test by sending an "I propose" message containing the selected message identifier and a random number into the network, the random delay period preventing simultaneous transmission of "I propose" messages from each node in the network, and the random number ensuring that a detectable collision occurs even if "I propose" messages are transmitted simultaneously and waiting for a second period of time;

if no cancellation reply is received from another node and a message collision is not detected before expiry of the second delay period, sending an "In use" message containing the selected message identifier into the network, and waiting for a third delay period;

if no cancellation reply is received from another node and a message collision is not detected before expiry of the third delay period, sending an "I am using" message containing the selected message identifier into the network;

wherein said "I propose", "In use" and "I am using" messages constitute messages having progressively higher message states and wherein, following the transmission of each said "I propose", "In use", and "I am using" messages, a node sends a cancellation message to another node if it receives, from the other node, a message having the same message identifier and any one of an equal or a lower message state; and

if, before the expiry of each of the first and second delay periods, no message is received from another node of the network whose respective message state is either "I propose" or "In use", reducing said stored message state of the message identifier associated with said other nodes.

2. A method according to claim 1, wherein in addition to the selected message identifier, each message sent by a node contains a random number.

3. A method according to claim 1, wherein if a cancellation message is received from another node during any of said second or third delay periods, the message identifier selection step is started again and the message identifier previously selected is designated as being in use.

4. A method according to claim 1, wherein a node starts normal operation after it has sent an "I am using" message into the network and the other nodes have accepted it, and during normal operation the node monitors the transmissions in the network as far as its own message identifier is concerned, and, if it finds that another node is trying to take the same message identifier, a cancellation message containing the message state of its own message identifier is sent.

5. A method according to claim 1 further comprising the steps of:

establishing a plurality of nodes in an elevator system, said plurality of nodes selected from one or more elevator call buttons on floors of a building, floor call buttons in an elevator car, floor and direction indicators, and door motor control units, each of said nodes lacking any message identifier setting switches.