WO2018098753A1 - Procédé de gestion de réseau distribué, nœud et système - Google Patents

Procédé de gestion de réseau distribué, nœud et système Download PDF

Info

Publication number
WO2018098753A1
WO2018098753A1 PCT/CN2016/108153 CN2016108153W WO2018098753A1 WO 2018098753 A1 WO2018098753 A1 WO 2018098753A1 CN 2016108153 W CN2016108153 W CN 2016108153W WO 2018098753 A1 WO2018098753 A1 WO 2018098753A1
Authority
WO
WIPO (PCT)
Prior art keywords
cluster
node
cluster head
head node
nodes
Prior art date
Application number
PCT/CN2016/108153
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/108153 priority Critical patent/WO2018098753A1/fr
Publication of WO2018098753A1 publication Critical patent/WO2018098753A1/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

  • 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 common nodes 111 and at least one sink node 112. Based on the actual network physical topology, the plurality of common nodes 111 may be divided into at least one virtual cluster 110, and the ordinary nodes 111 in the cluster 110 are further divided into at least one cluster head node 111a and cluster member node 111b. .
  • the cluster member node 111b within the cluster may be set to establish communication only with the cluster head node 111a, and no communication between the cluster member nodes 111b.
  • this is not a limitation, and communication can be implemented between the cluster member nodes 111b according to actual needs.
  • the present invention provides an embodiment of a message broadcast method for a distributed network.
  • the message broadcast method may be performed by the common node in the first embodiment, and is used to determine whether the normal node broadcasts a message requesting the campaign cluster head node.
  • the method includes the following steps:
  • S204 The request message including the remaining energy value of the self is not broadcasted.
  • the present invention provides another embodiment of a message broadcast method for a distributed network.
  • the message broadcast method may be performed by the common node described in the first embodiment, and is used to determine when to broadcast a message for requesting the election of the cluster head node, and the method includes the following steps:
  • the normal node after determining that the residual energy value of the self is less than the set threshold, the normal node further performs: if the request message sent by another ordinary node is not received within the first set time, the adjustment The threshold is set, and the above determination is made to determine whether the remaining energy value is less than the set threshold.
  • the ordinary node thinks that it is likely to be the cluster head node, so it is broadcast instantaneously.
  • S501 The ordinary node receives the networking message sent by the neighboring ordinary node.
  • S502 Acquire and save location information of the neighboring ordinary node from the networking message.
  • S503 When sending a message to the sink node as a cluster head node, select, according to the saved location information, a neighbor cluster head node that has the shortest distance from the sink node.
  • S504 Send the message to the selected neighbor cluster head node to forward the message to the sink node by using the selected neighbor cluster head node.
  • the shortest path is implemented, and the time and cost of data transmission to the aggregation node are reduced.
  • the routing method directly uses the location information carried in the networking message, and does not need to add a routing message, so the control overhead is reduced.
  • the present invention provides an embodiment of a cluster preferred method for a distributed network.
  • the method may be performed by a common node as described in the first embodiment, and may be used to implement a cluster preferred request without sending a contention request message from a common node.
  • the method includes:
  • S602 Obtain the foregoing according to the remaining energy information when entering a next cluster preferred phase The current remaining energy value of other common nodes.
  • the remaining energy information includes a second remaining energy value when the current cluster head node of the cluster is the last time the other common node sends data during the current cluster cluster node, for example, during the current cluster head node.
  • the S602 specifically includes: using the second remaining energy value of other common nodes as the current remaining energy value of the other common nodes.
  • the remaining energy information includes a first remaining energy value of the other common node and a communication status when the current cluster head node of the cluster is determined as the current cluster head node; and the S602 specifically includes: estimating according to the communication situation. Obtaining an energy loss value of the other common node during the cluster head node as the first node of the periodic cluster; taking the difference between the first remaining energy value of each other common node and its energy loss value as the other The current remaining energy value of the normal node. For example, the number of communications of the node is divided into multiple levels, and the energy loss values corresponding to different levels are preset, and the communication times of the other common nodes are divided into corresponding levels by the corresponding correspondence, so that the corresponding energy is obtained by querying. Loss value.
  • S604 Broadcast a self-recommendation notification message of a new cluster head node.
  • the normal node detects whether the current remaining energy value of the other node is greater than the current remaining energy value of the other common node, and detects whether a notification message sent by another ordinary node is newly received as a new cluster head node, and if not received, Determining itself as a new cluster head node, and broadcasting a notification message that is self-recommended as a new cluster head node, otherwise determining that the other common node that sends the notification message is a new cluster head node, and therefore does not broadcast a notification that is self-recommended as a new cluster head node. Message.
  • the normal node may perform data transmission and re-division of the cluster according to other embodiments of the present invention or a combination thereof.
  • the common node does not need to send the contention request message, so the transmission overhead generated by selecting the cluster head node is greatly reduced, and the energy of the node is also saved.
  • S701 The common node detects whether the cluster has the first node and whether the current residual energy of the cluster is greater than the set energy value when the cluster is in the preferred phase; if it is greater than, the process performs S702; otherwise, it determines that the cluster head node cannot be elected, so Broadcast notification message.
  • S702 Broadcast a self-recommendation notification message of a new cluster head node.
  • S803 Broadcast a request message including its own remaining energy value to request to select the cluster head node.
  • the setting condition includes a condition related to the remaining energy of the node and/or its position, for example, including whether the remaining energy value of the node meets the set energy condition and whether the node is closest to the distance of the sink node.
  • S804 can be referred to the description of S204.
  • set threshold For the description of the set threshold, refer to the set threshold in the third embodiment described above.
  • S902 The request message including the self-remaining energy value is not broadcasted.
  • S903 Broadcast a request message including its own remaining energy value.
  • the present invention provides an embodiment of a cluster preferred method for a distributed network.
  • the method may be performed by the cluster head node described in the first embodiment, and may be used to implement a cluster preferred request without sending a contention request message from a common node.
  • the method includes:
  • S1002 When entering the preferred phase of the next cluster, compare the current remaining energy value of the cluster node, and find the node with the largest remaining energy value.
  • S1003 Broadcast to determine that the node with the largest current remaining energy value is a notification message of the new cluster head node.
  • the cluster head node is the cluster head node
  • the data transmission and the re-division of the cluster may be performed according to other embodiments of the present invention or a combination thereof.
  • S1101 The cluster head node determines whether the target node of the data to be sent is a neighbor cluster head node. If yes, execute S1102, otherwise execute S1104.
  • the target node of the data to be sent is the next hop node of the cluster head node in the transmission path of the data to be transmitted, that is, the next hop node to which the cluster head node needs to send the data to be sent.
  • S1102 Search for a cluster member node associated with the target node.
  • the method further includes: broadcasting the test signal at the first transmit power; receiving a feedback signal sent by the cluster member node, wherein the feedback signal includes the cluster member node receivable
  • the information of the neighbor cluster head node of the test signal is the address of the neighbor cluster head node; the association between the cluster member node and the neighbor cluster head node of the cluster member node that can receive the test signal is established.
  • the cluster head node maintains an association relationship of at least one neighbor cluster head node.
  • S1103 Send the to-be-sent data to the associated cluster member node with a first transmit power, to forward the to-be-sent data to the target node by using the associated cluster member node.
  • the cluster head node compares the address of the target node with the neighbor cluster head node address in the pre-stored association relationship to find whether there is a neighbor cluster head that matches the target node address. a node address; if yes, acquiring cluster member node information associated with the target node according to the pre-stored association relationship, and transmitting the to-be-sent data to the cluster member node by using the first transmit power; The transmit power transmits the to-be-sent data directly to the target node.
  • the first transmit power (also referred to as intra-cluster transmit power) satisfies the cluster head node communicating with all cluster member nodes thereof, but cannot satisfy the cluster head node communication with all neighbor cluster head nodes.
  • the second transmit power (also referred to as extra-cluster transmit power) is greater than the first transmit power, and can satisfy communication between the cluster head node and all neighbor cluster head nodes.
  • the communication range achieved by the first transmit power is The communication range achieved by the second transmission power is R.
  • S1104 Send the to-be-sent data to the target node by using a first transmit power.
  • the target node is a cluster member node.
  • S1201 The cluster member node receives data sent by the cluster head node in the cluster at the first transmit power.
  • the first transmit power meets that the cluster head node communicates with all cluster member nodes in the cluster, but the cluster head node cannot communicate with all neighbor cluster head nodes.
  • S1202 Acquire target node information included in the data, and detect whether the target node of the data is a neighbor cluster head node.
  • the data sent by the cluster head node at the first transmit power may be sent directly to the intra-cluster node or may be sent to the neighbor cluster node. Therefore, after receiving the data, the cluster member node receives the data. According to the target node information in the data, such as the target node address, it is determined whether the target node of the data is a neighbor cluster head node or a cluster member node, and if it is a neighbor cluster head node, then S1203 is performed. If it is a cluster member node, it determines that the target node of the data is itself, and performs corresponding processing on the data to end the process. The target node described in this embodiment is as described in the eleventh embodiment.
  • the cluster member node performs intra-cluster communication with the first transmit power, and similarly, the cluster member node forwards the data to the neighbor cluster head node with the first transmit power.
  • the cluster member node can assist the communication between the cluster head node and the neighbor cluster head node without increasing its own transmit power.
  • the method may further include: receiving a test signal that the neighbor cluster head node broadcasts at the first transmit power; generating feedback information including information about the neighbor cluster head node, and sending the information to the cluster a cluster head node, so that the cluster head node establishes an association between the cluster member node and the neighbor cluster head node according to the feedback information.
  • the cluster head node and the cluster member node in the eleventh and twelfth embodiments described above may implement the cluster preferred fetch or request message broadcast in the cluster preferred node in the above embodiment.
  • the cluster head node transmits data to the cluster member node by using the intra-cluster transmit power, and the cluster member node forwards the data to the neighbor cluster head node, so the cluster head node only implements the intra-cluster transmit power.
  • Inter-cluster communication saves the energy of the cluster head node.
  • the present invention provides an embodiment of a communication adjustment method for a distributed network.
  • the message broadcast method may be performed by the cluster head node described in the first embodiment, for adaptively adjusting inter-cluster transmit power, and saving node energy.
  • the method includes the following steps:
  • the cluster head node can periodically detect the communication quality with the adjacent cluster head node, or perform the detection at the set time of the data communication phase as initially.
  • the communication quality may be any parameter that can represent the communication state between the cluster head node and the adjacent cluster head node, for example, the error of the cluster head node and the adjacent cluster head node communicating within a set time. Rate and so on.
  • S1302 Adjust transmit power when communicating with the neighboring cluster head node according to the communication quality.
  • the transmit power of the communication between the cluster head node and the adjacent cluster head node may be adjusted, and the specific cluster head node is adjusted according to the communication quality with the adjacent cluster head node. For example, if the communication quality satisfies the first set condition, the transmit power when communicating with the neighboring cluster head node is up-regulated; if the communication quality satisfies the second set condition, then the adjacent The transmit power of the cluster head node is reduced when it communicates.
  • the up or down adjustment may be performed according to the set step size, or the power value to be adjusted may be determined according to the difference between the current communication quality and the set condition.
  • the first setting condition is that a bit error rate of the cluster head node and the adjacent cluster head node communicating within a set time is less than a first set value
  • the second setting condition is the cluster The error rate of the first node and the adjacent cluster head node communicating within the set time is greater than a second set value; wherein the second set value is greater than or equal to the first set value.
  • the third setting condition is that the error rate of the cluster head node and the adjacent cluster head node communicating within the set time is between the first set value and the second set value.
  • the method may further comprise the following steps:
  • the cluster head node detects the communication quality with the cluster member nodes in the cluster.
  • S1304 Adjust transmit power when communicating with the cluster member node according to the communication quality with the cluster member node in the cluster.
  • the cluster head node adjusts the transmit power in the cluster according to the communication quality of the cluster member node.
  • the cluster head node adjusts the transmit power when communicating with the neighbor cluster head node according to the communication quality with the neighbor cluster head node, thereby realizing the adaptive adjustment of the transmit power of the inter-cluster communication, and avoiding the cluster communication between the clusters.
  • the extra waste of the energy of the first node enhances the efficient use of the energy of the cluster head node.
  • the present invention provides an embodiment of a communication adjustment method for a distributed network.
  • the message broadcast method may be performed by the cluster head node described in the first embodiment, for adaptively adjusting inter-cluster transmit power, and saving node energy.
  • the method includes the following steps:
  • the cluster head node acquires a distance from an adjacent cluster head node.
  • the cluster head node sends a message asking the location information to the neighboring cluster head node, and the neighboring cluster head node feeds back the location information in response to the query message; or the neighboring cluster head node sends the data to the cluster head node.
  • the location information may be sent by the notification message of the network node or the broadcasted cluster head node as in the fifth or fifteenth embodiment, and the cluster head node extracts the location information from the data. Save, get pre-stored neighbors when making adjustments
  • the location information of the cluster head node, and the distance between the cluster head node and the adjacent cluster head node is calculated by the location information.
  • S1402 Adjust, according to the distance, a transmit power when communicating with the adjacent cluster head node.
  • the transmission power of the communication between the cluster head node and the adjacent cluster head node is adjustable.
  • the specific cluster head node is pre-set with a corresponding relationship between different communication ranges and different transmit power values, and the S1402 may include: searching for a communication range that matches the distance from the preset transmit power values corresponding to different communication ranges. a transmit power value; adjusting transmit power when communicating with the neighboring cluster head node to the searched transmit power value.
  • the method may further comprise the following steps:
  • the cluster head node acquires a distance from a cluster member node in the cluster.
  • S1404 Adjust transmit power when communicating with the cluster member node according to the distance from the cluster member node in the cluster.
  • the cluster head node adjusts the transmit power in the cluster according to the distance pair with the cluster member node.
  • the cluster head node may also perform the above S1303-S1304 to adjust the transmission power when communicating with the cluster member nodes.
  • the cluster head node adjusts the transmit power when communicating with the neighbor cluster head node according to the distance from the neighbor cluster head node, thereby realizing the adaptive adjustment of the transmit power of the inter-cluster communication, and avoiding the cluster head when inter-cluster communication
  • the extra waste of node energy enhances the efficient use of the energy of the cluster head node.
  • the transmit power when the adjusted cluster head node communicates with the cluster member node in the thirteenth and fourteenth embodiments can be used as the first transmit power in the other embodiments of the present invention, and the adjusted cluster head node and the adjacent cluster are used.
  • the transmit power at the time of the first node communication can be used as the second transmit power in other embodiments of the present invention.
  • other embodiments of the present invention can use the first transmit power and the second transmit power to perform communication and re-division. Clusters and clusters are preferred to take or request message broadcasts.
  • the present invention provides an embodiment of a communication method for a distributed network.
  • the communication method may be performed by the cluster head node described in the first embodiment, and is used by the cluster head node to implement routing based on the node location during data transmission.
  • the method includes the following steps:
  • the cluster head node selects a neighbor cluster node with the shortest distance from the sink node according to the location information of the pre-stored neighbor cluster head node.
  • the location information of the neighbor cluster head node is derived from a notification message broadcast by the neighbor cluster head node when the cluster head node is elected.
  • the location information may specifically include a distance between the neighbor cluster head node and the sink node, or include other distances between the neighbor cluster head node and the sink node. Information.
  • This step occurs during the above data transfer phase. For example, when the cluster head node uploads data sent by the cluster member node of the cluster to the aggregation node, the cluster head node acquires the neighbor location information saved in the cluster first broadcast stage, and finds the neighbor cluster head in the saved information. The location message of the node compares the obtained location information of at least one neighbor cluster head node to obtain a neighbor cluster node with the shortest distance from the sink node.
  • S1502 Send the message to the selected neighbor cluster head node to forward the message to the sink node by using the selected neighbor cluster head node.
  • the cluster head node performs intra-cluster and out-of-cluster communication as described in the fourth embodiment described above. Specifically, the cluster head node sends the message to the selected neighbor cluster head node with the out-of-cluster transmit power after determining the neighbor cluster head node communication closest to the sink node. After receiving the message, the neighbor cluster head node may also forward the message to the next neighbor node of the neighboring cluster node by using the method embodiment, and each forwarding node forwards the message to such a message until the message is forwarded. Reach the aggregation node.
  • the method prior to S1501, the method further includes the following steps:
  • S1503 Receive a notification message broadcast by the neighbor cluster head node when the cluster head node is elected.
  • S1504 Acquire and save the address and location information of the neighbor cluster head node from the notification message.
  • the S1503-S1504 described above is executed in the cluster head broadcast sub-phase.
  • the notification message includes address and location information of the neighbor cluster head node.
  • the cluster head node obtains the address and location information from the notification message, and establishes a mapping relationship and saves it.
  • the cluster head node may generate a notification message including its own address and location information when the cluster head node is elected, and broadcast the notification message to notify it that the cluster head node is elected.
  • the other neighbor cluster head node receives the network message, and the method step can be performed in the same manner to obtain the location information of the neighbor cluster head node.
  • cluster head node in this embodiment may also use other embodiments of the present invention to re-divide the clusters and perform cluster preference or request message broadcasts.
  • the location information in the notification message of the elected cluster head node is used to determine the neighbor cluster head node that is closest to the sink node, so that the neighbor cluster node closest to the sink node forwards the message to the sink node, so The time and cost of data transmission to the aggregation node are minimized, and the routing efficiency is improved.
  • the routing method directly implements the location information in the notification message, and does not need to add a routing message, so the control overhead is reduced.
  • FIG. 3 is an embodiment of a method for managing a distributed network according to the present invention.
  • the management method may be performed by the cluster head node described in the first embodiment, and is used to re-divide the cluster after the networking node stage.
  • the method includes the following steps:
  • S1601 The cluster head node counts the number of nodes in the cluster.
  • the intra-cluster node may include the cluster head node or a cluster member node that does not include the cluster head node including only the cluster in which the cluster head node is located.
  • the cluster head node broadcasts a sounding signal, wherein the sounding signal is used to request the cluster member node in the cluster to respond to the sounding signal; and the cluster member node in the cluster responds to the sounding signal sent by the sounding signal; Signal to get the number of nodes in the cluster.
  • the sounding signal may be used to notify the notification message of the cluster head node.
  • the cluster head node broadcasts the sounding signal when determining the cluster head node, and the sounding signal includes the cluster head node.
  • the address is also used to notify the normal node in the cluster that it is elected as the cluster head node.
  • the cluster head node may obtain the cluster member nodes in the cluster by counting the number of responses received;
  • S1602 Determine whether the number of nodes in the cluster is greater than a set value; if greater than, execute S1603, otherwise determine that clustering is not required, and the process ends.
  • the set value may be obtained from the networking message broadcast by the aggregation node, or may be determined by the previous communication status and/or residual energy status of the cluster, for example, determining that the current remaining energy value of the cluster node is in advance. In which energy range is set, the number of nodes in the cluster is compared to a matching set value in the energy range.
  • S1603 Divide the cluster into at least two clusters, and upload the division result to the aggregation node.
  • the cluster may be determined according to the difference between the number of cluster nodes currently located and the set value. For example, if the difference is less than one third of the data of the cluster node, the cluster is divided into two clusters. If the difference is between one-third and one-time of the data of the cluster node, it is divided into three clusters. If the difference is greater than one-time of the cluster node data, it is divided into four clusters.
  • the partitioning result is forwarded to the neighbor cluster head node to be sent to the sink node through the neighbor cluster head node, and the partitioning result is broadcasted to the intra-cluster node.
  • the cluster head node may further determine a cluster head node of each cluster after the partitioning, for example, find a cluster that does not include the cluster head node in the at least two clusters; The node with the highest remaining energy value in the cluster is determined as the cluster head node of the corresponding cluster, and the determination result is broadcasted in the cluster.
  • the intra-cluster node divides the new cluster according to the received content and determines a new one. The cluster head node of the cluster.
  • the cluster head node may also be unsure of the cluster head node of each cluster. After the cluster nodes are clustered according to the foregoing division result, the request message of the cluster head node or the broadcast competition cluster head node may be selected and implemented according to the foregoing embodiment. The selection of the cluster head.
  • the cluster member node can adjust its transmit power according to the thirteenth and fourteenth embodiments.
  • the cluster head node performs the above inter-cluster communication and intra-cluster communication Reference can be made to the description of the relevant embodiments above.
  • the method further includes: determining, in the networking phase, the edge length of the cluster according to the networking policy; wherein the network policy is closer to the cluster, the larger the area of the cluster is. .
  • the networking policy includes at least three sizes of clusters.
  • the networking policy specifically includes a square in which the distance between the node and the sink node is within a first distance, and the cluster is a square whose first length is a side length; When the distance between the node and the sink node is outside the first distance range and within the second distance range, the cluster is a square whose side length is the second length; when the distance between the node and the sink node is at the second distance Outside the range and within the third distance range, the cluster is a square having a third length; wherein the first length is smaller than the second length and smaller than the third length.
  • the cluster head node may also perform inter-cluster or intra-cluster communication and perform cluster preference or request message broadcast by using other embodiments of the present invention.
  • the cluster head node can re-divide the cluster according to the number of nodes in the cluster of the current cluster, realizes the intelligent adjustment of the cluster division in the distributed network, and limits the number of cluster nodes in the network, and avoids the cluster head node. Due to the excessive number of nodes in the cluster and the excessive energy consumption, the energy uniformity of the network nodes can be achieved to a certain extent.
  • the node may be a common node as shown in FIG. 1.
  • the node includes a statistics module 171, a determination module 172, and a partitioning module 173.
  • the statistics module 171 is configured to count the number of nodes in the cluster
  • the determining module 172 is configured to determine whether the number of nodes in the cluster is greater than a set value
  • the dividing module 173 is configured to divide the cluster into at least two clusters when the number of nodes in the cluster is greater than a set value, and upload the partitioning result to the sink node.
  • the statistic module 171 is specifically configured to broadcast a sounding signal, where the sounding signal is used to request the cluster member node in the cluster to respond to the sounding signal; and receive a response signal sent by the cluster member node in the cluster in response to the sounding signal; The received answer signal is counted to obtain the number of nodes in the cluster.
  • the answering signal of the cluster member node in the cluster includes a remaining energy value of the cluster member node in the cluster; the node may further include a broadcast module, configured to find that the cluster head is not included in the at least two clusters a cluster of nodes; determining, as the cluster head node of the corresponding cluster, the node with the highest remaining energy value in each of the found clusters, and broadcasting the determination result.
  • a broadcast module configured to find that the cluster head is not included in the at least two clusters a cluster of nodes; determining, as the cluster head node of the corresponding cluster, the node with the highest remaining energy value in each of the found clusters, and broadcasting the determination result.
  • the cluster head node broadcasts the sounding signal when determining the cluster head node, and the sounding signal includes an address of the cluster head node, and is also used to notify the cluster member node in the cluster that it is elected the cluster head node.
  • the statistic module 171 is specifically configured to: in the selecting a cluster initial stage, detecting whether a request message broadcast by the node in the cluster is received, where the request message includes a remaining energy value of a node that broadcasts the request message, and is used to request to be elected.
  • the cluster head node if received, determining the general Whether the remaining energy value of the pass node is greater than the remaining energy value included in the request message; if yes, broadcasting a request message including its own remaining energy value to request election of the cluster head node; if not, not broadcasting Determining a request message including a self-remaining energy value; after the broadcasting the request message including the remaining energy value of the self, if the request message sent by the new intra-cluster node is not received within the selected cluster initial stage, determining the location The cluster head node of the cluster and broadcasts the sounding signal.
  • the node further includes a determining module, configured to determine, according to the networking policy, a side length of the cluster according to the networking policy, where the networking policy is closer to the area of the cluster where the sink node is located, Big.
  • a determining module configured to determine, according to the networking policy, a side length of the cluster according to the networking policy, where the networking policy is closer to the area of the cluster where the sink node is located, Big.
  • the networking policy specifically includes: when the distance between the node and the sink node is within a first distance range, where the cluster is a square whose side length is a first length; when the distance between the node and the sink node is at a When the distance is outside the range and within the second distance, the cluster is a square whose side length is the second length; when the distance between the node and the convergence node is outside the second distance range and within the third distance range, The cluster is a square whose side length is a third length; wherein the first length is smaller than the second length and smaller than the third length.
  • 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. It is to be understood that the foregoing modules of the foregoing nodes may also perform other steps in the foregoing method embodiments, or the foregoing nodes may further include other functional modules for performing other steps in the foregoing method embodiments.
  • FIG. 6 is a schematic structural diagram of another embodiment of a distributed network node according to the present invention.
  • the node is a normal 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 180 includes a transmitter 181, a receiver 182, one or more processors 183, a memory 184, and a bus 185.
  • the transmitter 181 is configured to send messages to other nodes in the distributed network, such as collected sensing data, networking messages, and the like.
  • the receiver 182 is configured to receive messages sent by other nodes in the distributed network, such as the collected sensor data, networking messages, and the like, and the memory 184 includes a read only memory and a random access memory. A portion of memory 184 may also include non-volatile random access memory (NVRAM).
  • NVRAM non-volatile random access memory
  • the processor 183 may also be referred to as a CPU (Central Processing Unit).
  • the various components of the node may be coupled together by a bus 185.
  • the bus 185 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 185 in the figure.
  • the node may not include the bus.
  • the node 180 further includes a plurality of applications and one or more programs.
  • the plurality of applications and one or more programs are stored in the memory 184 and configured to be executed by the processor 183.
  • the one or more programs include instructions.
  • the processor 183 is configured to execute the foregoing method embodiments or a combination thereof by calling the instructions in the one or more programs stored in the memory 184. For details, refer to the description of the foregoing method embodiments.
  • the above solution can reduce the control overhead, thereby saving node energy, extending the life of nodes and networks, and improving the reliability of network communication.

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 gestion d'un réseau distribué, un nœud et un système. Le procédé comprend les étapes consistant à : collecter, par un nœud de tête de grappe, les statistiques concernant le nombre de nœuds dans une grappe; déterminer si le nombre de nœuds dans la grappe est supérieur à une valeur définie ou non; si tel est le cas, diviser la grappe dans laquelle le nœud de tête de grappe est situé en au moins deux grappes, et télécharger le résultat de division vers un nœud d'agrégation. Au moyen du procédé, une consommation d'énergie élevée du nœud de tête de grappe peut être évitée.
PCT/CN2016/108153 2016-11-30 2016-11-30 Procédé de gestion de réseau distribué, nœud et système WO2018098753A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108153 WO2018098753A1 (fr) 2016-11-30 2016-11-30 Procédé de gestion de réseau distribué, nœud et système

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108153 WO2018098753A1 (fr) 2016-11-30 2016-11-30 Procédé de gestion de réseau distribué, nœud et système

Publications (1)

Publication Number Publication Date
WO2018098753A1 true WO2018098753A1 (fr) 2018-06-07

Family

ID=62241038

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/108153 WO2018098753A1 (fr) 2016-11-30 2016-11-30 Procédé de gestion de réseau distribué, nœud et système

Country Status (1)

Country Link
WO (1) WO2018098753A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112261665A (zh) * 2020-10-15 2021-01-22 天津津航计算技术研究所 一种自组织网络的组网方法
CN112954584A (zh) * 2021-01-28 2021-06-11 西安电子科技大学 基于量子退火算法的无人机通信网络路由规划方法
CN113485431A (zh) * 2021-07-23 2021-10-08 西安理工大学 一种紫外光通信协作的无人机集群分簇控制方法
CN113535635A (zh) * 2021-06-13 2021-10-22 复旦大学 一种用于双层环簇网络的自适应重配置硬件结构
CN114189917A (zh) * 2022-01-15 2022-03-15 西安电子科技大学 基于量子退火的移动自组织网络分簇及簇间路由规划方法
CN114363988A (zh) * 2021-12-10 2022-04-15 北京佰才邦技术股份有限公司 分簇方法、装置和电子设备
CN115022938A (zh) * 2022-06-16 2022-09-06 哈尔滨工业大学 一种面向海量节点的大规模自组网分簇组网方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090092112A1 (en) * 2007-10-09 2009-04-09 Eui Jik Kim Wireless sensor network system and cluster management method thereof
CN101801113A (zh) * 2009-02-05 2010-08-11 华为技术有限公司 网络拓扑分簇处理方法和处理系统
CN102238686A (zh) * 2011-07-04 2011-11-09 南京邮电大学 一种模型化量子遗传算法的无线传感器网络路由方法
CN102821422A (zh) * 2012-09-21 2012-12-12 北京邮电大学 一种基于分区的移动传感器网络分簇方法
CN102833289A (zh) * 2011-06-16 2012-12-19 宁波速腾电子有限公司 一种分布式云计算资源组织和任务分配方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090092112A1 (en) * 2007-10-09 2009-04-09 Eui Jik Kim Wireless sensor network system and cluster management method thereof
CN101801113A (zh) * 2009-02-05 2010-08-11 华为技术有限公司 网络拓扑分簇处理方法和处理系统
CN102833289A (zh) * 2011-06-16 2012-12-19 宁波速腾电子有限公司 一种分布式云计算资源组织和任务分配方法
CN102238686A (zh) * 2011-07-04 2011-11-09 南京邮电大学 一种模型化量子遗传算法的无线传感器网络路由方法
CN102821422A (zh) * 2012-09-21 2012-12-12 北京邮电大学 一种基于分区的移动传感器网络分簇方法

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112261665A (zh) * 2020-10-15 2021-01-22 天津津航计算技术研究所 一种自组织网络的组网方法
CN112261665B (zh) * 2020-10-15 2022-10-14 天津津航计算技术研究所 一种自组织网络的组网方法
CN112954584A (zh) * 2021-01-28 2021-06-11 西安电子科技大学 基于量子退火算法的无人机通信网络路由规划方法
CN113535635A (zh) * 2021-06-13 2021-10-22 复旦大学 一种用于双层环簇网络的自适应重配置硬件结构
CN113535635B (zh) * 2021-06-13 2022-04-12 复旦大学 一种用于双层环簇网络的自适应重配置硬件结构
CN113485431A (zh) * 2021-07-23 2021-10-08 西安理工大学 一种紫外光通信协作的无人机集群分簇控制方法
CN113485431B (zh) * 2021-07-23 2023-12-26 唐山梦之翼无人机科技有限公司 一种紫外光通信协作的无人机集群分簇控制方法
CN114363988A (zh) * 2021-12-10 2022-04-15 北京佰才邦技术股份有限公司 分簇方法、装置和电子设备
CN114189917A (zh) * 2022-01-15 2022-03-15 西安电子科技大学 基于量子退火的移动自组织网络分簇及簇间路由规划方法
CN115022938A (zh) * 2022-06-16 2022-09-06 哈尔滨工业大学 一种面向海量节点的大规模自组网分簇组网方法

Similar Documents

Publication Publication Date Title
WO2018098759A1 (fr) Procédé de sélection de tête de grappe dans un réseau distribué, nœud, et système
WO2018098737A1 (fr) Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système
WO2018098753A1 (fr) Procédé de gestion de réseau distribué, nœud et système
CN108600942B (zh) 一种无人机自组网的路由方法
US7295521B2 (en) Directional flooding method in wireless sensor network
WO2018098750A1 (fr) Procédé de transmission de message dans un réseau distribué et nœud
WO2016188116A1 (fr) Détection de crédibilité sur la base de protocole de routage de sécurité dans un réseau ad hoc véhiculaire
TWI398182B (zh) 應用於無線感測器網路之多跳路由演算法
WO2018098745A1 (fr) Procédé de communication dans un réseau distribué, nœud, et système
WO2018098755A1 (fr) Procédé de sélection de tête de grappe pour réseau distribué, nœud et système
US20130279409A1 (en) Establishing a Mesh Network
US8089912B2 (en) Multicast communication method, accompanied with the relay node and wireless network system design
WO2018098754A1 (fr) Procédé de sélection de tête de grappe pour réseau distribué, nœud et système
Huang et al. FAR: Face-aware routing for mobicast in large-scale sensor networks
WO2018098748A1 (fr) Procédé de communication dans un réseau distribué, nœud et système
Casari et al. ALBA: An adaptive load-balanced algorithm for geographic forwarding in wireless sensor networks
Hong et al. A hybrid beaconless geographic routing for different packets in WSN
WO2018098747A1 (fr) Procédé de communication dans un réseau distribué, nœud et système
Martirosyan et al. Energy-aware and quality of service-based routing in wireless sensor networks and vehicular ad hoc networks
Peng A novel adaptive mobility-aware MAC protocol in wireless sensor networks
WO2018098749A1 (fr) Procédé de diffusion de message dans un réseau distribué et nœud
WO2018098756A1 (fr) Procédé de diffusion de message pour réseau distribué, nœud et système
WO2018098752A1 (fr) Procédé de diffusion de message pour réseau distribué, et nœud
WO2018098757A1 (fr) Procédé de réglage de communication pour réseau distribué, nœud et système
WO2018098758A1 (fr) Procédé d'ajustement de communication pour réseau distribué, nœud et système

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

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

Country of ref document: EP

Kind code of ref document: A1