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

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

Info

Publication number
WO2017214806A1
WO2017214806A1 PCT/CN2016/085569 CN2016085569W WO2017214806A1 WO 2017214806 A1 WO2017214806 A1 WO 2017214806A1 CN 2016085569 W CN2016085569 W CN 2016085569W WO 2017214806 A1 WO2017214806 A1 WO 2017214806A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
partition
node
neighbor
content
Prior art date
Application number
PCT/CN2016/085569
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/085569 priority Critical patent/WO2017214806A1/fr
Publication of WO2017214806A1 publication Critical patent/WO2017214806A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a message reply method and a node for a distributed network.
  • 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. When a normal node needs a content message, it generates a subscription message and sends it to the top node of the partition. When the hilltop node does not find a matching content message locally, it selects a path different from the incoming path and sends it to other partitions to find a matching content message. After finding a matching content message, the network must return the content message along the transmission path of the subscription message to the source node of the subscription message.
  • hilltop English: hilltop
  • the transmission path of the subscription message is not necessarily the only path from the content source node to the subscription message source node, and the transmission path may be a relatively complicated one, so the existing content message return mode may cause transmission.
  • the increase in data overhead is not necessarily the only path from the content source node to the subscription message source node, and the transmission path may be a relatively complicated one, so the existing content message return mode may cause transmission.
  • the increase in data overhead is not necessarily the only path from the content source node to the subscription message source node, and the transmission path may be a relatively complicated one, so the existing content message return mode may cause transmission. The increase in data overhead.
  • the technical problem to be solved by the present invention is to provide a message replying method and a node of a distributed network, which can reduce transmission data overhead and improve transmission data efficiency.
  • a technical solution adopted by the present invention is to provide a message replying method for a distributed network, the method comprising: determining whether a neighbor partition contains a target partition of a content message to be returned; and if so, Sending the content message directly to the target partition; otherwise, transmitting the content message along a communication path of the subscription message corresponding to the content message.
  • the step of determining whether the neighbor partition includes the target partition of the content message to be returned further includes: extracting the partition identifier of the neighbor partition from the broadcast message of the neighbor node, and performing local storage; Whether the partition contains content messages to be returned
  • the step of the target 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.
  • the method further includes: receiving the subscription message; matching the subscription message with the local content message; if the matching is successful, performing the Determining whether the neighbor partition contains a target partition of the content message to be returned; otherwise, forwarding the subscription message further.
  • the step of further forwarding the subscription message includes: selecting a neighbor node that can reach the neighbor partition from the neighbor nodes; and forwarding the subscription message to the neighbor node that can reach the neighbor 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 The path identifier of the neighbor partition; if included, the neighbor node is determined to be a neighbor node capable of accessing the neighbor partition.
  • the step of further forwarding the subscription message further includes: if the neighbor partition is determined to be included in a neighbor partition of a source partition of the subscription message to be forwarded, returning the subscription message along a communication path of the subscription message .
  • the step of returning the subscription message along the communication path of the subscription message includes: reducing the subscription message into a backhaul message, and transmitting the backhaul along the communication path of the subscription message a message, wherein the message amount of the backhaul message is less than the message amount of the subscription message.
  • the step of directly sending the content message to the target partition further includes: transmitting a notification message corresponding to the content message according to the communication path, to notify each node on the communication path The content partition has received the content message, wherein the message amount of the notification message is less than the message amount of the content message.
  • a distributed network node comprising: a determining module, configured to determine whether a neighbor partition contains a target partition of a content message to be returned; and a sending module, And when the target partition is included in the neighbor partition, sending the content message directly to the target partition; and a backhaul module, when the neighbor partition does not include the target partition, along the The content message of the subscription message corresponding to the content message is returned to the content message.
  • the network node includes a transmitter, a processor and a memory, and the processor executes, by executing the instruction stored in the memory, a method for: determining whether a neighbor partition contains a target partition of a content message to be returned; if yes, The sender sends the content message directly to the target partition; otherwise, the content message is returned by the sender along a communication path of the subscription message corresponding to the content message.
  • the current node when the current node receives the content message to be returned, it first determines whether the neighbor partition contains the target partition of the content message, and if it does not, directly sends the content message to the target content according to the communication path, thereby reducing the data. Transmission overhead and response time of content messages.
  • FIG. 1 is a schematic structural diagram of an embodiment of a distributed network system according to the present invention.
  • FIG. 2 is a flow chart of an embodiment of a message replying method of a distributed network according to the present invention
  • FIG. 3 is a partial flow chart of another embodiment of a distributed network message replying method of the present invention.
  • FIG. 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.
  • 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 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.
  • the hilltop node 111a is the node with the highest connectivity among the partitions 110
  • the common node 111b is the node whose connectivity is lower than the hilltop 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 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.
  • 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, 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.
  • 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 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.
  • 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.
  • 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 current node may also directly perform S403 when the subscription message and the local content message match successfully, and perform the following eighth embodiment, as shown in FIG. 3.
  • Figure 3 only shows the upper In S901, the current node actually executes S902 and S903 after executing S901.
  • 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 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:
  • 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 content.
  • the content summary can be a matching content message digest and/or a subscribing 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 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.
  • 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 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.
  • 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 (figure When the embodiment shown in Fig. 1 illustrates 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 situation A is met, 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.
  • This 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 transmission path of the message and reduce the 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.
  • FIG. 2 is a flowchart of an embodiment of a message replying method for a distributed network according to the present invention.
  • the message replying method may be performed by the hilltop node shown in FIG. 1, and includes 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 current node further extracts, from the broadcast message of the neighbor node, that is, the heartbeat message, the partition identifier of the neighbor partition that the neighbor node can reach, and performs local storage.
  • the S901 includes: matching the partition identifier of the neighbor partition with the locally stored partition identifier; if the matching is successful, determining that the neighbor partition includes the target 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 cancellation along a communication path of the subscription message corresponding to the content message. interest.
  • the current node may return the content message by referring to the seventh embodiment.
  • the destination path is the target partition A-partition B-partition C.
  • partition A and partition C are adjacent.
  • the current node determines whether the neighbor partition includes the target partition of the content message, and if it does not, directly sends the content message to the target content according to the communication path, reducing The data transmission overhead and the response time of the content message.
  • 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 neighbor node that can lead to the neighbor partition and has the few hops to the neighbor partition as the target neighbor node.
  • 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. The current node may determine a 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 fourth or sixth embodiment described above, and determines the subscription message and the local When the content messages do not match, 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 hilltop node
  • 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.
  • 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.
  • 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:
  • 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.
  • the current node may perform the relevant step of the fourth or sixth embodiment after receiving the subscription message.
  • 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.
  • Step S161 the current node performs every first time interval. Step S161, and performing the step of sending the notification message every second time interval; wherein the first time interval is smaller than the second time interval.
  • 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. 4 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 judging module 41, a transmitting module 42, and a backhaul module 43.
  • the determining module 41 is configured to determine whether the target partition of the content message to be returned is included in the neighbor partition.
  • the sending module 42 is configured to send the content message directly to the target partition when the target partition is included in the neighbor partition.
  • the backhaul module 43 is configured to: when the neighboring partition does not include the target partition, return the content message along a communication path of the subscription message corresponding to the content message.
  • the method further includes a storage module, configured to extract the neighbor from a broadcast message of the neighbor node
  • the partition identifier of the partition is stored and stored locally; the determining module 41 is specifically configured to match the partition identifier of the target partition with the locally stored partition identifier; if the matching is successful, determine that the neighbor partition includes the target partition.
  • the method further includes a matching module, where the matching module is configured to receive the subscription message, and the subscription message is matched with the local content message; the determining module 41 is further configured to perform the determining the neighbor partition when the matching is successful. Whether the target partition of the content message to be returned is included in the step; the forwarding module is configured to further forward the subscription message when the matching is unsuccessful.
  • the forwarding module is specifically configured to select, from the neighboring nodes, a neighbor node that can reach the neighboring partition, and forward the subscription message to the neighboring node that can reach the neighboring partition.
  • the forwarding module is further configured to determine, in the broadcast message of the neighboring node, a partition identifier of the neighbor partition or a path identifier that can be connected to the neighbor partition; if yes, determine the neighbor node A neighbor node that is capable of accessing the neighbor partition.
  • the forwarding module is further configured to: if it is determined that the neighbor partition is included in the neighbor partition of the source partition of the subscription message to be forwarded, return the subscription message along the communication path of the subscription message.
  • the step of the forwarding module performing the returning the subscription message along the communication path of the subscription message comprises: reducing the subscription message into a backhaul message, and following the message of the subscription message The path returns the backhaul message, wherein the message amount of the backhaul message is smaller than the message amount of the subscription message.
  • the sending module 42 is further configured to: 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. a message, wherein the message amount of the notification message is less than the message amount of the content message.
  • 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. 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. Step.
  • the detailed description in the above method please refer to the detailed description in the above method, which will not be described here.
  • 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).
  • NVRAM non-volatile random access memory
  • 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 determining whether the neighbor partition contains a target partition of the content message to be returned by calling an instruction in the one or more programs stored in the memory 54; if yes, the transmitter 51 The content message is directly sent to the target partition; otherwise, the content message is returned by the sender 51 along the incoming path of the subscription message corresponding to the content 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.

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 retour de message de réseau distribué, et un nœud associé. Le procédé consiste à : déterminer si des zones voisines comprennent une zone cible d'un message de contenu devant être retourné ; dans l'affirmative, envoyer directement le message de contenu à la zone cible ; dans la négative, retourner le message de contenu via un trajet d'un message d'abonnement correspondant au message de contenu. La présente invention réduit les surdébits de transmission de données, et améliore l'efficacité de transmission de données.
PCT/CN2016/085569 2016-06-13 2016-06-13 Procédé de retour de message de réseau distribué, et nœud associé WO2017214806A1 (fr)

Priority Applications (1)

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

Applications Claiming Priority (1)

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

Publications (1)

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

Family

ID=60662888

Family Applications (1)

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

Country Status (1)

Country Link
WO (1) WO2017214806A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109218385A (zh) * 2018-06-28 2019-01-15 西安华为技术有限公司 处理数据的方法和装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101414964A (zh) * 2008-12-04 2009-04-22 天津大学 减少容迟网络和间歇连接网络中冗余消息的方法
US20150356242A1 (en) * 2013-01-21 2015-12-10 Life Technologies Corporation Systems and Methods for Gene Expression Analysis

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101414964A (zh) * 2008-12-04 2009-04-22 天津大学 减少容迟网络和间歇连接网络中冗余消息的方法
US20150356242A1 (en) * 2013-01-21 2015-12-10 Life Technologies Corporation Systems and Methods for Gene Expression Analysis

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHAKRABORTY, DIPANJAN ET AL.: "Toward Distributed Service Discovery in Pervasive Computing Environments", IEEE TRANSACTIONS ON MOBILE COMPUTING, vol. 5, no. 2, 28 February 2006 (2006-02-28), pages 97 - 112, XP001545958 *
FRIEDMAN, ROY ET AL.: "3DLS: Density-Driven Data Location Service for Mobile Ad-Hoc Networks", MOBIHOC'09 PROCEEDINGS OF THE TENTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 21 May 2009 (2009-05-21), pages 309 - 318, XP055447716 *
FRIEDMAN, ROY ET AL.: "A density-driven publish subscribe service for mobile ad-hoc networks", AD HOC NETWORKS, vol. 11, no. 1, 31 January 2013 (2013-01-31), pages 522 - 540, XP055447715 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109218385A (zh) * 2018-06-28 2019-01-15 西安华为技术有限公司 处理数据的方法和装置
CN109218385B (zh) * 2018-06-28 2021-08-03 西安华为技术有限公司 处理数据的方法和装置

Similar Documents

Publication Publication Date Title
US6845084B2 (en) Routing protocol selection for an ad hoc network
EP2566137B1 (fr) Procédés et systèmes pour la découverte de réseau poste à poste utilisant la diversité multiutilisateur
US7787429B2 (en) Method and apparatus for establishing path in wireless network
EP2807842B1 (fr) Procédés et appareils destinés à une découverte de dispositif
JP4911402B2 (ja) 移動無線通信システム及びその通信制御方法、移動端末、並びにプログラム
JP2017184051A (ja) 無線通信装置および無線通信方法
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
JP2013507836A (ja) ピアツーピアワイヤレスネットワークにおける良好に接続されたノードの活用のための方法およびシステム
WO2017214810A1 (fr) Nœud et procédé de routage de réseau distribué
WO2018019056A1 (fr) Procédé de transmission de données, et nœud relais
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
Hong et al. A hybrid beaconless geographic routing for different packets in WSN
Sakthipriya et al. A reliable communication scheme for VANET communication environments
WO2017214806A1 (fr) Procédé de retour de message de réseau distribué, et nœud associé
KR101288101B1 (ko) 이동무선네트워크 시스템에서의 라우팅 방법 및 이동노드
KR101243244B1 (ko) 애드혹 네트워크에서 에너지 소모를 최소화하는 경로 탐색 장치 및 방법
WO2017214803A1 (fr) Procédé de retour de message de réseau distribué, et nœud associé
WO2017214817A1 (fr) Procédé de traitement de message de réseau distribué, et nœud associé
WO2017214812A1 (fr) Procédé et nœud de transmission de message en réseau distribué
WO2017214802A1 (fr) Nœud et procédé de traitement de message de réseau distribué
WO2017214805A1 (fr) Nœud et procédé de battement de cœur de réseau distribué
WO2017214811A1 (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é

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: 16904925

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: 16904925

Country of ref document: EP

Kind code of ref document: A1