Routing method and device with response broadcast

Abstract

The invention discloses a routing method and device with response broadcast, and the method comprises the steps: S1, carrying out routing learning, building a routing hierarchy table between a master node and a slave node, and planning an exclusive time slot with response broadcast for the slave node by the master node according to the routing hierarchy table; s2, initiating response broadcast; s3, setting a timer by the slave node according to the response broadcast; s4, calculating a timing value T0; and S5, sending a response message, when the timing value T0 meets a sending condition, sending the response message to the master node by the slave node, and forming an ordered response sequence in a time domain. According to the method, the same state query frame can be compressed into one broadcast frame, the routing information and the time slot planning are integrated into the broadcast frame, the slave node performs ordered response according to the time slot arrangement, and compared with a traditional polling method, at least half of time is saved; in addition, each response node has an exclusive response time slot, so that the probability of signal collision is reduced, and the communication efficiency is further improved.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a routing method and device for broadcast with response. Background Art

[0002] Power line carrier technology is a communication method that uses power lines as transmission channels to transmit data through high-frequency signals. At the sending end, information is loaded onto the power line through modulation technology and transmitted in the form of a high-frequency carrier; at the receiving end, information is extracted from the power line through demodulation technology.

[0003] With the full development of the era of big Internet of Things, the role of power line carrier communication technology in Internet of Things applications has become increasingly prominent. In the actual operation of business communications, frequent queries on the status information of a large number of devices have become the norm, and higher requirements have been placed on the time efficiency of obtaining responses from all nodes. However, the time-varying characteristics of the power line communication channel bring challenges. The pre-planned path time slots often fail due to changes in channel conditions, which not only prolongs the response time, but may also result in an incomplete number of response frames. Therefore, how to optimize the communication strategy for status queries to adapt to the dynamic changes of the power line channel has become the key to improving the efficiency of Internet of Things applications. Traditional methods usually rely on the master node to poll the slave node for status, combined with pre-planned paths to improve end-to-end communication efficiency.

[0004] However, this method has a significant flaw: each communication starts with almost the same master node query frame, resulting in at least half of the time overhead being redundant. As the number of nodes increases, this time waste will also increase linearly, resulting in low communication efficiency. Summary of the invention

[0005] Based on this, it is necessary to propose a routing method and device with response broadcast to address the above problems, so as to significantly shorten the query time and improve the communication efficiency of query response in a more efficient way.

[0006] To achieve the above object, the present invention adopts the following technical solutions:

[0007] A routing method with answer broadcast, comprising:

[0008] S1: Routing learning: During the service communication process, the master node and the slave node perform routing learning and establish a routing hierarchy table. The master node plans an exclusive time slot for response broadcasting for the slave node according to the routing hierarchy table.

[0009] S2: Initiate a responded broadcast, the master node initiates the responded broadcast to the slave node, carries a response node list and a time slot bitmap when sending a request message, and frames the responded broadcast frame;

[0010] S3: timer setting. After receiving the request message with response broadcast, the slave node determines whether it belongs to the response slave node in the response node list according to the order in the response node list and the time slot of the time slot bitmap. If so, the response timer is set;

[0011] S4: Calculate the timing value T0, by adding the remaining forwarding time T1 of the master node's answered broadcast, the time T2 of the previous answering node, and the time T3 of the previous common service time slot to obtain the timing value T0;

[0012] S5: Send a response message. When the timing value T0 meets the sending condition, the slave node sends the response message to the master node, forming an ordered response sequence in the time domain.

[0013] In one embodiment, the S1 further includes:

[0014] S11, obtain the routing level, calculate the level with the source node from the routing domain of the received data and collect the routing level of the upstream channel;

[0015] S12, routing information exchange, sending the routing level of the current node and the source node to the source node through a service message, completing the routing information exchange between the current node and the target node.

[0016] 3. A routing method with answer broadcast according to claim 1, characterized in that the frame structure of the answer broadcast in S2 includes a routing control field, a normal service time slot interval, a response node list, a time slot bitmap and a request message,

[0017] The routing control domain includes the total forwarding life cycle, the remaining forwarding life cycle, the total forwarding duration and the used forwarding duration, and the routing control domain is used to calculate the starting time of obtaining the response frame;

[0018] The ordinary service time slot is used to process other conventional service communications while the network is executing a broadcast query with a response;

[0019] The answering nodes in the answering node list list all slave node addresses that need to respond to this answering broadcast query;

[0020] The response node is correspondingly provided with a time slot bitmap;

[0021] The request message includes a status query message.

[0022] In one embodiment, the S4 further includes:

[0023] S41, calculating the remaining forwarding time T1 of the master node's response broadcast through the total forwarding time and the used forwarding time in the routing control domain, and the starting time of T1 is set as the starting time of the response frame;

[0024] S42, calculating the duration T2 of the previous response node before the current node according to the response node list and the corresponding time slot bitmap;

[0025] S43, calculating the total duration of all the preceding common service time slots T3;

[0026] S44, calculating and adding the values ​​of T1, T2 and T3 to obtain the timing value T0 of the timer.

[0027] In one embodiment, S5 also includes: the timer of the slave node is preset with response data, and when the timing value T0 meets the timer triggering condition, the slave node sends the response data to the master node, and the time slot from the master node sending the response broadcast frame to the time when the last node completes the response is a sequence of ordered responses.

[0028] A routing device with answer broadcast comprises a processor and a memory, wherein a computer program is stored in the memory, and wherein the computer program can be executed by the processor to implement the method as claimed in any one of claims 1 to 5.

[0029] The routing method with response broadcast proposed in the present invention can compress the same status query frame into a broadcast frame and integrate routing information and time slot planning into it. The slave nodes respond in order according to the time slot arrangement, which saves at least half of the time compared with the traditional polling method. In addition, since each response node has an exclusive response time slot, this not only reduces the probability of signal collision, but also further improves the communication efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0031] in:

[0032] Figure 1 It is a flow chart of a routing method with answer broadcast described in the present invention;

[0033] Figure 2 It is a flowchart of each node route learning of a routing method with answer broadcast described in the present invention;

[0034] Figure 3 It is a schematic diagram of the frame structure of a broadcast message with response in a routing method for broadcast with response described in the present invention;

[0035] Figure 4 It is a method for calculating the timing value T0 of the reply slave node timer in a routing method with reply broadcast described in the present invention;

[0036] Figure 5 It is a schematic diagram of the time slot distribution from the time when a master node sends a broadcast frame with response to the time when the last slave node completes the response in a routing method with response broadcast described in the present invention. DETAILED DESCRIPTION

[0037] In order to facilitate the understanding of the present invention, the present invention is described in more detail below in conjunction with the accompanying drawings and specific embodiments. Unless otherwise defined, all technical and scientific terms used in this specification have the same meaning as those commonly understood by those skilled in the art of the present invention. The terms used in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention.

[0038] To solve the problem in the prior art that each communication almost starts with the same master node query frame, resulting in at least half of the time overhead being redundant and this time waste will increase linearly with the increase in the number of nodes,

[0039] The following will be combined with the attached Figure 1 To Attachment Figure 5 A routing method and device for broadcast with response provided by an embodiment of the present invention are described in detail.

[0040] See also Figure 1 , Figure 1 1 is a flow chart of a routing method with answer broadcast according to an embodiment of the present invention, a routing method with answer broadcast includes:

[0041] S1: Routing learning: During the service communication process, the master node and the slave node perform routing learning and establish a routing hierarchy table. The master node plans an exclusive time slot for response broadcasting for the slave node according to the routing hierarchy table.

[0042] S2: Initiate a responded broadcast, the master node initiates the responded broadcast to the slave node, carries a response node list and a time slot bitmap when sending a request message, and frames the responded broadcast frame;

[0043] S3: timer setting. After receiving the request message with response broadcast, the slave node determines whether it belongs to the response slave node in the response node list according to the order in the response node list and the time slot of the time slot bitmap. If so, the response timer is set;

[0044] S4: Calculate the timing value T0, by adding the remaining forwarding time T1 of the master node's answered broadcast, the time T2 of the previous answering node, and the time T3 of the previous common service time slot to obtain the timing value T0;

[0045] S5: Send a response message. When the timing value T0 meets the sending condition, the slave node sends the response message to the master node, forming an ordered response sequence in the time domain.

[0046] Specifically,

[0047] Routing learning: In the network, all nodes need to continuously perform routing learning during the power line communication process to form a routing hierarchy table. The routing hierarchy table includes the network addresses of the master node and the slave node and the relevant information exchange protocol. The master node extracts and sends the hierarchy information of the slave node from the routing domain of the received data, and saves it in the routing table to form a response node list. Repeat this process. While completing the business data interaction, the latest routing hierarchy information is continuously updated to the routing table to form a routing hierarchy table. The master node plans exclusive time slots for response broadcasts for the slave node based on the routing hierarchy table.

[0048] Initiate a responded broadcast: In this communication mode, after the sender sends information, it expects a response signal (confirmation signal) from the receiver. This response signal indicates that the information has been received or understood. In communication, when the sender sends a message, if the receiver can return a confirmation signal, this communication mode can be regarded as a responded broadcast. Whenever data is sent to a target node, the sending node will first extract the routing hierarchy information of the target node from the routing table, and then pass the routing hierarchy information to the target node by sending a request message to the target node. For example, the master node initiates a responded broadcast to the slave node and carries the response node list and time slot bitmap when sending the request message. Here, the sending node is the master node, and the target node is the slave node, which is also the response node;

[0049] Timer setting: After receiving the request message with reply broadcast, the slave node parses the request message according to the preset frame structure. The slave node compares its own address with the reply node address list one by one according to the order of the list and the time slot of the time slot bitmap to determine whether it is in the address list. If it is in the address list, the reply timer is set;

[0050] Calculation of timing value T0: The remaining forwarding time T1 of the response broadcast, the time T2 of the previous response node, and the normal service time slot T3 are added together to obtain the timing value T0;

[0051] Sending a reply message: When the timing value T0 meets the sending condition, that is, the reply timer expires, the slave node sends the reply message to the master node, forming an ordered reply sequence in the time domain.

[0052] This method can integrate routing information and time slot planning. The slave nodes respond in order according to the time slot arrangement, and the same status query frame can be compressed into a broadcast frame. Each response node has an exclusive response time slot, which reduces the probability of signal collision. Compared with the polling method in the prior art, it saves a lot of time and improves communication efficiency.

[0053] See also Figure 2 , Figure 2 It is a flowchart of each node route learning of a routing method with answer broadcast described in an embodiment of the present invention;

[0054] In one embodiment, the S1 further includes:

[0055] S11, obtain the routing level, calculate the level with the source node from the routing domain of the received data and collect the routing level of the upstream channel;

[0056] S12, routing information exchange, sending the routing level of the current node and the source node to the source node through a service message, completing the routing information exchange between the current node and the target node.

[0057] Specifically,

[0058] Receive business messages on the power line,

[0059] Determine whether the address of the service message is this node.

[0060] If it is the local node, the number of uplink routing levels from the sending node to the local node is calculated based on the total life cycle and remaining life cycle of the message routing domain, and the number of uplink routing levels corresponding to the sending node in the routing table is updated;

[0061] Extract the downlink routing level information carried by the service message routing field, and update the downlink routing level number of the corresponding sending node in the routing table;

[0062] When there is a communication service with other nodes, the upstream routing level of the corresponding node address in the routing table is queried, and this information is filled in the routing field of the message.

[0063] In the network, all nodes need to continuously learn routes during the power line communication process. Furthermore, the node extracts the hierarchical information of the sending node from the routing domain of the received data and saves it in the routing table. Whenever data is sent to the target node, the node first extracts the hierarchical information of the target node from the routing table, and then transmits the routing hierarchical information to the target node by sending a message to the target node. This is repeated, and while completing the business data interaction, the latest routing hierarchical information is continuously updated to the routing table, making the communication between the master node and the slave node faster and improving the communication efficiency.

[0064] See also Figure 3 , Figure 3 is a schematic diagram of a frame structure of a broadcast message with response in a routing method for broadcast with response according to an embodiment of the present invention,

[0065] In one embodiment, the frame structure of the response broadcast in S2 includes a routing control field, a normal service time slot interval, a response node list, a time slot bitmap and a request message.

[0066] The routing control domain includes the total forwarding life cycle, the remaining forwarding life cycle, the total forwarding duration and the used forwarding duration, and the routing control domain is used to calculate the starting time of obtaining the response frame;

[0067] The ordinary service time slot is used to process other conventional service communications while the network is executing a broadcast query with a response;

[0068] The answering nodes in the answering node list list all slave node addresses that need to respond to this answering broadcast query;

[0069] The response node is correspondingly provided with a time slot bitmap;

[0070] The request message includes a status query message.

[0071] Specifically,

[0072] The routing control field carries key forwarding control information to ensure the effective transmission of data packets in the network. The routing control field includes the total forwarding life cycle, the remaining forwarding life cycle, the total forwarding time, and the used forwarding time.

[0073] The total forwarding lifecycle defines the maximum allowed number of times or time that a data packet is forwarded in the network. The remaining forwarding lifecycle is used to update the number of times or time that a data packet has been forwarded in real time in order to control its further forwarding behavior. The total forwarding duration is used to set the total transmission time of the data packet from the source node to the destination. The used forwarding duration is used to record the forwarding time consumed by the data packet, which helps to estimate the end time of the broadcast frame.

[0074] Normal service time slots are used to process other regular service communications while the network is executing answered broadcast queries. By setting specific time slots, the network can still process other regular service communications while executing answered broadcast queries, thereby improving the overall efficiency and flexibility of the network.

[0075] The reply node list lists all slave node addresses that need to respond to this reply broadcast query. Only the nodes in the list can send replies. This design ensures the orderliness and security of communication, which is conducive to shortening communication time and improving communication efficiency.

[0076] The corresponding time slot bitmap is set for the answering node. The corresponding time slot bitmap: This part accurately controls the reply time slot of each answering node in the form of a bitmap. Each bit corresponds to a answering node, 0 means to allocate a short time slot, and 1 means to allocate a long time slot.

[0077] Order correspondence: The order of the bits strictly corresponds to the order of the nodes in the reply node list, ensuring that the nodes send replies in the predetermined order, thus avoiding communication conflicts.

[0078] The request message includes a status query message. Status query message content: This part contains the specific content that the master node wants to query, and the slave node will reply with the corresponding agreed status value information based on this content.

[0079] The design of this frame structure not only ensures the efficiency and orderliness of network communication, but also effectively reduces communication conflicts through precise time slot management and node behavior control, optimizes the communication process of the master node to query the status of multiple slave nodes, and improves the overall performance of the network.

[0080] See also Figure 4 , Figure 4 A method for calculating a timing value T0 of a response slave node timer in a routing method with response broadcast described in an embodiment of the present invention,

[0081] In one embodiment, the S4 further includes:

[0082] S41, calculating the remaining forwarding time T1 of the master node's response broadcast through the total forwarding time and the used forwarding time in the routing control domain, and the starting time of T1 is set as the starting time of the response frame;

[0083] S42, calculating the duration T2 of the previous response node before the current node according to the response node list and the corresponding time slot bitmap;

[0084] S43, calculating the total duration of all the preceding common service time slots T3;

[0085] S44, calculating and adding the values ​​of T1, T2 and T3 to obtain the timing value T0 of the timer.

[0086] Specifically,

[0087] Calculate the remaining forwarding time T1 of the master node: By subtracting the used forwarding time from the total forwarding time in the routing control domain, the remaining forwarding time broadcast by the master node can be obtained. This time point is set as the starting time of the response frame.

[0088] Calculate the duration T2 of the master node's preceding response node: Based on the response node address list and the corresponding time slot bitmap, the total duration of all slave nodes before the current node can be calculated. This step ensures that each node can send a response frame in the predetermined order and time.

[0089] Calculate the duration T3 of the preceding normal service time slot: Considering other normal service communications that may exist in the network, it is necessary to calculate the total duration of all the preceding normal service time slots. This step ensures that the network can still handle other service communications during the response broadcast process.

[0090] Calculation of the timer's timing value T0: Add the above three durations (remaining forwarding duration T1, duration of the previous response node T2, and duration of the previous ordinary service time slot T3) to get the timer's timing value T0. This timing value T0 determines when the current node starts sending a response frame. Through precise time slot management and node behavior control, communication conflicts can be effectively reduced and communication efficiency can be improved.

[0091] See also Figure 5 , Figure 5 It is a schematic diagram of the time slot distribution from when a master node sends a broadcast frame with response to when the last slave node completes the response in a routing method with response broadcast described in an embodiment of the present invention.

[0092] In one embodiment, S5 also includes: the timer of the slave node is preset with response data, and when the timing value T0 meets the timer triggering condition, the slave node sends the response data to the master node, and the time slot from the master node sending the response broadcast frame to the time when the last node completes the response is a sequence of ordered responses.

[0093] Specifically,

[0094] The slave node sets the timer and quickly prepares the response data. Once the timer is triggered, the response data is immediately sent to the master node. Observe from the global timeline, the time slot distribution from the master node sending a response broadcast frame to the last slave node completing the response. In the initial stage, the master node sends a response broadcast frame, followed by the response frames of each node in the location list. Ordinary business time slots are regularly embedded in the time slot sequence of the response frame. Through this precise timer timing value T0 calculation method, the embodiment of the present invention ensures that the slave node can send the response frame at the correct time point, thereby avoiding communication conflicts and improving the overall efficiency and reliability of the network. This design not only optimizes the network communication process, but also enhances the flexibility and reliability of the network.

[0095] A routing device with reply broadcast includes a processor and a memory, wherein a computer program is stored in the memory, and the computer program can be executed by the processor to implement the method according to any one of claims 1 to 5. The device is used to compress the same status query frame into a broadcast frame to improve communication efficiency.

[0096] In view of the low communication efficiency of the master node polling the slave node in the prior art, the routing method with response broadcast proposed in the embodiment of the present invention can compress the same status query frame into a broadcast frame, and integrate the routing information and time slot planning into it, and the slave node responds in order according to the time slot arrangement. Compared with the traditional polling method, at least half of the time is saved. In addition, since each response node has an exclusive response time slot, this not only reduces the probability of signal collision, but also further improves the communication efficiency.

[0097] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them. Under the concept of the present invention, the technical features in the above embodiments or different embodiments may also be combined, the steps may be implemented in any order, and there are many other changes in different aspects of the present invention as described above, which are not provided in detail for the sake of simplicity. Although the present invention is described in detail with reference to the above embodiments, a person of ordinary skill in the art should understand that the technical solutions described in the above embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A routing method with answer broadcast, characterized in that: include: S1: Routing learning: During the service communication process, the master node and the slave node perform routing learning and establish a routing hierarchy table. The master node plans an exclusive time slot for response broadcasting for the slave node according to the routing hierarchy table. S2: Initiate a responded broadcast, the master node initiates the responded broadcast to the slave node, carries a response node list and a time slot bitmap when sending a request message, and frames the responded broadcast frame; S3: timer setting. After receiving the request message with response broadcast, the slave node determines whether it belongs to the response slave node in the response node list according to the order in the response node list and the time slot of the time slot bitmap. If so, the response timer is set; S4: Calculate the timing value T0, by adding the remaining forwarding time T1 of the master node's answered broadcast, the time T2 of the previous answering node, and the time T3 of the previous common service time slot to obtain the timing value T0; S5: Send a response message. When the timing value T0 meets the sending condition, the slave node sends the response message to the master node, forming an ordered response sequence in the time domain.

2. A routing method for answered broadcast according to claim 1, characterized in that: The S1 further comprises: S11, obtain the routing level, calculate the level with the source node from the routing domain of the received data and collect the routing level of the upstream channel; S12, routing information exchange, sending the routing level of the current node and the source node to the source node through a service message, completing the routing information exchange between the current node and the target node.

3. A routing method for broadcast with response according to claim 1, characterized in that: The frame structure of the response broadcast in S2 includes a routing control field, a normal service time slot interval, a response node list, a time slot bitmap and a request message. The routing control domain includes the total forwarding life cycle, the remaining forwarding life cycle, the total forwarding duration and the used forwarding duration, and the routing control domain is used to calculate the starting time of obtaining the response frame; The ordinary service time slot is used to process other conventional service communications while the network is executing a broadcast query with a response; The reply node list lists all slave node addresses that need to respond to this reply broadcast query; The answering nodes in the answering node list are correspondingly provided with a time slot bitmap; The request message includes a status query message.

4. A routing method for broadcast with response according to claim 3, characterized in that: The S4 further comprises: S41, calculating the remaining forwarding time T1 of the master node's response broadcast through the total forwarding time and the used forwarding time in the routing control domain, and the starting time of T1 is set as the starting time of the response frame; S42, calculating the duration T2 of the previous response node before the current node according to the response node list and the corresponding time slot bitmap; S43, calculating the total duration of all the preceding common service time slots T3; S44, calculating and adding the values ​​of T1, T2 and T3 to obtain the timing value T0 of the timer.

5. A routing method for broadcast with response according to claim 4, characterized in that: The S5 also includes: the timer of the slave node is preset with response data. When the timing value T0 meets the timer triggering condition, the slave node sends the response data to the master node. The time slot from the master node sending the response broadcast frame to the time when the last node completes the response is a sequence of ordered responses.

6. A routing device with answer broadcast, comprising a processor and a memory, wherein a computer program is stored in the memory, characterized in that: The computer program can be executed by a processor to implement the method according to any one of claims 1 to 5.

Images