WO2017214815A1 - Procédé de traitement de message de réseau distribué, et nœud associé - Google Patents

Procédé de traitement de message de réseau distribué, et nœud associé Download PDF

Info

Publication number
WO2017214815A1
WO2017214815A1 PCT/CN2016/085580 CN2016085580W WO2017214815A1 WO 2017214815 A1 WO2017214815 A1 WO 2017214815A1 CN 2016085580 W CN2016085580 W CN 2016085580W WO 2017214815 A1 WO2017214815 A1 WO 2017214815A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
partition
subscription message
neighbor
Prior art date
Application number
PCT/CN2016/085580
Other languages
English (en)
Chinese (zh)
Inventor
任智
王斌
Original Assignee
深圳天珑无线科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳天珑无线科技有限公司 filed Critical 深圳天珑无线科技有限公司
Priority to PCT/CN2016/085580 priority Critical patent/WO2017214815A1/fr
Publication of WO2017214815A1 publication Critical patent/WO2017214815A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update

Definitions

  • 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.
  • the mobile Ad Hoc network is a common distributed network, and is a wireless communication system composed of mobile nodes with wireless communication capabilities and without infrastructure support.
  • the nodes are equal in status, the nodes themselves act as routers and forward data, and realize mutual communication with other nodes through cooperation; at the same time, the network topology has dynamic changes due to the node being movable.
  • a mobile Ad Hoc network is composed of multiple node topologies, which are divided into multiple partitions.
  • the nodes in the network obtain their neighbor node information before routing, and the node learns its neighbor nodes according to its neighbor node information, but the node cannot obtain whether its neighbor nodes can lead to the adjacent partition.
  • the node may need to consume more transmission data overhead during the message transmission process. For example, when a node needs to send a message to another partition, it selects one of the neighbor nodes according to the neighbor node information. However, the neighbor node selected by the node may not be able to access the neighbor partition. At this time, the message is returned. Go to the node to reselect the new path.
  • a mobile Ad Hoc network does not need its nodes to know more about its neighbor nodes.
  • the technical problem to be solved by the present invention is to provide a message processing method and a node of a distributed network, and to know whether a neighbor node can lead to a neighbor partition.
  • a technical solution adopted by the present invention is to provide a message processing method for a distributed network, the method comprising: receiving a subscription message; and determining that the subscription message is from another partition, in a current partition The node that forwarded the subscription message is determined to be a node that can reach the neighbor partition.
  • the subscription message carries each history node on the communication path of the subscription message. And determining, by the node in the current partition, the node that has forwarded the subscription message as a node that can reach the neighboring partition, the step of: obtaining the node identifier that belongs to the current partition that is carried in the subscription message; The node corresponding to the acquired node identifier is determined to be a node that can lead to the neighbor partition.
  • the determining, by the node that forwards the subscription message in the current partition as a node that can reach the neighboring partition includes: determining, by the neighboring node that forwards the subscription message in the current partition, a neighboring node that can be connected to the neighboring partition. Neighbor node.
  • the subscription message carries a partition identifier that forwards the subscribed message.
  • the method further includes: The neighbor partition identifier is found in the partition identifier; the neighbor partition corresponding to the neighbor partition identifier is determined as the neighbor partition that can be accessed.
  • the method further includes: determining whether the subscription message matches the local content message; if the matching, returning the content message; if not, following the The neighbor node to the neighbor partition forwards the subscription message.
  • the step of returning the content message includes: determining whether the neighbor node includes the source node of the subscription message; if yes, sending the content message directly to the source node; otherwise, following the subscription
  • the message path of the message returns the content message.
  • the step of forwarding the subscription message along a neighboring node that can reach the neighboring partition includes: if not, determining whether the subscription message meets a returning condition; if not, the edge is The neighboring node to the neighboring partition forwards the subscription message; if satisfied, the subscription message is reduced to a backhaul message, and the backhaul message is returned along the incoming path of the subscription message, where the back The amount of messages transmitted by the message is less than the amount of messages of the subscribed message.
  • the step of reducing the subscription message into a backhaul message includes: extracting the feature information from the subscription message; and generating a backhaul message carrying the feature information.
  • another technical solution adopted by the present invention is to provide a distributed network node, including: a receiving module, configured to receive a subscription message, and a determining module, configured to determine, when the subscription message is from another partition. Determining, in the current partition, the node that forwarded the subscription message as a node that can reach the neighbor partition.
  • another technical solution adopted by the present invention is to provide a distributed network node, including a receiver, a processor, and a memory, by performing the The instruction stored in the memory is configured to: acquire a subscription message received by the receiver; and determine, when determining that the subscription message is from another partition, a node that forwards the subscription message in the current partition as a node that can reach the neighboring partition .
  • the node when receiving the subscription message of the other partition, determines, according to the transmission path of the subscription message, the node that has forwarded the subscription message in the current partition as a node that can reach the neighboring partition, so that the node can learn the neighbors thereof. Whether the node can lead to the neighbor partition, and then, the path selection can be based on the neighbor node that can lead to the neighbor partition.
  • FIG. 1 is a schematic structural diagram of an embodiment of a distributed network system according to the present invention.
  • FIG. 2 is a flowchart of an embodiment of a message processing method of a distributed network according to the present invention
  • FIG. 3 is a schematic structural diagram of an embodiment of a distributed network node according to the present invention.
  • FIG. 4 is a schematic structural diagram of another embodiment of a distributed network node according to the present invention.
  • FIG. 1 is a schematic structural diagram of an embodiment of a distributed network system according to the present invention.
  • 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.
  • partition mountainous partition
  • the hilltop node 111a serves as a collection point of the partition 110 message for managing the node message of the partition and processing the node message of the other partition; the common node 111b is configured to forward the message to the top node in the partition 110 by using a greedy policy or the like.
  • 111a the top of the mountain Point 111a is the node with the highest connectivity in the partition 110, and the normal node 111b is the node whose connectivity is lower than the summit node 111.
  • 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.
  • 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.
  • system 100 logically includes three phases in a sequence:
  • each node 111 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:
  • H p represents the height value of the node p
  • N(1, p) represents the 1-hop neighbor node set of the node p (including p itself)
  • 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.
  • the normal node 111b 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.
  • the node 111 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.
  • the normal node 111b 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.
  • 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.
  • a hilltop node of a stub partition ie, a partition with only one neighbor 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.
  • 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.
  • 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.
  • the distributed network may include more partitions, each of which may include more partitions. There may be a common node for each partition, and the number of mountain nodes in each partition may be multiple.
  • the distributed network system can be a distributed wired network system or a distributed wireless network system.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the node directly selects a neighboring node that can reach the neighboring partition to forward the subscription message, and avoids forwarding the subscription message to the node that cannot reach the neighboring partition, and then returns to the local mountain node to reroute until the correct forwarding to the neighbor.
  • the case of a partitioned node thus avoiding unnecessary round-trip transmission of subscription messages and generating forwarding redundancy, reducing subscription overhead and transmitting data
  • the overhead and time spent looking for content messages increases data transfer efficiency.
  • 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:
  • 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.
  • 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.
  • 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.
  • 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).
  • the heartbeat message also referred to as a broadcast message
  • 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 neighboring node; further, if the current node is a normal node, the path identifier is also marked in the heartbeat message of the current node, and the heartbeat message of the current node is further broadcasted.
  • the above path identifier may be represented by the attribute or content of the message, for example, there is
  • the road identifier is a message type field, that is, the second heartbeat message is different from the value of the message type field of the first heartbeat message.
  • the way identifier may also be represented by a different message length, message format, and the like from the first heartbeat message, or
  • the way identifier is a message extension field for carrying the partition identifier of the neighbor partition.
  • the local neighbor node information records the partition identifier of the neighbor partition that the neighbor node can reach.
  • 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.
  • 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 tenth embodiment are performed, or the steps S112-S113 described in the eleventh embodiment are performed, or the thirteenth embodiment is performed. Steps S132-S133, or step S172 described in the seventeenth embodiment.
  • 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.
  • the normal node of the current partition sends the content message to the local mountain node for saving after generating the content message.
  • the hilltop node matches the saved content message according to the content message summary in the subscription message. If the match is successful, then The matched content message is sent back along the communication path of the subscription message. Thereafter, the subscription message is invalidated, 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:
  • 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;
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 and the source address identifier remaining in the subscription message.
  • S502 Return the backhaul message along a communication path of the subscription message, where the backhaul The message amount of the message is less 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.
  • 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.
  • 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.
  • 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:
  • 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 perform the steps S112-S113 described in the eleventh embodiment, or execute the tenth The S132-S133 steps described in the third embodiment.
  • S603 Replying to the content matching the subscription message along the communication path of the subscription message interest.
  • 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.
  • the current common node saves the content message locally after generating the content 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:
  • 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;
  • 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.
  • 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)
  • the above S404 is performed to perform the subscription message reduction backhaul.
  • the subscription message is sent to the current The path of the top node of the partition is transmitted; if the above conditions are met A, the above S201, S202 are directly executed to forward the subscription message to the neighbor partition.
  • the embodiment provides an embodiment of the message replying method of the distributed network.
  • the message replying method can 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the step of S801 is specifically: matching 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 matching is successful, the neighbor partition identifying the local partition is included in the to-be-forwarded Subscribe to the neighbor partition of the source partition of the message.
  • the subscription message may be streamlined back along the incoming path as described in the fifth 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the current node may return the content message by referring to the seventh embodiment.
  • This embodiment provides an embodiment of a routing method of a distributed network.
  • the routing method 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, including the following steps:
  • S101 Select, from the neighbor nodes, a path that can lead to the neighbor partition and to the neighbor partition
  • the fewest neighbor nodes are the target neighbor nodes.
  • 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.
  • 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.
  • 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.
  • the current node 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.
  • the embodiment provides an embodiment of the message processing method of the distributed network.
  • the message processing method can be performed by the common node or the mountain node shown in FIG. 1 to improve the search efficiency of the content message and reduce the data transmission overhead, including 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.
  • the local content message is a content message generated by the current partition
  • the current node is a common node, Node
  • the local content message is the content message generated by the current node.
  • 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.
  • the summary message includes a summary of the content message and a partition identifier of the source partition of the content message. .
  • the current node receives a summary message of the content message generated by node 1 in neighbor partition A and saves it locally.
  • 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.
  • 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.
  • 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.
  • This embodiment provides an embodiment of a message processing method of a distributed network.
  • the message processing method may be performed by a common node or a hilltop node shown in FIG. 1 to reduce transmission data overhead and transmission time of a content message, and improve transmission efficiency, including The following steps:
  • S122 Extract, from the subscription message, a node identifier of each history node on a communication path of the subscription message.
  • 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.
  • 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. Among them, when The former node may determine the communication path of the subscription message according to the node identifier in the locally stored subscription message.
  • 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.
  • 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.
  • 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 yes, execute S133; otherwise, perform forwarding the subscription message to a neighbor that can reach the neighboring partition as shown in the second embodiment. node.
  • the current node performs the foregoing fourth or sixth embodiment.
  • 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.
  • 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:
  • S142 Determine whether the subscription message matches the first content message generated by the other partitions. If yes, execute S143, otherwise execute S144.
  • the current node is a mountain node, and the current node is locally stored by two types of content elimination.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 hilltop node or a common node shown in FIG. 1, and includes the following steps:
  • the subscription message carries the node identifier of each history node on the communication path of the subscription message and the partition identifier of the source partition.
  • the current node determines whether the partition identifier of the source partition is the partition identifier of the current partition, and if not, determines that the subscription message is from another partition, and obtains the node identifier that belongs to the current partition that is carried in the subscription message;
  • the node corresponding to the acquired node identifier is determined to be a node that can lead to 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. Specifically, when the subscription message is from another partition, the node identifier of the last hop history node of the subscription message is obtained; and the node corresponding to the acquired node identifier is determined as a neighbor node that can reach the neighbor partition.
  • the current node can further determine the neighbor nodes to which the node can reach.
  • the subscription message also carries a partition identifier that forwards the subscription message.
  • the method further includes: when the subscription message is from another partition, finding a neighbor partition identifier from the partition identifier; determining a neighbor partition corresponding to the neighbor partition identifier as the neighbor partition that can be accessed. Further, the node or the neighbor node that has forwarded the subscription message in the current partition is determined as a node or a neighbor node that can reach the neighbor partition corresponding to the neighbor partition identifier.
  • the current node may perform the relevant step of the fourth or sixth embodiment after receiving the subscription message.
  • the node when receiving the subscription message of the other partition, determines, according to the transmission path of the subscription message, the node that has forwarded the subscription message in the current partition as a node that can reach the neighboring partition, and the node can be known. Whether its neighbor node can lead to the neighbor partition, and further, the path selection can be based on the neighbor node that can lead to the neighbor partition.
  • 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.
  • some nodes in the network perform heartbeat, and the other node does not perform heartbeat.
  • 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.
  • the method further includes: receiving a notification message that is sent by another node and carrying the identifier of the neighboring node; and determining, by the other node, the node corresponding to the neighboring node identifier as the neighboring node.
  • 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.
  • 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:
  • 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.
  • 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.
  • FIG. 3 is a schematic structural diagram of an embodiment of a distributed network node according to the present invention.
  • the node may be a common node as shown in FIG. 1.
  • the node 40 includes a receiving module 41 and a determining module 42.
  • the receiving module 41 is configured to receive a subscription message;
  • the determining module 42 is configured to When it is determined that the subscription message is from another partition, the node that has forwarded the subscription message in the current partition is determined as a node that can reach the neighbor partition.
  • the subscription message carries the node identifier of each historical node on the communication path of the subscription message; the determining module 42 is specifically configured to acquire the node identifier that belongs to the current partition that is carried in the subscription message.
  • the node corresponding to the acquired node identifier is determined as a node that can lead to the neighbor partition.
  • the determining module 42 is specifically configured to determine, by the neighbor node that forwards the subscription message in the current partition, as a neighbor node that can reach the neighboring partition.
  • the forwarding module is specifically configured to: select, from the neighboring nodes, a neighboring node that can reach the neighboring partition; and forward the subscription message to the neighboring node that can reach the neighboring partition.
  • the subscription message carries a partition identifier that forwards the subscription message.
  • the node 40 further includes a searching module, configured to search for the neighbor partition identifier from the partition identifier, and identify the neighbor corresponding to the neighbor partition identifier.
  • the partition is determined to be the neighbor partition to which the access can be made.
  • the node 40 further includes a matching module, configured to determine whether the subscription message matches the local content message; if matched, return the content message; if not, along the path to the neighbor partition The neighbor node forwards the subscription message.
  • a matching module configured to determine whether the subscription message matches the local content message; if matched, return the content message; if not, along the path to the neighbor partition The neighbor node forwards the subscription message.
  • the step of the matching module performing the backhauling the content message comprises: determining whether a source node of the subscription message is included in a neighbor node; if yes, sending the content message directly to the source node Otherwise, the content message is returned along the incoming path of the subscription message.
  • the step of forwarding the subscription message along a neighboring node that can reach the neighboring partition comprises: if not, determining whether the subscription message meets a returning condition; If not, the subscription message is forwarded along a neighbor node that can reach the neighboring partition; if yes, the subscription message is reduced to a backhaul message, and the backhaul is returned along the incoming path of the subscription message. And transmitting a message, wherein the message amount of the backhaul message is smaller than the message amount of the subscription message.
  • the step of the matching module performing the reducing the subscription message into a backhaul message comprises: extracting the feature information from the subscription message; and generating a backhaul message carrying the feature information.
  • 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. For details, refer to the description of the foregoing method embodiments.
  • FIG. 4 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.
  • the node can perform the steps in the above method.
  • 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).
  • the bus 55 may include a power bus, a control bus, a status signal bus, and the like in addition to the data bus.
  • various buses are labeled as bus 55 in the figure.
  • 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 an operation of acquiring a subscription message received by the receiver 52 by calling an instruction in the one or more programs stored in the memory 54; when determining that the subscription message is from another partition, the current partition is The node that forwarded the subscription message is determined to be a node that can reach the neighbor partition.
  • 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé de traitement de message de réseau distribué, et un nœud associé. Le procédé consiste à : recevoir un message d'abonnement; lorsqu'il est déterminé que le message d'abonnement provient d'une autre zone, déterminer un nœud ayant transféré le message d'abonnement dans une zone actuelle comme étant un nœud apte à conduire à une zone voisine. La présente invention permet de savoir si un nœud voisin est apte à conduire à une zone voisine.
PCT/CN2016/085580 2016-06-13 2016-06-13 Procédé de traitement de message de réseau distribué, et nœud associé WO2017214815A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/085580 WO2017214815A1 (fr) 2016-06-13 2016-06-13 Procédé de traitement de message de réseau distribué, et nœud associé

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/085580 WO2017214815A1 (fr) 2016-06-13 2016-06-13 Procédé de traitement de message de réseau distribué, et nœud associé

Publications (1)

Publication Number Publication Date
WO2017214815A1 true WO2017214815A1 (fr) 2017-12-21

Family

ID=60662766

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/085580 WO2017214815A1 (fr) 2016-06-13 2016-06-13 Procédé de traitement de message de réseau distribué, et nœud associé

Country Status (1)

Country Link
WO (1) WO2017214815A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050091399A1 (en) * 2003-09-30 2005-04-28 Candan Kasim S. Resource-aware adaptive multicasting in a shared proxy overlay network
CN101267401A (zh) * 2008-04-25 2008-09-17 北京交通大学 一种结合aodv协议的混合式拓扑控制方法
CN102158983A (zh) * 2011-05-04 2011-08-17 常熟理工学院 一种构建6LoWPAN无线传感器网络的实现方法
CN103813364A (zh) * 2013-11-21 2014-05-21 重庆邮电大学 一种基于区域感知的移动自组织网络中断数据的恢复方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050091399A1 (en) * 2003-09-30 2005-04-28 Candan Kasim S. Resource-aware adaptive multicasting in a shared proxy overlay network
CN101267401A (zh) * 2008-04-25 2008-09-17 北京交通大学 一种结合aodv协议的混合式拓扑控制方法
CN102158983A (zh) * 2011-05-04 2011-08-17 常熟理工学院 一种构建6LoWPAN无线传感器网络的实现方法
CN103813364A (zh) * 2013-11-21 2014-05-21 重庆邮电大学 一种基于区域感知的移动自组织网络中断数据的恢复方法

Similar Documents

Publication Publication Date Title
EP2566137B1 (fr) Procédés et systèmes pour la découverte de réseau poste à poste utilisant la diversité multiutilisateur
US6845084B2 (en) Routing protocol selection for an ad hoc network
US7787429B2 (en) Method and apparatus for establishing path in wireless network
TWI508508B (zh) 利用同級間無線網路中的良好連接的節點的方法和系統
CN108809825B (zh) 建立双向路由的方法及计算机可读存储介质
EP2894812B1 (fr) Procédé et appareil permettant d'établir une interface virtuelle pour un ensemble de dispositifs à écoute mutuelle
US20110289193A1 (en) Method of controlling mobile terminal, home hub, and visited hub in virtual group for content sharing
WO2018098737A1 (fr) Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système
WO2018019056A1 (fr) Procédé de transmission de données, et nœud relais
JP6206483B2 (ja) 通信方法、通信プログラム、および、ノード装置
WO2017214810A1 (fr) Nœud et procédé de routage de réseau distribué
US20120155322A1 (en) Method And Apparatus For Network Node Discovery
WO2018098745A1 (fr) Procédé de communication dans un réseau distribué, nœud, et système
US20140198770A1 (en) Node device, communication method, and storage medium
KR101243244B1 (ko) 애드혹 네트워크에서 에너지 소모를 최소화하는 경로 탐색 장치 및 방법
WO2017214806A1 (fr) Procédé de retour de message de réseau distribué, et nœud associé
KR101288101B1 (ko) 이동무선네트워크 시스템에서의 라우팅 방법 및 이동노드
WO2017024952A1 (fr) Procédé et appareil de recherche de chemin de réseau maillé sans fil dispositif à dispositif
WO2017214815A1 (fr) Procédé de traitement de message de réseau distribué, et nœud associé
WO2017214811A1 (fr) Procédé de traitement de message de réseau distribué, et nœud associé
WO2017214803A1 (fr) Procédé de retour de message de réseau distribué, et nœud associé
WO2017214802A1 (fr) Nœud et procédé de traitement de message de réseau distribué
WO2017214817A1 (fr) Procédé de traitement de message de réseau distribué, et nœud associé
WO2017214801A1 (fr) Nœud et procédé de traitement de message de réseau distribué
WO2017214812A1 (fr) Procédé et nœud de transmission de message en réseau distribué

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16904934

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16904934

Country of ref document: EP

Kind code of ref document: A1