Adaptive node addressing method and system for multi-node smart device system

Abstract

The application belongs to the technical field of intelligent monitoring, and provides an adaptive node addressing method and system suitable for a multi-node intelligent device system, which has the technical scheme of receiving an addressing instruction, obtaining a search starting address range; taking the search starting address range and the maximum number of effective devices as inputs, adaptively calculating a fuzzy divide-and-conquer factor for dividing the search range and a fine scanning granularity for fine search under the constraint of the available stack memory size; initializing an address stack, pushing the search starting address range into the address stack, and cyclically executing the following steps: sending a query instruction of the popped top address range of the stack, dynamically matching a corresponding branch processing mode according to the received response, until the address stack is empty, and obtaining the addressing result of each node. The system deployment speed is improved, the communication overhead is reduced, and the stability in a complex environment is enhanced.

Description

Technical Field

[0001] This invention belongs to the field of intelligent monitoring technology, and particularly relates to an adaptive node addressing method and system applicable to multi-node intelligent device systems. Background Technology

[0002] The statements in this section are merely background information related to the present invention and do not necessarily constitute prior art.

[0003] In the field of intelligent device monitoring, with the popularization and development of IoT technology, the number of integrated terminal nodes in the system is increasing daily, and their distribution is becoming more widespread. To achieve effective management, status monitoring, and data collection of massive numbers of nodes, the system must first be able to accurately and efficiently identify and locate each node in the network, i.e., complete node addressing. This process is the fundamental prerequisite for the system to establish communication connections and perform all subsequent monitoring and management operations.

[0004] Currently, common methods for identifying node addresses mainly include the following categories:

[0005] First, manual transcription and data entry: During system deployment or maintenance, operations and maintenance personnel rely on each node to be checked and recorded on-site, and then manually entered into the central management system. This method is not only extremely inefficient and labor-intensive, but also highly susceptible to human error, making it difficult to trace and correct. Furthermore, it is completely unsuitable for the rapid deployment and dynamic scaling requirements of large-scale, distributed nodes.

[0006] Second, full-range traversal query: Within the known address space, starting from the starting address, the system sends query commands to every possible address in strict order and waits for a response to confirm whether a valid node exists at that address. While this method ensures coverage of all nodes theoretically, it requires numerous invalid communication attempts, and the addressing time is directly proportional to the size of the address space. In scenarios with a large address space and sparse actual nodes, the communication overhead is enormous, resulting in slow overall addressing speed and severely impacting the efficiency of system initialization or network recovery.

[0007] Third, simple segmented query: As an improvement on full-range traversal, this method divides the entire address space into several fixed-size intervals and then performs traversal queries by interval. While this helps organize the query process to some extent, its segmentation strategy is often static or empirical, lacking a dynamic optimization mechanism, and still results in a large number of invalid queries. These problems are particularly prominent in complex, unstable, or resource-constrained field environments. Summary of the Invention

[0008] To address at least one of the technical problems mentioned above, this invention provides an adaptive node addressing method and system suitable for multi-node intelligent device systems, which improves system deployment speed, reduces communication overhead, and enhances stability in complex environments.

[0009] To achieve the above objectives, the present invention adopts the following technical solution:

[0010] A first aspect of the present invention provides an adaptive node addressing method suitable for multi-node intelligent device systems, comprising the following steps:

[0011] Receive addressing instructions and obtain the starting address range for the search;

[0012] Using the search start address range and the maximum number of effective devices as input, and under the constraint of the available stack memory size, the fuzzy divide-and-conquer factor for dividing the search range and the fine sweep granularity for refining the search are adaptively calculated.

[0013] Initialize the address stack, push the search starting address range onto the address stack, and execute the following steps in a loop: send query instructions for the popped address range from the top of the stack, dynamically match the corresponding branch processing mode according to the received response, until the address stack is empty, and obtain the addressing results of each node.

[0014] Furthermore, the adaptive calculation process includes the following steps:

[0015] Define the address space length based on the starting address range of the search;

[0016] Based on the available stack memory size Define the stack depth;

[0017] Within the preset fine-sweeping particle size range, find the fine-sweeping particle size that satisfies the optimal termination condition. With divide-and-conquer factors The optimal termination condition is to minimize the total instruction overhead. Minimum, and N and G must satisfy the following constraints: ,in It is an integer. In the formula, For the number of fuzzy scans, , This represents the maximum number of effective devices.

[0018] Furthermore, the step of dynamically matching the corresponding branch processing mode based on the received response includes:

[0019] If no response is received, it is determined that there are no valid nodes in this range, and the cycle continues to the next iteration;

[0020] If a response is received and the verification is correct, the system enters single sign-on mode, sends a confirmation command to the corresponding address, and registers the address after successful confirmation.

[0021] If a response is received but the verification fails, further judgment is made. If the current range length is not greater than the fine scan granularity G, the sequential query confirmation mode is entered, and the individual addresses within the range are queried sequentially. Otherwise, the current addressing range is pushed onto the stack using the divide-and-conquer factor N.

[0022] Furthermore, upon entering single-point confirmation mode, the specific features include:

[0023] Send a single address confirmation command to the responding device and wait for a response. If a matching response is returned, perform address registration and deduplication. After comparing the confirmed valid node address with the registered address for deduplication, store the deduplicated address in the registration address queue and persist the data after the search is completed. If there is no match or the timeout occurs, return to continue to the next loop.

[0024] Furthermore, entering the sequential query confirmation mode involves sequentially querying individual addresses within the range, including:

[0025] If a matching response is received, address registration and deduplication will be performed. The confirmed valid node address will be compared with the registered address for deduplication and then stored in the registration address queue.

[0026] If no matching response is received, the address is incremented and the search continues;

[0027] If the current address exceeds the fine scan granularity range, then enter the fuzzy range investigation mode.

[0028] Furthermore, after entering the fuzzy range screening mode, it includes:

[0029] Send exclusion query commands to the remaining global address range;

[0030] If a response is received, the corresponding remaining address range is pushed onto the address stack, and the divide-and-conquer range search step is returned.

[0031] If no response is received, the addressing is considered complete, data is persisted, and the multi-node intelligent device system is reset to enter normal monitoring mode.

[0032] Furthermore, the method also includes an incremental node addition step, which includes: after the system completes the initial addressing and enters the normal operating state, receiving one or more manually entered new node addresses, directly adding them to the registration address queue and updating the persistent data, without triggering a full range of re-addressing.

[0033] A second aspect of the present invention provides an adaptive node addressing system suitable for multi-node intelligent device systems, comprising:

[0034] The addressing trigger module is used to receive addressing instructions and obtain the search starting address range;

[0035] The parameter adaptive calculation unit is used to adaptively calculate the fuzzy divide-and-conquer factor for dividing the search range and the fine sweep granularity for refining the search, under the constraint of the available stack memory size, taking the search start address range and the maximum number of effective devices as input.

[0036] The node addressing module is used to initialize the address stack, push the search starting address range onto the address stack, and execute the following steps in a loop: send the query command of the popped top address range of the stack, dynamically match the corresponding branch processing mode according to the received response, until the address stack is empty, and obtain the addressing results of each node.

[0037] A third aspect of the present invention provides a computer-readable storage medium.

[0038] A computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the adaptive node addressing method for multi-node intelligent device systems as described above.

[0039] A fourth aspect of the present invention provides a computer device.

[0040] A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the steps of the adaptive node addressing method for multi-node intelligent device systems as described above.

[0041] Compared with the prior art, the beneficial effects of the present invention are:

[0042] This invention provides highly efficient and fast addressing: by using N-division fuzzy scanning to quickly eliminate large areas without nodes, invalid broadcasts are greatly reduced; by adopting a depth-first strategy combined with sequential fine scanning, active nodes can be located and confirmed first. This "coarse-to-fine, in-depth" search strategy optimizes the total instruction overhead, thereby significantly shortening the overall addressing time.

[0043] This invention, through a built-in parameter adaptive calculation unit, can dynamically calculate the optimal divide-and-conquer factor N and fine-scan granularity G based on the specific network scale (address space size, estimated number of nodes) and available system resources (stack memory) for each addressing task, and can automatically and intelligently switch between "range probing" and "sequential fine-scanning" modes. This allows the algorithm to efficiently adapt to network environments of different densities and sizes without manual configuration.

[0044] The entire algorithm's core control flow relies only on two basic lightweight data structures: stack and queue. It does not involve complex models or large caches, has minimal memory footprint, and controllable computational complexity, making it particularly suitable for resource-constrained embedded MCUs or real-time operating system (RTOS) environments.

[0045] High fault tolerance and strong robustness: Multi-level verification and retry mechanisms (such as range query response verification, single point of confirmation, and exception skipping) are designed in the communication link, which can effectively handle situations such as data packet loss, interference, or momentary communication instability, ensuring the reliability and integrity of the addressing process in complex industrial environments.

[0046] Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. Attached Figure Description

[0047] The accompanying drawings, which form part of this invention, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an improper limitation of the invention.

[0048] Figure 1 This is an overall flowchart of the adaptive node addressing method for multi-node intelligent device systems provided in this embodiment of the invention;

[0049] Figure 2 This is an adaptive node addressing and judgment flowchart for multi-node intelligent device systems provided in the embodiments of the present invention. Detailed Implementation

[0050] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0051] It should be noted that the following detailed description is illustrative and intended to provide further explanation of the invention. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0052] It should be noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of exemplary embodiments according to the invention. As used herein, the singular form is intended to include the plural form as well, unless the context clearly indicates otherwise. Furthermore, it should be understood that when the terms "comprising" and / or "including" are used in this specification, they indicate the presence of features, steps, operations, devices, components, and / or combinations thereof.

[0053] Example 1

[0054] like Figure 1 and Figure 2As shown in the figure, this embodiment provides an adaptive node addressing method applicable to a multi-node intelligent device system, including the following steps:

[0055] Step 1: Receive an addressing instruction and obtain the search start address range;

[0056] In this embodiment, the addressing instruction can be issued by a host computer or triggered manually. The obtained search start address range is ;

[0057] Step 2: Take the search start address range and the maximum number of valid devices as inputs, and adaptively calculate the fuzzy divide-and-conquer factor for dividing the search range and the fine-scanning granularity for refined search under the constraint of the available stack memory size;

[0058] The specific adaptive calculation process includes the following steps:

[0059] Step 201: Define the address space length according to the search start address range , expressed as , where Start < End; the maximum number of valid devices is denoted as K;

[0060] Step 202: Define the stack depth according to the available stack memory size , expressed as , where a single address occupies 2 bytes;

[0061] Step 203: Within the preset fine-scanning granularity range such as [2, 10], find the fine-scanning granularity G and the divide-and-conquer factor N that satisfy the following optimal termination condition;

[0062] Among them, the optimal termination condition is to make the total instruction overhead minimum;

[0063] In the formula, is the number of fuzzy scans, , substituting to get:

[0064] ,

[0065] And N and G need to satisfy the constraint condition: , where is an integer, ;

[0066] The finally output fine-scanning granularity G is the smallest g value that satisfies the above constraints, and the divide-and-conquer factor N is the smallest value, expressed as:

[0067] ,

[0068] .

[0069] Step 3: Initialize an address stack, push the search starting address range onto the address stack, and execute the following in a loop: send query instructions for the popped address range from the top of the stack, and dynamically match the corresponding branch processing mode according to the received response, until the address stack is empty;

[0070] Specifically, the steps include the following:

[0071] Step 301: Initialize an address stack, push the search start address range onto the address stack, and check if the address stack is empty;

[0072] If the address stack is not empty, pop the top address range [L,R] and send a query command for that range;

[0073] If the address stack is empty, the addressing ends, the data is persisted, and the system is reset to enter normal monitoring mode.

[0074] Step 302, Loop Execution: Send a query instruction for the popped stack top address range, and dynamically match the corresponding branch processing mode according to the received response;

[0075] If no response is received, it is determined that there are no valid nodes in the range, and the process returns directly to step 301 to continue the next loop.

[0076] If a response is received and the verification is correct, the system enters single sign-on mode, sends a confirmation command to the corresponding address, and registers the address after successful confirmation.

[0077] If a response is received but a verification error is found, further judgment is made. If the current range length is not greater than the fine scan granularity G, the sequential query confirmation mode is entered, and the individual addresses within the range are queried sequentially. Otherwise, the current addressing range is divided into N sub-ranges according to the divide-and-conquer factor N, and these sub-ranges are pushed onto the address stack to continue the search.

[0078] The above technical solution can automatically calculate addressing parameters based on network size and automatically switch between "range probing" and "sequential fine scanning" modes, improving dynamic adaptability. Simultaneously, it quickly locates active node regions using the N-division method, and significantly reduces invalid communication by combining response data verification and fuzzy range exclusion modes. For valid nodes, a depth-first strategy is adopted for node addressing. Furthermore, it supports response verification, retry mechanisms, and exception skipping, adapting to unstable communication scenarios. It uses only lightweight data structures such as stacks and queues, making it suitable for single-task embedded MCU or RTOS environments; and it has low resource consumption.

[0079] In single-point confirmation mode or sequential query confirmation mode, the confirmed valid node address is compared with the registered address to remove duplicates, then stored in the registered address queue, and the data is persistently stored after the search is completed.

[0080] As a further implementation method, entering single-point confirmation mode specifically includes:

[0081] Send a single address confirmation command to the responding device and wait for a response: if a matching response is returned, perform address registration and deduplication, compare the confirmed valid node address with the registered address after deduplication, store it in the registration address queue, and persist the data after the search is completed; if there is no match or timeout, return to step 301 and continue to the next loop.

[0082] As a further implementation method, after entering the sequential query confirmation mode, the specific steps include:

[0083] If a matching response is received, address registration and deduplication are performed. The confirmed valid node address is compared with the registered address for deduplication and then stored in the registration address queue. After the search is completed, the data is persistently stored.

[0084] If no matching response is received, the address is incremented and the search continues;

[0085] If the current address exceeds the fine scan granularity range, a fuzzy range investigation mode will be used.

[0086] Specifically, address registration and deduplication include:

[0087] Upon receiving a valid and matching response, extract the device address and compare it with the queue of registered addresses:

[0088] If the address already exists, discard the duplicate;

[0089] If it is a new address, add it to the address queue.

[0090] Specifically, the fuzzy range screening mode includes:

[0091] Send the remaining range [R,End] exclusion command:

[0092] If a response is received, it means there are still nodes in the remaining range. Return to step 301 to continue the search.

[0093] If no response is received, the addressing is considered complete, data is persisted, and the system is reset to enter normal monitoring mode.

[0094] Furthermore, the current addressing range is divided into N sub-ranges according to the divide-and-conquer factor N, and these sub-ranges are pushed onto the address stack to continue the search. This can be represented as: dividing the current range N into [L, ]…[ ,R];

[0095] The method also includes an incremental node addition step, including:

[0096] After the system completes the initial addressing and enters the normal operating state, it receives one or more manually entered new node addresses, adds them directly to the registered address queue and updates the persistent data, without triggering a full-range re-addressing. This technology allows for the manual addition of new nodes later, avoids repeated full-network scanning, and improves operation and maintenance efficiency.

[0097] Example 2

[0098] This embodiment provides an adaptive node addressing system suitable for multi-node intelligent device systems, including:

[0099] The addressing trigger module is used to receive addressing instructions and obtain the search starting address range;

[0100] The parameter adaptive calculation unit is used to adaptively calculate the fuzzy divide-and-conquer factor for dividing the search range and the fine sweep granularity for refining the search, under the constraint of the available stack memory size, taking the search start address range and the maximum number of effective devices as input.

[0101] The node addressing module is used to initialize the address stack, push the search starting address range onto the address stack, and execute the following steps in a loop: send the query command of the popped top address range of the stack, dynamically match the corresponding branch processing mode according to the received response, until the address stack is empty, and obtain the addressing results of each node.

[0102] Furthermore, the adaptive calculation process includes the following steps:

[0103] Define the address space length based on the starting address range of the search;

[0104] Based on the available stack memory size Define the stack depth;

[0105] Within the preset fine-sweeping particle size range, find the fine-sweeping particle size that satisfies the optimal termination condition. With divide-and-conquer factors The optimal termination condition is to minimize the total instruction overhead. Minimum, and N and G must satisfy the following constraints: ,in It is an integer. In the formula, For the number of fuzzy scans, , This represents the maximum number of effective devices.

[0106] Furthermore, the step of dynamically matching the corresponding branch processing mode based on the received response includes:

[0107] If no response is received, it is determined that there are no valid nodes in that range, and the cycle continues to the next iteration.

[0108] If a response is received and the verification is correct, the system enters single sign-on mode, sends a confirmation command to the corresponding address, and registers the address after successful confirmation.

[0109] If a response is received but the verification fails, further judgment is made. If the current range length is not greater than the fine scan granularity G, the sequential query confirmation mode is entered, and the individual addresses within the range are queried sequentially. Otherwise, the current addressing range is pushed onto the stack using the divide-and-conquer factor N.

[0110] Furthermore, upon entering single-point confirmation mode, the specific features include:

[0111] Send a single address confirmation command to the responding device and wait for a response. If a matching response is returned, perform address registration and deduplication. After comparing the confirmed valid node address with the registered address for deduplication, store the deduplicated address in the registration address queue and persist the data after the search is completed. If there is no match or the timeout occurs, return to continue to the next loop.

[0112] Furthermore, entering the sequential query confirmation mode involves sequentially querying individual addresses within the range, including:

[0113] If a matching response is received, address registration and deduplication will be performed. The confirmed valid node address will be compared with the registered address for deduplication and then stored in the registration address queue.

[0114] If no matching response is received, the address is incremented and the search continues;

[0115] If the current address exceeds the fine scan granularity range, then enter the fuzzy range investigation mode.

[0116] Furthermore, after entering the fuzzy range screening mode, it includes:

[0117] Send exclusion query commands to the remaining global address range;

[0118] If a response is received, the corresponding remaining address range is pushed onto the address stack, and the divide-and-conquer range search step is returned.

[0119] If no response is received, the addressing is considered complete, data is persisted, and the multi-node intelligent device system is reset to enter normal monitoring mode.

[0120] Furthermore, the method also includes an incremental node addition step, which includes: after the system completes the initial addressing and enters the normal operating state, receiving one or more manually entered new node addresses, directly adding them to the registration address queue and updating the persistent data, without triggering a full range of re-addressing.

[0121] It should be noted that the specific implementation of the adaptive node addressing system for multi-node intelligent device systems in this embodiment of the invention is similar to the specific implementation of the adaptive node addressing method for multi-node intelligent device systems in this embodiment of the invention. For details, please refer to the description in the method section. To reduce redundancy, it will not be repeated here.

[0122] Example 3

[0123] This embodiment provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps in the adaptive node addressing method for multi-node intelligent device systems described above.

[0124] Example 4

[0125] This embodiment provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the steps in the adaptive node addressing method for multi-node intelligent device systems described above.

[0126] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of hardware embodiments, software embodiments, or embodiments combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage and optical storage) containing computer-usable program code.

[0127] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0128] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0129] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0130] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc.

[0131] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. An adaptive node addressing method applicable to multi-node intelligent device systems, characterized in that, include: Receive addressing instructions and obtain the starting address range for the search; Using the search starting address range and the maximum number of effective devices as input, and constrained by the available stack memory size, the fuzzy divide-and-conquer factor for dividing the search range and the fine-scan granularity for refining the search are adaptively calculated; the adaptive calculation process includes the following steps: Define the address space length based on the starting address range of the search; Based on the available stack memory size Define the stack depth; Within the preset fine-sweeping particle size range, find the fine-sweeping particle size that satisfies the optimal termination condition. With divide-and-conquer factors The optimal termination condition is to minimize the total instruction overhead. Minimum, and N and G must satisfy the following constraints: Wherein, the final output fine sweep granularity G is the minimum g value that satisfies the above constraints, and the divide-and-conquer factor N is the minimum value that satisfies the above constraints. The value is represented as: ， It is an integer. In the formula, For the number of fuzzy scans, , Where L is the maximum number of valid devices, D is the address space length, and D is the stack depth. Initialize the address stack, push the search starting address range onto the address stack, and repeatedly execute the following steps: send a query command for the popped address range from the top of the stack, dynamically match the corresponding branch processing mode based on the received response, until the address stack is empty, and obtain the addressing results of each node; the step of dynamically matching the corresponding branch processing mode based on the received response includes: If no response is received, it is determined that there are no valid nodes in this range, and the cycle continues to the next iteration; If a response is received and the verification is correct, the system enters single sign-on mode, sends a confirmation command to the corresponding address, and registers the address after successful confirmation. If a response is received but the verification fails, further judgment is made. If the current range length is not greater than the fine scan granularity G, the sequential query confirmation mode is entered, and the individual addresses within the range are queried sequentially. Otherwise, the current addressing range is pushed onto the stack using the divide-and-conquer factor N.

2. The adaptive node addressing method for multi-node intelligent device systems as described in claim 1, characterized in that, After entering single sign-on mode, the specific features include: Send a single address confirmation command to the responding device and wait for a response. If a matching response is returned, perform address registration and deduplication. After comparing the confirmed valid node address with the registered address for deduplication, store the deduplicated address in the registration address queue and persist the data after the search is completed. If there is no match or the timeout occurs, return to continue to the next loop.

3. The adaptive node addressing method for multi-node intelligent device systems as described in claim 1, characterized in that, The sequential query confirmation mode involves sequentially querying individual addresses within the specified range, including: If a matching response is received, address registration and deduplication will be performed. The confirmed valid node address will be compared with the registered address for deduplication and then stored in the registration address queue. If no matching response is received, the address is incremented and the search continues; If the current address exceeds the fine scan granularity range, then enter the fuzzy range investigation mode.

4. The adaptive node addressing method for multi-node intelligent device systems as described in claim 3, characterized in that, After entering the fuzzy range screening mode, it includes: Send exclusion query commands to the remaining global address range; If a response is received, the corresponding remaining address range is pushed onto the address stack, and the divide-and-conquer range search step is returned. If no response is received, the addressing is considered complete, data is persisted, and the multi-node intelligent device system is reset to enter normal monitoring mode.

5. The adaptive node addressing method for multi-node intelligent device systems as described in claim 1, characterized in that, The method also includes an incremental node addition step, which includes: after the system completes the initial addressing and enters the normal operating state, receiving one or more manually entered new node addresses, directly adding them to the registration address queue and updating the persistent data, without triggering a full range of re-addressing.

6. An adaptive node addressing system suitable for multi-node intelligent device systems, characterized in that, include: The addressing trigger module is used to receive addressing instructions and obtain the search starting address range; The parameter adaptive calculation unit takes the search starting address range and the maximum number of effective devices as input, and adaptively calculates the fuzzy divide-and-conquer factor for dividing the search range and the fine sweep granularity for refining the search, under the constraint of the available stack memory size; the adaptive calculation process includes the following steps: Define the address space length based on the starting address range of the search; Based on the available stack memory size Define the stack depth; Within the preset fine-sweeping particle size range, find the fine-sweeping particle size that satisfies the optimal termination condition. With divide-and-conquer factors The optimal termination condition is to minimize the total instruction overhead. Minimum, and N and G must satisfy the following constraints: Wherein, the final output fine sweep granularity G is the minimum g value that satisfies the above constraints, and the divide-and-conquer factor N is the minimum value that satisfies the above constraints. The value is represented as: ， It is an integer. In the formula, For the number of fuzzy scans, , Where L is the maximum number of valid devices, D is the address space length, and D is the stack depth. The node addressing module initializes the address stack, pushes the search starting address range onto the address stack, and repeatedly executes the following steps: sending a query command for the popped address range from the top of the stack, dynamically matching the corresponding branch processing mode based on the received response, until the address stack is empty, and obtaining the addressing results for each node; the step of dynamically matching the corresponding branch processing mode based on the received response includes: If no response is received, it is determined that there are no valid nodes in this range, and the cycle continues to the next iteration; If a response is received and the verification is correct, the system enters single sign-on mode, sends a confirmation command to the corresponding address, and registers the address after successful confirmation. If a response is received but the verification fails, further judgment is made. If the current range length is not greater than the fine scan granularity G, the sequential query confirmation mode is entered, and the individual addresses within the range are queried sequentially. Otherwise, the current addressing range is pushed onto the stack using the divide-and-conquer factor N.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the steps in the adaptive node addressing method for multi-node intelligent device systems as described in any one of claims 1-5.

8. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the steps in the adaptive node addressing method for multi-node intelligent device systems as described in any one of claims 1-5.

Images