Implementation method of an intelligent elevator signal transmission system

Abstract

The present invention provides a method for implementing an intelligent elevator signal transmission system. The system includes a plurality of wireless nodes evenly distributed in the elevator. Each of the wireless nodes has a unique coordinate and a node ID. The plurality of wireless nodes are configured as one central node, a plurality of sensing nodes, and a plurality of backbone nodes. The central node is used to collect data collected by all the sensing nodes. The backbone nodes are used to collect data from neighboring sensing nodes and transmit the data to the central node. The sensing nodes are used to collect data. This implementation method is applied to various elevators such as inclined elevators. By using wireless communication, it overcomes the deficiencies of traditional elevators using wired signal transmission. The intelligent elevator signal transmission system does not require manual participation and can still transmit elevator signals through wireless communication in harsh environments, reducing the installation and use costs of elevators, and at the same time ensuring the safe use of elevators, having a wide range of application prospects.

Description

Technical Field

[0001] The present invention relates to the field of signal transmission, and particularly to a method for implementing an intelligent elevator signal transmission system. Background Art

[0002] Currently, the control signals of elevators are transmitted in a wired manner. Wired signal transmission has many limitations and has many requirements for elevator use sites, climate, and environment, especially for inclined elevators, which increases the installation and use costs of elevators. Therefore, the present invention innovatively proposes to use wireless communication to transmit elevator control signals, thereby reducing the requirements for elevator installation and use, greatly reducing the installation and use costs of elevators, and ensuring that the elevator can still be safely used in harsh environments. Summary of the Invention

[0003] Object of the Invention: The technical problem to be solved by the present invention is to provide a method for implementing an intelligent elevator signal transmission system in view of the deficiencies of the prior art.

[0004] Technical Solution: The present invention discloses a method for implementing an intelligent elevator signal transmission system. The system includes a plurality of wireless nodes evenly distributed in the elevator. Each wireless node has a unique coordinate and node ID. The plurality of wireless nodes are configured as a central node, a plurality of sensing nodes, and a plurality of backbone nodes. The central node is used to collect data collected by all sensing nodes. The backbone nodes are used to collect data of neighboring sensing nodes and transmit the data to the central node. The sensing nodes are used to collect data. The method includes the following steps:

[0005] The central node collects signal data by setting a clock and sending wireless messages. Among them, the wireless messages include message ID, hop count, and timestamp.

[0006] If the sensing node receives the wireless message, it sends a data set message. And if the backbone node receives the wireless message, it decrements the hop count in the wireless message by 1. And if the hop count in the wireless message after decrement is equal to 0, the backbone node sends a data set message. If the hop count in the wireless message after decrement is greater than 0, and the backbone node does not have a wireless entry with a timestamp equal to the timestamp in the wireless message, it creates a wireless entry and forwards the wireless message. Among them, the data set message includes message ID, timestamp, and data set.

[0007] If the backbone node that receives the data set message has a wireless entry with a timestamp equal to the timestamp in the data set message and the life cycle of the wireless entry is equal to 0, it forwards the data set message. And if the central node that receives the data set message has its clock expired, it constructs a data set entry.

[0008] The wireless node obtains a data set by sending a transmission message; wherein, the transmission message includes a message ID, a node ID, and a timestamp;

[0009] If a wireless node that receives the transmission message has a data set entry with a timestamp equal to the timestamp in the transmission message, it sends a signal message; otherwise, if the node ID of the wireless node is equal to the node ID in the transmission message and there is no temporary entry with a timestamp equal to the timestamp in the transmission message, it creates a temporary entry and forwards the transmission message; wherein, the signal message includes a message ID, a timestamp, and a data set.

[0010] If a wireless node that receives the signal message has a temporary entry with a timestamp equal to the timestamp in the signal message, it forwards the signal message; if the wireless node that sends the transmission message receives the signal message, it creates a data set entry.

[0011] In the method,

[0012] Each of the wireless nodes also stores a central table, which is empty in the initial state, and the central table entry includes a node ID and coordinates; the method further includes:

[0013] The central node sends a central message to establish the central table; wherein, the central message includes a message ID, a node ID, and coordinates, and the message ID of the central message is 1, the node ID is its own node ID, and the coordinates are its own coordinates;

[0014] If a wireless node that receives the central message does not have a central table entry with a node ID equal to the node ID in the central message, it clears the central table, creates a central table entry, and the node ID and coordinates of this entry are respectively equal to the node ID and coordinates in the central message, and forwards the central message.

[0015] The method further includes:

[0016] Each of the wireless nodes also stores an information table, and the information table entry includes a node ID, a node type, coordinates, energy, and centrality; wherein, the centrality is equal to the number of neighbor wireless nodes of the wireless node, and the value of the node type is 0 and 1, 0 represents a sensing node, and 1 represents a backbone node; the information table is empty in the initial state; the method further includes:

[0017] Each of the wireless nodes establishes the information table by sending an elevator message; wherein, the elevator message includes a message ID, a node ID, a node type, coordinates, and energy, and the message ID of the elevator message is 2, and the node ID, coordinates, and energy are respectively equal to its own node ID, node type, coordinates, and current energy value;

[0018] If a neighbor wireless node that receives the elevator message does not have an entry in the information table whose node ID is equal to the node ID in the elevator message, it creates an entry. The node ID, node type, coordinates, and energy of this entry are respectively equal to the node ID, node type, coordinates, and energy in the elevator message, and the centrality is equal to 0.

[0019] The method further includes:

[0020] After the wireless node establishes the information table, it sends a centrality message; wherein, the centrality message includes a message ID, a node ID, and a centrality, and the message ID of this centrality message is 3, the node ID is equal to its own node ID, and the centrality is equal to the number of entries in its own information table;

[0021] A neighbor wireless node that receives the centrality message selects the entry in the information table whose node ID is equal to the node ID in the centrality message, and sets the centrality of this entry to the centrality in the centrality message.

[0022] The method further includes:

[0023] The wireless node calculates its own backbone coefficient b1 through the following formula;

[0024] b1 = n1 × e1(1)

[0025] wherein, n1 is the centrality of the wireless node, and e1 is the energy of the node;

[0026] The wireless node calculates the backbone coefficient b2 of each entry through the following formula (2), where n2 and e2 are respectively equal to the centrality and energy of the entry;

[0027] b2 = n2 × e2(2)

[0028] If the backbone coefficient of the wireless node itself is greater than or equal to the backbone coefficient of each entry, it marks itself as a backbone node;

[0029] If the wireless node is a sensing node and there is no entry with a node type of 1, or the wireless node is a backbone node and the distance between its coordinates and the coordinates of the central entry is greater than the communication radius and there is no entry whose node type is 1 and the distance between its coordinates and the coordinates of the central entry is less than the distance between its own coordinates and the coordinates of the central entry, the wireless node then selects the entries whose distances between their coordinates and the coordinates of the central entry are less than the distance between its own coordinates and the coordinates of the central entry, selects an entry with the largest backbone coefficient from these information coordinates, and sends a backbone message, the message ID of which is equal to 4, and the node ID is equal to the node ID of the selected entry;

[0030] If the node ID of the wireless node that receives the backbone message is equal to the node ID in the backbone message, mark itself as a backbone node.

[0031] The method further includes:

[0032] Each of the wireless nodes also stores a data set table, a temporary data set table, and a wireless table; wherein, each data set table entry includes a data set and a time stamp, and is an empty table in the initial state; the data set is an empty set or consists of elevator signals; each temporary data set table entry includes a data set and a time stamp, and is an empty table in the initial state; each wireless table includes a time stamp and a life cycle; and is an empty table in the initial state;

[0033] The message ID of the wireless message sent by the central node is 5, the hop count is equal to a preset value, and the time stamp is the current time:

[0034] In the data set message sent by the sensing node or the backbone message, the message ID is 6, the time stamp is equal to the time stamp in the wireless message, and the data set includes the data sensed by itself.

[0035] The method further includes:

[0036] In the wireless table entry created by the backbone node that receives the wireless message, the time stamp is equal to the time stamp in the wireless message, and the life cycle is set to t1, as shown in the following formula;

[0037] t1 = t2×h1 + t3×(h1 + 1) (3)

[0038] Wherein, t2 is equal to the maximum threshold for sending wireless messages, which is preset, t3 is equal to the maximum threshold for sending data set messages, which is preset, and h1 is equal to the hop count in the wireless message.

[0039] The method further includes:

[0040] If the central node that receives the data set message does not have a temporary data set table entry whose data set and time stamp are respectively equal to the time stamp and data set in the data set message, create a temporary data set table entry, and the data set and time stamp of the temporary data set table entry are respectively equal to the time stamp and data set in the data set message;

[0041] If the backbone node that receives the data set message has a wireless table entry whose time stamp is equal to the time stamp in the data set message, and does not have a temporary data set table entry whose data set and time stamp are respectively equal to the time stamp and data set in the data set message, create a temporary data set table entry;

[0042] In the dataset message forwarded by the backbone node, the dataset in the dataset message is equal to the union of the datasets in the temporary dataset table entries whose timestamps are equal to the timestamp in the dataset message;

[0043] In the dataset table entry constructed by the central node, the timestamp is equal to the timestamp in the dataset message, and the dataset is equal to the union of the datasets of all temporary dataset table entries.

[0044] The method further includes:

[0045] Each wireless node stores a temporary table, and the table entry contains a timestamp and a lifetime;

[0046] In the signal message sent by the wireless node that receives the transmission message, the message ID is equal to 9, and the timestamp and the dataset are respectively equal to the timestamp and the dataset in the dataset table entry whose timestamp is equal to the timestamp in the transmission message;

[0047] In the temporary table entry created by the wireless node that receives the transmission message, the timestamp is equal to the timestamp in the transmission message, and the lifetime is equal to the maximum value. The wireless node selects all the information table entries with the node type of 1, and selects one information table entry from these information table entries. The distance between the coordinates of this table entry and the coordinates of the central table entry is the closest. In the forwarded transmission message, the node ID is set to the node ID in this information table entry.

[0048] The method further includes:

[0049] In the dataset table entry created by the wireless node that sends the transmission message, the timestamp and the dataset are respectively equal to the timestamp and the dataset in the transmission message.

[0050] Beneficial effects: The present invention provides a method for implementing an intelligent elevator signal transmission system. This implementation method is applied to various elevators such as inclined elevators. It overcomes the deficiencies of traditional elevators using wired signal transmission by using wireless communication. The intelligent elevator signal transmission system does not require manual participation and can still transmit elevator signals through wireless communication in harsh environments, reducing the installation and use costs of elevators, and ensuring the safe use of elevators at the same time, having a wide range of application prospects. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] The following further specifically describes the present invention in conjunction with the drawings and specific embodiments, and the above and / or other advantages of the present invention will become clearer.

[0052] The following further specifically describes the present invention in conjunction with the drawings and specific embodiments, and the above and / or other advantages of the present invention will become clearer.

[0053] Figure 1It is a flowchart of the implementation method of the intelligent elevator safety monitoring system of the present invention;

[0054] Figure 2 It is a schematic diagram of the process of establishing a central table according to the present invention;

[0055] Figure 3 It is a schematic diagram of the process of establishing an information table according to the present invention.

[0056] Figure 4 It is a schematic diagram of the process of obtaining centrality according to the present invention.

[0057] Figure 5 It is a schematic diagram of the process of electing backbone nodes according to the present invention.

[0058] Figure 6a and Figure 6b It is a schematic diagram of the process of constructing a data set according to the present invention.

[0059] Figure 7 It is a schematic diagram of the elevator signal transmission process according to the present invention. Detailed implementation manners

[0060] To enable those skilled in the art to better understand the technical solution of the present invention, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific implementation manners. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the described embodiments of the present invention without creative efforts belong to the scope of protection of the present invention.

[0061] Unless otherwise specifically stated, the technical terms or scientific terms used in the embodiments of the present invention should have the ordinary meaning understood by those with ordinary skills in the field to which the present invention belongs. The "including" or "comprising" used in the embodiments of the present invention neither limits the mentioned shapes, numbers, steps, actions, operations, components, originals and / or their groups, nor excludes the occurrence or addition of one or more other different shapes, numbers, steps, actions, operations, components, originals and / or their groups, or the addition of these. In addition, the terms "first" and "second" are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the quantity and order of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include one or more of such features. In the description of the embodiments of the present invention, the meaning of "a plurality" is two or more, unless otherwise specifically defined.

[0062] Unless otherwise specifically stated, the relative settings, numerical expressions, and numerical values of the components and steps set forth in these embodiments do not limit the scope of the present invention. At the same time, it should be understood that, for the sake of convenience of description, the dimensions of the various parts shown in the drawings are not drawn in actual proportional relationships. Technologies, methods, and devices known to those of ordinary skill in the relevant art may not be discussed in detail, but where appropriate, the technologies, methods, and devices shown should be regarded as part of the authorization specification. In all the examples shown and discussed here, any specific other examples may have different values. It should be noted that similar symbols and letters represent similar items in the following drawings. Therefore, once an item is defined in one drawing, it does not need to be further discussed in subsequent drawings.

[0063] In the description of the embodiments of the present invention, the descriptions referring to terms such as "one embodiment", "some embodiments", "example", "specific example", or "some examples" mean that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present invention. In the embodiments of the present invention, the schematic expressions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in a suitable manner in any one or more embodiments or examples. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments or examples described in the embodiments of the present invention and the features of different embodiments or examples.

[0064] Next, exemplary embodiments of the present invention will be described in detail with reference to the drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments of the present invention. It should be understood that the present invention is not limited by the exemplary embodiments described here.

[0065] Figure 1 It is a flowchart of an implementation method of an intelligent elevator signal transmission system of the present invention. The system includes a plurality of wireless nodes evenly distributed in the elevator. Each of the wireless nodes has a unique coordinate and a node ID. The plurality of wireless nodes are configured as a central node, a plurality of sensing nodes, and a plurality of backbone nodes. The central node is used to collect data collected by all sensing nodes. The backbone nodes are used to collect data of neighboring sensing nodes and transmit the data to the central node. The sensing nodes are used to collect data; the method includes the following steps:

[0066] The central node collects signal data by setting a clock and sending wireless messages; wherein, the wireless messages include a message ID, a hop count, and a timestamp;

[0067] If the sensing node receives the wireless message, it sends a data set message; and if the backbone node receives the wireless message, it decrements the hop count in the wireless message by 1, and if the hop count in the wireless message after decrement is equal to 0, the backbone node sends a data set message; if the hop count in the wireless message after decrement is greater than 0 and the backbone node does not have a wireless entry with a timestamp equal to the timestamp in the wireless message, it creates a wireless entry and forwards the wireless message; wherein, the data set message includes a message ID, a timestamp, and a data set.

[0068] If the backbone node that receives the data set message has a wireless entry with a timestamp equal to the timestamp in the data set message and the lifetime of the wireless entry is equal to 0, it forwards the data set message; and if the central node that receives the data set message has its clock expired, it constructs a data set entry.

[0069] The wireless node obtains a data set by sending a transmission message; wherein, the transmission message includes a message ID, a node ID, and a timestamp.

[0070] If the wireless node that receives the transmission message has a data set entry with a timestamp equal to the timestamp in the transmission message, it sends a signal message; otherwise, if the node ID of the wireless node is equal to the node ID in the transmission message and there is no temporary entry with a timestamp equal to the timestamp in the transmission message, it creates a temporary entry and forwards the transmission message; wherein, the signal message includes a message ID, a timestamp, and a data set.

[0071] If the wireless node that receives the signal message has a temporary entry with a timestamp equal to the timestamp in the signal message, it forwards the signal message; if the wireless node that sends the transmission message receives the signal message, it creates a data set entry.

[0072] The present invention provides a method for implementing an intelligent elevator signal transmission system. This implementation method is applied to various elevators such as inclined elevators, overcomes the deficiencies of traditional elevators using wired signal transmission by using wireless communication. The intelligent elevator signal transmission system does not require manual participation and can still transmit elevator signals through wireless communication in harsh environments, reducing the installation and usage costs of elevators, and ensuring the safe use of elevators at the same time, having a wide range of application prospects.

[0073] Figure 2Schematic diagram of the process for establishing a central table according to the present invention. The system consists of a plurality of wireless nodes evenly distributed in the elevator. The wireless nodes are further divided into a central node, a plurality of sensing nodes, and a plurality of backbone nodes; there is only one central node in the system, which is pre-set and responsible for collecting data collected by all sensing nodes. The backbone nodes are responsible for collecting data from neighboring sensing nodes and transmitting the data to the central node, and the sensing nodes are responsible for collecting data; in the initial state, all wireless nodes are sensing nodes;

[0074] The central node and each wireless node have unique coordinates and node IDs. The coordinates are obtained through GPS, and the node IDs are pre-set;

[0075] Each wireless node stores a central table, which is empty in the initial state. The central table entry contains the node ID and coordinates;

[0076] The central message contains the message ID, node ID, and coordinates;

[0077] The central node executes the following process to establish a central table:

[0078] Step 101: Start;

[0079] Step 102: The central node sends a central message. The message ID of this message is 1, the node ID is its own node ID, and the coordinates are its own coordinates;

[0080] Step 103: If a wireless node that receives the central message has a central table entry whose node ID is equal to the node ID in the central message, then execute Step 105; otherwise, execute Step 104;

[0081] Step 104: The wireless node that receives the central message clears the central table, creates a central table entry, whose node ID and coordinates are respectively equal to the node ID and coordinates in the central message, forwards the central message, and executes Step 103;

[0082] Step 105: End.

[0083] The wireless node establishes a central table through the above process to obtain the coordinates and node ID of the central node.

[0084] Figure 3 Schematic diagram of the process for establishing an information table according to the present invention. Each wireless node stores an information table. The information table entry contains the node ID, node type, coordinates, energy, and centrality. Among them, the centrality is equal to the number of neighboring wireless nodes of the wireless node. The value of the node type is 0 and 1. 0 represents a sensing node, and 1 represents a backbone node; the information table is initially an empty table;

[0085] The elevator message contains the message ID, node ID, node type, coordinates, and energy;

[0086] Each wireless node periodically executes the following process to establish an information table:

[0087] Step 201: Start;

[0088] Step 202: The wireless node sends an elevator message. The message ID of this message is 2, and the node ID, coordinates, and energy are respectively equal to its own node ID, node type, coordinates, and current energy value;

[0089] Step 203: The neighbor wireless node that receives the elevator message checks whether there is an information table entry whose node ID is equal to the node ID in the elevator message. If it exists, execute Step 205; otherwise, execute Step 204;

[0090] Step 204: The neighbor wireless node that receives the elevator message creates an information table entry. The node ID, node type, coordinates, and energy of this information table entry are respectively equal to the node ID, node type, coordinates, and energy in the elevator message, and the centrality is equal to 0;

[0091] Step 205: End.

[0092] The wireless node obtains the node ID, node type, coordinates, and energy value of each neighbor wireless node through the above process.

[0093] Figure 4 It is the schematic diagram of the process for obtaining centrality described in the present invention. The centrality message includes the message ID, node ID, and centrality;

[0094] After the wireless node establishes the information table, it executes the following process:

[0095] Step 301: Start;

[0096] Step 302: The wireless node sends a centrality message. The message ID of this message is 3, the node ID is equal to its own node ID, and the centrality is equal to the number of its own information table entries;

[0097] Step 303: The neighbor wireless node that receives the centrality message selects an information table entry whose node ID is equal to the node ID in the centrality message, and sets the centrality of this information table entry to the centrality in the centrality message;

[0098] Step 304: End.

[0099] The wireless node obtains the centrality of each neighbor wireless node through the above process.

[0100] Figure 5Schematic diagram of the process for electing backbone nodes according to the present invention. Each wireless node calculates its own backbone coefficient b1 according to formula (1), where n1 is the centrality of the wireless node and e1 is the energy of the node;

[0101] b1 = n1 × e1 (1)

[0102] Each wireless node calculates the backbone coefficient b2 of each information table entry according to formula (2), where n2 and e2 are respectively equal to the centrality and energy of the information table entry;

[0103] b2 = n2 × e2 (2)

[0104] If its own backbone coefficient is greater than or equal to the backbone coefficient of each information table entry, the node marks itself as a backbone node and executes steps 201 - 205;

[0105] The backbone message includes a message ID and a node ID;

[0106] If the wireless node is a sensing node and there is no information table entry with node type 1, or the wireless node is a backbone node and the distance between its coordinate and the coordinate of the central table entry is greater than the communication radius and there is no information table entry whose node type is 1 and the distance between its coordinate and the coordinate of the central table entry is less than the distance between its own coordinate and the coordinate of the central table entry, the wireless node selects information table entries whose distances between their coordinates and the coordinate of the central table entry are less than the distance between its own coordinate and the coordinate of the central table entry, and selects an information table entry with the largest backbone coefficient from these information coordinates, and executes the following operations:

[0107] Step 401: Start;

[0108] Step 402: The wireless node sends a backbone message, the message ID of which is equal to 4, and the node ID is equal to the node ID of the selected information table entry;

[0109] Step 403: The wireless node that receives the backbone message determines whether its own node ID is equal to the node ID in the backbone message. If it is equal, it executes step 404, otherwise it executes step 405;

[0110] Step 404: The wireless node that receives the backbone message marks itself as a backbone node and executes steps 201 - 205;

[0111] Step 405: End.

[0112] The sensing nodes elect backbone nodes through the above process, so that each sensing node has neighbor backbone nodes.

[0113] Figure 6a and Figure 6bSchematic diagram of the process for constructing a data set according to the present invention. Each wireless node stores a data set table, and each table entry includes a data set and a timestamp; in the initial state, it is an empty table; the data set is an empty set or consists of elevator signals;

[0114] Each wireless node stores a temporary data set table, and each temporary data set table entry includes a data set and a timestamp; in the initial state, it is an empty table;

[0115] Each wireless node stores a wireless table, and each wireless table includes a timestamp and a lifetime; in the initial state, it is an empty table;

[0116] A wireless message includes a message ID, a hop count, and a timestamp;

[0117] A data set message includes a message ID, a timestamp, and a data set;

[0118] The central node executes the following process to construct a data set:

[0119] Step 501: Start;

[0120] Step 502: The central node sets the clock and sends a wireless message. The message ID of this message is 5, the hop count is equal to a preset value, the value range is 2 - 20, and the timestamp is the current time;

[0121] For a wireless node that receives the wireless message, if it is a sensing node, it executes Step 508; otherwise, it executes Step 504;

[0122] Step 504: The backbone node that receives the wireless message decrements the hop count in the wireless message by 1;

[0123] Step 505: If the hop count in the wireless message is equal to 0, it executes Step 508; otherwise, it executes Step 506;

[0124] For the backbone node that receives the wireless message, if there does not exist a wireless table entry whose timestamp is equal to the timestamp in the wireless message, it executes Step 507; otherwise, it executes Step 509;

[0125] Step 507: The backbone node that receives the wireless message creates a wireless table entry whose timestamp is equal to the timestamp in the wireless message, sets the lifetime to t1 as shown in formula (3), where t2 is equal to the maximum threshold for sending wireless messages, preset in advance, t3 is equal to the maximum threshold for sending data set messages, preset in advance, h1 is the hop count in the wireless message, forwards the wireless message, and executes Step 503;

[0126] t1 = t2×h1 + t3×(h1 + 1) (3)

[0127] Step 508: The wireless node that receives the wireless message sends a data set message. The message ID of this message is 6, the timestamp is equal to the timestamp in the wireless message, and the data set contains the data sensed by itself.

[0128] Step 509: If the central node receives the data set message, execute Step 514; otherwise, execute Step 510.

[0129] Step 510: The backbone node that receives the data set message determines whether there is a wireless entry whose timestamp is equal to the timestamp in the data set message. If it exists, execute Step 511; otherwise, execute Step 517.

[0130] Step 511: The backbone node that receives the data set message determines whether there is a temporary data set entry whose data set and timestamp are respectively equal to the timestamp and data set in the data set message. If it exists, do nothing; otherwise, create a temporary data set entry whose data set and timestamp are respectively equal to the timestamp and data set in the data set message.

[0131] Step 512: The backbone node that receives the data set message selects a wireless entry whose timestamp is equal to the timestamp in the data set message, and determines whether the lifespan of this wireless entry is equal to 0. If so, execute Step 513; otherwise, execute Step 510.

[0132] Step 513: The backbone node that receives the data set message selects a wireless entry whose timestamp is equal to the timestamp in the data set message, deletes this wireless entry, constructs a data set that is equal to the union of the data sets in all temporary data set entries whose timestamps are equal to the timestamp in the data set message, sets the data set of the data set message to the constructed data set, forwards the data set message, and execute Step 509.

[0133] Step 514: The central node that receives the data set message determines whether there is a temporary data set entry whose data set and timestamp are respectively equal to the timestamp and data set in the data set message. If it exists, do nothing; otherwise, create a temporary data set entry whose data set and timestamp are respectively equal to the timestamp and data set in the data set message.

[0134] Step 515: The central node that receives the data set message determines whether the clock has expired, that is, decayed to 0. If so, execute Step 516; otherwise, execute Step 509.

[0135] Step 516: The central node that receives the data set message constructs a data set entry whose timestamp is equal to the timestamp in the data set message, and the data set is equal to the union of the data sets of all temporary data set entries.

[0136] Step 517: End.

[0137] The central node collects the data sensed by each sensing node distributed in the elevator through the above process, so as to perform real-time monitoring.

[0138] Figure 7 It is a schematic diagram of the elevator signal transmission process described in the present invention. Each wireless node stores a temporary table, and the table entry contains a timestamp and a lifetime;

[0139] The transmission message contains a message ID, a node ID, and a timestamp;

[0140] The signal message contains a message ID, a timestamp, and a data set;

[0141] In the case that there is a data set table entry with a timestamp equal to T1 in the central node, the wireless node obtains the elevator signal data set with a timestamp of T1 through the following process:

[0142] Step 601: Start;

[0143] Step 602: The wireless node selects any information table entry with a node type of 1, sends a transmission message, the message ID of this message is 8, the node ID is equal to the node ID in this table entry, and the timestamp is T1;

[0144] Step 603: The wireless node that receives the transmission message determines whether there is a data set table entry whose timestamp is equal to the timestamp in the transmission message. If it exists, execute Step 604, otherwise execute Step 605;

[0145] Step 604: The wireless node that receives the transmission message selects a data set table entry whose timestamp is equal to the timestamp in the transmission message, sends a signal message, the message ID of this message is equal to 9, the timestamp and the data set are respectively equal to the timestamp and the data set in the data set table entry, and execute Step 608;

[0146] Step 605: The wireless node that receives the transmission message determines whether its own node ID is equal to the node ID in the transmission message. If it is equal, execute Step 606, otherwise execute Step 612;

[0147] Step 606: If the wireless node that receives the transmission message has a temporary table entry whose timestamp is equal to the timestamp in the transmission message, execute Step 608, otherwise execute Step 607;

[0148] Step 607: The wireless node that receives the transmission message creates a temporary table entry. The timestamp of this table entry is equal to the timestamp in the transmission message, and the lifespan is equal to the maximum value, which is preset. Select all the information table entries with node type 1. From these information table entries, select an information table entry whose distance between the coordinates and the coordinates of the central table entry is the closest. Set the node ID in the transmission message as the node ID in this information table entry, forward the transmission message, and execute step 603;

[0149] Step 608: If the wireless node that sends the transmission message receives a signal message, execute step 611; otherwise, execute step 609;

[0150] Step 609: The wireless node that receives the signal message determines whether there is a temporary table entry whose timestamp is equal to the timestamp in the signal message. If there is, execute step 610; otherwise, execute step 612;

[0151] Step 610: The wireless node that receives the signal message selects a temporary table entry whose timestamp is equal to the timestamp in the signal message, deletes this temporary table entry, forwards the signal message, and executes step 608;

[0152] Step 611: If the wireless node that sends the transmission message creates a dataset table entry, the timestamp and dataset of this table entry are respectively equal to the timestamp and dataset in the transmission message;

[0153] Step 612: End.

[0154] Through the above process, the wireless node can obtain the elevator parameters in real time for monitoring. Once a potential safety hazard or parameter anomaly is detected, an alarm is triggered.

[0155] Embodiment 1

[0156] Based on the simulation parameters in Table 1, this embodiment simulates an implementation method of an intelligent elevator signal transmission system in the present invention. The performance analysis is as follows: When the length of the inclined elevator is relatively large, the success rate of elevator signal transmission decreases. When the length of the inclined elevator is relatively short, the success rate of elevator signal transmission increases. The average success rate of elevator signal transmission is 99.5%.

[0157] Table 1

[0158]

[0159] The present invention provides an idea for an implementation method of an intelligent elevator signal transmission system. There are many methods and approaches to specifically implement this technical solution. The above description is only a preferred embodiment of the present invention. It should be noted that for those of ordinary skill in the art, without departing from the principle of the present invention, several improvements and refinements can be made, and these improvements and refinements should also be regarded as the protection scope of the present invention. Each component not clearly defined in this embodiment can be implemented using existing technologies.

Claims

1. A method for implementing an intelligent elevator signal transmission system, characterized in that: The system includes a plurality of wireless nodes evenly distributed in the elevator, each of the wireless nodes has a unique coordinate and node ID, the plurality of wireless nodes are configured as a central node, a plurality of sensing nodes and a plurality of backbone nodes, the central node is used to collect data collected by all sensing nodes, the backbone node is used to collect data of neighbor sensing nodes and transmit the data to the central node, and the sensing node is used to collect data; the method includes the following steps: The central node collects signal data by setting a clock and sending a wireless message; wherein the wireless message includes a message ID, a hop count and a timestamp; If the sensing node receives the wireless message, it sends a data set message; and if the backbone node receives the wireless message, it decrements the number of hops in the wireless message by 1, and if the number of hops in the wireless message after decrement is equal to 0, the backbone node sends the data set message; if the number of hops in the wireless message after decrement is greater than 0, and the backbone node does not have a wireless table entry with a timestamp equal to the timestamp in the wireless message, it creates a wireless table entry and forwards the wireless message; wherein the data set message includes a message ID, a timestamp and a data set; The backbone node that receives the data set message forwards the data set message if there is a wireless table entry with a timestamp equal to the timestamp in the data set message, and the lifecycle of the wireless table entry is equal to 0; and the central node that receives the data set message constructs a data set table entry if the clock expires; In the case that the central node has a data set table entry with a timestamp equal to T1, the sensing node or the backbone node obtains the data set by sending a transmission message; wherein the transmission message includes a message ID, a node ID and a timestamp; If the central node that receives the transmission message has a data set table entry with a timestamp equal to the timestamp in the transmission message, then the central node sends a signal message; otherwise, if the node ID of the backbone node is equal to the node ID in the transmission message and there is no temporary table entry with a timestamp equal to the timestamp in the transmission message, then a temporary table entry is created and the transmission message is forwarded; wherein the signal message includes a message ID, a timestamp and a data set; If the backbone node that receives the signal message has a temporary table entry with a timestamp equal to the timestamp in the signal message, it forwards the signal message; if the perception node or backbone node that sends the transmission message receives the signal message, it creates a data set table entry.

2. The method for implementing an intelligent elevator signal transmission system according to claim 1, characterized in that: Each of the wireless nodes also stores a central table, which is initially empty, and the central table entry includes a node ID and coordinates; the method further includes: The central node sends a central message to establish a central table; wherein the central message includes a message ID, a node ID and coordinates, and the message ID of the central message is 1, the node ID is its own node ID, and the coordinates are its own coordinates; If the wireless node that receives the central message does not have a central table entry whose node ID is equal to the node ID in the central message, it clears the central table, creates a central table entry whose node ID and coordinates are respectively equal to the node ID and coordinates in the central message, and forwards the central message.

3. The method for implementing an intelligent elevator signal transmission system according to claim 1, characterized in that: Each of the wireless nodes also stores an information table, wherein the information table items include node ID, node type, coordinates, energy and centrality; wherein the centrality is equal to the number of neighboring wireless nodes of the wireless node, the node type has values ​​of 0 and 1, 0 represents a sensing node, and 1 represents a backbone node; the information table is initially empty; the method further includes: Each of the wireless nodes establishes an information table by sending an elevator message; wherein the elevator message includes a message ID, a node ID, a node type, coordinates and energy, and the message ID of the elevator message is 2, and the node ID, coordinates and energy are respectively equal to its own node ID, node type, coordinates and current energy value; If the neighboring wireless node that receives the elevator message does not have an information table entry whose node ID is equal to the node ID in the elevator message, an information table entry is created, and the node ID, node type, coordinates and energy of the information table entry are respectively equal to the node ID, node type, coordinates and energy in the elevator message, and the centrality is equal to 0.

4. The method for implementing an intelligent elevator signal transmission system according to claim 3, characterized in that: The method further comprises: After the wireless node establishes the information table, it sends a centrality message; wherein the centrality message includes a message ID, a node ID and a centrality, and the message ID of the centrality message is 3, the node ID is equal to its own node ID, and the centrality is equal to the number of its own information table items; The neighbor wireless node that receives the centrality message selects an information table entry whose node ID is equal to the node ID in the centrality message, and sets the centrality of the information table entry as the centrality in the centrality message.

5. The method for implementing an intelligent elevator signal transmission system according to any one of claims 1 to 4, characterized in that: The method further comprises: The wireless node calculates its own backbone coefficient b1 by the following formula; b1=n1×e1(1) Wherein, n1 is the centrality of the wireless node, and e1 is the energy of the node; The wireless node calculates the backbone coefficient b2 of each information table item by the following formula (2), wherein n2 and e2 are equal to the centrality and energy of the information table item, respectively; b2=n2×e2(2) If the backbone coefficient of the wireless node itself is greater than or equal to the backbone coefficient of each information table entry, the wireless node marks itself as a backbone node; If the wireless node is a sensing node and there is no information table entry with a node type of 1, or the wireless node is a backbone node and the distance between the coordinates and the coordinates of the central table entry is greater than the communication radius and there is no information table entry, the node type of the information table entry is 1 and the distance between the coordinates and the coordinates of the central table entry is less than the distance between its own coordinates and the coordinates of the central table entry, the wireless node selects information table entries, the distance between the coordinates of these information table entries and the coordinates of the central table entry is less than the distance between its own coordinates and the coordinates of the central table entry, selects an information table entry from these information coordinates, the backbone coefficient of the information table entry is the largest, and sends a backbone message, the message ID of the message is equal to 4, and the node ID is equal to the node ID of the selected information table entry; If the node ID of the wireless node receiving the backbone message is equal to the node ID in the backbone message, the wireless node marks itself as a backbone node.

6. The method for implementing an intelligent elevator signal transmission system according to claim 5, characterized in that: Each of the wireless nodes also stores a data set table, a temporary data set table, and a wireless table; wherein each data set table entry includes a data set and a timestamp, and is initially an empty table; the data set is an empty set or is composed of elevator signals; each temporary data set table entry includes a data set and a timestamp, and is initially an empty table; each wireless table includes a timestamp and a life cycle; and is initially an empty table; The message ID of the wireless message sent by the central node is 5, the number of hops is equal to the preset value, and the timestamp is the current time: In the data set message sent by the sensing node, the message ID is 6, the timestamp is equal to the timestamp in the wireless message, and the data set contains the data sensed by itself.

7. The method for implementing an intelligent elevator signal transmission system according to any one of claims 1 to 4, characterized in that: In the wireless table entry created by the backbone node that receives the wireless message, the timestamp is equal to the timestamp in the wireless message, and the life cycle is set to t1, as shown in the following formula; t1=t2×h1+t3×(h1+1)(3) Among them, t2 is equal to the maximum threshold for sending wireless messages, which is preset, t3 is equal to the maximum threshold for sending data set messages, which is preset, and h1 is equal to the number of hops in the wireless message.

8. The method for implementing an intelligent elevator signal transmission system according to claim 6, characterized in that: The method further comprises: If the central node receiving the data set message does not have a temporary data set table entry whose data set and timestamp are respectively equal to the timestamp and data set in the data set message, then a temporary data set table entry is created, wherein the data set and timestamp of the temporary data set table entry are respectively equal to the timestamp and data set in the data set message; The backbone node that receives the data set message creates a temporary data set table entry if there is a wireless table entry with a timestamp equal to the timestamp in the data set message, and there is no temporary data set table entry with a data set and a timestamp equal to the timestamp and data set in the data set message respectively; In the data set message forwarded by the backbone node, the data set in the data set message is equal to the union of the data sets in all temporary data set table entries whose timestamp is equal to the timestamp in the data set message; In the data set table entry constructed by the central node, the timestamp is equal to the timestamp in the data set message, and the data set is equal to the data set union of all temporary data set table entries.

9. The method for implementing an intelligent elevator signal transmission system according to claim 1, characterized in that: Each wireless node stores a temporary table, and the table entries of the temporary table include timestamp and life cycle; In a signal message sent by a wireless node that receives the transmission message, the message ID is equal to 9, and the timestamp and the data set are respectively equal to the timestamp and the data set in the data set table entry whose timestamp is equal to the timestamp in the transmission message; In the temporary table entry created by the wireless node that receives the transmission message, the timestamp is equal to the timestamp in the transmission message, and the life cycle is equal to the maximum value. The wireless node selects all information table entries with node type 1, and selects an information table entry from these information table entries, the coordinates of which are closest to the coordinates of the central table entry. In the forwarded transmission message, the node ID is set to the node ID in the information table entry.

10. The method for implementing an intelligent elevator signal transmission system according to claim 1, characterized in that: In the data set table entry created by the wireless node that sends the transmission message, the timestamp and the data set are respectively equal to the timestamp and the data set in the signal message.

Images