WO2017214817A1

WO2017214817A1 - Distributed network message processing method and node

Info

Publication number: WO2017214817A1
Application number: PCT/CN2016/085582
Authority: WO
Inventors: 任智; 王斌
Original assignee: 深圳天珑无线科技有限公司
Priority date: 2016-06-13
Filing date: 2016-06-13
Publication date: 2017-12-21

Abstract

Disclosed are a distributed network message processing method and node. The method comprises: receiving a summary message of a non-local content message sent by a neighbouring area; matching a subscription message with the summary message; if matched, sending the summary message along a path of the subscription message, or sending the subscription message along a path of the summary message. The present invention reduces data transmission overheads.

Description

Message processing method and node of distributed network

[Technical Field]

The present invention relates to the field of communications technologies, and in particular, to a message processing method and a node for a distributed network.

【Background technique】

The mobile Ad Hoc network is a common distributed network. It uses a partitioned structure. The network is divided into multiple mountain sections (English: hill). Each partition includes a hilltop (English: hilltop) node and common node. In the network, after the node generates the content message, the node saves the content message locally and the top node of the partition. When the other partitioned node needs the content message, it generates a corresponding subscription message and sends it to other partition nodes to request the content message. The subscription message must be sent to the source node of the content message or the hilltop node of the source partition to obtain the content message.

However, the node does not know the node where the content message is located in the process of publishing the subscription message. It can only publish the subscription message to different nodes without the target. Therefore, the subscription message may be transmitted to more nodes but still fails to reach the source node or source. The top node of the partition, and thus the content message is not obtained, resulting in a large transmission data overhead.

[Summary of the Invention]

The technical problem to be solved by the present invention is to provide a message processing method and a node of a distributed network, which can reduce data transmission overhead.

To solve the above technical problem, a technical solution adopted by the present invention is to provide a message processing method for a distributed network, the method comprising: receiving a summary message of a non-local content message sent by a neighboring partition; and subscribing the message with And the summary message is matched; if the summary message matches, the summary message is sent along a communication path of the subscription message, or the subscription message is sent along a communication path of the summary message.

The summary message includes a summary of the content message and a partition identifier of the source partition of the content message.

Before the step of matching the subscription message with the summary message, the method further includes: receiving the subscription message; determining whether to match the subscription message with a local content message; if matching with the local content message, Then, the matched content message is returned; otherwise, the step of matching the subscription message with the summary message is performed.

The step of transmitting the summary message along a communication path of the subscription message or the sending the subscription message along a communication path of the summary message further includes: determining the summary if the summary message is matched Whether the partition on the incoming path of the message is included in the neighbor partition of the source partition of the subscribed message; if included in the neighbor partition of the source partition of the subscribed message, the sending path along the incoming message of the subscribed message The summary message is sent; otherwise, the subscription message is sent along the communication path of the summary message.

The step of returning the matched content message includes: determining whether the source partition of the subscription message is included in the neighbor partition; if yes, sending the content message directly to the source partition; otherwise, The incoming message of the subscription message returns the content message.

The step of determining whether the source partition of the subscription message is included in the neighbor partition further includes: extracting a partition identifier of the neighbor partition from a broadcast message of the neighbor node, and performing local storage; and determining the neighbor partition The step of including the source partition of the subscription message includes: matching the partition identifier of the target partition with the locally stored partition identifier; if the matching is successful, determining that the target partition is included in the neighbor partition.

The method further includes: generating a summary message of the local content message; selecting a neighboring node that can reach the neighboring partition from the neighboring node, and sending the notification message to the neighboring node that can reach the neighboring partition .

Before the step of selecting the neighboring node that can be connected to the neighboring partition, the method further includes: determining whether the broadcast message of the neighboring node includes the partition identifier of the neighboring partition or is capable of A path identifier that partitions the neighbor; if so, the neighbor node is marked as a neighbor node that is capable of accessing the neighbor partition.

In order to solve the above technical problem, another technical solution adopted by the present invention is to provide a distributed network node, including: a receiving module, configured to receive a summary message of a non-local content message sent by a neighboring partition; a matching module, The matching message is matched with the summary message; the sending module is configured to send the summary message along a communication path of the subscription message when the subscription message matches the summary message, or the communication along the summary message The path sends a subscription message.

In order to solve the above technical problem, another technical solution adopted by the present invention is to provide a distributed network node, including a transmitter, a receiver, a processor, and a memory, and the processor uses the instruction stored in the memory to use Obtaining: a summary message of the non-local content message sent by the neighbor partition received by the receiver; matching the subscription message with the summary message; if matching with the summary message, following the subscription by the sender The message path of the message is sent by the profile message, or the message is sent by the sender along the message path of the profile message.

In the above solution, after generating the content message, the node sends the summary message of the content message to the neighboring partition, and the node of the neighboring partition further matches the subscription message with the summary message, and directly follows the communication path of the subscription message when matching Sending the summary message, or sending the subscription message along a communication path of the summary message, implementing effective transmission of the subscription message without sending a subscription message without a target, thereby improving the efficiency of searching for the content message and reducing data transmission Overhead.

[Description of the Drawings]

1 is a schematic structural diagram of an embodiment of a distributed network system according to the present invention;

2 is a flowchart of an embodiment of a message processing method of a distributed network according to the present invention;

3 is a partial flow chart of another embodiment of a distributed network message processing method according to the present invention;

4 is a schematic structural diagram of an embodiment of a distributed network node according to the present invention;

FIG. 5 is a schematic structural diagram of another embodiment of a distributed network node according to the present invention.

【detailed description】

The invention will now be described in detail in conjunction with the drawings and embodiments.

First embodiment:

Please refer to FIG. 1. FIG. 1 is a schematic structural diagram of an embodiment of a distributed network system according to the present invention. In this embodiment, the distributed network system 100 includes a plurality of nodes 111. Based on the actual network physical topology, the plurality of nodes 111 are virtualized into at least one mountainous partition (hereinafter also referred to as partition) 110, and the node 111 in the mountainous partition 110 is further divided into at least one mountain node. 111a and the normal node 111b.

Wherein, the mountain node 111a serves as a collection point of the partition 110 message for managing the partition. The node message and the node message processing the other partitions; the normal node 111b is used to forward the message to the hilltop node 111a in the partition 110 by means of a greedy policy or the like. In this embodiment, the hilltop node 111a is the node with the highest connectivity among the partitions 110, and the common node 111b is the node whose connectivity is lower than the hilltop node 111. Of course, in other embodiments, the hilltop node 111a may also be a node whose connectivity is higher than a set value. That is, the partition may contain multiple hilltop nodes.

System 100 is a publish/subscribe system whose nodes can issue subscription messages to the network and obtain corresponding content messages from other nodes. The subscription message is used to request a response, and the content message is used to perform the above response. In a specific application, the content message is a message containing service data, which is equivalent to a data packet; the subscription message is a control message requesting to obtain a content message, which is equivalent to a request packet in the control packet, and may include a source node address and a message. Fields such as identification, content message summary, and more.

In an embodiment, the system 100 logically includes three phases in a sequence:

1) Partition formation stage

After the network starts running, each node 111 periodically broadcasts a heartbeat message within a 1-hop range and receives heartbeat messages from surrounding nodes. Alternatively, node 111 in the network may also perform heartbeat and receive heartbeat messages as described in the sixteenth embodiment below. The heartbeat message is a control message that carries at least a node identifier and an identifier of a partition where the node is located. For example, the heartbeat message carries a node ID, a number of neighbors, a node height value, an ID of a partition where the node is located, and the like. This transceiving operation continues to be performed throughout the network. After waiting for a preset time T (the default value of T can be set to 60s or other values), the node 111 calculates its own node height value parameter according to the following formula:

In the above formula, H _p represents the height value of the node p, N(l, p) represents the set of 1-hop neighbor nodes of the node p (including p itself), and |N(l, q)| represents the 1-hop neighbor node of the node q. Number (including q itself).

The node determines whether it is a mountain node in the following way: if its own height value is higher than the height value of all neighbor nodes, it determines that it is a mountain node, otherwise it is not; the ordinary node regards the neighbor node with the highest height value as a mountain node or The next hop to the top node. In this way, several single-hop or multi-hop mountainous regions adjacent to each other are formed in the network, and the top nodes of each partition can be determined.

It can be understood that when the physical topology of the ad hoc network changes, its partition will also change, and the summit nodes in the partition may also change.

2) Local processing of content messages

If the normal node 111b generates a content message, it sends the content message to the local hilltop node 111a (the mountaintop node in the partition). After receiving the content message, the local hilltop node 111a stores it and matches the previously cached subscription message. If the matching is successful, the content message is sent along the communication path of the subscription message to the source node of the subscription message; if the matching is unsuccessful, no processing is performed. The content message generated by the hilltop node 111a itself also performs the above-described storage and matching processing.

3) Content message acquisition

If the content message is required, the node 111 generates a corresponding subscription message and sends it to the local hilltop node 111a. After receiving the subscription message, the local hilltop node 111a first matches the stored content message. If the matching is successful, the matching content message is sent to the source node of the subscription message along the communication path of the subscription message; if the matching is unsuccessful, the subscription message is stored, and a communication path different from the subscription message is selected. The subscription message is forwarded through the selected path.

If the normal node 111b receives the subscription message sent by other partitions, the normal node 111b forwards the subscription message to the local mountain node. If the subscription message sent by the local hilltop node is received, the subscription message is forwarded to the neighbor partition. If the subscription message cannot be forwarded (for example, the node is already an edge node of the partition and there is no route to other partitions), or the subscription message does not need to be forwarded (for example, the neighbors located in the adjacent partition have forwarded the subscription) Message), the subscription message is transmitted back to the local hilltop node 111a along the incoming path; if a hilltop node of a stub partition (ie, a partition with only one neighbor partition) does not find the content message requested by the subscription message in the partition, The subscription message is then transmitted back along the incoming path to the hilltop node 111a of the neighboring partition. Both the hilltop node 111a and the normal node 111b in the network operate in the above manner until a matching content message is found, the number of times the subscription message is transmitted by the hilltop node reaches a threshold and is no longer forwarded, or the subscription message is returned.

In this embodiment, each node in the system has the same physical property and has a routing function. Moreover, each node can act as both a publisher of content messages and a subscriber to content messages.

It can be understood that FIG. 1 only exemplarily shows the topology of the distributed network of the present invention, but is not limited to the distributed network structure of the present invention. In other embodiments, the distributed network may be Including more partitions, each partition can have a common node, and the number of mountain nodes in each partition can be multiple.

The distributed network system can be a distributed wired network system or a distributed wireless network system. In a specific application, the distributed wireless network system may specifically but not limited to a mobile Ad Hoc network system, and the node may be any mobile terminal that can implement communication, such as a mobile phone, a computer, or the like.

The hilltop node 111a and the common node 111b in the system may perform the method in at least one of the following embodiments, or correspond to the nodes in the following embodiments. For details, refer to the following description of the embodiments.

Here, the words appearing in the following embodiments are defined: the neighbor node is a node located in the transmission range of the current node, and the embodiment can be understood as a node reachable by one hop. A neighbor partition is another partition that includes its neighbor nodes.

Second embodiment:

This embodiment provides an embodiment of a routing method of a distributed network. The routing method may be performed by the hilltop node or the common node shown in FIG. 1, and specifically includes the following steps:

S201: Select a neighbor node that can lead to the neighbor partition from neighbor nodes adjacent to the current node.

For example, the current node pre-stores a list of neighbor nodes that can lead to the neighbor partition, and the list includes the neighbor node identifier and the neighbor partition identifier that can be accessed. When the current node determines that the subscription message needs to be forwarded to the neighboring partition, select a non-subscribed message from the list of pre-stored neighbor nodes (ie, the node on the incoming path different from the subscribed message) or passable A neighbor node to a neighbor partition that has not received the subscription message. If there are neighbor nodes that satisfy the above conditions, a random algorithm may be used to select one of them. If the neighboring node has received the subscription message, it may be considered that the subscription message does not need to be forwarded, and the subscription message is returned according to the incoming path.

The current node may perform the steps of the third or fifteenth embodiment described below prior to S201 to obtain neighbor nodes that may be directed to the neighbor partition.

S202: Send a subscription message to be forwarded to the neighbor node that can lead to the neighbor partition.

In the distributed network, each node can perform the above method when forwarding a subscription message. For example, after receiving the subscription message, the neighboring node performs the operations of S201 and S202 to forward the subscription message to its next hop neighbor node to implement sending the subscription message to its neighboring partition.

In this embodiment, the node directly selects a neighboring node that can reach the neighboring partition to forward the subscription message, thereby avoiding forwarding the subscription message to the node that cannot reach the neighboring partition, and then returning to the local peak. The node reroutes until it is correctly forwarded to the node that can reach the neighbor partition, thus avoiding unnecessary round-trip transmission of the subscription message and generating forwarding redundancy, reducing the subscription overhead, transmitting data overhead, and time consuming to find content messages. Improve data transfer efficiency.

Third embodiment:

This embodiment provides an embodiment of a neighbor processing method of a distributed network. The neighbor processing method can be performed by the hilltop node or the normal node shown in FIG. 1. The method is used to obtain a neighbor node that can lead to a neighbor partition, and specifically includes:

S301: Determine whether the neighbor node can lead to the neighbor partition. If the neighbor node can reach the neighbor partition, execute S302; otherwise, no processing is performed. The neighbor node that can lead to the neighbor partition may include a neighbor node located in the current partition or a neighbor node located in the neighbor partition.

In an application of a neighboring path sensing mechanism based on message sensing, each node of the network periodically broadcasts a first heartbeat message after the partition is formed, and the ordinary node receives the first heartbeat message of the neighbor node and determines the first heartbeat. If the identifier of the partition carried in the message is the identifier of the other partition (that is, the neighbor partition identifier), the neighbor node may record the neighbor partition corresponding to the carried identifier, and broadcast a second path with the path identifier that can lead to the neighbor partition. A heartbeat message, wherein the second heartbeat message is different from the first heartbeat message in that it includes the way leg identifier. If the normal node receives the second heartbeat message, it also records that the neighbor node can reach the neighbor partition corresponding to the carried identifier, and broadcasts a second heartbeat message including the way identifier that can lead to the neighbor partition. Therefore, the local common node sends the second heartbeat message to the different neighboring partitions to the local mountaintop node, and the mountaintop node receives the second heartbeat message of the neighboring node, and records that the neighboring node can reach the neighbor corresponding to the carried identifier. Partition. Through the routing mechanism, nodes in the network can continuously perceive the presence or absence of neighbor nodes and neighbor partitions to the neighbor partition according to the received heartbeat message.

Therefore, the S301 step may be specifically: the node receives the heartbeat message of each of the neighboring nodes; and determines whether the heartbeat message (also referred to as a broadcast message) of the neighboring node includes the partition identifier of the neighboring partition (for the first heartbeat) Message) or a way path to the neighbor partition (which is a second heartbeat message). If the heartbeat message of the neighboring node includes the partition identifier or the directional identifier, the neighboring node may be connected to the neighboring partition, and determine, according to the partition identifier of the neighboring partition carried in the heartbeat message, To the neighbor partition; further, if the current node is a normal node, the path identifier is also marked in the heartbeat message of the current node, and further Broadcasting a heartbeat message of the current node.

The path identifier may be represented by the attribute or the content of the message. For example, the path identifier is a message type field, that is, the value of the second heartbeat message is different from the value of the message type field of the first heartbeat message. It may also be represented by a different message length, a message format, or the like than the first heartbeat message, or the way identifier is a message extension field for carrying the partition identifier of the neighbor partition.

S302: Mark the neighbor node as being accessible to the neighbor partition.

For example, when the current node determines that the neighbor node can lead to the neighbor partition, the local neighbor node information records the partition identifier of the neighbor partition that the neighbor node can reach.

Through the above-mentioned neighboring path sensing mechanism based on message sensing, the node in the distributed network can determine the neighbor nodes that can reach the neighboring partition, so that the node can directly pass the neighboring node that can lead to the neighboring partition. Forward the subscription message to the neighbor partition.

Fourth embodiment:

This embodiment provides an embodiment of a distributed network routing method. The routing method may be performed by the hilltop node shown in FIG. 1, and the method may be performed before the foregoing S201, so that when the current node in the embodiment receives the subscription message and determines that there is no content message that matches the subscription message, The step of S201 is performed again. The method includes:

S401: Receive a subscription message.

S402: Match the subscription message to the content message of the common node of the current partition to the top node; if the matching is successful, execute S403; if the matching is unsuccessful, execute S404, or execute S201, or execute The method steps described in the eighth embodiment, or the method steps described in the following tenth embodiment are performed, or the steps S112-S113 (shown in FIG. 3) described in the eleventh embodiment are performed, or executed. The steps S132-S133 described in the thirteenth embodiment, or the step S172 described in the seventeenth embodiment.

S403: Return a content message that matches the subscribed message description.

Specifically, when the subscription message is successfully matched with the local content message, the current node may return a content message that matches the subscription message along the communication path of the subscription message, or perform the method steps described in the ninth embodiment.

S404: The subscription message is streamlined and returned.

In an embodiment, the normal node of the current partition cancels the content after generating the content message. The information is saved with the local mountain node. After receiving the subscription message, the hilltop node matches the saved content message according to the content message summary in the subscription message. If the matching is successful, the matching content message is sent back along the communication path of the subscription message. After that, the subscription message is invalid, and the network will not forward the subscription message. If the match is unsuccessful, it is determined that there is no content matching the subscription message in the current partition, and is processed according to the following two situations:

a) If the backhaul condition is not met, that is, if the current partition is not a stub partition (it may be determined as a stub partition according to the number of neighbor partitions thereof) and the neighbor partition does not forward the subscription message (if all nodes of the neighbor partition exist) If the subscription message is not forwarded, the method may be performed by directly performing the foregoing S201 and S202, or performing the method steps described in the following eighth embodiment, or performing the following method steps in the tenth embodiment. Or performing the steps S112-S113 described in the eleventh embodiment, or performing the steps S132-S133 described in the thirteenth embodiment, or performing the step S172 described in the seventeenth embodiment;

b) If the return condition is satisfied, that is, if the current partition is the last partition or its neighbor partition has forwarded the subscription message (if at least one node of each neighbor partition forwards the subscription message), then the above S404 is performed to subscribe to the message. The reduced backhaul, wherein the above S404 can specifically perform message reduction backhaul as described in the fifth embodiment.

Fifth embodiment:

This embodiment provides an embodiment of a message backhauling method of a distributed network. The message backhauling method may be performed by a hilltop node or a common node as shown in FIG.

S501: Reduce the subscription message into a backhaul message.

The backhaul message can be used to identify the subscription message. Specifically, the step may include: extracting, by the subscription message, the subscription message identifier and a source address identifier (an address identifier of the source node, such as an ID of the source node, an IP address, a Mac address, etc.); according to the subscription message The identifier and the source address identifier generate the backhaul message. Alternatively, the step includes: extracting the feature information from the subscription message; and generating a backhaul message carrying the feature information. The feature information may include the subscription message identifier and a source address identifier, and the like.

In a specific application, the subscription message includes a subscription message identifier, a source address identifier, and a content summary, which may be a matching content message digest and/or a subscription message digest. The extracting the subscription message identifier and the source address identifier from the subscription message further includes: discarding the content summary in the subscription message to obtain the subscription message identifier remaining in the subscription message to And source address identifier.

S502: The backhaul message is returned along a communication path of the subscription message, where the message volume of the backhaul message is smaller than the message amount of the subscription message.

The node identifier in the present invention may be information such as the node ID, the node IP address, or the node Mac address, which can uniquely identify the node, and the partition identifier may be information that uniquely identifies the partition identifier for the partition ID or the like.

The node on the incoming path of the subscription message caches the subscription message and its previous hop node and the next hop node after forwarding the subscription message until the subscription message is invalid (for example, if the number of times the hill node forwards exceeds the threshold, the search is found. The cached subscription message is deleted only if the content message matches, or the cache timeout, etc.). Therefore, after receiving the backhaul message, the ordinary node on the incoming path of the subscription message compares the backhaul message with the locally cached subscription message, thereby obtaining the last hop of the locally cached corresponding subscription message. And sending, by the node, a backhaul message to the previous hop node, to implement transmitting the backhaul message along the received communication path of the subscribed message. After receiving the backhaul message, the hilltop node on the incoming path of the subscription message finds the corresponding cached complete subscription message according to the backhaul message, and determines whether the neighboring partition has forwarded the subscription message. If yes, the subscription message is forwarded to the neighbor node that can reach the neighboring partition that has not forwarded the subscription message according to the foregoing steps S201 and S202; if yes, the backhaul message is continued to be returned according to the above S401 and S402 until the The return message reaches the local hill node of its source node or its source node.

In other embodiments, the normal node on the incoming path of the subscription message may perform the same steps as the hilltop node. It can be understood that the above-mentioned communication path along the subscription message is transmitted in the opposite direction of the subscription message.

The above-mentioned streamlined backhaul method not only realizes the effect of subscribing message backhaul, but also shortens the data amount of the returned subscription message and reduces the transmission data overhead.

Sixth embodiment:

The embodiment provides an embodiment of a routing method of a distributed network, where the current node is a common node, and the method includes:

S601: Receive a subscription message;

S602: Match the subscription message with the local content message; if the matching is successful, execute S603; if the matching is unsuccessful, execute S604, or execute S112-S113 according to the eleventh embodiment. Steps, or performing the steps S132-S133 described in the thirteenth embodiment.

S603: Reply to the content message that matches the subscription message along the communication path of the subscription message.

The current common node has the function of directly replying to the content message, and does not need to be forwarded to the local mountain node for reply, which reduces the number of forwarding of the subscription message and the content message, reduces the subscription overhead and data forwarding overhead, and improves the data transmission efficiency.

S604: Forward the subscription message.

In this embodiment, the current common node saves the content message locally after generating the content message. After receiving the subscription message, the current normal node matches the saved content message according to the content message summary in the subscription message. If the matching is successful, the matching content message is sent back along the communication path of the subscription message. After that, the subscription message is invalid, and the network will not forward the subscription message. If the matching is unsuccessful, it is determined that the current node does not have content matching the subscription message, and the following may be determined by the subscription message, and the subscription message is forwarded according to the corresponding situation:

A) if it is determined that the subscription message is transmitted from the top node, that is, the subscription message needs to be input to the vertex node of the neighboring partition, the foregoing S201, S202 may be performed, or the method steps described in the following tenth embodiment may be performed, Forwarding the subscription message to the neighbor partition, or performing the step S172 described in the seventeenth embodiment;

B) If it is determined that the subscription message is transmitted from the neighbor partition, that is, the subscription message needs to be input to the vertex node of the current partition, the subscription message may be transmitted along the path leading to the top node of the current partition.

The current node may determine the above two situations according to the previous hop node of the subscription message. For example, the current node pre-stores a neighboring node that can lead to the local mountaintop node, and determines whether the previous hop node of the subscription message is the neighboring node that can reach the local mountaintop node, and if so, determines that the situation A belongs to the foregoing, Otherwise it is determined to belong to case B.

Further, if the common node has a backhaul function, the matching is unsuccessful, and the current node does not satisfy the backhaul condition, such as unable to continue forwarding the subscription message or continuing to forward the subscription message (the embodiment shown in FIG. 1 has this condition) When the description is made, the above S404 is performed to perform the subscription message reduction backhaul.

In another embodiment, before performing the foregoing S602, determining that the subscription message belongs to the foregoing situation Case A or B, if the above situation B is met, the above S602 is performed, and when the matching is unsuccessful, the subscription message is transmitted along the path leading to the top node of the current partition; if the above situation A is met, the above is directly performed. S201, S202, to forward the subscription message to the neighbor partition.

Seventh embodiment:

This embodiment provides a flowchart of an embodiment of a message replying method of a distributed network. The message replying method may be performed by the common node shown in FIG. 1 to reduce the data transmission overhead and the reply time of the content message, and specifically includes the following steps. :

S701: Determine whether the neighbor node includes the target node of the content message to be returned, if yes, execute S702, if not, execute S703.

The target node of the content message is the source node of the subscription message that matches the content message.

Optionally, before the S701, the current node further extracts the node identifier of the neighbor node from the broadcast message of the neighbor node, and performs local storage. The S701 includes: matching the node identifier of the target node with the locally stored node identifier; if the matching is successful, determining that the neighbor node includes the target node.

S702: Send the content message directly to the target node.

If the target node of the content message is a neighbor node, the current node determines that the content message does not need to be replied according to the communication path of the subscription message, and is directly sent to the target node via the content message.

S703: Return the content message along a communication path of the subscription message corresponding to the content message.

Eighth embodiment:

The embodiment provides an embodiment of a message transmission method of a distributed network. The message transmission method can be executed by the hilltop node shown in FIG. 1 to shorten the message transmission path and reduce data transmission overhead, including the following steps:

S801: Determine whether the neighbor partition of the local partition is included in the neighbor partition of the source partition of the subscription message to be forwarded. If yes, execute S802. If not, execute S803.

The source partition of the subscription message is the partition of the source node that generates the subscription message.

Before executing S801, the current node may first acquire the partition identifier of the neighbor partition and the partition identifier of the subscription message source partition to perform matching. Correspondingly, the step of S801 is specifically to compare the partition identifier of the neighbor partition of the local partition with the partition identifier of the neighbor partition of the source partition. If the match is successful, the neighbor partition identifying the local partition is included in the neighbor partition of the source partition of the subscription message to be forwarded.

S802: Return the subscription message along a communication path of the subscription message.

Specifically, the subscription message may be streamlined back along the incoming path as described in the fifth embodiment.

S803: Forward the subscription message to a neighbor partition of the local partition.

For details, refer to the second embodiment to implement forwarding the subscription message to a neighbor node that can reach a neighbor partition of the local partition.

Ninth embodiment:

This embodiment provides an embodiment of a message replying method for a distributed network. The message replying method can be executed by the hilltop node shown in FIG. 1 for shortening the transmission path of the content message and reducing the data transmission overhead, including the following steps:

S901: Determine whether the target partition of the content message to be returned is included in the neighbor partition, if yes, execute S902; if not, execute S903.

The target partition of the content message is the source partition of the subscription message that matches the content message.

Optionally, the S901 includes: matching a partition identifier of the target partition with a partition identifier of a locally stored neighbor partition; if the matching is successful, determining that the target partition is included in the neighbor partition.

S902: Send the content message directly to the target partition.

If the target partition of the content message is a neighbor partition, the current node determines that the content message does not need to be replied according to the communication path of the subscription message, and is directly sent to the target partition via the content message.

Optionally, the current node may send a notification message corresponding to the content message according to the communication path, to notify each node on the communication path that the target partition has received the content message, where The message amount of the notification message is smaller than the message amount of the content message. Further, the notification message may include at least an identifier of the target node and an identifier of the subscription message.

S903: Return the content message along a communication path of the subscription message corresponding to the content message.

Specifically, the current node may return the content message by referring to the seventh embodiment.

Tenth embodiment:

This embodiment provides an embodiment of a routing method of a distributed network, which may be performed by a common node or a hilltop node as shown in FIG. 1 for routing optimal selection and reducing data transmission overhead. Includes the following steps:

S101: Select, from the neighbor nodes, a neighbor node that can lead to the neighbor partition and has the few hops to the neighbor partition as the target neighbor node.

In this embodiment, the heartbeat message broadcasted by the neighboring node to the neighboring partition includes at least a partition identifier of the neighboring partition that can be accessed and a hop count identifier for indicating the hop count of the neighboring partition corresponding to the partition identifier. . Before S101, the current node receives the heartbeat message of the neighboring node as described in the third embodiment, and determines whether the neighboring node can reach the neighboring partition according to the heartbeat message. When it is determined that the neighboring partition can be reached, the hop count identifier is extracted from the heartbeat message, and the neighbor node that can lead to the neighbor partition and its corresponding hop count identifier are locally recorded.

Further, when it is determined that the neighbor node can reach the neighboring partition, the path identifier may be recorded in the heartbeat message of the current node, and the hop ID in the heartbeat message of the current node is set to be at the neighbor node. The preset step value is added based on the hop number identifier, and the heartbeat message of the current node is further broadcasted. The preset step value can be set according to actual needs, such as set to 1. Further, when it is determined that the neighboring node is located in the neighboring partition, the current node locally records the hop count identifier corresponding to the neighboring node as an initial value, such as 0, and increases the hop count identifier of the heartbeat message to 1.

The step may specifically include: the current node selects, as the target neighbor node, the neighbor node with the smallest hop ID of the neighbor node from the locally recorded neighbor node information.

S102: Send a subscription message to be forwarded to the target neighbor node.

Eleventh embodiment:

Referring to FIG. 2, FIG. 2 is a flowchart of an embodiment of a message processing method for a distributed network according to the present invention. The message processing method may be performed by a common node or a mountaintop node shown in FIG. 1, and includes the following steps:

S111: Receive a summary message of a non-local content message sent by the neighboring partition.

The local content message in the present specification is a content message stored locally. For example, if the current node is a mountain node, the local content message is a content message generated by the current partition, and if the current node is a common node, Node, the local content message is the content message generated by the current node. The non-local content message described in this specification is a content message that is not stored locally, such as a content message of another partition that has been received by the current hilltop node, or a content message of other nodes that the current ordinary node has received.

The summary message is used to indicate the main information included in the corresponding content message, and may specifically include a summary part in the content message. In a specific application, the summary message includes a summary of the content message and a partition identifier of the source partition of the content message. . For example, the current node receives a summary message of the content message generated by node 1 in neighbor partition A and saves it locally.

S112: Match the subscription message with the summary message.

For example, when the subscription message is received, the subscription message is matched with the summary of the corresponding content message included in the summary message. If yes, S113 is performed; otherwise, the process may be ended.

S113: Send the summary message along a communication path of the subscription message, or send the subscription message along a communication path of the summary message.

For example, the current node determines whether the partition on the incoming path of the summary message is included in the neighbor partition of the source partition of the subscription message; if included in the neighbor partition of the source partition of the subscription message, along the subscription message The summary path sends the summary message; otherwise, the subscription message is sent along the communication path of the summary message.

Optionally, the message processing method may further generate a summary message of the local content message after obtaining the local content message, and send the summary message to a neighbor node that can reach the neighboring partition, so that the summary message is sent to the neighbor. Partition. Specifically, the manner in which the summary message is sent to the neighbor node that can reach the neighboring partition can be referred to the second embodiment above.

In this embodiment, after generating the content message, the node sends the summary message of the content message to the neighboring partition, and the node of the neighboring partition further matches the subscription message with the summary message, and directly matches the subscription message when matching. And sending, by the text path, the summary message, so that the subscription message source node obtains the summary message, or sends the subscription message along a communication path of the summary message, so that the content message source node receives the subscription message and then replies to the content message. Therefore, the effective transmission of the subscription message is realized, and the destination message is not required to be sent, thereby improving the efficiency of searching for the content message and reducing the data transmission overhead.

FIG. 3 is a partial flowchart of another embodiment of a message processing method of a distributed network. In this embodiment, FIG. 3 only shows the foregoing S112. In fact, the embodiment further includes the foregoing S111 and S113, where the current node may be The above S131 is executed at any time of the method shown in FIG. S113 is executed after executing S112.

Twelfth embodiment:

This embodiment provides an embodiment of a message processing method of a distributed network, and the message processing method It can be executed by the common node or the top node shown in FIG. 1 to reduce the transmission data overhead and transmission time of the content message, and improve the transmission efficiency, including the following steps:

S121: Receive a subscription message.

S122: Extract, from the subscription message, a node identifier of each history node on a communication path of the subscription message.

In this embodiment, the subscription message includes the node identifier of each history node that has forwarded the subscription message, and the current node extracts the node identifier of each history node of the subscription message from the subscription message, and stores it locally.

S123: When returning the content message that matches the subscription message, determining, according to the node identifier, whether the history node other than the previous hop history node of the subscription message includes other history nodes, if yes, executing S124, Otherwise, execute S125.

For example, when the subscription message is received, the subscription message is matched with the local content message. If the matching is unsuccessful, the node identifier of the current node is added to the subscription message, and the fourth or sixth embodiment is executed. Corresponding steps when the matching is unsuccessful, to forward the subscription message, or to return the subscription message, etc.; if the matching is successful, determine, according to the node identifier, whether the neighbor node has a history node other than the previous hop of the subscription message Contains other history nodes. The current node may determine a communication path of the subscription message according to the node identifier in the locally stored subscription message.

S124: The content message is directly transmitted back to the other history node.

S125: The content message is sent back to the last hop history node to return the content message along the communication path of the matched subscription message.

Thirteenth embodiment:

This embodiment provides an embodiment of a message processing method of a distributed network, which may be performed by a common node or a hilltop node shown in FIG. 1 for targeted transmission of a subscription message to a source node of a matched content message. Reduce the transmission data overhead, including the following steps:

S131: Acquire a summary of the content message sent by the neighbor node and a transmission path of the content message.

For example, when the returned content message is received, the summary in the content message is extracted, and the historical transmission path of the content message is obtained and saved locally.

S132: When the subscription message needs to be forwarded, determine whether the subscription message matches the summary, If it matches, then S133 is performed; otherwise, the subscription message is forwarded to the neighbor node that can reach the neighbor partition as shown in the second embodiment.

For example, the current node performs the foregoing fourth or sixth embodiment. When it is determined that the subscription message does not match the local content message, it is determined that the subscription message needs to be forwarded, and it is determined whether the subscription message matches the summary.

S133: Forward the subscription message along a transmission path of the content message.

The transmission path of the content message may be the last hop history node information of the content message.

Fourteenth embodiment:

This embodiment provides an embodiment of a message processing method of a distributed network. The message processing method may be executed by a hilltop node or a common node shown in FIG. 1 for storing content messages of other partitions and performing subscription matching, thereby improving network content messages. Find probabilities and efficiencies, including the following steps:

S141: Receive a subscription message.

S142: Determine whether the subscription message matches the first content message generated by the other partitions. If yes, execute S143, otherwise execute S144.

For example, the current node is a hilltop node, and the current node is locally stored by two types of content messages: the first content message is generated for other partitions, and the second content message is generated for the current partition.

Optionally, after receiving the subscription message, the current node determines whether the subscription message matches the local second content message, and if yes, performs the corresponding step of the matching succeeding in the fourth or sixth embodiment, if the matching is unsuccessful, Then, the above S142 is executed.

Further, before the foregoing S142, the method further includes: receiving a first content message sent by another partition; determining whether the first content message satisfies a setting condition; if yes, saving the first content message, and S142 is performed upon receiving the subscription message; otherwise the first content message is forwarded. Specifically, the current node forwarding the first content message may refer to the second embodiment to send the first content message to a neighbor node that can reach the neighbor partition.

The setting condition may be configured according to an actual situation, for example, the source partition of the first content message is not a neighbor partition and the local storage space is greater than a set capacity, or is a current partition identifier and the first content message. The carried target partition identifiers are consistent, or the number of times the first content message is forwarded matches the set number of times.

S143: Return the matched first content message.

S144: Send the subscription message to a neighbor node that can reach the neighbor partition.

The backhaul of the first content message in the foregoing S143 may refer to the backhaul step of the content message, for example, refer to S403 in the fourth embodiment, or S601 in the sixth embodiment. The above S144 can refer to the description of the second embodiment.

Fifteenth embodiment:

This embodiment provides an embodiment of a message processing method of a distributed network. The message processing method may be performed by a hilltop node or a common node shown in FIG. 1 for obtaining a neighbor node that can lead to a neighboring partition, including the following steps:

S151: Receive a subscription message.

S152: When it is determined that the subscription message is from another partition, determine, by the node in the current partition that the subscription message is forwarded, a node that can reach the neighbor partition.

The current node may only judge the neighbor node, for example, the current node determines the neighbor node in the current partition that has forwarded the subscription message as a neighbor node that can reach the neighbor partition.

Optionally, after receiving the subscription message, the current node may perform the relevant step of the fourth or sixth embodiment after receiving the subscription message.

Sixteenth embodiment:

This embodiment provides an embodiment of a heartbeat method of a distributed network. The heartbeat method may be performed by a mountain node or a common node as shown in FIG. 1 for performing heartbeat detection by a network part node, including the following steps:

S161: The current node determines whether the set heartbeat condition is met. If yes, execute S162, otherwise execute S163.

In this embodiment, some nodes in the network perform heartbeat, and the other node does not perform heartbeat. Specifically, the node periodically detects whether a heartbeat needs to be performed. The setting heartbeat condition may be set according to actual requirements, for example, may include predicting that the current network topology changes are greater than a set change value, the current time is a set time, the current channel is in an idle state, and the current location is a set network topology position, At least one of the heartbeat message of the neighbor node, the heartbeat message not sent within the previously set period, and the result of the random operation are not received within the preset time.

S162: Send a heartbeat message.

S163: Do not send a heartbeat message.

Optionally, the method further includes: receiving a neighbor node identifier sent by another node a notification message; determining a node corresponding to the neighbor node identifier in the notification message as a neighbor node.

Further, in order to reduce the data transmission overhead, the current node performs the foregoing step S161 every first time interval, and performs the step of transmitting the notification message every second time interval; wherein the first time interval is smaller than the first Two time intervals.

Seventeenth embodiment:

The embodiment provides an embodiment of the message processing method of the distributed network. The message processing method can be performed by the hilltop node or the common node shown in FIG. 1 for intelligently controlling the validity of the subscription message, including the following steps:

S171: Receive a subscription message.

S172: If it is determined that the forwarding of the subscription message is invalid or is about to expire, and the current node or the subscription message satisfies the set condition, the validity of the subscription message is extended.

This is about to expire as the state in which the next forwarding is invalid. If it is determined that the subscription message has not been forwarded or is not about to expire, the subscription message is forwarded. The setting condition may be set according to an actual situation, for example, the current node does not forward the subscription message, the source node of the subscription message is a setting node, and the importance degree value of the subscription message is higher than a set value. At least one.

For example, the current node determines whether the number of times the subscription message is forwarded exceeds the number of valid forwardings. If yes, the number of valid forwardings of the subscription message is increased by a set number of times to extend the validity. Or the current node determines whether the total forwarding time of the subscription message exceeds a valid forwarding time. If yes, the effective forwarding time of the subscription message is increased by a set time value to extend the validity.

The present invention can also provide an embodiment of the combination of the above-mentioned second to seventeenth embodiments, that is, the method embodiment includes at least two steps described in the above embodiments, and the execution sequence of the step can be referred to the above embodiment. In the description.

Eighteenth embodiment:

Please refer to FIG. 4. FIG. 4 is a schematic structural diagram of an embodiment of a distributed network node according to the present invention. In this embodiment, the node may be a common node as shown in FIG. 1. The node 40 includes a receiving module 41, a matching module 42, and a transmitting module 43. The receiving module 41 is configured to receive a summary message of a non-local content message sent by the neighboring partition. The matching module 42 is configured to match the subscription message with the summary message. The sending module 43 is configured to: when the subscription message matches the summary message, Transmitting the summary message along a communication path of the subscription message or sending the subscription message along a communication path of the summary message.

Optionally, the summary message includes a summary of the content message and a partition identifier of a source partition of the content message.

Optionally, the matching module 42 is further configured to: receive the subscription message, determine whether to match the subscription message with a local content message, and if the local content message matches, return the matched content message; Otherwise, the step of matching the subscription message with the summary message is performed.

Optionally, the sending module 43 is further configured to: determine whether a partition on the source path of the summary message is included in a neighbor partition of a source partition of the subscription message; if a neighbor included in a source partition of the subscription message In the partition, the summary message is sent along the communication path of the subscription message; otherwise, the subscription message is sent along the communication path of the summary message.

Optionally, the step of the matching module 42 performing the backhauling the matched content message comprises: determining whether a source partition of the subscription message is included in the neighbor partition; if yes, sending the content message directly to the source Partitioning; otherwise, the content message is returned along the incoming path of the subscription message.

Optionally, the node 40 further includes a storage module, configured to extract a partition identifier of the neighbor partition from a broadcast message of the neighbor node, and perform local storage; and the matching module 42 performs the determining whether the neighbor partition includes the subscription message. The step of the source partition includes: matching the partition identifier of the target partition with the locally stored partition identifier; if the matching is successful, determining that the neighbor partition includes the target partition.

Optionally, the node 40 further includes a generating module, configured to generate a summary message of the local content message, select a neighboring node that can pass to the neighboring partition, and provide the neighboring node to the neighboring partition The neighbor node sends the notification message.

Optionally, the generating module is further configured to determine whether the broadcast message of the neighboring node includes a partition identifier of the neighbor partition or a path identifier that can be connected to the neighbor partition; if yes, mark the neighbor node A neighbor node that is capable of accessing the neighbor partition.

The modules in the above-mentioned nodes can respectively perform the corresponding steps in the foregoing method embodiments, and therefore, the modules are not described herein. For details, refer to the description of the corresponding steps.

The foregoing node 40 can also be used to perform the foregoing method embodiments or a combination thereof. Description of method embodiments.

Nineteenth embodiment:

Please refer to FIG. 5. FIG. 5 is a schematic structural diagram of another embodiment of a distributed network node according to the present invention. The node is a hilltop node or a common node as shown in FIG. 1, and the node can perform the steps in the above method. For related content, please refer to the detailed description in the above method, which will not be described here.

In this embodiment, the node 50 includes a transmitter 51, a receiver 52, one or more processors 53, a memory 54, and a bus 55.

Transmitter 51 is used to send messages, such as subscription messages or content messages, to other nodes in the distributed network. The receiver 52 is configured to receive messages sent by other nodes in the distributed network, such as subscription messages or content messages. The memory 54 includes a read only memory and a random access memory. A portion of memory 54 may also include non-volatile random access memory (NVRAM).

The processor 53 may also be referred to as a CPU (Central Processing Unit). In a specific application, the various components of the node are coupled together by a bus 55. The bus 55 may include a power bus, a control bus, a status signal bus, and the like in addition to the data bus. However, for clarity of description, various buses are labeled as bus 55 in the figure.

In an embodiment of the invention, node 50 further includes a plurality of applications and one or more programs, said plurality of applications and one or more programs being stored in memory 54 and configured to be executed by said processor 53. The one or more programs include instructions. The processor 53 performs the following operations by calling an instruction in the one or more programs stored in the memory 54: acquiring a summary message of the non-local content message sent by the neighbor partition received by the receiver 52; The summary message is matched; if it matches the summary message, the summary message is sent along the communication path of the subscription message by the sender 51, or sent along the communication path of the summary message by the sender 51. The subscription message.

The foregoing processor 53 is specifically configured to perform the foregoing method embodiments or a combination thereof. For details, refer to the description of the foregoing method embodiments.

The above is only the embodiment of the present invention, and is not intended to limit the scope of the invention, and the equivalent structure or equivalent process transformations made by the description of the invention and the drawings are directly or indirectly applied to other related technologies. The fields are all included in the scope of patent protection of the present invention.

Claims

A message processing method for a distributed network, the method comprising:

Receiving a summary message of a non-local content message sent by the neighbor partition;

Matching the subscription message with the summary message;

And if the summary message matches, sending the summary message along a communication path of the subscription message, or sending the subscription message along a communication path of the summary message.
The method of claim 1 wherein the summary message comprises an overview of the content message and a partition identification of a source partition of the content message.
The method according to claim 1, wherein before the step of matching the subscription message with the summary message, the method further comprises:

Receiving the subscription message;

Determining whether to match the subscription message with a local content message;

Returning the matched content message if it matches the local content message;

Otherwise, the step of matching the subscription message with the summary message is performed.
The method according to claim 3, wherein if the summary message matches, the summary message is sent along a communication path of the subscription message, or the message is sent along a communication path of the summary message The steps of subscribing to the message further include:

Determining whether a partition on a communication path of the summary message is included in a neighbor partition of a source partition of the subscription message;

And if included in a neighbor partition of the source partition of the subscription message, sending the summary message along a communication path of the subscription message;

Otherwise, the subscription message is sent along the communication path of the summary message.
The method of claim 3, wherein the step of returning the matched content message comprises:

Determining whether the source partition of the subscription message is included in the neighbor partition;

If yes, sending the content message directly to the source partition;

Otherwise, the content message is returned along the incoming path of the subscription message.
The method according to claim 1, wherein the step of determining whether the source partition of the subscription message is included in the neighbor partition further comprises:

Extracting the partition identifier of the neighbor partition from the broadcast message of the neighbor node, and performing local storage;

The step of determining whether the source partition of the subscription message is included in the neighbor partition includes:

Matching the partition identifier of the target partition with the locally stored partition identifier;

If the match is successful, it is determined that the target partition is included in the neighbor partition.
The method of claim 1 further comprising:

Generating a summary message of the local content message;

Selecting a neighbor node that can lead to the neighbor partition from the neighbor nodes, and sending the notification message to the neighbor node that can reach the neighbor partition.
The method according to claim 7, wherein before the step of selecting a neighbor node that can be passed to the neighboring partition from the neighboring nodes, the method further includes:

Determining, by the broadcast message of the neighboring node, a partition identifier of the neighbor partition or a road identifier that can be connected to the neighbor partition;

If included, the neighbor node is marked as a neighbor node that is capable of accessing the neighbor partition.
A distributed network node, comprising:

a receiving module, configured to receive a summary message of a non-local content message sent by the neighboring partition;

a matching module, configured to match the subscription message with the summary message;

And a sending module, configured to send the summary message along a communication path of the subscription message when the subscription message matches the summary message, or send the subscription message along a communication path of the summary message.
A distributed network node, comprising: a transmitter, a receiver, a processor, and a memory, the processor executing the instructions stored in the memory for:

Obtaining a summary message of the non-local content message sent by the neighbor partition received by the receiver;

Matching the subscription message with the summary message;

And if the summary message matches, sending, by the sender, the summary message along a communication path of the subscription message, or sending, by the sender, the subscription message along a communication path of the summary message.