Node configuration method and apparatus for network, and device, medium and program product

Abstract

Provided is a node configuration method for a network, the method comprising: configuring respective timeout margins of a plurality of nodes, wherein the timeout margins of the plurality of nodes sequentially decrease in the direction from a master node to a tail node; configuring respective counters of the plurality of nodes, wherein when a slave node corresponding to a counter receives a downlink message from the master node via a network path, a count value of the counter is changed by one step length in the direction exceeding a timeout margin, and when the slave node corresponding to the counter receives an uplink message from the tail node via the network path, the count value of the counter is reset to an initial value; and in response to a count value of a counter of a slave node being greater than or equal to a timeout margin corresponding to the slave node, updating the slave node to a tail node of the network path.

Description

Node configuration method, apparatus, device, medium and program product for network

[0001] This invention claims priority to Chinese patent application number 202311605232.5 filed with the Patent Office of China on November 28, 2023, and entitled “Node configuration method, device, equipment, medium and program product for network”. The entire contents of this application are incorporated herein by reference. Technical Field

[0002] The present disclosure relates to the field of communication technology, and in particular to a node configuration method, apparatus, device, medium, and program product for a network. Background Art

[0003] In a communications network, a network node is a connection point, representing a redistribution point or a communication endpoint. A network node can send, receive, or forward information through a communication channel. Network topology connects many network nodes with communication lines, forming interconnected relationships between each network node within a topological network. In related communications technologies, network nodes may lose connection to the network due to external factors, significantly impacting the stability of the network system. There is significant room for improvement in the configuration of individual network nodes in response to changes in network topology. Summary of the Invention

[0004] It would be advantageous to provide a mechanism that alleviates, mitigates, or even eliminates one or more of the above-mentioned problems.

[0005] According to one aspect of the present disclosure, a node configuration method for a network is provided, the network including multiple nodes, the method including: configuring a timeout margin for each of the multiple nodes, the multiple nodes including a master node, at least one slave node and an end node connected in sequence along a network path, and the timeout margins of the multiple nodes decrease in sequence from the master node to the end node; configuring a counter for each of the multiple nodes, for any one of the counters of at least one slave node, when the slave node corresponding to the counter receives a downlink message from the master node via the network path, the count value of the counter is changed by a step in the direction of exceeding the timeout margin, and when the slave node corresponding to the counter receives an uplink message from the end node via the network path, the count value of the counter is restored to the initial value; and in response to the count value of the counter of one of the at least one slave node being greater than or equal to the timeout margin corresponding to the slave node, updating the slave node to the end node of the network path.

[0006] According to another aspect of the present disclosure, a node configuration device for a network is provided, the network including multiple nodes, the device including: a first module for configuring the timeout margin of each of the multiple nodes, wherein the multiple nodes include a master node, at least one slave node and an end node connected in sequence along a network path, and the timeout margins of the multiple nodes decrease in sequence from the master node to the end node; a second module for configuring the counters of the multiple nodes, wherein, for any one of the counters of at least one slave node, when the slave node corresponding to the counter receives a downlink message from the master node via the network path, the count value of the counter is changed by a step in the direction of exceeding the timeout margin, and when the slave node corresponding to the counter receives an uplink message from the end node via the network path, the count value of the counter is restored to the initial value; and a third module for updating the slave node to the end node of the network path in response to the count value of the counter of one of the at least one slave node being greater than or equal to the timeout margin corresponding to the slave node.

[0007] According to yet another aspect of the present disclosure, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; the memory storing instructions executable by the at least one processor, the instructions being executed by the at least one processor so as to enable the at least one processor to perform the method described in the present disclosure.

[0008] According to yet another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, where the computer instructions are used to cause a computer to execute the method described in the present disclosure.

[0009] According to yet another aspect of the present disclosure, a computer program product is provided, comprising a computer program, which implements the method described in the present disclosure when executed by a processor.

[0010] These and other aspects of the disclosure will be apparent from and elucidated with reference to the embodiments described hereinafter. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] Further details, features and advantages of the present disclosure are disclosed in the following description of exemplary embodiments in conjunction with the accompanying drawings, in which:

[0012] FIG. 1 is a schematic diagram illustrating an example communication network in which the various methods described herein may be implemented, according to an example embodiment.

[0013] FIG2A is a schematic diagram illustrating a communication network in the related art during normal communication;

[0014] FIG2B is a schematic diagram illustrating a complete communication in a communication network in the related art;

[0015] FIG2C is a schematic diagram illustrating a situation in which a network slave node loses connection with a communication network in the related art;

[0016] FIG2D is a schematic diagram illustrating reconfiguration of an end node in the related art;

[0017] FIG3 is a schematic diagram illustrating communications performed by a communication network according to an exemplary embodiment;

[0018] FIG4 is a flowchart illustrating a configuration method of a network node according to another exemplary embodiment;

[0019] FIG5 is a schematic block diagram illustrating a configuration apparatus of a network node according to an exemplary embodiment;

[0020] FIG. 6 illustrates an example configuration of an electronic device that may be used to implement the methods described herein. DETAILED DESCRIPTION

[0021] In this disclosure, unless otherwise specified, the use of terms such as "first" and "second" to describe various elements is not intended to limit the positional relationship, temporal relationship, or importance relationship of these elements. Such terms are only used to distinguish one element from another. In some examples, the first element and the second element may refer to the same instance of the element, while in some cases, based on the context of the description, they may also refer to different instances.

[0022] The terms used in the description of the various examples described in this disclosure are for the purpose of describing specific examples only and are not intended to be limiting. Unless the context clearly indicates otherwise, if the number of elements is not specifically limited, the element can be one or more. As used herein, the term "plurality" means two or more, and the term "based on" should be interpreted as "based at least in part on". In addition, the terms "and / or" and "at least one of..." cover any one of the listed items and all possible combinations.

[0023] Exemplary embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings.

[0024] 1 is a diagram illustrating an example communication network 100 in which various methods described herein may be implemented according to an exemplary embodiment. In this example, the communication network 100 is a communication network for automotive applications, used to implement control of electronic systems in an automobile, but the present disclosure is not limited in this respect.

[0025] Referring to FIG. 1 , the network node 110 is referred to as a master node, and the network nodes 120 through 150 are referred to as slave nodes. Master node 110 may be connected to a central processing unit (CPU), a digital signal processor (DSP), or a microcontroller unit (MCU). Slave nodes 120 through 150 may be connected to corresponding functional units, such as a microphone array, a vibration sensor, an audio codec unit, or an ambient light.

[0026] Master node 110 can configure the operating status of slave nodes 120 through 150 by initiating communication. In one embodiment, the communication is initiated by master node 110. Slave node 150, which is farthest from master node 110, is referred to as the end node, while the remaining slave nodes 120 through 140 are referred to as intermediate nodes. In one embodiment, each node is serially connected over a wired line for data transmission, forming a daisy chain. In another embodiment, the wired line is a coaxial cable, twisted pair cable, or other data bus.

[0027] After the nodes form the communication network 100, in the discovery phase of the network topology logic, each node needs to identify its position in the network and assign an identifier based on the position. In addition, the slave node 150 at the end of the daisy chain needs to identify itself as the end node.

[0028] FIG2A is a schematic diagram illustrating a communication network in the related art during normal communication. As shown in FIG2A , a master node 210 initiates and sends a downlink frame along a network path from nodes 220 to 250, and an end node 250 initiates and sends an uplink frame along a network path from nodes 240 to 220 to the master node 210. In one embodiment, transmission between each node is performed using only a single twisted pair cable, so downlink frames and uplink frames are separated in absolute time. A complete data transmission is called a superframe. A superframe begins with a downlink frame sent from the master node 210, ends with an uplink frame sent from the end node 250, and finally returns to the master node 210.

[0029] FIG2B is a schematic diagram illustrating a complete communication in a communication network in the related art. As shown in FIG2B , during normal transmission, the master node 210 starts to transmit data downward once, and the data is transmitted to the end node 250 via the intermediate nodes 220, 230, and 240, which is called the transmission of a downlink frame. During this period, the intermediate nodes can receive data from the bus or send data to the bus. The end node 250 receives the downlink frame started by the master node 210 and starts transmission to the upstream node. The data is then transmitted to the master node 210 via the intermediate nodes 240, 230, and 220, which becomes the transmission of an uplink frame. The transmission of a superframe is started by the downlink frame sent by the master node 210 and ends when the uplink frame sent by the end node 250 returns to the master node. In the entire communication network, only the end node 250 can start the transmission of the uplink frame.

[0030] During the communication process, a slave node may lose connection with the communication network due to various reasons. Figure 2C is a schematic diagram illustrating a situation in which a network slave node loses connection with the communication network in the related art. As shown in Figure 2C, slave node 240 loses connection with the communication network, resulting in the disconnection of slave node 230 from the slave node 240 and the connection between the end node 250. The node 250 at the back end will also lose the ability to communicate with the master node 210. The devices mounted on the bus can only receive the downlink frames sent by the master node 210, but cannot receive the uplink frames returned by the end node 250. In other words, for the communication network, its end node 250 is lost. At this time, it is required that when a fault occurs and the end node 250 is lost, normal communication can be re-established between the slave nodes 220 and 230 that have not been lost and the master node 210.

[0031] In the related art, when the end node is not reconfigured, it can be seen from the topology of the communication network that there will be no uplink frames in the communication network, and the master node 210 cannot complete the communication with the non-lost node 250.

[0032] In the case of end node reconfiguration in the related art, when an active slave node (slave nodes 220, 230) receives only downlink frames from master node 210 and no uplink frames from end node 250 within a certain threshold of consecutive superframes, the slave node will set itself as the end node. However, a shortcoming of the end node reconfiguration scheme in the related art is that when multiple slave nodes are mounted, if the end node is lost, multiple slave nodes will set themselves as end nodes within the same superframe. Figure 2D is a schematic diagram illustrating the end node reconfiguration in the related art. As shown in Figure 2D, slave node 220, which is closer to master node 210, crosses the threshold earlier than slave node 230, and thus sets itself as end node 220' earlier. This scheme will cause the active slave node 230 downstream to be discarded, which is contrary to the expected situation.

[0033] 3 is a flow chart illustrating a configuration method 300 of a network node according to an exemplary embodiment. The configuration method 300 may be used in, for example, the communication network 100. As shown in FIG3 , the configuration method 300 includes steps 310 to 330.

[0034] In step 310, a timeout margin is configured for each of the plurality of nodes, the plurality of nodes including a master node, at least one slave node and an end node connected in sequence along a network path, and the timeout margins of the plurality of nodes decrease in sequence from the master node to the end node.

[0035] In step 320, counters of multiple nodes are configured. For any counter of at least one slave node, when the slave node corresponding to the counter receives a downlink message from the master node via the network path, the count value of the counter is changed by one step in the direction of exceeding the timeout margin, and when the slave node corresponding to the counter receives an uplink message from the end node via the network path, the count value of the counter is restored to the initial value.

[0036] In step 330 , in response to a count value of a counter of one of the at least one slave node being greater than or equal to a timeout margin corresponding to the slave node, the slave node is updated as an end node of the network path.

[0037] In some examples, the timeout margin is exceeded in an incremental manner, such as by counting from a counter at the node starting at 0 until it increases to exceed the timeout margin.

[0038] In other examples, the timeout margin is exceeded in a decreasing manner, for example, a counter of the slave node starts counting from N until it decreases to exceed the timeout margin.

[0039] In summary, the configuration method 300 of the network node in the exemplary embodiment of the present application configures the timeout margin of each slave node in a decreasing manner along the network path from the master node to the end node. Optionally, a counter is configured in each node. If no downlink message is received and uplink messages are continuously received within a certain period of time, this will cause a node to exceed its timeout margin. Since the timeout margin decreases along the network path, the closer to the end node, the smaller the timeout margin will be, and thus the sooner the timeout margin will be exceeded. Therefore, the configuration method 300 can set the active slave node close to the end node as the new end node earlier, thereby ensuring that enough nodes are in an active state.

[0040] In some exemplary embodiments, the counter is configured with a predetermined number of superframes as the predetermined time interval. For example, 32 consecutive superframes or an absolute time may be set as the predetermined time interval.

[0041] In some exemplary embodiments, configuring the timeout margin of multiple nodes includes: configuring threshold parameters for each of the multiple nodes, wherein the threshold parameters for the multiple nodes decrease or increase in sequence from the main node to the end node, and the threshold parameters for the multiple nodes are positively correlated with the dynamic addresses of the multiple nodes. For example, during the initialization phase of the communication network, the total number of devices / nodes mounted on the bus is queried, and a unique dynamic address is assigned to each node. The threshold parameter is positively correlated with the assigned dynamic address. That is, when the dynamic address decreases in sequence from the main node to the end node, the threshold parameter also decreases in sequence from the main node to the end node. When the dynamic address increases in sequence from the main node to the end node, the threshold parameter also increases in sequence from the main node to the end node.

[0042] In some exemplary embodiments, configuring the timeout margins of the multiple nodes based on the threshold parameters of the multiple nodes includes: taking the sum of the threshold parameters of each of the multiple nodes and the corresponding first value as the timeout margin of each of the multiple nodes. In some examples, the threshold parameters of the multiple nodes decrease in sequence from the main node to the end node, in which case the first values ​​of the multiple nodes can be the same. In other examples, the first values ​​of the multiple nodes can also be different. It is sufficient to ensure that the timeout margins of the multiple nodes decrease in sequence from the main node to the end node.

[0043] In some exemplary embodiments, configuring the timeout margins of the multiple nodes based on the threshold parameters of the multiple nodes includes multiplying the dynamic address threshold parameters of the multiple nodes by the corresponding second value as the timeout margins of the multiple nodes. In some examples, the second values ​​of the multiple nodes can be the same or different. This is sufficient as long as the timeout margins of the multiple nodes decrease in a direction from the master node to the end node.

[0044] In addition to configuring the timeout margin by configuring the threshold parameters of each node as described above, the timeout margin can also be configured by configuring the initial value of each node. In other exemplary embodiments, configuring the timeout margin of multiple nodes includes: configuring the initial values ​​of each of the multiple nodes, the initial values ​​of the multiple nodes decreasing or increasing in sequence from the main node to the end node; configuring the timeout margin of the multiple nodes based on the initial values ​​of the multiple nodes. For example, the initial value of each node can decrease in sequence from the main node to the end node. The timeout margin can be the sum of the initial value and the third value, or the product of the initial value and the fourth value. The configuration of the third value and the fourth value corresponding to each node only needs to ensure that the timeout margin of the multiple nodes decreases in sequence from the main node to the end node.

[0045] In summary, by configuring the threshold parameters or initial values ​​of each node, the timeout margin of each node decreases in sequence from the master node to the end node. Therefore, the active slave node closest to the damaged node can be set as the new end node earlier and start to rewind frames to restore the counters in its upstream nodes to the initial values, thus preserving the activity of all nodes upstream of the damaged node.

[0046] In some exemplary embodiments, the threshold parameter of each of the plurality of nodes is a dynamic address of each of the plurality of nodes.

[0047] In some exemplary embodiments, the method 300 further includes: restoring the count value of the counter of the updated end node to an initial value, and sending an uplink message to the master node via the network path based on the updated end node.

[0048] FIG4 is a flowchart illustrating a configuration method 400 for a network node according to another exemplary embodiment. As shown in FIG4 , each node starts at step 410. During the system initialization phase, the total number of devices mounted on the bus is queried, and a unique dynamic address is assigned to each node. For example, the closer the slave node is to the master node, the higher its dynamic address (for example, the dynamic address of each slave node is assigned in the order of N+1, N, N-1, N-2…). In some examples, the timeout margin within the node is set to the sum of a preset value M (for example, 32) and the dynamic address of the node. Since the dynamic address increases from far to near, the timeout margin of the intermediate node farther away from the master node is smaller.

[0049] In step 420, the current node determines whether it is a slave node. If it is not a slave node, the process proceeds to end process 480. If the current node is a slave node, the process proceeds to step 430, where the current slave node obtains the value of its internal counter.

[0050] In step 440, the current slave node determines whether its counter value is greater than or equal to the timeout margin. If so, the process proceeds to step 470, where the current slave node automatically determines that all downstream nodes have been lost and sets itself as the new end node. Once the current slave node is set as the end node, the counter within the slave node no longer changes.

[0051] If it is less than the timeout margin, the process proceeds to step 450, where the current slave node determines whether an uplink frame has been received. If an uplink frame has been received, the process proceeds to step 452, where the counter inside the current slave node is reset to zero, and the process returns to step 430.

[0052] If no uplink frame is received, the process proceeds to step 460, where the current slave node determines whether a downlink frame has been received. If a downlink frame is received, the process proceeds to step 462, where the current node's counter is incremented by one step, for example, by 1. If no downlink frame is received, the process proceeds to step 490, where the current counter value is retained.

[0053] To summarize, when the slave node with dynamic address N-2 fails and loses its connection to the bus, its downstream nodes (N-3, N-4, etc.) also lose communication with the master node. Devices connected to the bus can only receive downlink frames sent by the master node, but not uplink frames returned by the end nodes. According to node configuration method 400, when the master node sends the (M+(N-1))th frame, the slave node with dynamic address N-1 receives this downlink frame, and its internal counter exceeds the timeout margin (M+(N-1)). At this point, the slave node with dynamic address N and its upstream nodes are still waiting for uplink or downlink frames and do not set themselves as the end nodes. This is because the internal timer (M+(N-1)) of the Nth slave node has not yet exceeded its timeout margin (M+N). Therefore, the active N-1th slave node, the farthest from the master node, is automatically set as the new end node and immediately begins returning uplink frames.

[0054] Since the N-1th slave node or the new end node returns an uplink frame, the internal counters of the remaining slave nodes (N, N+1, etc.) are cleared without exceeding their corresponding timeout margins. Therefore, only the N-1th slave node is set as the end node, and the remaining nodes resume normal communication with the master node.

[0055] As can be seen, the automatic node reconfiguration method according to the embodiments of the present disclosure can transform the remote bus slave node into a new end node without repowering the bus. Furthermore, the active node closest to the damaged node can be set as the end node earlier and begin sending frames back upstream to clear the internal counters of its upstream nodes, thereby preserving all active nodes upstream of the damaged node.

[0056] FIG5 is a schematic block diagram illustrating a configuration apparatus 500 of a network node according to an exemplary embodiment. As shown in FIG5 , the configuration apparatus 500 includes a first module 510 , a second module 520 , and a third module 530 .

[0057] The first module 510 is used to configure the timeout margin of each of the multiple nodes, where the multiple nodes include a master node, at least one slave node and an end node connected in sequence along a network path, and the timeout margins of the multiple nodes decrease in sequence from the master node to the end node.

[0058] The second module 520 is used to configure the respective counters of multiple nodes. For any counter of at least one slave node, when the slave node corresponding to the counter receives a downlink message from the master node via the network path, the count value of the counter is changed by one step in the direction of exceeding the timeout margin, and when the slave node corresponding to the counter receives an uplink message from the end node via the network path, the count value of the counter is restored to the initial value.

[0059] The third module 530 is configured to update a slave node among the at least one slave node as an end node of the network path in response to a count value of a counter of the slave node being greater than or equal to a timeout margin corresponding to the slave node.

[0060] It should be understood that the various modules of the apparatus 500 shown in FIG5 may correspond to the various steps in the method 300 described with reference to FIG3 . Thus, the operations, features, and advantages described above for the method 300 are also applicable to the apparatus 500 and the modules included therein. For the sake of brevity, certain operations, features, and advantages are not described in detail herein.

[0061] While specific functions have been discussed above with reference to specific modules, it should be noted that the functions of the various modules discussed herein may be separated into multiple modules, and / or at least some functions of multiple modules may be combined into a single module. A specific module as discussed herein performing an action may include the specific module itself performing the action, or alternatively, the specific module calling or otherwise accessing another component or module that performs the action (or performs the action in conjunction with the specific module). Thus, a specific module that performs an action may include the specific module itself that performs the action and / or another module that the specific module calls or otherwise accesses to perform the action.

[0062] It should also be understood that various techniques may be described herein in the general context of software and hardware elements or program modules. The various modules described above with respect to FIG. 5 may be implemented in hardware or in hardware combined with software and / or firmware. For example, these modules may be implemented as computer program code / instructions configured to be executed in one or more processors and stored in a computer-readable storage medium. Alternatively, these modules may be implemented as hardware logic / circuits. For example, in some embodiments, one or more of the first module 510, the second module 520, and the third module 530 may be implemented together in a system on a chip (SoC). The SoC may include an integrated circuit chip (which includes a processor (e.g., a central processing unit (CPU), a microcontroller, a microprocessor, a digital signal processor (DSP), etc.), memory, one or more communication interfaces, and / or one or more components in other circuits), and may optionally execute received program code and / or include embedded firmware to perform functions.

[0063] According to one aspect of the present disclosure, an electronic device is provided, comprising at least one processor and a memory communicatively coupled to the at least one processor. The memory stores instructions executable by the at least one processor. The instructions are executed by the at least one processor to enable the at least one processor to perform the steps of any of the method embodiments described above.

[0064] According to one aspect of the present disclosure, a non-transitory computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of any method embodiment described above are implemented.

[0065] According to one aspect of the present disclosure, a computer program product is provided, which includes a computer program. When the computer program is executed by a processor, the steps of any one of the method embodiments described above are implemented.

[0066] Illustrative examples of such an electronic device, non-transitory computer-readable storage medium, and computer program product are described below in conjunction with FIG. 6 .

[0067] FIG6 illustrates an example configuration of an electronic device 600 that can be used to implement the methods described herein. For example, the communication network 100 shown in FIG1 may include an architecture similar to the electronic device 600. The apparatus 500 described above may also be implemented in whole or in part by the electronic device 600 or a similar device or system.

[0068] The electronic device 600 can be a variety of different types of devices. Examples of the electronic device 600 include, but are not limited to, a desktop computer, a server computer, a laptop or netbook computer, a mobile device (e.g., a tablet computer, a cellular or other wireless phone (e.g., a smartphone), a notepad computer, a mobile station), a wearable device (e.g., eyeglasses, a watch), an entertainment device (e.g., an entertainment appliance, a set-top box communicatively coupled to a display device, a game console), a television or other display device, an automobile computer, and the like.

[0069] The electronic device 600 may include at least one processor 602, memory 604, communication interface(s) 606, a display device 608, other input / output (I / O) devices 610, and one or more mass storage devices 612, all capable of communicating with one another, such as via a system bus 614 or other appropriate connection.

[0070] The processor 602 may be a single processing unit or multiple processing units, all of which may include a single or multiple computing units or multiple cores. The processor 602 may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuits, and / or any device that manipulates signals based on operational instructions. Among other capabilities, the processor 602 may be configured to retrieve and execute computer-readable instructions stored in the memory 604, mass storage device 612, or other computer-readable media, such as program code for an operating system 616, program code for application programs 618, program code for other programs 620, and the like.

[0071] The memory 604 and the mass storage device 612 are examples of computer-readable storage media for storing instructions that are executed by the processor 602 to implement the various functions described above. For example, the memory 604 may generally include both volatile memory and non-volatile memory (e.g., RAM, ROM, etc.). In addition, the mass storage device 612 may generally include a hard drive, a solid-state drive, removable media, including external and removable drives, memory cards, flash memory, floppy disks, optical disks (e.g., CDs, DVDs), storage arrays, network attached storage, storage area networks, and the like.

[0072] A plurality of programs may be stored on the mass storage device 612. These programs include an operating system 616, one or more application programs 618, other programs 620, and program data 622, and they may be loaded into the memory 604 for execution. Examples of such applications or program modules may include, for example, computer program logic (e.g., computer program code or instructions) for implementing the following components / functions: the first module 510, the second module 520, the third module 530, the method 300 and / or the method 400 (including any suitable steps of the methods 300, 400), and / or other embodiments described herein.

[0073] 6 as being stored in memory 604 of electronic device 600, operating system 616, application programs 618, other programs 620, and program data 622, or portions thereof, may be implemented using any form of computer-readable media accessible by electronic device 600. As used herein, "computer-readable media" includes at least two types of computer-readable media, namely, computer-readable storage media and communication media.

[0074] One or more communication interfaces 606 are used to exchange data with other devices, such as through a network, direct connection, etc. In some examples, a display device 608 such as a monitor may be included for displaying information and images to the user. Other I / O devices 610 may be devices that receive various inputs from the user and provide various outputs to the user, and may include a touch input device, a gesture input device, a camera, a keyboard, a remote control, a mouse, a printer, an audio input / output device, etc.

[0075] Although the present disclosure has been illustrated and described in detail in the drawings and the foregoing description, such illustration and description are to be considered illustrative and exemplary and not restrictive; the present disclosure is not limited to the disclosed embodiments. Variations to the disclosed embodiments will be understood and effected by those skilled in the art in practicing the claimed subject matter by studying the drawings, the disclosure and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps that are not listed, the indefinite article "a" or "an" does not exclude a plurality, the term "plurality" means two or more, and the term "based on" should be interpreted as "based at least in part on". The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

Claims

1. A node configuration method for a network, the network comprising a plurality of nodes, the method comprising: configuring a timeout margin of each of the plurality of nodes, wherein the plurality of nodes include a master node, at least one slave node, and an end node sequentially connected along a network path, and the timeout margins of the plurality of nodes decrease in sequence from the master node to the end node; configuring respective counters of the plurality of nodes, wherein, for any one of the counters of the at least one slave node, when the slave node corresponding to the counter receives a downlink message from the master node via the network path, the count value of the counter is changed by one step toward a direction exceeding the timeout margin, and when the slave node corresponding to the counter receives an uplink message from the end node via the network path, the count value of the counter is restored to an initial value; and In response to a count value of a counter of one of the at least one slave node being greater than or equal to a timeout margin corresponding to the slave node, the slave node is updated as an end node of the network path.

2. The method of claim 1, wherein: The configuring the timeout margins of the plurality of nodes comprises: configuring threshold parameters of the multiple nodes respectively, wherein the threshold parameters of the multiple nodes are successively decreased or successively increased along the direction from the main node to the end node, wherein the threshold parameters of the multiple nodes respectively are positively correlated with the dynamic addresses of the multiple nodes respectively; Based on the threshold parameters of the plurality of nodes, timeout margins of the plurality of nodes are configured.

3. The method of claim 2, wherein: The configuring the timeout margins of the multiple nodes based on the threshold parameters of the multiple nodes comprises: The sum of the threshold parameters of the multiple nodes and the corresponding first values ​​is taken as the timeout margin of the multiple nodes.

4. The method of claim 3, wherein: The threshold parameters of the plurality of nodes decrease in sequence from the main node to the end node, and the corresponding first values ​​are equal to each other.

5. The method of claim 2, wherein: The configuring the timeout margins of the multiple nodes based on the threshold parameters of the multiple nodes comprises: The products of the threshold parameters of the multiple nodes and the corresponding second values ​​are respectively used as the timeout margins of the multiple nodes.

6. The method of claim 2, wherein: The threshold parameters of each of the plurality of nodes are dynamic addresses of each of the plurality of nodes.

7. The method of claim 1, wherein: The configuring the timeout margins of the plurality of nodes comprises: Configuring initial values ​​of the multiple nodes, wherein the initial values ​​of the multiple nodes decrease or increase in sequence from the main node to the end node; Based on the initial values ​​of the plurality of nodes, timeout margins of the plurality of nodes are configured.

8. The method according to any one of claims 1 to 7, further comprising: The count value of the counter of the updated end node is restored to the initial value, and An uplink message is sent to the master node via the network path based on the updated end node.

9. A node configuration device for a network, the network comprising a plurality of nodes, the device comprising: A first module is used to configure a timeout margin of each of the plurality of nodes, wherein the plurality of nodes include a master node, at least one slave node, and an end node sequentially connected along a network path, and the timeout margins of the plurality of nodes decrease in sequence from the master node to the end node; a second module, configured to configure respective counters of the plurality of nodes, wherein, for any one of the counters of the at least one slave node, when the slave node corresponding to the counter receives a downlink message from the master node via the network path, the count value of the counter is changed by a step size in a direction exceeding the timeout margin, and when the slave node corresponding to the counter receives an uplink message from the end node via the network path, the count value of the counter is restored to an initial value; and The third module is configured to update a slave node among the at least one slave node as an end node of the network path in response to a count value of a counter of the slave node being greater than or equal to a timeout margin corresponding to the slave node.

10. An electronic device comprising: at least one processor; as well as a memory communicatively coupled to the at least one processor; in The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 8.

11. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-8.

12. A computer program product comprising a computer program, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Images