Communication method, apparatus and system

Through the identification information update mechanism of the master node and slave node, the congestion problem caused by repeated reporting during communication is solved, and communication efficiency and network speed are improved.

CN116192964BActive Publication Date: 2025-07-29SUNGROW (SHANGHAI) CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310120834.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-02-15
Publication Date
2025-07-29
Estimated Expiration
2043-02-15

AI Technical Summary

Technical Problem

In the prior art, the communication between the master node and the slave node is likely to cause repeated reporting and communication congestion, resulting in some slave nodes being unable to successfully communicate with the master node, increasing the networking time.

Method used

The master node sends an information query request according to the preset time period, receives the slave node's reply message and updates the identification information, so that the reported slave node no longer reports the identification code when the information query request is received next time. The slave node determines whether it has been reported based on the identification information, and ignores the request if it has been reported.

Benefits of technology

It avoids repeated reporting from nodes, reduces communication congestion, and improves networking efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116192964B_ABST
    Figure CN116192964B_ABST
Patent Text Reader

Abstract

The present invention provides a communication method, apparatus and system. Among them, the master node sends an information query request to the slave node. The slave node determines whether it has reported an identification code to the master node according to the identification information in the information query request. If so, the slave node ignores the request; if not, the slave node reports a response message carrying the identification code to the master node. After receiving the message, the master node obtains the identification code therefrom and updates the identification information according to the identification code, so that when the slave node receives the information query request sent by the master node next time, according to the updated identification information, it will no longer report the identification code to the master node. The slave node in the present invention only needs to report an identification code to the same master node once to mark itself, and will not report the identification code repeatedly, avoiding communication congestion.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of information interaction technologies, and particularly to a communication method, apparatus, and system. Background Art

[0002] In major application systems, multiple master nodes and multiple slave nodes need to be set up for communication to complete the optimization of major functions in the system and the networking process. As downstream devices of the master nodes, the slave nodes need to receive instructions from the master nodes to complete the tasks issued by the master nodes. In the initial stage of networking, each slave node needs to actively search for other slave nodes for communication connection. However, in the prior art, the master nodes cannot obtain the number and related information of the slave nodes. During each search for slave nodes, each slave node will compete to report after receiving relevant instructions, and if the reporting is successful, the communication with the master node is completed.

[0003] Actually, during the reporting process of the slave nodes, due to the differences in communication signals between each slave node and each master node, the slave nodes with strong communication signals may report information to the same master node multiple times, while the slave nodes with poor communication signals may be unable to report information. The slave nodes that report repeatedly and the master nodes that send search instructions repeatedly are likely to cause communication congestion, resulting in the slave nodes with poor communication signals being even more unable to report messages. Therefore, in the prior art, during the communication process between each master node and each slave node, it is easy to cause some slave nodes to fail to communicate with the master node successfully, increasing the networking duration. Summary of the Invention

[0004] In view of this, the present invention provides a communication method, apparatus, and system. Through this method, after a slave node successfully reports its identification code, it will no longer communicate with the master node, avoiding communication congestion caused by repeated reporting.

[0005] A communication method, which is applied to a master node, and the method includes:

[0006] Sending an information query request to multiple slave nodes according to a preset time period, so that each of the slave nodes determines whether to report the identification code of the slave node based on the identification information in the information query request;

[0007] When receiving an acknowledgment message reported by any slave node based on the information query request within a preset reporting limit time, obtaining the identification code of the slave node in the acknowledgment message;

[0008] Based on the identification code, updating the identification information, so that the slave node that has reported the acknowledgment message will no longer report the acknowledgment message to the master node based on the updated identification information when receiving the information query request next time.

[0009] In the above method, optionally, the identification information includes the node query number of the master node and a list of identification codes;

[0010] The node query number is the unique identification number of the master node, used to identify the identity of the master node; the list of identification codes is used to record the identification codes that the master node has received.

[0011] In the above method, optionally, updating the identification information based on the identification code includes:

[0012] Updating the identification code to the list of identification codes in the identification information.

[0013] In the above method, optionally, it further includes:

[0014] When sending the first information query request, starting a preset timer for timing;

[0015] When no response message reported by any slave node is received after sending the information query request multiple times, or when the timing time of the timer exceeds the preset query time, ending the communication process with each of the slave nodes.

[0016] A communication device, which is applied to a master node, and the device includes:

[0017] A sending unit, configured to send information query requests to multiple slave nodes according to a preset time period, so that each of the slave nodes confirms whether to report the identification code of the slave node based on the identification information in the information query request;

[0018] A receiving unit, configured to obtain the identification code of the slave node in the response message when receiving a response message reported by any slave node based on the information query request within a preset reporting limit time;

[0019] An updating unit, configured to update the identification information based on the identification code, so that the slave node that has reported the response message will not report the response message to the master node based on the updated identification information when receiving the information query request next time.

[0020] A communication method, which is applied to a slave node, and the method includes:

[0021] When receiving an information query request sent by a master node, obtaining the identification information and the reporting limit time in the information query request;

[0022] Based on the identification information, determining whether the slave node has reported the identification code of the slave node to the master node;

[0023] If the slave node has reported the identification code of the slave node to the master node, the information query request is ignored;

[0024] If the slave node has not reported the identification code of the slave node to the master node, a response message carrying the identification code is reported to the master node within the reporting limit time.

[0025] For the above method, optionally, determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information includes:

[0026] Obtain the node query number of the master node included in the identification information;

[0027] Determine whether the slave node has recorded the node query number;

[0028] If the slave node has recorded the node query number, it is determined that the slave node has reported the identification code of the slave node to the master node;

[0029] If the slave node has not recorded the node query number, it is determined that the slave node has not reported the identification code of the slave node to the master node.

[0030] For the above method, optionally, it further includes:

[0031] After the slave node reports a response message carrying the identification code to the master node, the node query number of the master node is recorded.

[0032] For the above method, optionally, determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information includes:

[0033] Obtain the identification code list recorded by the master node included in the identification information;

[0034] Query whether the identification code of the slave node is recorded in the identification code list;

[0035] If the identification code of the slave node is already recorded in the identification code list, it is determined that the slave node has reported the identification code of the slave node to the master node;

[0036] If the identification code of the slave node is not recorded in the identification code list, it is determined that the slave node has not reported the identification code of the slave node to the master node.

[0037] For the above method, optionally, it further includes:

[0038] When the slave node receives the information query request for the first time, the identification code of the slave node is generated.

[0039] The above method, optionally, reporting the response message carrying the identification code to the master node within the reporting time limit includes:

[0040] Detect whether the slave node has generated a response message carrying the identification code;

[0041] If the slave node has not generated a response message carrying the identification code, start a preset reporting mechanism and generate a response message carrying the identification code;

[0042] Apply the reporting mechanism to compete for reporting the response message carrying the identification code to the master node within the reporting time limit.

[0043] The above method, optionally, further includes:

[0044] If the slave node does not report the response message to the master node within the reporting time limit, suspend reporting the response message to the master node.

[0045] A communication device, which is applied to a slave node, and the device includes:

[0046] An acquisition unit, configured to acquire the identification information and the reporting time limit in the information query request when receiving an information query request sent by a master node;

[0047] A judgment unit, configured to judge whether the slave node has reported the identification code of the slave node to the master node based on the identification information;

[0048] An execution unit, configured to ignore the information query request if the slave node has reported the identification code of the slave node to the master node;

[0049] A reporting unit, configured to report a response message carrying the identification code to the master node within the reporting time limit if the slave node has not reported the identification code of the slave node to the master node.

[0050] A communication system includes:

[0051] At least one master node and at least one slave node;

[0052] The at least one master node communicates with the at least one slave node and executes any one of the above communication methods applied to the master node.

[0053] The at least one slave node is configured to execute any one of the above communication methods applied to the slave node.

[0054] Compared with the prior art, the present invention has the following advantages:

[0055] The present invention provides a communication method, apparatus and system. Among them, the master node sends an information query request to the slave node. The slave node determines whether it has reported the identification code to the master node according to the identification information in the information query request. If so, the slave node ignores the request; if not, the slave node reports a response message carrying the identification code to the master node. After receiving the message, the master node obtains the identification code therefrom and updates the identification information according to the identification code, so that when the slave node receives the information query request sent by the master node next time, it no longer reports the identification code to the master node according to the updated identification information. The slave node in the present invention only needs to report the identification code to the same master node once to mark itself, and will not report the identification code repeatedly, avoiding communication congestion. Description of the Drawings

[0056] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only the embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained according to the provided drawings.

[0057] Figure 1 It is a flowchart of a communication method applied to the master node provided by an embodiment of the present invention;

[0058] Figure 2 It is a structural diagram of a communication apparatus applied to the master node provided by an embodiment of the present invention;

[0059] Figure 3 It is a flowchart of a communication method applied to the slave node provided by an embodiment of the present invention;

[0060] Figure 4 It is another flowchart of a communication method applied to the slave node provided by an embodiment of the present invention;

[0061] Figure 5 It is yet another flowchart of a communication method applied to the slave node provided by an embodiment of the present invention;

[0062] Figure 6 It is a structural diagram of a communication apparatus applied to the slave node provided by an embodiment of the present invention;

[0063] Figure 7 It is a system module diagram of a communication system provided by an embodiment of the present invention;

[0064] Figure 8 It is an example diagram of the communication between the master node and the slave node provided by an embodiment of the present invention. Detailed Embodiments

[0065] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0066] In the present application, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. The terms "comprising", "including" or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements not only includes those elements, but also includes other elements not expressly listed, or elements inherent to such process, method, article or device. Without further limitation, an element defined by the statement "comprising an..." does not exclude the existence of additional identical elements in the process, method, article or device including the element.

[0067] The present invention can be used in many general or special computing device environments or configurations. For example: personal computers, server computers, handheld devices or portable devices, tablet devices, multi-processor devices, distributed computing environments including any of the above devices or equipment, and so on.

[0068] An embodiment of the present invention provides a communication method, which can be applied to a master node. The method flow chart of the method is as Figure 1 shown, and specifically includes:

[0069] S101: Send an information query request to multiple slave nodes according to a preset time period, so that each slave node confirms whether it needs to report its identification code based on the identification information in the information query request.

[0070] In this embodiment, during network formation, the information query request is sent to the slave node multiple times. The information query request includes identification information and a reporting limit time. The slave node can confirm whether it has reported its identification code to the master node according to the identification information. If it has reported, it ignores the information query request; if not, it can report its identification code to the master node within the reporting limit time. Among them, the identification code is an identifier for the slave node to identify its own site to the master node.

[0071] It should be noted that the master node can send information query requests to all slave nodes within a preset range. A slave node can receive information query requests sent by multiple master nodes at the same time.

[0072] It should also be noted that the identification information includes a node query number and a list of identification codes. The node query number is the unique identification number of the master node, which is used to identify the identity of the master node; the list of identification codes is used to record the identification codes received by the master node.

[0073] It can be understood that after receiving the information query request, the slave node can obtain the node query number and the list of identification codes from the identification information. The slave node can determine whether it has reported the identification code to the master node corresponding to the node query number according to the node query number, or can determine whether the identification code of the slave node is recorded in the list by querying the list of identification codes.

[0074] S102: When receiving an acknowledgment message reported by any slave node based on the information query request within a preset reporting limit time, obtain the identification code of the slave node in the acknowledgment message.

[0075] It should be noted that after the slave node determines that it needs to report the identification code to the master node, it generates an acknowledgment message carrying the identification code and reports the acknowledgment message to the master node within the reporting limit time. The master node obtains the identification code of the slave node from the acknowledgment message.

[0076] S103: Based on the identification code, update the identification information so that the slave node that has reported the acknowledgment message will no longer report the acknowledgment message to the master node according to the updated identification information when receiving the information query request next time.

[0077] It can be understood that after the slave node reports the identification code to the master node, the identification information of the master node changes. When the slave node receives the information query request of the master node again, according to the updated identification information, the slave node will no longer report the identification code to the master node.

[0078] In this embodiment, updating the identification information is specifically to update the identification code to the list of identification codes in the identification information. Each time the master node receives an acknowledgment message reported by a slave node, it obtains the identification code from the message and updates it to the list of identification codes. When sending the information query request again next time, the request includes the updated list of identification codes. After the slave node queries that the updated list of identification codes contains the identification code of the slave node, it will no longer report the acknowledgment message carrying the identification code to the master node.

[0079] It should be noted that after updating the identification information, the node query number of the master node in the identification information will not change. After the slave node reports the acknowledgment message for the first time, it can record the node query number. When the slave node receives the information query request of the master node again, it can determine that the node query number in the updated identification information has been recorded. Therefore, the slave node will no longer report the acknowledgment message carrying the identification code to the master node.

[0080] In an embodiment of the present invention, the master node sends an information query request to multiple slave nodes according to a preset time period. The slave node determines whether it needs to report an identification code based on the identification information in the request. If so, it sends a response message carrying the identification code within the reporting limit time. After receiving the response message, the master node obtains the identification code from it and updates the identification information according to the identification code. When the slave node receives the information query request sent by the master node next time, it can confirm again whether it needs to report the identification code according to the updated identification information. Since the identification information has been updated and the slave node can confirm that it has reported the identification code to the master node, the slave node ignores the information query request and no longer reports the identification code to the master node. By applying the method provided in this embodiment, repeated reporting by the slave node can be avoided, and communication congestion can be avoided.

[0081] In this embodiment, in addition to the repeated reporting by the slave node, communication congestion may also be caused by the master node repeatedly sending information query requests multiple times to search for slave nodes. Therefore, this embodiment also provides the following process, which specifically includes:

[0082] When sending the first information query request, start a preset timer for timing;

[0083] When no response message reported by any slave node is received after sending the information query request multiple times, or when the timing time of the timer exceeds the preset query time, end the communication process with each of the slave nodes.

[0084] It can be understood that when the master node starts to send the first information query request, the timer starts and begins to time. If the timing time exceeds the query time, the master node can stop sending information query requests to each slave node and end the communication process.

[0085] Furthermore, before the timing time does not exceed the query time, the master node may have completed communication with all slave nodes. Therefore, if no response message reported by the slave node is received after sending the information query request multiple times, the communication process can be ended in advance to avoid communication congestion caused by continuously sending requests.

[0086] Corresponding to Figure 1 the method described above, an embodiment of the present invention also provides a communication device for Figure 1 the specific implementation of the method. The communication device provided in the embodiment of the present invention can be applied to the master node, and its structural schematic diagram is as Figure 2 shown, and specifically includes:

[0087] A sending unit 201, configured to send an information query request to multiple slave nodes according to a preset time period, so that each of the slave nodes confirms whether it needs to report the identification code of the slave node based on the identification information in the information query request;

[0088] A receiving unit 202, configured to obtain an identification code of the slave node in the response message when receiving any response message reported by the slave node based on the information query request within a preset reporting limit time.

[0089] An updating unit 203, configured to update the identification information based on the identification code, so that the slave node that has reported the response message does not report the response message to the master node based on the updated identification information when receiving the information query request next time.

[0090] In the device provided by the embodiment of the present invention, the master node sends an information query request to multiple slave nodes according to a preset time period, and the slave node determines whether to report the identification code according to the identification information in the request. If so, a response message carrying the identification code is sent within the reporting limit time. After receiving the response message, the master node obtains the identification code from it and updates the identification information according to the identification code. When the slave node receives the information query request sent by the master node next time, it can confirm again whether to report the identification code according to the updated identification information. Since the identification information has been updated, the slave node can confirm that it has reported the identification code to the master node, so the slave node ignores the information query request and does not report the identification code to the master node anymore. Applying the method provided by this embodiment can avoid repeated reporting of slave nodes and avoid communication congestion.

[0091] The embodiment of the present invention provides a communication method, which can be applied to a slave node. The flowchart of the method is as Figure 3 shown, and specifically includes:

[0092] S301: When receiving an information query request sent by the master node, obtain the identification information and the reporting limit time in the information query request.

[0093] Among them, the identification information includes the node query number of the master node and the identification code list. The node query number is the unique identification number of the master node, used to identify the identity of the master node; the identification code list is used to record the identification codes that the master node has received.

[0094] It should be noted that the slave node can receive information query requests from one or more master nodes simultaneously.

[0095] S302: Based on the identification information, determine whether the slave node has reported the identification code of the slave node to the master node.

[0096] Among them, if the slave node has reported the identification code of the slave node to the master node, execute S303; if the slave node has not reported the identification code of the slave node to the master node, execute S304.

[0097] S303: Ignore the information query request.

[0098] S304: Report a response message carrying the identification code to the master node within the reporting time limit.

[0099] It should be noted that the identification code is the one generated when the slave node first receives the information query request and is used to identify the slave node.

[0100] In the method provided by the embodiment of the present invention, when the slave node receives the information query request sent by the master node, it obtains the identification information and the reporting time limit in the request. Based on the identification information, it determines whether it has reported the identification code to the master node. If so, it can ignore the information query request; otherwise, it reports a response message carrying the identification code to the master node within the reporting time limit. After receiving the response message, the master node obtains the identification code from it and updates the identification information. If the master node sends an information query request next time, the slave node can determine that it has reported the identification code to the master node according to the updated identification information, so the slave node no longer reports the identification code to the master node.

[0101] Applying the method provided by the embodiment of the present invention, the slave node only reports the identification code to the same master node once, avoiding communication congestion caused by repeated reporting.

[0102] In the embodiment of the present invention, referring to the Figure 4 flow chart shown, based on the above S302, a process for determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information may specifically include:

[0103] S401: Obtain the node query number of the master node included in the identification information.

[0104] It should be noted that the identification information includes the node query number of the master node and the identification code list.

[0105] S402: Determine whether the slave node has recorded the node query number.

[0106] Among them, if the slave node has recorded the node query number, S403 is executed; if the slave node has not recorded the node query number, S404 is executed.

[0107] It should be noted that after the slave node reports a response message carrying the identification code to the master node, it records the node query number of the master node. When receiving an information query request sent by the master node with the same node query number next time, the information query request can be ignored.

[0108] S403: Determine that the slave node has reported the identification code of the slave node to the master node.

[0109] S404: Determine that the slave node has not reported the identification code of the slave node to the master node.

[0110] In an embodiment of the present invention, when a slave node receives an information query request sent by a master node, it obtains the node query number of the master node included in the identification information in the request, and determines whether it has sent the identification code of the slave node to the master node based on this. After the slave node successfully sends a response message carrying the identification code to the master node, it records the node query number of the master node, thereby recording that the slave node has reported the identification code to the master node corresponding to this node query number.

[0111] It should be noted that the slave node can receive information query requests sent by multiple master nodes simultaneously. If the slave node needs to report response messages carrying the identification code to multiple master nodes simultaneously, it can send the response message to each master node corresponding to the node query number according to the node query number of the master node.

[0112] In an embodiment of the present invention, referring to the flowchart as shown in Figure 5 Based on the above S302, another process for determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information may specifically include:

[0113] S501: Obtain the list of identification codes recorded by the master node included in the identification information.

[0114] S502: Query whether the identification code of the slave node is recorded in the list of identification codes.

[0115] Among them, if the identification code of the slave node is already recorded in the list of identification codes, then execute S503; if the identification code of the slave node is not recorded in the list of identification codes, then execute S504.

[0116] S503: Determine that the slave node has reported the identification code of the slave node to the master node.

[0117] S504: Determine that the slave node has not reported the identification code of the slave node to the master node.

[0118] In an embodiment of the present invention, when the slave node receives an information query request sent by the master node, it obtains the list of identification codes included in the identification information in the request. Query whether the list contains the identification code of the slave node. If so, it means that the slave node has reported the identification code to the master node, and the slave node can directly ignore the information query request sent by the master node; if not, it means that the slave node has not reported the identification code to the master node, and it reports a response message carrying the identification code to the master node within the reporting limit time.

[0119] It should be noted that after the master node receives the response message reported by the slave node, it obtains the identification code from the message and updates it to the list of identification codes. When sending an information query request next time, it sends the node query number, the updated list of identification codes, and the reporting limit time.

[0120] In an embodiment of the present invention, when a slave node needs to report an identification code, it reports the identification code by carrying it in a reporting response message. Therefore, when the slave node determines that it has not reported the identification code to the master node and needs to report a response message carrying the identification code to the master node within the reporting limit time, the process may specifically include:

[0121] Detect whether the slave node has generated a response message carrying the identification code; if the slave node has not generated a response message carrying the identification code, start a preset reporting mechanism and generate a response message carrying the identification code; apply the reporting mechanism to compete to report the response message carrying the identification code to the master node within the reporting limit time.

[0122] It should be noted that the reporting mechanism may be a CSMA / CA (Carrier Sense Multiple Access with Collision Avoidance, that is, Carrier Sense Multiple Access with Collision Avoidance) mechanism. The reporting mechanism competes to report the response message within the reporting limit time.

[0123] Among them, during the process of the reporting mechanism competing to report the response message, timing starts to determine whether the reporting is successful within the reporting limit time. If the response message is not reported to the chasing node within the reporting limit time, it indicates that the reporting mechanism has failed in the competition and the reporting of the response message to the master node is suspended. After the competition fails, the slave node will not record the node query number of the master node, and the identification code of the slave node will not be recorded in the identification code list of the master node.

[0124] In this embodiment, after the slave node generates a response message, it saves the response message. When the slave node needs to report the identification code to any master node, it can compete to report the response message through the reporting mechanism. The slave node with a stronger communication signal has a greater probability of successfully competing for reporting. However, once the slave node successfully reports the identification code to all master nodes, it will not compete for reporting again to avoid causing communication congestion.

[0125] Corresponding to Figure 3 the method described above, an embodiment of the present invention further provides a communication device for Figure 3 the specific implementation of the method in Figure 6 shown. Specifically, it includes:

[0126] An obtaining unit 601, configured to obtain the identification information and the reporting limit time in the information query request when receiving an information query request sent by the master node;

[0127] A judging unit 602, configured to judge whether the slave node has reported the identification code of the slave node to the master node based on the identification information;

[0128] An execution unit 603, configured to ignore the information query request if the slave node has reported the identification code of the slave node to the master node;

[0129] A reporting unit 604, configured to, if the slave node has not reported the identification code of the slave node to the master node, report a response message carrying the identification code to the master node within the reporting limit time.

[0130] In the device provided by the embodiment of the present invention, when the slave node receives an information query request sent by the master node, it obtains the identification information and the reporting limit time in the request. Based on the identification information, it determines whether it has reported the identification code to the master node. If so, it can ignore the information query request; otherwise, it reports a response message carrying the identification code to the master node within the reporting limit time. After receiving the response message, the master node obtains the identification code from it and updates the identification information. If the master node sends an information query request next time, the slave node can determine that it has reported the identification code to the master node according to the updated identification information, so the slave node no longer reports the identification code to the master node.

[0131] By applying the device provided by the embodiment of the present invention, the slave node only reports the identification code to the same master node once, avoiding communication congestion caused by repeated reporting.

[0132] The specific implementation processes and their derivative methods of the above embodiments are all within the protection scope of the present invention.

[0133] The present invention further provides a communication system, the system module diagram of which is shown in FIG. 7, and specifically includes:

[0134] At least one master node 701 and at least one slave node 702;

[0135] The at least one master node 701 communicates with the at least one slave node 702 and executes any one of the following communication methods:

[0136] Send information query requests to multiple slave nodes according to a preset time period, so that each slave node confirms whether it needs to report the identification code of the slave node based on the identification information in the information query request;

[0137] When receiving a response message reported by any slave node based on the information query request within the preset reporting limit time, obtain the identification code of the slave node in the response message;

[0138] Based on the identification code, update the identification information, so that the slave node that has reported the response message no longer reports the response message to the master node based on the updated identification information when receiving an information query request next time.

[0139] In the above method, optionally, the identification information includes the node query number of the master node and a list of identification codes;

[0140] The node query number is the unique identification number of the master node, used to identify the identity of the master node; the list of identification codes is used to record the identification codes received by the master node.

[0141] In the above method, optionally, updating the identification information based on the identification code includes:

[0142] Updating the identification code to the list of identification codes in the identification information.

[0143] In the above method, optionally, it further includes:

[0144] When sending the first information query request, start a preset timer for timing;

[0145] When no response message reported by any slave node is received after sending the information query request multiple times, or when the timing time of the timer exceeds the preset query time, end the communication process with each slave node.

[0146] The at least one slave node is used to execute any one of the following communication methods:

[0147] When receiving an information query request sent by the master node, obtain the identification information and the reporting limit time in the information query request;

[0148] Based on the identification information, determine whether the slave node has reported the identification code of the slave node to the master node;

[0149] If the slave node has reported the identification code of the slave node to the master node, ignore the information query request;

[0150] If the slave node has not reported the identification code of the slave node to the master node, report a response message carrying the identification code to the master node within the reporting limit time.

[0151] In the above method, optionally, determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information includes:

[0152] Obtain the node query number of the master node included in the identification information;

[0153] Determine whether the slave node has recorded the node query number;

[0154] If the slave node has recorded the node query number, determine that the slave node has reported the identification code of the slave node to the master node;

[0155] If the slave node does not record the node query number, it is determined that the slave node has not reported the identification code of the slave node to the master node.

[0156] Optionally, the above method further includes:

[0157] After the slave node reports the response message carrying the identification code to the master node, the slave node records the node query number of the master node.

[0158] Optionally, for the above method, determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information includes:

[0159] Obtain the list of identification codes recorded by the master node included in the identification information;

[0160] Query whether the identification code of the slave node is recorded in the list of identification codes;

[0161] If the identification code of the slave node is already recorded in the list of identification codes, it is determined that the slave node has reported the identification code of the slave node to the master node;

[0162] If the identification code of the slave node is not recorded in the list of identification codes, it is determined that the slave node has not reported the identification code of the slave node to the master node.

[0163] Optionally, the above method further includes:

[0164] When the slave node receives the information query request for the first time, generate the identification code of the slave node.

[0165] Optionally, for the above method, reporting the response message carrying the identification code to the master node within the reporting time limit includes:

[0166] Detect whether the slave node has generated a response message carrying the identification code;

[0167] If the slave node has not generated a response message carrying the identification code, start a preset reporting mechanism and generate a response message carrying the identification code;

[0168] Apply the reporting mechanism to compete to report the response message carrying the identification code to the master node within the reporting time limit.

[0169] Optionally, the above method further includes:

[0170] If the slave node does not report the response message to the master node within the reporting time limit, suspend reporting the response message to the master node.

[0171] Based on the above embodiments, the communication system provided by the present invention can be applied to a solar photovoltaic power generation system equipped with a power optimizer. In this solar photovoltaic power generation system, the inverter and the optimizer communicate through Power Line Communication (PLC). Among them, the inverter contains a PLC master node controller, and the optimizer is a slave node of the PLC.

[0172] Refer to Figure 8 , with the inverter as the master node and the optimizer as the slave node, the communication method between the master node and the slave node includes the following processes:

[0173] 1) Before the master node starts the automatic search, it first randomly generates a node query number seq_num, and this query number remains unchanged until the end of this automatic search;

[0174] 2) The master node starts the automatic search and sends an information query request discovery_command to all surrounding stations. The discovery_command carries the current seq_num, the maximum timeout time maxseq_time reported by the slave node (i.e., the reporting limit time), and the list conf_list of the slave node identification codes searched in the previous round. For the first time the information query request is sent, the content of conf_list is empty.

[0175] 3) Since the conf_list of the first query request is empty, after receiving the discovery_command, the slave node starts the CSMA / CA mechanism to compete for the reporting information response message response_data and starts timing at the same time; the response_data will carry a generated identification code iden_code to identify its own station. If it is found that the timing reaches maxseq_time and it fails to report successfully due to not winning the competition itself, it stops reporting and waits to report again after receiving the discovery_command next time.

[0176] 4) After the master node receives the response_data reported by the nearby nodes, it records the iden_code of the reporting stations.

[0177] 5) The master node keeps the seq_num unchanged, repackages, and continues to send the discovery_command for discovering broadcast information to all surrounding stations, and at the same time carries the list code_list composed of all the node iden_codes that have been reported successfully in the previous round.

[0178] 6) After the nearby nodes receive the discovery_command, they match the iden_code in the code_list of the identification code list. If their own iden_code is not found, they will report the response_data again. If it is found that their own random_code already exists, they will not report the response_data again. At the same time, mark that the current seq_num has been reported, and if a request message with the same sequence number is received again later, no response will be made.

[0179] 7) After the master node receives the response_data reported by the nearby nodes, it records the iden_code of the reporting site at the same time.

[0180] 8) Repeat the above steps 5 - 7 until there are no slave nodes reporting nearby or the timeout occurs.

[0181] Each embodiment in this specification is described in a progressive manner. The same or similar parts among the embodiments can be referred to each other, and the key point of each embodiment is to illustrate the differences from other embodiments. In particular, for the system or system embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can refer to the partial description of the method embodiments. The systems and system embodiments described above are only illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement it without creative work.

[0182] Professionals can further realize that the units and algorithm steps of each example described in combination with the embodiments disclosed in this article can be implemented by electronic hardware, computer software, or a combination of the two.

[0183] To clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described according to functions in the above description. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professionals can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

[0184] The foregoing description of the disclosed embodiments enables those skilled in the art to practice or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A communication method, characterized in that, The method is applied to a master node, which is an inverter in a solar photovoltaic power generation system equipped with a power optimizer. The method includes: Sending an information query request to multiple slave nodes according to a preset time period, so that each of the slave nodes confirms whether to report the identification code of the slave node based on the identification information in the information query request; the slave node is an optimizer in a solar photovoltaic power generation system equipped with a power optimizer; the identification information includes the node query number and identification code list of the master node; the node query number is the unique identification number of the master node, used to identify the identity of the master node; the identification code list is used to record the identification codes already received by the master node; When receiving an acknowledgment message reported by any slave node based on the information query request within a preset reporting limit time, obtaining the identification code of the slave node in the acknowledgment message; Based on the identification code, updating the identification information, so that the slave node that has reported the acknowledgment message will not report the acknowledgment message to the master node again when receiving the information query request next time based on the updated identification information.

2. The method according to claim 1, wherein The updating the identification information based on the identification code includes: Updating the identification code to the identification code list in the identification information.

3. The method according to claim 1, characterized in that It further includes: When sending the first information query request, starting a preset timer for timing; When no acknowledgment message reported by any slave node is received after sending the information query request multiple times, or when the timing time of the timer exceeds the preset query time, ending the communication process with each of the slave nodes.

4. A communication device, characterized in that, The device is applied to a master node, which is an inverter in a solar photovoltaic power generation system equipped with a power optimizer. The device includes: A sending unit, configured to send an information query request to multiple slave nodes according to a preset time period, so that each of the slave nodes confirms whether to report the identification code of the slave node based on the identification information in the information query request; the slave node is an optimizer in a solar photovoltaic power generation system equipped with a power optimizer; the identification information includes the node query number and identification code list of the master node; the node query number is the unique identification number of the master node, used to identify the identity of the master node; the identification code list is used to record the identification codes already received by the master node; A receiving unit, configured to obtain the identification code of the slave node in the acknowledgment message when receiving an acknowledgment message reported by any slave node based on the information query request within a preset reporting limit time; An updating unit, configured to update the identification information based on the identification code, so that the slave node that has reported the acknowledgment message will not report the acknowledgment message to the master node again when receiving the information query request next time based on the updated identification information.

5. A communication method, characterized in that, The method is applied to a slave node, which is an optimizer in a solar photovoltaic power generation system equipped with a power optimizer. The method includes: When receiving an information query request sent by the master node, obtain the identification information and the reporting limit time in the information query request; the master node is an inverter in a solar photovoltaic power generation system equipped with a power optimizer; the identification information includes the node query number and the identification code list of the master node; the node query number is the unique identification number of the master node, used to identify the identity of the master node; the identification code list is used to record the identification codes received by the master node. Based on the identification information, determine whether the slave node has reported the identification code of the slave node to the master node. If the slave node has reported the identification code of the slave node to the master node, ignore the information query request. If the slave node has not reported the identification code of the slave node to the master node, report a response message carrying the identification code to the master node within the reporting limit time.

6. The method according to claim 5, wherein The determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information includes: Obtain the node query number of the master node included in the identification information. Determine whether the slave node has recorded the node query number. If the slave node has recorded the node query number, determine that the slave node has reported the identification code of the slave node to the master node. If the slave node has not recorded the node query number, determine that the slave node has not reported the identification code of the slave node to the master node.

7. The method according to claim 6, wherein It further includes: After the slave node reports a response message carrying the identification code to the master node, record the node query number of the master node.

8. The method according to claim 5, wherein The determining whether the slave node has reported the identification code of the slave node to the master node based on the identification information includes: Obtain the identification code list recorded by the master node included in the identification information. Query whether the identification code of the slave node is recorded in the identification code list. If the identification code of the slave node is already recorded in the identification code list, determine that the slave node has reported the identification code of the slave node to the master node. If the identification code of the slave node is not recorded in the identification code list, determine that the slave node has not reported the identification code of the slave node to the master node.

9. The method according to claim 5, characterized in that, It further includes: When the slave node receives an information query request for the first time, generate the identification code of the slave node.

10. The method according to claim 5, characterized in that, The reporting a response message carrying the identification code to the master node within the reporting limit time includes: Detect whether the slave node has generated a response message carrying the identification code. If the slave node has not generated a response message carrying the identification code, start a preset reporting mechanism and generate a response message carrying the identification code. Apply the reporting mechanism to compete to report a response message carrying the identification code to the master node within the reporting limit time.

11. The method according to claim 5 or 10, characterized in that, It further includes: If the slave node does not report the response message to the master node within the reporting limit time, suspend reporting the response message to the master node.

12. A communication device, characterized in that, The device is applied to a slave node, and the slave node is an optimizer in a solar photovoltaic power generation system equipped with a power optimizer. The device includes: An acquisition unit, configured to acquire the identification information and the reporting limit time in the information query request when receiving the information query request sent by the master node; the master node is an inverter in a solar photovoltaic power generation system equipped with a power optimizer; the identification information includes the node query number and the identification code list of the master node; the node query number is the unique identification number of the master node, used to identify the identity of the master node; the identification code list is used to record the identification codes received by the master node. A judgment unit, configured to judge whether the slave node has reported the identification code of the slave node to the master node based on the identification information. An execution unit, configured to ignore the information query request if the slave node has reported the identification code of the slave node to the master node. A reporting unit, configured to report a response message carrying the identification code to the master node within the reporting limit time if the slave node has not reported the identification code of the slave node to the master node.

13. A communication system, characterized in that, Comprising: At least one master node and at least one slave node; The at least one master node communicates with the at least one slave node and executes the communication method according to any one of claims 1-3 above; The at least one slave node is configured to execute the communication method according to any one of claims 5-11 above.

Citation Information

Patent Citations

  • Node management method and device

    CN104320459A

  • Method and device for identifying slave nodes by master node applied to RS485 bus

    CN113971152A