Implementation method of intelligent elevator signal transmission system
By setting wireless nodes and corresponding node types in the elevator, wireless communication and transmission of elevator control signals is solved, and the problems of high wired transmission costs and high environmental requirements are solved, the installation and use costs of elevators are reduced, and the safe use of elevators is ensured in harsh environments.
Patent Information
- Application Number
- CN202510228074.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-02-28
- Publication Date
- 2025-03-28
- Estimated Expiration
- 2045-02-28
AI Technical Summary
The existing elevator control signals are transmitted in wired mode, which have high installation and use costs and many environmental requirements, and are especially suitable for oblique elevators.
The intelligent elevator signal transmission system is adopted to configure the central node, perception node and backbone node through multiple wireless nodes evenly distributed, and to collect and transmit elevator signal data using wireless communication.
It realizes wireless communication to transmit elevator control signals, reduces the cost of elevator installation and use, ensures safe use of elevators in harsh environments, and has a wide range of application prospects.
Smart Images

Figure CN119706540A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of signal transmission, and in particular to a method for realizing an intelligent elevator signal transmission system. Background Art
[0002] At present, the control signal of the elevator is transmitted by wire. The wired signal transmission has many limitations and has many requirements on the use site, climate and environment of the elevator, especially for inclined elevators, which increases the installation and use cost of the elevator. Therefore, the present invention innovatively proposes to use wireless communication to transmit the elevator control signal, thereby reducing the requirements for the installation and use of the elevator, thereby greatly reducing the installation and use cost of the elevator, and ensuring that the elevator can still be used safely in harsh environments. Summary of the invention
[0003] Purpose of the invention: The technical problem to be solved by the present invention is to provide a method for realizing an intelligent elevator signal transmission system in view of the deficiencies in the prior art.
[0004] Technical solution: The present invention discloses a method for realizing an intelligent elevator signal transmission system, wherein the system comprises a plurality of wireless nodes evenly distributed in the elevator, each of the wireless nodes having a unique coordinate and a node ID, the plurality of wireless nodes being configured as a central node, a plurality of sensing nodes and a plurality of backbone nodes, the central node being used to collect data collected by all sensing nodes, the backbone node being used to collect data from neighboring sensing nodes and transmitting the data to the central node, and the sensing node being used to collect data; the method comprising 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; The wireless node acquires the data set by sending a transmission message; wherein the transmission message includes a message ID, a node ID and a timestamp; If the wireless node receiving the transmission message has a data set table entry with a timestamp equal to the timestamp in the transmission message, then the wireless node 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 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 quantity set; If the wireless 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 wireless node that sends the transmission message receives the signal message, it creates a data set table entry.
[0005] In the method, 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.
[0006] The method further comprises: 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.
[0007] 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.
[0008] 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.
[0009] The method further comprises: 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 perception node or backbone message, the message ID is 6, the timestamp is equal to the timestamp in the wireless message, and the data set contains the data perceived by itself.
[0010] The method further comprises: 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.
[0011] 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.
[0012] The method further comprises: Each wireless node stores a temporary table, the entries of which contain timestamps and life cycles; 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 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.
[0013] The method further comprises: 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 transmission message.
[0014] Beneficial effects: The present invention provides an implementation method of an intelligent elevator signal transmission system, which is applied to various elevators such as inclined elevators. Wireless communication is used to overcome the shortcomings of traditional elevators in transmitting signals by wire. The intelligent elevator signal transmission system does not require human intervention and can still transmit elevator signals through wireless communication in harsh environments, thereby reducing the installation and use costs of elevators and ensuring the safe use of elevators. It has broad application prospects. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments, and the above and / or other advantages of the present invention will become more clear.
[0016] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments, and the above and / or other advantages of the present invention will become more clear.
[0017] Figure 1 It is a flow chart of a method for implementing the intelligent elevator safety monitoring system of the present invention; Figure 2 This is a schematic diagram of the process of establishing a center table according to the present invention; Figure 3 This is a schematic diagram of the process of establishing an information table according to the present invention.
[0018] Figure 4 This is a schematic diagram of the process of obtaining centrality according to the present invention.
[0019] Figure 5 This is a schematic diagram of the backbone node election process described in the present invention.
[0020] Figure 6a and Figure 6b This is a schematic diagram of the process of constructing a data set according to the present invention.
[0021] Figure 7 The figure is a schematic diagram of the elevator signal transmission process of the present invention. DETAILED DESCRIPTION
[0022] In order to enable those skilled in the art to better understand the technical solution of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific implementation methods. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. Based on the described embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work are within the scope of protection of the present invention.
[0023] Unless otherwise specified, the technical terms or scientific terms used in the embodiments of the present invention should be understood by people with ordinary skills in the field to which the present invention belongs. "Including" or "comprising" used in the embodiments of the present invention neither limit the shapes, numbers, steps, actions, operations, components, originals and / or their groups mentioned, nor exclude the appearance 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 number and order of the indicated technical features. Thus, the features defined as "first" and "second" can explicitly or implicitly include one or more of the features. In the description of the embodiments of the present invention, the meaning of "multiple" is two or more, unless otherwise clearly and specifically defined.
[0024] Unless otherwise specifically stated, the relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention. At the same time, it should be understood that for ease of description, the sizes of the various parts shown in the drawings are not drawn according to the actual proportional relationship, and the techniques, methods and devices known to ordinary technicians in the relevant fields may not be discussed in detail, but where appropriate, the techniques, methods and devices shown should be considered as part of the authorized specification. In all 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, so once an item is defined in one drawing, it does not need to be further discussed in subsequent drawings.
[0025] In the description of the embodiments of the present invention, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction 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 representations of the above terms do not necessarily refer to the same embodiments or examples. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in the embodiments of the present invention and the features of the different embodiments or examples, without contradiction.
[0026] Below, the exemplary embodiments according to the present invention will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments of the present invention, and it should be understood that the present invention is not limited to the exemplary embodiments described here.
[0027] Figure 1 The present invention is a flowchart of the implementation method of the intelligent elevator signal transmission system. The system includes multiple wireless nodes evenly distributed in the elevator, each of the wireless nodes has a unique coordinate and node ID, the multiple wireless nodes are configured as a central node, multiple sensing nodes and multiple backbone nodes, the central node is used to collect data collected by all sensing nodes, the backbone node is used to collect data from neighboring sensing nodes and pass 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; The wireless node acquires the data set by sending a transmission message; wherein the transmission message includes a message ID, a node ID and a timestamp; If the wireless node receiving the transmission message has a data set table entry with a timestamp equal to the timestamp in the transmission message, then the wireless node 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 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 quantity set; If the wireless 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 wireless node that sends the transmission message receives the signal message, it creates a data set table entry.
[0028] The present invention provides an implementation method of an intelligent elevator signal transmission system. The implementation method is applied to various elevators such as inclined elevators. Wireless communication is used to overcome the shortcomings of traditional elevators in transmitting signals by wire. The intelligent elevator signal transmission system does not require human intervention and can still transmit elevator signals by wireless communication in harsh environments, thereby reducing the installation and use costs of the elevators and ensuring the safe use of the elevators. The intelligent elevator signal transmission system has broad application prospects.
[0029] Figure 2 The schematic diagram of the process of establishing the central table of the present invention. The system comprises a plurality of wireless nodes evenly distributed in the elevator, and the wireless nodes are divided into a central node, a plurality of sensing nodes and a plurality of backbone nodes; the system has only one central node, which is pre-set and is 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; 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; Each wireless node stores a central table, which is initially empty and contains node ID and coordinates. The central message contains the message ID, node ID and coordinates; The central node executes the following process to establish the central table: Step 101: Start; Step 102: The central node sends a central message, the message ID of the message is 1, the node ID is its own node ID, and the coordinates are its own coordinates; Step 103: If the wireless node that receives the central message has a central table entry, and the node ID of the central table entry is equal to the node ID in the central message, then execute step 105, otherwise execute step 104; Step 104: The wireless node that receives the central message clears the central table, creates a central table entry, the node ID and coordinates of the entry are respectively equal to the node ID and coordinates in the central message, forwards the central message, and executes step 103; Step 105: End.
[0030] The wireless node establishes a center table through the above process and obtains the coordinates and node ID of the center node.
[0031] Figure 3 This is a schematic diagram of the process of establishing an information table according to the present invention. Each wireless node stores an information table, and the information table items include node ID, node type, coordinates, energy and centrality, where the centrality is equal to the number of neighboring wireless nodes of the wireless node, and the node type has a value of 0 and 1, 0 represents a sensing node, and 1 represents a backbone node; the initial state of the information table is an empty table; The elevator message contains the message ID, node ID, node type, coordinates and energy; Each wireless node periodically performs the following process to establish an information table: Step 201: Start; Step 202: The wireless node sends an elevator message, the message ID of which is 2, and the node ID, coordinates and energy are respectively equal to its own node ID, node type, coordinates and current energy value; Step 203: The neighboring 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 so, step 205 is executed, otherwise step 204 is executed; Step 204: The neighboring wireless node that receives the elevator message creates an information table entry, 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; Step 205: End.
[0032] The wireless node obtains the node ID, node type, coordinates and energy value of each neighboring wireless node through the above process.
[0033] Figure 4 The centrality acquisition process diagram of the present invention is shown in FIG. The centrality message includes a message ID, a node ID and a centrality; After the wireless node establishes the information table, it performs the following process: Step 301: Start; Step 302: The wireless node sends a centrality message, the message ID of which 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; 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 the information table entry to the centrality in the centrality message; Step 304: End.
[0034] The wireless node obtains the centrality of each neighboring wireless node through the above process.
[0035] Figure 5 The figure is a schematic diagram of the backbone node selection process of 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; b1=n1×e1(1) Each wireless node calculates the backbone coefficient b2 of each information table entry according to formula (2), where n2 and e2 are equal to the centrality and energy of the information table entry, respectively; b2=n2×e2(2) If its backbone coefficient is greater than or equal to the backbone coefficient of each information table entry, it marks itself as a backbone node and executes steps 201-205; Backbone messages contain message ID and node ID; 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, and the backbone coefficient of the information table entry is the largest, and performs the following operations: Step 401: Start; Step 402: The wireless node 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 item; Step 403: The wireless node receiving the backbone message determines whether its node ID is equal to the node ID in the backbone message. If yes, step 404 is executed; otherwise, step 405 is executed. Step 404: The wireless node that receives the backbone message marks itself as a backbone node and executes steps 201-205; Step 405: End.
[0036] The sensing nodes elect backbone nodes through the above process, so that each sensing node has a neighbor backbone node.
[0037] Figure 6a and Figure 6b This is a schematic diagram of the data set construction process of the present invention. Each wireless node stores a data set table, and each table entry contains a data set and a timestamp; the table is empty in the initial state; the data set is an empty set or consists of elevator signals; Each wireless node stores a temporary data set table, and each temporary data set table entry contains a data set and a timestamp; the table is empty in the initial state; Each wireless node stores a wireless table, each of which contains a timestamp and life cycle; the table is empty in the initial state; Wireless messages contain message ID, hop count, and timestamp; The dataset message contains the message ID, timestamp and dataset; The central node performs the following process to build the data set: Step 501: Start; Step 502: The central node sets the clock and sends a wireless message, the message ID of which is 5, the hop count is equal to the preset value, the value range is 2-20, and the timestamp is the current time; Step 503: If the wireless node receiving the wireless message is a sensing node, execute step 508, otherwise execute step 504; Step 504: The backbone node that receives the wireless message decrements the hop count in the wireless message by 1; Step 505: If the hop count in the wireless message is equal to 0, execute step 508, otherwise execute step 506; Step 506: If the backbone node that receives the wireless message does not have a wireless table entry whose timestamp is equal to the timestamp in the wireless message, then execute step 507; otherwise, execute step 509; Step 507: The backbone node that receives the wireless message creates a wireless table entry, the timestamp of the wireless table entry is equal to the timestamp in the wireless message, and the life cycle is set to t1, as shown in formula (3), where 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, h1 is equal to the number of hops in the wireless message, and the wireless message is forwarded, and step 503 is executed; t1=t2×h1+t3×(h1+1)(3) Step 508: The wireless node that receives the wireless message sends a data set message, the message ID of which is 6, the timestamp of which is equal to the timestamp in the wireless message, and the data set contains the data sensed by itself; Step 509: If the central node receives the data set message, execute step 514, otherwise execute step 510; Step 510: The backbone node that receives the data set message determines whether there is a wireless table entry whose timestamp is equal to the timestamp in the data set message. If so, step 511 is executed; otherwise, step 517 is executed. Step 511: The backbone node that receives the data set message determines whether there is 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. If so, no operation is performed. Otherwise, a temporary data set table entry is created whose data set and timestamp are respectively equal to the timestamp and data set in the data set message. Step 512: The backbone node that receives the data set message selects a wireless table entry whose timestamp is equal to the timestamp in the data set message, and determines whether the life cycle of the wireless table entry is equal to 0. If yes, execute step 513, otherwise execute step 510; Step 513: The backbone node that receives the data set message selects a wireless table entry whose timestamp is equal to the timestamp in the data set message, deletes the wireless table entry, constructs a data set, which is equal to the union of the data sets in all temporary data set table entries whose timestamps are equal to the timestamp in the data set message, sets the data set of the data set message as the constructed data set, forwards the data set message, and executes step 509; Step 514: the central node receiving the data set message determines whether there is 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; if so, no operation is performed; otherwise, a temporary data set table entry is created whose data set and timestamp are respectively equal to the timestamp and data set in the data set message; Step 515: The central node receiving the data set message determines whether the clock has expired, that is, it has decayed to 0. If so, execute step 516; otherwise, execute step 509; Step 516: The central node that receives the data set message constructs a data set table entry, the timestamp of the table entry 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; Step 517: End.
[0038] 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.
[0039] Figure 7 This is a schematic diagram of the elevator signal transmission process of the present invention. Each wireless node stores a temporary table, and the table entry contains a timestamp and a life cycle; The transmission message contains the message ID, node ID and timestamp; The signal message contains a message ID, a timestamp, and a data set; When the central node has a data set table entry with a timestamp equal to T1, the wireless node obtains the elevator signal data set with a timestamp of T1 through the following process: Step 601: Start; Step 602: The wireless node selects any node type 1 information table entry and sends a transmission message, the message ID of the message is 8, the node ID is equal to the node ID in the table entry, and the timestamp is T1; Step 603: The wireless node receiving the transmission message determines whether there is a data set table entry whose timestamp is equal to the timestamp in the transmission message. If so, step 604 is executed; otherwise, step 605 is executed. Step 604: The wireless node receiving the transmission message selects a data set table entry whose timestamp is equal to the timestamp in the transmission message, sends a signal message whose message ID is equal to 9, whose timestamp and data set are respectively equal to the timestamp and data set in the data set table entry, and executes step 608; Step 605: The wireless node that receives the transmission message determines whether its node ID is equal to the node ID in the transmission message. If yes, execute step 606; otherwise, execute step 612. 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, then execute step 608; otherwise, execute step 607; Step 607: The wireless node that receives the transmission message creates a temporary table entry, the timestamp of the table entry is equal to the timestamp in the transmission message, the life cycle is equal to the maximum value, the maximum value is preset, selects all information table entries with node type 1, selects an information table entry from these information table entries, the coordinates of the table entry are closest to the coordinates of the center table entry, sets the node ID in the transmission message to the node ID in the information table entry, forwards the transmission message, and executes step 603; Step 608: If the wireless node that sent the transmission message receives the signal message, execute step 611, otherwise execute step 609; Step 609: The wireless node receiving the signal message determines whether there is a temporary table entry whose timestamp is equal to the timestamp in the signal message. If so, step 610 is executed; otherwise, step 612 is executed. 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 the temporary table entry, forwards the signal message, and executes step 608; Step 611: If the wireless node sending the transmission message creates a data set table entry, the timestamp and data set of the table entry are respectively equal to the timestamp and data set in the transmission message; Step 612: End.
[0040] Through the above process, the wireless node can obtain elevator parameters in real time for monitoring, and once safety hazards or parameter abnormalities are found, an alarm will be issued.
[0041] Example 1 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 inclined elevator is long, the elevator signal transmission success rate decreases, and when the inclined elevator is short, the elevator signal transmission success rate increases, and the average elevator signal transmission success rate is 99.5%.
[0042] Table 1
[0043] The present invention provides an idea for implementing a method for implementing an intelligent elevator signal transmission system. There are many methods and ways to implement the technical solution. The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications should also be considered as the protection scope of the present invention. All components not specified in this embodiment can be implemented by 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; The wireless node acquires the data set by sending a transmission message; wherein the transmission message includes a message ID, a node ID and a timestamp; If the wireless node receiving the transmission message has a data set table entry with a timestamp equal to the timestamp in the transmission message, then the wireless node 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 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 quantity set; If the wireless 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 wireless 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 perception node or backbone message, the message ID is 6, the timestamp is equal to the timestamp in the wireless message, and the data set contains the data perceived 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, the entries of which contain timestamps and life cycles; 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 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 transmission message.
Citation Information
Patent Citations
Routing method of city vehicle-mounted net
CN103036785A
Data transmission method of Internet of Things
CN106713515A
Naming and blockchain record of the internet of things (IoT)
CN110024422A
Topology control message transmission method and device based on Ad Hoc and medium
CN114845255A
802.11 Using a Compressed Reassociation Exchange to Facilitate Fast Handoff
EP1887758A2