WO2018098737A1 - Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système - Google Patents

Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système Download PDF

Info

Publication number
WO2018098737A1
WO2018098737A1 PCT/CN2016/108135 CN2016108135W WO2018098737A1 WO 2018098737 A1 WO2018098737 A1 WO 2018098737A1 CN 2016108135 W CN2016108135 W CN 2016108135W WO 2018098737 A1 WO2018098737 A1 WO 2018098737A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
cluster
cluster head
data
head node
Prior art date
Application number
PCT/CN2016/108135
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/108135 priority Critical patent/WO2018098737A1/fr
Publication of WO2018098737A1 publication Critical patent/WO2018098737A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a cluster preferred method, node and system for a distributed network.
  • a distributed network is a network of nodes that are distributed in different locations and have multiple terminals.
  • Distributed networks are used in various fields, for example as sensor networks.
  • the sensor network is a network formed based on sensor nodes, which can acquire information of various environments or monitoring objects in the network distribution area and transmit them to the user terminal remotely.
  • a distributed network usually adopts a clustering structure, that is, the network is divided into a plurality of clusters, each cluster includes a plurality of common nodes, and at least one common node is selected as a cluster head node in each cluster.
  • the commonly used selection method is based on the residual energy of the node. Specifically, each common node in the cluster broadcasts its own residual energy. The ordinary node determines the highest residual energy by comparing the remaining energy of the other common nodes with its residual energy.
  • the cluster head node of the cluster is a clustering structure, that is, the network is divided into a plurality of clusters, each cluster includes a plurality of common nodes, and at least one common node is selected as a cluster head node in each cluster.
  • the commonly used selection method is based on the residual energy of the node. Specifically, each common node in the cluster broadcasts its own residual energy. The ordinary node determines the highest residual energy by comparing the remaining energy of the other common nodes with its residual energy.
  • each node broadcasts its remaining energy, resulting in a large network transmission overhead.
  • the technical problem to be solved by the present invention is to provide a cluster preferred method, node and system for a distributed network, which can reduce the transmission overhead generated by selecting a cluster head node.
  • a technical solution adopted by the present invention is to provide a cluster preferred method for a distributed network, where the distributed network selects a cluster head node based on a residual energy value of a node, and the method includes: a cluster head The node receives the data sent by the cluster member node of the cluster, and obtains the current residual energy value of the cluster member node from the data; compares the current remaining energy value of the cluster node when entering the next cluster preferred phase, and The node with the largest remaining energy value is found; the node that determines that the current remaining energy value is the largest is the notification message of the new cluster head node.
  • the present invention adopts another technical solution, and provides a distributed network node, where the distributed network selects a cluster head node based on a residual energy value of the node, and the distributed network node is currently a common node, including a transmitter, a receiver, a memory, and a processor, the transmitter for transmitting a message to other nodes; the receiver for receiving a message sent by another node; the memory for storing a computer instruction; the processor executing the Computer instruction, And the method is configured to: receive, by the receiver, data sent by a cluster member node of a cluster, and obtain, by the data, a current residual energy value of the cluster member node; when entering a next cluster preferred phase, compare the cluster node The current residual energy value, and find the node with the largest current remaining energy value; broadcast the node that determines that the current remaining energy value is the largest, and the notification message of the new cluster head node.
  • the present invention adopts yet another technical solution, and provides a distributed network system, including a convergence node and a plurality of common nodes, where the plurality of common nodes are divided into at least one cluster, and the clusters are At least one common node includes at least one cluster head node and a cluster member node, wherein the cluster member node is configured to send data to be uploaded to a cluster head node; the cluster head node is configured to forward the data to a neighbor cluster The first node is uploaded to the sink node or directly forwards the data to the sink node; wherein the normal node is also the above node.
  • the cluster head node directly confirms the new cluster head node according to the remaining energy of the cluster node, and broadcasts the notification message, in the manner that all the common nodes of the existing network send the request message to compete for the cluster head node.
  • the node does not need to send the contention cluster 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.
  • FIG. 1 is a schematic structural diagram of an embodiment of a distributed network system according to the present invention.
  • FIG. 2 is a schematic diagram of a clustering structure in an embodiment of a distributed network system according to the present invention
  • FIG. 3 is a flowchart of an embodiment of a method for selecting a cluster of a distributed network according to the present invention
  • FIG. 4 is a flow chart of an embodiment of a communication method of a distributed network according to the present invention.
  • FIG. 5 is a schematic structural diagram of an embodiment of a distributed network node according to the present invention.
  • FIG. 6 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 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 head node 111a is used as a collection point of the cluster 110 node data and a transit point of other cluster node data, and is used for collecting node data of the cluster and forwarding node data of the neighbor cluster, so that the data finally reaches the convergence node 112. .
  • Aggregation node 112 as the distributed network system A collection point of data for collecting data of the cluster head node 111a in the distributed network system 100 and for further processing.
  • the nodes in the system may have at least one of the following features: (1) the physical properties of all the common nodes 111 are the same; (2) each of the ordinary nodes 111 is capable of generating data such as collecting data and transmitting data; Each of the ordinary nodes 111 has a routing function; (4) each of the ordinary nodes 111 can obtain its own location information by a certain technology (such as GPS); (5) the default communication range of the aggregation node 112 and the ordinary node 111. The value (that is, the maximum communication range) R is the same, and the node knows the value.
  • the sink node and the normal node can also set different default communication range values; (6) the transmit power of the common node 111 can be adjusted.
  • the communication range is also adjustable; (7) the aggregation node 112 and each of the ordinary nodes 111 have unique network layer addresses, such as IPv6 addresses.
  • the distributed network system can be a distributed wired network system or a distributed wireless network system.
  • the distributed wireless network system may be a wireless sensor network (WSNs), and a common node in the system is a sensor node.
  • the distributed wireless network system may be a mobile Ad Hoc network system, and the common node in the system may be any mobile terminal that can implement communication, such as a mobile phone, a computer, or the like.
  • the wireless sensor network is a distributed multi-hop wireless network.
  • the common node 111 is used to collect sensing data of the surrounding environment or the monitoring object, and the ordinary node 111 is in the collecting node.
  • the sensing data packet is transmitted 112
  • the sensing data of all the nodes in the cluster are collected in the cluster head node 111a of the cluster 110, and the cluster head node 111a transmits the sensing data packet to the cluster data using one-hop or multi-hop inter-cluster routing.
  • the sink node 112 after receiving the data packet, the aggregation node 112 may perform further processing, for example, sending the sensing data to the user terminal; or performing prediction estimation on the sensing data, and performing an alarm or the like according to the determination result.
  • the system 100 includes two stages of clustering and data transmission, wherein the system can periodically perform the following clustering phase, and each time after re-clustering, the following data transmission is performed according to the new cluster. Or the system periodically selects the cluster head and the cluster head notification sub-stage after the following network sub-phases are completed. After each new cluster head is selected, the following data transmission is performed according to the new cluster head:
  • the network area of the system 100 is divided into clusters, and one (or more) nodes are selected as the cluster heads in the common node 111 located in each cluster by a certain mechanism (such as the maximum remaining energy, etc.).
  • Node 111a Node 111a.
  • the clustering stage may include a network broadcast, a cluster head selection, and a cluster head announcement.
  • the aggregation node 112 broadcasts a networking message with a default communication radius R within a range of 1 hop.
  • the networking message may include the address, location, clustering policy, and the like of the sink node 112.
  • the clustering policy may include the identifiers and side lengths of the clusters in the system.
  • the side lengths of the various clusters 110 to be set may be included and The location information of the cluster 110 is set correspondingly in the system.
  • the clustering strategy includes setting clusters of squares of two sizes, wherein one cluster is 1/4 of the area of another cluster, as shown in FIG.
  • the cluster shape in this embodiment is not limited to a square.
  • the networking message may also include the length of time for selecting the first sub-phase of the cluster, as may be considered to set the duration to 60s.
  • the common node 111 can determine the cluster, such as the side length and the identifier of the cluster, according to the clustering policy and the location of the network message, wherein the identifier of the cluster 110 is separated from the sink node by the cluster.
  • the coordinates of the farthest vertex are represented. .
  • the cluster 110 is a square whose side length is the first length; when the distance between the normal node 111 and the sink node 112 is within the first distance range
  • the cluster 110 is a square having a second length; wherein the first length is smaller than the second length, and the first distance is greater than the second length.
  • the common node 111 is located at (x0+15m, y0+5m), where (x0 ⁇ 50m, In the y0 ⁇ 50m) region, the cluster side length is 10m, so the ordinary node 111 is located in the cluster 110 whose cluster identifier is (x0+20m, y0+10m).
  • the ordinary node 111 can record the address information of the last hop node carried in the networking message, or the address of the node that forwards the network message, and the cluster size such as the side length. Then, the network address is added to the network message, and the network message is broadcasted, for example, the network message is broadcasted by using the default communication radius R within a range of 1 hop.
  • the other ordinary node receives the network message, the above operation of the ordinary node is performed.
  • the system 100 selects a cluster head node based on the remaining energy of the node (eg, remaining power). For example, after the broadcast network message, the normal node 111 needs to compete for the cluster head node, and generates a request message (also referred to as a contention cluster head message) including the own address and the current remaining energy value, and the request message is used. The request is elected to the cluster head node of the cluster where the broadcast node is located.
  • a request message also referred to as a contention cluster head message
  • the normal node 111 then broadcasts the request message.
  • the nodes of different sizes of clusters have different communication ranges, for example, the side length is
  • the intra-cluster node can adjust its transmit power to make its communication range Side length
  • the intra-cluster node can adjust its transmit power to reduce its communication range to The subsequent operation of the broadcast request message is performed.
  • the time of the sub-stage may not be fixed. For example, after the election time of the cluster head node reaches a preset time, the next period is entered. Select the cluster sub-phase, which is directly based on the previous cycle by a node in the cluster The situation determines the cluster head node of the new cycle, at which point the sub-phase is terminated and the result is announced in the next sub-phase. Of course, this situation can also be considered as not including this sub-phase.
  • each ordinary node 111 that broadcasts the above request message (whether or not its request message is broadcast or when its request message is broadcast can be determined by the following related embodiments) can determine whether it is elected according to its own residual energy value.
  • the cluster head node of the cluster may refer to the following related embodiments, and generate a cluster head notification message after determining the cluster head node, the message includes the address of the ordinary node 111 and the identifier of the cluster, and the notification message is broadcasted.
  • the current node confirms the generation of the new cluster head node and broadcasts the notification message.
  • the other common node 111 determines whether it belongs to the cluster according to the cluster head notification message, and if so, saves the address information of the cluster head node as the address of the cluster head node of the cluster; if it does not belong to the cluster, it determines whether it is The cluster head node, if yes, saves the address information of the cluster head node as the address of the cluster head node of the neighbor cluster, otherwise it is not saved.
  • the data packet is first transmitted to the cluster head node 111a of the cluster by using, but not limited to, single-hop transmission. After receiving the data packet, the cluster head node 111a forwards the data packet to the sink node 112 in a single hop or multi-hop manner; if the cluster head node 111a has a data packet to upload, the same manner is adopted.
  • the cluster head node 111a may reply a response message such as an ACK frame or other message to the cluster member node 111b to indicate that its data packet has been received.
  • the cluster head node 111a When the cluster head node 111a has a data packet (either itself or a node within the cluster) needs to be sent to the sink node 112, the node selected as the cluster cluster head is first found from the neighbor node, and the data packet is sent to the node. Each cluster head node performs such operations until the data packet is transmitted to the sink node 112.
  • 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.
  • FIG. 1 only exemplarily shows the topology of the distributed network of the present invention, but is not limited to the distributed network structure of the present invention.
  • the distributed network may include more clusters, each of which may include more clusters.
  • the clusters may have a common node, and the number of cluster head nodes in each cluster may be multiple, and the data of the sink nodes in the network may also be multiple.
  • the ordinary node 111 or the cluster head node 111a in the system can perform at least one of the following The method in the embodiment, or corresponding to the node in the following embodiments, is specifically described in the following embodiments.
  • the neighbor node is a node located within the communication range of the current node, and the embodiment can be understood as a node reachable by one hop.
  • common nodes or other nodes described in the following methods of the present invention refer to any one or more common nodes or nodes except the method, and other common nodes or other nodes that are expressed each time may be The same node or different nodes should not be understood as all other common nodes that are specifically referred to as the same node. Of course, except for some steps that can be clearly understood that a series of actions are performed by the same other common nodes (as follows) S208, etc.).
  • the cluster head node can be selected from the remaining energy values of the nodes.
  • 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:
  • S201 The common node detects whether the request message broadcasted by other common nodes in the cluster is received when the cluster first stage is selected; if yes, S202 is performed, and if not, S203 is performed.
  • the set request time can be understood as the time when the ordinary node can send the request message, and can be set by the aggregation node of the distributed network. Or itself determined by judgment (as in the third embodiment described below).
  • S202 Determine whether the remaining energy value of the common node is greater than the remaining energy value included in the request message. If yes, execute S203, otherwise execute S204.
  • S203 Broadcast a request message including its own remaining energy value to request to select the cluster head node.
  • the normal node determines its eligibility to compete for the cluster head node.
  • S204 The request message including the remaining energy value of the self is not broadcasted.
  • the normal node determines that it does not qualify for the first node of the competing cluster.
  • the normal node may also monitor whether a request message sent by another common node in the new cluster is received in the remaining stage of the selected cluster; if not, determine the cluster head node as the cluster, and All other common nodes of the cluster are connected to this message, and if so, it is directly determined that the common node is not the cluster head node of the cluster.
  • the common node limits the request message of the ordinary node with less residual energy, so the transmission overhead generated by selecting the cluster head node is reduced, and the energy of the node is also saved.
  • the present invention provides another embodiment of a message broadcast method for a distributed network.
  • the The message broadcast method may be performed by the normal node described in the first embodiment, for determining when to broadcast a message for requesting the election of the cluster head node, and the method includes the following steps:
  • the common node determines whether the residual energy value of the common node is less than a set threshold in the first stage of selecting the cluster; if yes, executing S302, otherwise executing S303.
  • the ordinary node determines the time of broadcasting the request message by using the principle of priority broadcast with a large remaining energy.
  • the set threshold value is a value randomly obtained by the probability of uniform distribution in the interval between the remaining energy value and the zero when the previous cluster head node of the cluster is competing for the cluster head in the previous period.
  • the set threshold may also be a fixed value, and the fixed value changes according to different periods. Usually, the higher the previous period, the larger the fixed value.
  • 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.
  • S302 Delay the broadcast of the request message including the self-remaining energy value.
  • the ordinary node thinks that it is less likely to be the cluster head node, so the broadcast is delayed.
  • S303 Instantly broadcast a request message including the self-remaining energy value.
  • the ordinary node thinks that it is likely to be the cluster head node, so it is broadcast instantaneously.
  • the normal node performs the request message in the foregoing S302 and S303 to broadcast the self-remaining energy value, and then determines the cluster head node to refer to the second embodiment method.
  • ordinary nodes in the distributed network are broadcast separately to avoid congestion of the communication channel. Further, at this time, the ordinary node with small remaining energy broadcasts later, so that the non-broadcast request can be determined according to the method of the second embodiment, so that the control overhead can be further reduced, that is, the transmission overhead of the selected cluster head node is reduced, and the node energy is saved.
  • FIG. 4 is a flowchart of an embodiment of a communication method of a distributed network according to the present invention.
  • the communication method may be performed by a common node in the first embodiment, and is used to adjust a communication range according to intra-cluster and inter-cluster transmission.
  • the method includes the following steps:
  • the cluster head node determines whether the node that needs to communicate with the node is an intra-cluster node or an extra-cluster node.
  • S402 If it is an intra-cluster node, communicate with the intra-cluster node with the first transmit power.
  • the first transmit power (also referred to as intra-cluster transmit power) is less than the second transmit power (also referred to as extra-cluster transmit power).
  • the distributed network may divide the two size clusters according to the distance from the sink node, and the communication range of the second transmit power may be set to R, when the cluster side length is The communication range of the first transmit power can be set to When the length of the cluster is The communication range of the first transmit power can be set to
  • the communication range is adaptively adjusted, and the inter-cluster interference is reduced under the premise of ensuring successful intra-cluster communication, so that the communication is relatively more reliable, and the success rate of data packet transmission is improved, and Save the energy of the cluster head node.
  • the present invention provides an embodiment of a message transmission method for a distributed network.
  • the message transmission method may be performed by a common node according to the first embodiment, and is used by a common node to implement routing based on a node location during data transmission.
  • the method includes the following steps:
  • S501 The ordinary node receives the networking message sent by the neighboring ordinary node.
  • the networking message is derived from the aggregation node of the distributed network, and may be specifically as described in the first embodiment.
  • the networking message also includes location information of the neighboring ordinary node.
  • the location information may specifically include a distance between a neighboring ordinary node and a sink node that send the network message.
  • S502 Acquire and save location information of the neighboring ordinary node from the networking message.
  • the ordinary node may also add its own address and location information to the networking message, and forward the networking message.
  • the other ordinary nodes receive the network message, and the method steps can be performed in the same manner to obtain the location information of the neighbor node.
  • 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 normal node performs intra-cluster and out-of-cluster communication as described in the fourth embodiment described above. Specifically, after determining the neighbor cluster head node closest to the sink node, the ordinary node sends the message to the selected neighbor cluster head node with the above-mentioned out-of-cluster transmit power.
  • 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:
  • S601 The ordinary node receives remaining energy information of other common nodes in the cluster.
  • the S601 can perform the data transfer phase or the clustering phase described in the first embodiment.
  • the remaining energy information can be set in any data received by the ordinary node. Of course, the remaining energy information can also be determined based on the signal strength of the received data. Ordinary node will leave the remaining energy The amount information is saved locally. It can be understood that, in an embodiment in which the cluster head node is not continuously the cluster head node, the normal node in this embodiment is only a cluster member node.
  • S602 Obtain a current remaining energy value of the other common node according to the remaining energy information when entering a next cluster preferred phase.
  • 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.
  • S603 Determine whether the current residual energy value of the self is greater than the current remaining energy value of the obtained other node; if yes, execute S604; otherwise, determine that it is not the cluster head node, that is, not broadcast the self-recommended as a new cluster head. The notification message for the node.
  • 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.
  • 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:
  • 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.
  • the ordinary node determines whether to receive the notification message sent by the other common nodes of the cluster to be the new cluster head node before executing the foregoing S701; if not, determining that it is the new cluster head node, and executing S701; If yes, it is determined that the other common node that sends the notification message is a new cluster head node, and the process ends.
  • the foregoing determining may also be performed after executing S701, if it is determined that the cluster head node is not elected and the current remaining energy of the cluster is greater than the set energy value, and it is determined that the notification message of the other common node is not received, then S702 is performed. Otherwise, it is determined that the other ordinary node that sent the notification message is a new cluster head node, and the process ends.
  • the present invention provides an embodiment of a cluster preferred method for a distributed network.
  • the method may be performed by a common node according to the first embodiment, and is used to determine whether a common node broadcasts a message requesting a campaign for a cluster head node, and the method includes the following steps:
  • S801 The normal node detects whether a request message broadcast by other common nodes in the cluster is received when the cluster first stage is selected; if yes, S802 is performed, and if not, S803 is performed.
  • S802 Determine whether the remaining energy value of the common node is not lower than the set difference value than the remaining energy value included in the request message. If yes, execute S803, otherwise execute S804.
  • 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.
  • the present invention provides an embodiment of a message broadcast method for a distributed network.
  • the method may be performed by a common node according to the first embodiment, and is used to determine whether a common node broadcasts a message requesting a campaign for a cluster head node, and the method includes the following steps:
  • S901 The common node determines whether the residual energy value of the common node is less than a set threshold in the first stage of selecting the cluster; if yes, executing S902, otherwise executing S903.
  • 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.
  • the request message is used to request that the cluster head node be elected.
  • the S902 is specifically described with reference to the description of S204.
  • S903 Broadcast a request message including its own remaining energy value.
  • S903 can be referred to the description of S203.
  • the normal node may perform the foregoing S805 to determine that it is a new cluster head node. For example, the normal node determines whether it is the highest energy remaining in the intra-cluster node that broadcasts the request message or is closest to the sink node. The node, if it is, determines itself as the new cluster head node and broadcasts itself as the notification message of the new cluster head node. After being elected as a new cluster head node, 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.
  • FIG. 3 is a flowchart of an embodiment of a method for selecting a cluster of a distributed network according to the present invention.
  • 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:
  • the cluster head node receives data sent by the cluster member node of the cluster, and obtains the current remaining energy value of the cluster member node from the data.
  • the data may be specifically data transmitted at the data transmission node, such as sensory data or a contention cluster request message broadcasted by the cluster member node in a clustering stage, the current remaining energy value may be included in the data, or a signal from the data Strength is determined.
  • the cluster head node determines the remaining energy value of the cluster member node according to the data sent by the cluster member node, and saves it locally.
  • the S1001 specifically includes: receiving data sent by a cluster member node of the cluster, and detecting whether a distance between the current time and a preferred phase of the next cluster is lower than a set time; if yes, The remaining energy contained in the data is the current remaining energy of the cluster member node.
  • 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.
  • the data also includes the time at which the data was sent.
  • the cluster head node searches for the last remaining energy of each cluster member node received according to the sending time of the data, and serves as the current remaining energy of the cluster member node; compares each received cluster member node The current remaining energy and its current current remaining energy value are used to find the node with the largest current remaining energy value.
  • the cluster head node can find the cluster member 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 other nodes of the cluster After receiving the notification message, the other nodes of the cluster store the address contained in the notification message as the new cluster head node address of the cluster.
  • 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.
  • the cluster head node directly confirms the new cluster head node according to the remaining energy of the cluster node, and broadcasts the notification message, and does not need to send the node, compared to the manner in which all the common nodes of the existing network send the request message to compete for the cluster head node. Competing for the cluster head request message, the transmission overhead caused by selecting the cluster head node is greatly reduced, and the energy of the node is also saved.
  • the present invention provides an embodiment of a communication method for a distributed network.
  • the method may be performed by the cluster head node described in the first embodiment, and is used to implement inter-cluster communication by using intra-cluster transmit power, and the method includes:
  • 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. Node address; if present, based on pre-stored associations Obtaining cluster member node information associated with the target node, and sending the to-be-sent data to the cluster member node by using a first transmit power; if not, sending the to-be-sent data directly to the second transmit power 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.
  • the present invention provides another embodiment of a communication method for a distributed network.
  • the method may be performed by the cluster member node in the first embodiment, and is used to implement inter-cluster communication by using intra-cluster transmit power, and the method includes:
  • 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 above eleventh and twelfth embodiments are preferred nodes in the cluster
  • the cluster preferred to request or request message broadcast can be implemented using 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 detects the communication quality with the adjacent cluster head node.
  • 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 according to the communication quality with the neighbor cluster head node and the neighbor cluster first section
  • the transmission power of the point communication is adjusted, and the adaptive adjustment of the transmission power of the inter-cluster communication is realized, which avoids the extra waste of the energy of the cluster head node during inter-cluster communication, and enhances the effective utilization 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.
  • the location information of the pre-stored neighboring cluster head node is obtained when the adjustment is performed, 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 can be used as the first transmit power in other embodiments of the present invention, and the transmit power when the adjusted cluster head node communicates with the adjacent cluster head node can be used as the second transmit power in other embodiments of the present invention.
  • other embodiments of the present invention may be utilized to perform communication by using the first transmit power and the second transmit power, to re-divide the cluster, and to perform cluster preference or request message broadcast.
  • 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 information that may obtain a distance between the neighbor cluster head node and the sink node.
  • 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 can generate its own address and location information when the cluster head node is elected.
  • the notification message and broadcast the notification message to inform 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.
  • the present invention provides an embodiment of a management method for a distributed network.
  • 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-fold of the data of the cluster node where the cluster is located, it is divided into 3 Clusters, if the difference is greater than 1 times the data of the cluster node, is divided into 4 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, and can refer to the description of the above related embodiments.
  • 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 the cluster head node shown in FIG. 1.
  • the node includes a receiving module 171, a lookup module 172, and a broadcast module 173.
  • the receiving module 171 is configured to receive data sent by a cluster member node of the cluster, and obtain, by the data, a current remaining energy value of the cluster member node;
  • the searching module 172 is configured to compare the current remaining energy value of the cluster node when the next cluster is selected into the preferred phase, and find the node with the largest remaining energy value;
  • the broadcast module 173 is configured to broadcast a notification message that determines that the node with the highest current remaining energy value is the new cluster head node.
  • the data further includes a sending time of the data; the searching module 172 is specifically configured to: according to the sending time of the data, search for the last remaining remaining energy of each cluster member node received, and serve as a The current remaining energy of the cluster member node is compared; the current remaining energy of each cluster member node received and its current residual energy value are compared to find the node with the largest current remaining energy value.
  • the receiving module 171 is specifically configured to receive data sent by the cluster member node of the cluster, and detect whether the distance between the current time and the preferred phase of the next cluster is lower than a set time; if yes, the data is The remaining energy contained is the current remaining energy of the cluster member node.
  • the node further includes a sending module, configured to feed back a response message to the cluster member node that sends the data by using the first transmit power, and forward the data to the sink node by using the second transmit power to send the data to the sink node.
  • a sending module configured to feed back a response message to the cluster member node that sends the data by using the first transmit power, and forward the data to the sink node by using the second transmit power to send the data to the sink node.
  • the first transmit power is less than the second transmit power.
  • the sending module is further configured to: according to the location information of the pre-stored neighbor cluster head node, select a neighbor cluster head node that has the shortest distance from the sink node, where the location information of the neighbor cluster head node is derived from the networking. a network message sent by the neighbor cluster head node in the phase; sending the data to the selected neighbor cluster head node by using a second transmit power, to forward the data to the node by using the selected neighbor cluster head node Said aggregation node.
  • the cluster when the distance between the common node and the sink node in the sensing network is within a first distance range, the cluster is a square whose side length is a first length; when the common node is When the distance between the aggregation nodes is outside the first distance range, the cluster is a square whose side length is the second length; wherein the first length is smaller than the second 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 the memory 184 may also include a 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.
  • node 180 further includes a plurality of applications and one or more programs, the plurality of applications and one or more programs being stored in memory 184 and configured to be executed by said 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 sélection d'une tête de grappe dans un réseau distribué, un nœud et un système. Le procédé comprend les étapes suivantes : un nœud de tête de grappe reçoit des données envoyées par un nœud d'élément de grappe dans une grappe dans laquelle se trouve le nœud de tête de grappe, et obtient une valeur d'énergie résiduelle actuelle du nœud d'élément de grappe en fonction des données ; lors de l'entrée dans une phase de sélection de tête de grappe suivante, comparaison des valeurs d'énergie résiduelle actuelle des nœuds dans la grappe et recherche d'un nœud ayant la valeur d'énergie résiduelle actuelle la plus élevée ; et diffusion d'un message de notification selon lequel le nœud ayant la valeur d'énergie résiduelle actuelle la plus élevée est défini en tant que nouveau nœud de tête de grappe. Le procédé selon l'invention permet de réduire le surdébit de transmission généré par la sélection d'un nœud de tête de grappe.
PCT/CN2016/108135 2016-11-30 2016-11-30 Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système WO2018098737A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108135 WO2018098737A1 (fr) 2016-11-30 2016-11-30 Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108135 WO2018098737A1 (fr) 2016-11-30 2016-11-30 Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système

Publications (1)

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

Family

ID=62240953

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/108135 WO2018098737A1 (fr) 2016-11-30 2016-11-30 Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système

Country Status (1)

Country Link
WO (1) WO2018098737A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109348442A (zh) * 2018-08-20 2019-02-15 洛阳中科协同科技有限公司 一种基于计时器的无线传感器分簇方法
CN109831811A (zh) * 2019-03-28 2019-05-31 中国科学院上海微系统与信息技术研究所 分簇路由算法
CN110602757A (zh) * 2019-09-18 2019-12-20 上海海事大学 基于自适应遗传算法的无线传感器网络分簇路由方法
CN111526558A (zh) * 2020-04-28 2020-08-11 河南科技大学 Wban中基于非均匀分簇的高效路由协议
CN111818044A (zh) * 2020-07-07 2020-10-23 北京赋云安运营科技有限公司 一种基于多级模式的安全事件通报系统
CN113347590A (zh) * 2021-06-04 2021-09-03 河南科技大学 基于人体移动性和能量收集的wban分簇路由协议
CN113596951A (zh) * 2021-09-02 2021-11-02 哈尔滨工程大学 基于量子礁鲨机制的无线传感器网络分簇路由方法
CN114827936A (zh) * 2022-04-25 2022-07-29 国网智能电网研究院有限公司 面向输电设备物联网的接入调度方法、装置及存储介质
CN116489741A (zh) * 2023-06-19 2023-07-25 南昌大学 一种无线传感网络跨层节能方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100073826A (ko) * 2008-12-23 2010-07-01 주식회사 케이티 이종 센서 네트워크에서의 클러스터링 방법
CN102572995A (zh) * 2012-01-10 2012-07-11 山东大学 一种无线传感器网络中基于gaf改进分簇机制的热区问题解决方案
CN103237334A (zh) * 2013-04-12 2013-08-07 太原理工大学 一种基于巷道环境的无线传感器网络分簇路由方法
CN104618997A (zh) * 2015-01-28 2015-05-13 西安电子科技大学 一种基于非均匀网格的数据聚合方法
CN104853396A (zh) * 2014-02-13 2015-08-19 中国科学院沈阳自动化研究所 面向链式无线传感器网络的分簇路由系统及方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100073826A (ko) * 2008-12-23 2010-07-01 주식회사 케이티 이종 센서 네트워크에서의 클러스터링 방법
CN102572995A (zh) * 2012-01-10 2012-07-11 山东大学 一种无线传感器网络中基于gaf改进分簇机制的热区问题解决方案
CN103237334A (zh) * 2013-04-12 2013-08-07 太原理工大学 一种基于巷道环境的无线传感器网络分簇路由方法
CN104853396A (zh) * 2014-02-13 2015-08-19 中国科学院沈阳自动化研究所 面向链式无线传感器网络的分簇路由系统及方法
CN104618997A (zh) * 2015-01-28 2015-05-13 西安电子科技大学 一种基于非均匀网格的数据聚合方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
GONG, BENCAN ET AL.: "Clustering protocol based on residual energy for wireless sensor networks", COMPUTER ENGINEERING AND APPLICATIONS, vol. 44, no. 8, 29 February 2008 (2008-02-29), pages 31 - 33 *
XU, DONGYI ET AL.: "Improved algorithm of LEACH protocol introducing residual energy", COMPUTER ENGINEERING AND APPLICATIONS, vol. 45, no. 28, 31 July 2009 (2009-07-31), pages 115 - 119 *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109348442A (zh) * 2018-08-20 2019-02-15 洛阳中科协同科技有限公司 一种基于计时器的无线传感器分簇方法
CN109348442B (zh) * 2018-08-20 2023-02-21 洛阳国花新能源科技有限公司 一种基于计时器的无线传感器分簇方法
CN109831811B (zh) * 2019-03-28 2022-12-23 中国科学院上海微系统与信息技术研究所 分簇路由方法
CN109831811A (zh) * 2019-03-28 2019-05-31 中国科学院上海微系统与信息技术研究所 分簇路由算法
CN110602757A (zh) * 2019-09-18 2019-12-20 上海海事大学 基于自适应遗传算法的无线传感器网络分簇路由方法
CN110602757B (zh) * 2019-09-18 2023-05-12 上海海事大学 基于自适应遗传算法的无线传感器网络分簇路由方法
CN111526558A (zh) * 2020-04-28 2020-08-11 河南科技大学 Wban中基于非均匀分簇的高效路由协议
CN111526558B (zh) * 2020-04-28 2024-01-30 河南科技大学 一种在wban中基于非均匀分簇的高效路由方法
CN111818044A (zh) * 2020-07-07 2020-10-23 北京赋云安运营科技有限公司 一种基于多级模式的安全事件通报系统
CN113347590B (zh) * 2021-06-04 2023-01-31 河南科技大学 基于人体移动性和能量收集的wban分簇路由协议
CN113347590A (zh) * 2021-06-04 2021-09-03 河南科技大学 基于人体移动性和能量收集的wban分簇路由协议
CN113596951A (zh) * 2021-09-02 2021-11-02 哈尔滨工程大学 基于量子礁鲨机制的无线传感器网络分簇路由方法
CN114827936A (zh) * 2022-04-25 2022-07-29 国网智能电网研究院有限公司 面向输电设备物联网的接入调度方法、装置及存储介质
CN114827936B (zh) * 2022-04-25 2023-08-08 国网智能电网研究院有限公司 面向输电设备物联网的接入调度方法、装置及存储介质
CN116489741A (zh) * 2023-06-19 2023-07-25 南昌大学 一种无线传感网络跨层节能方法及系统
CN116489741B (zh) * 2023-06-19 2023-09-01 南昌大学 一种无线传感网络跨层节能方法及系统

Similar Documents

Publication Publication Date Title
WO2018098737A1 (fr) Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système
WO2018098759A1 (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) 一种无人机自组网的路由方法
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
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
CN104853398B (zh) 树型无线传感器网络的路由优化方法
Bharamagoudra et al. Event driven energy depth and channel aware routing for underwater acoustic sensor networks: Agent oriented clustering based approach
Mishra et al. Study of cluster based routing protocols in wireless sensor networks
WO2018098754A1 (fr) Procédé de sélection de tête de grappe pour réseau distribué, nœud et système
Chen et al. Receiver‐oriented load‐balancing and reliable routing in wireless sensor networks
Shanthy et al. A zone routing protocol incorporated with sleep scheduling for MANETs
Arshad et al. Energy efficient cluster head selection in mobile wireless sensor networks
WO2018098748A1 (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
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
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
CN106937349A (zh) 基于移动汇聚节点和蚁群算法的无线传感器网路由协议
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: 16922641

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

Country of ref document: EP

Kind code of ref document: A1