WO2018098756A1 - 分布式网络的消息广播方法、节点及系统 - Google Patents

分布式网络的消息广播方法、节点及系统 Download PDF

Info

Publication number
WO2018098756A1
WO2018098756A1 PCT/CN2016/108156 CN2016108156W WO2018098756A1 WO 2018098756 A1 WO2018098756 A1 WO 2018098756A1 CN 2016108156 W CN2016108156 W CN 2016108156W WO 2018098756 A1 WO2018098756 A1 WO 2018098756A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
cluster
energy value
cluster head
request message
Prior art date
Application number
PCT/CN2016/108156
Other languages
English (en)
French (fr)
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/108156 priority Critical patent/WO2018098756A1/zh
Publication of WO2018098756A1 publication Critical patent/WO2018098756A1/zh

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
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • 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 message broadcast 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 message broadcast 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 message broadcast method of 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: Selecting a cluster stage to determine whether the remaining energy value is less than a set threshold; if yes, not transmitting a request message including the self-remaining energy value; if not, broadcasting a request message including the self-remaining energy value; The request message is used to request that the cluster head node be elected.
  • 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 The computer instruction is configured to: determine whether the residual energy value of the cluster is less than a set threshold in the first stage of selecting the cluster; Controlling that the transmitter does not broadcast a request message containing the self-remaining energy value; when not less than, a request message containing the self-remaining energy value is broadcast by the transmitter.
  • 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 common node selectively broadcasts the request message according to its remaining energy, in which the common node sends the request message to select the cluster head node, which limits the common residual energy.
  • the request message of the node reduces the transmission overhead generated by the selected cluster head node and also saves the energy of the node.
  • 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 flow chart of an embodiment of a message broadcast method 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. .
  • the aggregation node 112 serves as a collection point for the data of the distributed network system for collecting data of the cluster head node 111a in the distributed network system 100 and can be further processed.
  • 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 network message may include an address, a location, a clustering policy, and the like of the aggregation node 112.
  • the clustering strategy may include the identity and side length of the clusters in the system, when the system 110 is based on When the distances of the aggregation nodes 112 are set to different sizes of the clusters 110, the side lengths of the various clusters 110 to be set and the position information corresponding to the clusters 110 in the system may be included.
  • 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. Selecting the cluster sub-phase, a node in the cluster directly determines the cluster head node of the new period according to the previous period. At this time, the sub-phase is ended, 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 common node 111 or the cluster head node 111a in the system may perform the method in the following at least one embodiment, or correspond to the node in the following embodiments. For details, refer to the description of 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 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 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 intra-cluster and inter-cluster communication are realized.
  • the inter-cluster interference is reduced, the communication is relatively more reliable, the success rate of data packet transmission is improved, and the energy of the cluster head node is saved.
  • 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.
  • the normal node saves the remaining energy information 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 When the common node is in the preferred phase of the cluster, it detects whether it has been elected to the cluster head node and whether its current residual energy is greater than the set energy value; if it is greater than, it executes S702, Then it is determined that the cluster head node cannot be elected, so the notification message is not broadcast.
  • 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.
  • FIG. 3 is a flowchart of an embodiment of a message broadcast method of a distributed network according to the present invention.
  • 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.
  • the S902 specifically includes the following sub-steps:
  • S9021 Determine, according to the signal strength of the data of the neighboring ordinary node that is received before, whether the remaining energy value of the neighboring common node is lower than a set energy value.
  • the communication protocol set by the distributed network includes changing the signal strength when the node detects that its residual energy value is lower than the set energy value, and the signal may be turned up or down.
  • the normal node records the signal strength of the data or control message it receives from the neighbor node. In this step, by comparing the recorded signal strength with the normal signal strength in the protocol, if the signal strength of the neighbor node is found to change, it is determined that the remaining energy value of the neighbor node is lower than the set energy value.
  • the ordinary node further executes when the remaining residual energy value is not less than a set threshold, or the number of neighboring ordinary nodes whose residual energy value is less than a set threshold but the remaining energy value is lower than the set energy value is not lower than a set number. S903.
  • All neighbor nodes that have received their signals in the previous cycle may be judged according to the above manner.
  • the ordinary node determines that the number of neighbor nodes whose remaining energy is lower than the set energy value is not lower than a value, the ordinary node may be considered as the ordinary node.
  • the neighbor node energy state is mostly in a low state, and may not be broadcast after performing the method of the embodiment. To prevent the neighbor nodes from broadcasting, the normal node broadcasts its request message at this time.
  • the normal node determines that the number of neighbor nodes whose remaining energy is lower than the set energy value is lower than a value, it may be considered that there is less possibility that all neighbor nodes have no broadcast, so the request message is not broadcasted at this time.
  • all the ordinary nodes send the request message to select the cluster head node.
  • the ordinary node selectively broadcasts the request message according to its remaining energy. The request message of the ordinary node with less residual energy is prepared, 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 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:
  • 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.
  • 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 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 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 target node determines that the target node is a neighbor cluster head node
  • the target node The address is compared with the neighbor cluster node address in the pre-stored association relationship to find whether there is a neighbor cluster head node address matching the target node address; if yes, the cluster member node associated with the target node is obtained according to the pre-stored association relationship And sending the to-be-sent data to the cluster member node by using a first transmit power; if not, transmitting the to-be-sent data directly to the target node by using a second transmit power.
  • 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 Cluster head node to make the cluster head node root And establishing, according to the feedback information, an association between the cluster member node and the neighbor cluster head node.
  • 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 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 according to the communication quality pair with the cluster member node and the cluster The transmit power is adjusted.
  • 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.
  • 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 Excessive waste of node energy enhances the effective benefit of the energy of the cluster head node use.
  • 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 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 location from the notification message Address and location information, and create a mapping relationship to save.
  • 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, thereby reducing 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 partition may be determined according to the difference between the number of cluster nodes currently located and the set value. Less clustering, for example, if the difference is less than one third of the data of the cluster node in which it is located, it is divided into two clusters, and if the difference is between one-third and one-fold of the data of the cluster node in the cluster, It is divided into 3 clusters. If the difference is greater than 1 times of the cluster node data, it 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 a common node as shown in FIG. 1.
  • the node includes a detection module 171, a first broadcast module 172, and a second broadcast module 173.
  • the detecting module 171 is configured to determine whether the remaining energy value of the cluster is less than a set threshold in the first stage of selecting the cluster;
  • the first broadcast module 172 is configured to not broadcast a request message including the self-remaining energy value when it is less than;
  • the second broadcast module 173 is configured to broadcast a request message including the self-remaining energy value when not less than
  • the request message is used to request that the cluster head node be elected.
  • the node further includes an adjustment module, configured to: if the request message sent by another common node in the cluster is not received within the set time, the set threshold is lowered.
  • the detecting module 171 further performs the detecting with the adjusted threshold.
  • the node further includes a value module, where a value of the remaining energy value of the previous cluster head node of the cluster in which the cluster head competes with the cluster head in the previous period is 0, and a random value is randomly obtained. As the set threshold.
  • the first broadcast module 172 is specifically configured to determine, according to a signal strength of the previously received neighboring common node data, whether the remaining energy value of the neighboring common node is lower than a set energy value; if it is determined that the remaining energy value is low If the number of the neighboring common nodes of the set energy value is lower than the set number, the request message including the self-remaining energy value is not broadcasted; the first broadcast module 172 is specifically configured to: if the residual energy value of the first broadcast module is not less than a set threshold If the number of neighboring ordinary nodes whose own residual energy value is less than the set threshold but the remaining energy value is lower than the set energy value is not lower than the set number, the request message including the self-remaining energy value is broadcasted.
  • the node further includes a third broadcast module, configured to determine whether it is the node with the highest remaining energy or the closest distance to the sink node in the intra-cluster node that has broadcasted the request message, and if so, broadcast itself as a new cluster.
  • the notification message of the first node is the node with the highest remaining energy or the closest distance to the sink node in the intra-cluster node that has broadcasted the request message, and if so, broadcast itself as a new cluster.
  • the node further includes a sending module, configured to receive data sent by other common nodes of the cluster when the new cluster head node is used, and feed back a response message to the other common nodes with the first transmit power, and The second transmit power forwards the data to the sink node through the neighbor cluster head node, wherein the first transmit power is less than the second transmit power.
  • a sending module configured to receive data sent by other common nodes of the cluster when the new cluster head node is used, and feed back a response message to the other common nodes with the first transmit power, and The second transmit power forwards the data to the sink node through the neighbor cluster head node, wherein the first transmit power is less than the second transmit power.
  • 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.
  • Related Please refer to the detailed description in the above method, which will not be described here.
  • 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.
  • 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

本发明公开了分布式网络的消息广播方法、节点及系统。其中，所述方法包括：普通节点在选取簇首阶段判断自身剩余能量值是否小于设定阈值；若是，则不广播包含所述自身剩余能量值的请求消息；若否，则广播包含所述自身剩余能量值的请求消息；其中，所述请求消息用于请求当选所述簇首节点。通过上述方式，能够减少由选取簇首节点产生的传输开销。

Description

分布式网络的消息广播方法、节点及系统 【技术领域】
本发明涉及通信技术领域，特别是涉及分布式网络的消息广播方法、节点及系统。
【背景技术】
分布式网络是由分布在不同地点且具有多个终端的节点互连而成的网络。分布式网络应用于各领域中，例如作为传感网络。传感网络是一种基于传感器节点形成的网络，能够获取网络分布区域内的多种环境或监测对象的信息并远程传送给用户端。
分布式网络通常采用分簇式结构，即该网络被划分成多个簇，每个簇中包括多个普通节点，且每个簇中选取至少一个普通节点作为簇首节点。常用的选取方式为基于节点剩余能量选取，具体是，簇内每个普通节点均广播自身的剩余能量，普通节点通过比较其他普通节点的剩余能量和自身剩余能量，确定最高剩余能量的普通节点为该簇的簇首节点。
然而，每个节点均广播其剩余能量，导致网络传输开销较大。
【发明内容】
本发明主要解决的技术问题是提供分布式网络的消息广播方法、节点及系统，能够减少由选取簇首节点产生的传输开销。
为解决上述技术问题，本发明采用的一个技术方案是：提供一种分布式网络的消息广播方法，所述分布式网络基于节点的剩余能量值选取簇首节点，所述方法包括：普通节点在选取簇首阶段判断自身剩余能量值是否小于设定阈值；若是，则不广播包含所述自身剩余能量值的请求消息；若否，则广播包含所述自身剩余能量值的请求消息；其中，所述请求消息用于请求当选所述簇首节点。
为解决上述技术问题，本发明采用再一技术方案，提供一种分布式网络节点，所述分布式网络基于节点的剩余能量值选取簇首节点，所述分布式网络节点当前为普通节点，包括发送器、接收器、存储器和处理器，所述发送器用于向其他节点发送消息；所述接收器用于接收其他节点发送的消息；所述存储器用于存储计算机指令；所述处理器执行所述计算机指令，用于：在选取簇首阶段判断自身剩余能量值是否小于设定阈值；在小于时， 控制所述发送器不广播包含所述自身剩余能量值的请求消息；在不小于时，通过所述发送器广播包含所述自身剩余能量值的请求消息。
为解决上述技术问题，本发明采用又再一技术方案，提供一种分布式网络系统，包括汇聚节点和多个普通节点，所述多个普通节点被划分为至少一个簇，所述簇中的至少一个普通节点包括至少一个簇首节点和簇成员节点，其中，所述簇成员节点用于将需上传的数据发送至簇首节点；所述簇首节点用于将所述数据转发至邻居簇首节点以上传至所述汇聚节点或直接将所述数据转发至所述汇聚节点；其中，所述普通节点还为上述的节点。
以上方案，相比于现有网络所有普通节点均发送请求消息以竞选簇首节点的方式，本实施例中普通节点根据自身剩余能量选择性广播其请求消息，即限制了剩余能量较少的普通节点的请求消息，故减少了由选取簇首节点产生的传输开销，也节省了节点的能量。
【附图说明】
图1是本发明分布式网络系统一实施例的结构示意图；
图2是本发明分布式网络系统一实施例中分簇结构示意图；
图3是本发明分布式网络的消息广播方法一实施例的流程图；
图4是本发明分布式网络的通信方法一实施例的流程图；
图5是本发明分布式网络节点一实施例的结构示意图；
图6是本发明分布式网络节点另一实施例的结构示意图。
【具体实施方式】
下面结合附图和实施方式对本发明进行详细说明。
第一实施例：
请参阅图1，图1是本发明分布式网络系统一实施例的结构示意图。本实施例中，分布式网络系统100包括多个普通节点111和至少一个汇聚(sink)节点112。以实际的网络物理拓扑为基础，该多个普通节点111可以被划分在至少一个虚拟的簇110中，所述簇110内的普通节点111进一步划分为至少一簇首节点111a和簇成员节点111b。
其中，簇首节点111a作为该簇110节点数据的汇集点和其他簇节点数据的中转点，用于收集所在簇的节点数据和和转发邻居簇的节点数据，以使上述数据最终到达汇聚节点112。汇聚节点112作为该分布式网络系统的数据的汇集点，用于收集分布式网络系统100中的簇首节点111a的数据，并可进行进一步处理。
本实施例中，该系统中的节点可具有以下至少一个特征：(1)所有普通节点111的物理性质相同；(2)每个普通节点111都能够产生数据如采集数据和发送数据；(3)每个普通节点111都具有路由功能；(4)每个普通节点111都能通过某种技术(如GPS)获得自己的位置信息；(5)汇聚节点112和普通节点111的缺省通信范围值(即最大通信范围)R相同，而且节点都知道该值，当然，其他实施例中汇聚节点和普通节点也可设置不同的缺省通信范围值；(6)普通节点111的发射功率可调，从而通信范围也可调；(7)汇聚节点112和每个普通节点111都有唯一的网络层地址，如IPv6地址。
该分布式网络系统可为分布式有线网络系统，或者分布式无线网络系统。在一应用中，该分布式无线网络系统可为无线传感器网络(Wireless Sensor Networks，WSNs)，该系统中的普通节点为传感器节点。在另一应用中，分布式无线网络系统可为移动Ad Hoc网络系统，该系统中的普通节点可以为可实现通信的任意移动终端，如手机、电脑等。
以无线传感器网络为例，该无线传感器网络是一种分布式的多跳无线网络，在该网络中，普通节点111用于采集周边环境或监测对象的传感数据，普通节点111在向汇集节点112传送传感数据分组时，簇内的所有节点的传感数据均汇集在所在簇110的簇首节点111a，簇首节点111a使用一跳或多跳的簇间路由将传感数据分组传送到汇聚(sink)节点112，汇集节点112接收到该数据分组后可进行进一步处理，例如将传感数据发送至用户终端；或将传感数据进行预估判断，并根据判断结果进行警报等。
在一实施例中，该系统100包括成簇和数据传输两个阶段，其中，系统可周期性的进行下述的成簇阶段，每次重新成簇后，则按照新簇进行下述数据传输；或者系统在下述组网子阶段完成后周期性进行选取簇首、簇首通告子阶段，每次选取新簇首后，则按照新簇首进行下述数据传输：
1)成簇阶段
网络开始运行后，将系统100的网络区域划分若干簇，并以一定的机制(如剩余能量最多等)在位于每个簇内的普通节点111中选择1个(或多个)节点作为簇首节点111a。
具体地，该成簇阶段可包括组网广播、选取簇首、簇首通告三个子节阶段。
1.1、组网广播子阶段
汇聚节点112在1跳范围内以缺省通信半径R广播一个组网消息，该组网消息中可包含汇聚节点112的地址、位置、分簇策略等。
该分簇策略可包括该系统中簇的标识和边长，当该系统110根据与汇 聚节点112的距离设定不同大小的簇110时，可包括需设置的各种簇110的边长以及该系统中对应设置该簇110的位置信息。在一实际应用中，该分簇策略包括设置两个尺寸的正方形的簇，其中，一种簇为另一种簇面积的1/4，如图2所示。本实施例中的簇形状也不限定为正方形。
该组网消息中还可包括下述选取簇首子阶段的时长，如可考虑将该时长设置为60s。
普通节点111收到组网消息后，根据组网消息中的分簇策略以及自身位置可确定所在簇，如所在簇的边长和标识，其中，该簇110的标识由该簇中离汇聚节点最远的顶点的坐标来表示。。例如，当普通节点111与汇聚节点12间的距离在第一距离范围内时，所在簇110为边长为第一长度的正方形；当普通节点111与汇聚节点112间的距离在第一距离范围外时，所在簇110为边长为第二长度的正方形；其中，所述第一长度小于第二长度，第一距离大于第二长度。具体如，以汇集节点112的X、Y坐标(或经、纬度)的(x0、y0)为基准，该普通节点111位于(x0+15m、y0+5m)，其中，在(x0±50m，y0±50m)区域内，簇边长为10m，故普通节点111位于簇标识为(x0+20m、y0+10m)的簇110中。
另外，普通节点111收到组网消息后，可记录下组网消息中携带的上一跳节点的地址信息、或所有转发过该组网消息的节点的地址以及簇尺寸如其边长等信息。然后，在该组网消息中加入自身的地址，并广播该组网消息，具体如在1跳范围内以缺省通信半径R广播该组网消息。其他普通节点接收到该组网消息，则进行如该普通节点的上述操作。
1.2、选取簇首子阶段
本实施例中，该系统100基于节点的剩余能量(如剩余电量)选取簇首节点。具体如，在广播组网消息后，普通节点111若需竞争为簇首节点，则生成包含自身地址和当前的剩余能量值的请求消息(也可称为竞争簇首消息)，该请求消息用于请求当选广播节点所在簇的簇首节点。
然后，普通节点111广播该请求消息。其中，不同尺寸的簇的节点的通信范围不同，例如，边长为
Figure PCTCN2016108156-appb-000001
的簇内节点则可调整其发射功率，以使其通信范围为
Figure PCTCN2016108156-appb-000002
边长为
Figure PCTCN2016108156-appb-000003
的簇内节点则可调整其发射功率，以使其通信范围调小为
Figure PCTCN2016108156-appb-000004
再进行后续的广播请求消息的操作。
可以理解的是，在上述的簇首节点可由单个节点选取确定的实施例中，该子阶段的时间可不固定，例如在该簇首节点的当选时间达到预设时间后，则进入下一周期的选取簇首子阶段，由簇内的一个节点直接根据上一周期情况确定好新周期的簇首节点，此时则结束该子阶段，并在下一子阶段通告该结果。当然此情况也可认为不设该子阶段。
1.3、簇首通告子阶段
选取簇首子阶段结束后，每一个广播了上述请求消息的普通节点111(其中是否广播其请求消息或者何时广播其请求消息可由下述相关实施例确定)可根据自身剩余能量值确定是否当选该簇的簇首节点具体可参考下述相关实施例，并在确定当选簇首节点后生成簇首通知消息，该消息中包括该普通节点111的地址和所在簇的标识，广播该通知消息。
当然，在上述的簇首节点可由单个节点选取确定的实施例中，该当个节点确认新簇首节点后的生成并广播该通知消息。
其他普通节点111根据该簇首通知消息确定自己是否属于该簇，如果是，则保存该簇首节点的地址信息作为所在簇的簇首节点的地址；如果不属于该簇，则判断自己是否为簇首节点，如果是，则保存该簇首节点的地址信息作为邻居簇的簇首节点的地址，否则不保存。
2)数据传输阶段
其中，如果簇成员节点111b有数据分组需要上传，则先将数据分组采用但不限采用单跳传送方式传给本簇的簇首节点111a。簇首节点111a收到数据分组后，用单跳或多跳的方式将数据分组转发给汇聚节点112；如果簇首节点111a自己有数据分组需上传，也采用同样的方式。
例如，当簇成员节点111b有数据分组要传送给汇聚节点112时，先查到所在簇的簇首节点111a的地址，然后以单播的方式将数据分组发送给簇首节点111a。簇首节点111a接收到该数据分组后，可向簇成员节点111b回复回应消息如ACK帧或其它消息，以表示已接收到其数据分组。
当簇首节点111a有数据分组(自身或簇内节点的)需要发往汇聚节点112时，先从邻居节点里找出当选为邻居簇簇首的节点，并将数据分组发送给该节点。每个簇首节点都进行这样的操作，直到数据分组被传送到汇聚节点112。
在数据传输阶段中，簇内的簇成员节点111b可设置为仅与簇首节点111a建立通信，而簇成员节点111b之间不进行通信。当然，这并不作为限定，簇成员节点111b之间可根据实际需要实现通信。
可以理解的是，图1仅示范性示出本发明分布式网络的拓扑结构，但不作为本发明分布式网络结构的限定，在其他实施例中，该分布式网络可包括更多簇，每个簇可存在共同节点，每个簇中的簇首节点数量可为多个，网络中汇聚节点数据也可为多个。
其中，该系统中的普通节点111或簇首节点111a可执行以下至少一个实施例中的方法，或对应为以下实施例中的节点，具体请参阅以下实施例描述。
在此，先对下面实施例出现的词语进行定义：邻居节点为位于当前节点通信范围内的节点，本实施例可理解为一跳可到达的节点。
另外，本发明下述方法中所述的其他普通节点或其他节点指的是除该执行该方法外的任意一个或多个普通节点或节点，且每次表述的其他普通节点或其他节点可以为相同节点或不同节点，并不应理解为所有表述的其他普通节点为特指的同一个节点，当然，在一些可明确理解为一系列动作均是有同一其他普通节点执行的步骤除外(如下述S208等)。
下述实施例均可以节点的剩余能量值选取簇首节点。
第二实施例：
本发明提供分布式网络的消息广播方法一实施例。本实施例中，该消息广播方法可由第一实施例所述的普通节点执行，用于确定普通节点是否广播请求竞选簇首节点的消息，具体该方法包括以下步骤：
S201：普通节点在选取簇首阶段时检测是否接收到簇内其他普通节点广播的请求消息；若接收到，则执行S202，若没有接收到，则执行S203。
其中，该分布式网络中的普通节点到达其设定请求时间时进行的上述检测，该设定请求时间可以理解为该普通节点可发送请求消息的时间，可由分布式网络的汇聚节点调配设置的，或者自身通过判断确定的(如下述第三实施例)。
S202：判断所述普通节点的剩余能量值是否大于所述请求消息中包含的所述剩余能量值。若是，则执行S203，否则执行S204。
S203：广播包含自身剩余能量值的请求消息，以请求当选所述簇首节点。
此时，普通节点确定其具有竞争簇首节点的资格。
S204：不广播包含自身剩余能量值的请求消息。
此时，普通节点确定其不具有竞争簇首节点的资格。
可选地，在S203之后，普通节点还可监测在剩余的选取簇首阶段中是否收到新的簇内其他普通节点发送的请求消息；若否，则确定作为所在簇的簇首节点，并将此消息通所在簇的所有其他普通节点，若是，则直接确定所述普通节点不为所在簇的簇首节点。
本实施例中普通节点限制了剩余能量较少的普通节点的请求消息，故减少了由选取簇首节点产生的传输开销，也节省了节点的能量。
第三实施例：
本发明提供分布式网络的消息广播方法另一实施例。本实施例中，该消息广播方法可由第一实施例所述的普通节点执行，用于确定何时广播用于请求竞选簇首节点的消息，具体该方法包括以下步骤：
S301：普通节点在选取簇首阶段判断自身剩余能量值是否小于设定阈值；若是，则执行S302，否则执行S303。
本实施例中普通节点采用剩余能量较大的优先广播的原则确定其广播请求消息的时间。其中，上述设定阈值为在所在簇的前一簇首节点在前一周期竞争簇首时的剩余能量值与0的区间中，以均匀分布的概率随机取的一个值。当然，该设定阈值也可为一固定值，且该固定值根据不同周期进行变化。通常，越靠前的周期中，该固定值越大。
可选地，在另一实施例中，在判断自身剩余能量值小于设定阈值之后，普通节点还执行：若在第一设定时间内未收到其他普通节点发送的请求消息，则调整所述设定阈值，并重新执行上述判断自身剩余能量值是否小于设定阈值。
S302：延迟广播包含所述自身剩余能量值的请求消息。
此时，普通节点认为其成为簇首节点的可能性较小，故延迟广播。
S303：即时广播包含所述自身剩余能量值的请求消息。
此时，普通节点认为其成为簇首节点的可能性较大，故即时广播。
可选地，普通节点执行上述S302和S303中的所述广播包含所述自身剩余能量值的请求消息以及之后确定簇首节点可参考第二实施例方法。
本实施例中，分布式网络中的普通节点分开广播，避免通信信道的堵塞。进一步，此时剩余能量小的普通节点更晚广播故可根据第二实施例方法判断后确定不广播请求，故可进一步减少控制开销，即减少由选取簇首节点传输开销，且节约节点能量。
第四实施例：
请参阅图4，图4是本发明分布式网络的通信方法一实施例的流程图。本实施例中，该通信方法可由第一实施例所述的普通节点执行，用于根据簇内和簇间传输调整其通信范围，具体该方法包括以下步骤：
S401：簇首节点判断需进行与之通信的节点为簇内节点还是簇外节点。
S402：若为簇内节点，则以第一发射功率与所述簇内节点通信。
S403：若为簇外节点，则以第二发射功率与所述簇外节点通信。
所述第一发射功率(也称为簇内发射功率)小于所述第二发射功率(也称为簇外发射功率)。
可选地，该分布式网络可按照与汇聚节点的距离划分两种尺寸簇的具体应用中，该第二发射功率的通信范围可均设置为R，当所在簇边长为
Figure PCTCN2016108156-appb-000005
时，所述第一发射功率的通信范围可设置为
Figure PCTCN2016108156-appb-000006
当所在簇边长为
Figure PCTCN2016108156-appb-000007
时，所述第一发射功率的通信范围可设置为
Figure PCTCN2016108156-appb-000008
本实施例实现了自适应调整其通信范围，实现了在保障簇内、簇间通 信成功的前提下，减小簇间干扰，使通信相对更加可靠，有利于数据分组传送成功率的提高，且节约簇首节点能量。
第五实施例：
本发明提供分布式网络的消息传输方法一实施例。本实施例中，该消息传输方法可由第一实施例所述的普通节点执行，用于普通节点在数据传输时基于节点位置实现路由选择，具体该方法包括以下步骤：
S501：普通节点接收邻居普通节点发送的组网消息。
该组网消息来源于所述分布式网络的汇聚节点，具体可如第一实施例所述。该组网消息还包括邻居普通节点的位置信息。该位置信息可具体包括发送该组网消息的邻居普通节点与汇聚节点之间的距离。
S502：从所述组网消息中获取并保存所述邻居普通节点的位置信息。
进一步地，在确定其邻居簇首节点后，可仅保存其邻居簇首节点的位置信息。在进行上述位置保存之后，普通节点还可将自身的地址和位置信息加入至组网消息中，并转发所述组网消息。其他普通节点接收到该组网消息，即可同样执行本方法步骤以获得其邻居节点的位置信息。
S503：在作为簇首节点向所述汇聚节点发送消息时，根据所述保存的位置信息，选择出与所述汇聚节点距离最短的邻居簇首节点。
S504：将所述消息发送至所述选择的邻居簇首节点，以通过所述选择的邻居簇首节点将所述消息转发至所述汇聚节点。
例如，普通节点如上述第四实施例所述进行簇内和簇外通信。具体地，普通节点在确定与汇聚节点最近的邻居簇首节点之后，以上述簇外发射功率向所述选择的邻居簇首节点发送所述消息。
本实施例实现了最短路由，减少了数据传输至汇聚节点的时间和开销，而且上述路由方式直接利用组网消息中携带位置信息实现，无需新增路由消息进行，故减少其控制开销。
第六实施例
本发明提供分布式网络的簇首选取方法一实施例。本实施例中，该方法可由第一实施例所述的普通节点执行，用于无需普通节点发送竞争簇首请求消息，即可实现簇首选取，该方法包括：
S601：普通节点接收所在簇其他普通节点的剩余能量信息。
该S601可执行在第一实施例中所述的数据传输阶段或所述成簇阶段。该剩余能量信息可以设置于该普通节点接收到的任意数据中。当然，该剩余能量信息也可根据接收到的数据的信号强度确定。普通节点将该剩余能量信息保存于本地。可以理解的是，在簇首节点不可连续作为簇首节点的实施例中，本实施例中的普通节点仅为簇成员节点。
S602：在进入下一簇首选取阶段时，根据所述剩余能量信息获得所述其他普通节点的当前剩余能量值。
例如，在数据传输阶段，所述剩余能量信息包括所在簇的当前簇首节点作为本周期簇首节点期间其他普通节点最后一次发送数据时的第二剩余能量值，例如包括在当前簇首节点期间，其他簇成员节点最后一次向簇首节点发送数据时的剩余能量值以及该簇首节点最后一次向该普通节点发送数据时的剩余能量值。该S602具体包括：将其他普通节点的所述第二剩余能量值作为所述其他普通节点的当前剩余能量值。
又例如，所述剩余能量信息包括在所在簇当前簇首节点确定作为本周期簇首节点时所述其他普通节点的第一剩余能量值以及通信情况；该S602具体包括：根据所述通信情况估计得到所述其他普通节点在所述簇首节点作为本周期簇首节点期间的能量损耗值；将每个其他普通节点的所述第一剩余能量值与其能量损耗值之间的差值作为该其他普通节点的当前剩余能量值。具体如，根据节点的通信次数划分为多个等级，并对应不同等级预设对应的能量损耗值，通过上述对应关系，将该其他普通节点的通信次数划分至对应等级中，从而查询得到相应能量损耗值。
S603：判断自身当前剩余能量值是否大于获得的所述其普通他节点的当前剩余能量值；，若均大于，则执行S604，否则确定自身不为簇首节点，即不广播自荐为新簇首节点的通知消息。
S604：广播自荐为新簇首节点的通知消息。
进一步地，该普通节点在判断自身当前剩余能量值大于该其他普通节点的当前剩余能量值时，检测是否接收到其他普通节点发送的自荐为新簇首节点的通知消息，若未接收到，则确定自身作为新簇首节点，并广播自荐为新簇首节点的通知消息，否则确定发送所述通知消息的所述其他普通节点为新簇首节点，故不广播自荐为新簇首节点的通知消息。
在当选为新簇首节点后，该普通节点可如本发明其他实施例或其组合方式进行所述进行数据传输和重新划分所在簇。
本实施例无需普通节点发送竞争簇首请求消息，故大大减少了因选取簇首节点产生的传输开销，也节省了节点的能量。
第七实施例
本发明提供分布式网络的簇首选取方法一实施例。本实施例中，该方法可由第一实施例所述的普通节点执行，用于无需普通节点发送竞争簇首请求消息，即可实现簇首选取，该方法包括：
S701：普通节点在簇首选取阶段时，检测自身是否已当选过簇首节点以及自身的当前剩余能量是否大于设定能量值；若大于，则执行S702，否 则确定无法当选簇首节点，故不广播通知消息。
该设定能量值的设定和调整可参考上述第三实施例中的设定阈值的秒速。
S702：广播自荐为新簇首节点的通知消息。
可选地，普通节点在执行上述S701之前，先判断是否接收到所在簇其他普通节点发送的自荐为新簇首节点的通知消息；若否，则确定自身为新簇首节点，并执行S701；若是，则确定发送所述通知消息的所述其他普通节点为新簇首节点，并结束流程。当然，上述判断也可以在执行S701后，若确定自身未当选过簇首节点以及自身的当前剩余能量大于设定能量值时再执行，并判断未收到其他普通节点的通知消息则执行S702，否则确定发送该通知消息的该其他普通节点为新簇首节点，并结束流程。
第八实施例
本发明提供分布式网络的簇首选取方法一实施例。本实施例中，该方法可由第一实施例所述的普通节点执行，用于确定普通节点是否广播请求竞选簇首节点的消息，该方法包括以下步骤：
S801：普通节点在选取簇首阶段时检测是否接收到簇内其他普通节点广播的请求消息；若接收到，则执行S802，若没有接收到，则执行S803。
该S801具体实施请参阅S201的描述。
S802：判断所述普通节点的剩余能量值是否比所述请求消息中包含的所述剩余能量值不低于设定差值。若是，则执行S803，否则执行S804。
S803：广播包含自身剩余能量值的请求消息，以请求当选所述簇首节点。
S805：在所述选取簇首阶段结束时，若判断自身为广播过所述请求消息的簇内节点中满足设定条件的节点，则确定自身作为新簇首节点。
其中，该设定条件包括关于该节点剩余能量和/或其位置相关的条件，例如包括该节点剩余能量值是否符合设定能量条件和该节点是否与汇聚节点的距离最近。
S804：不广播包含自身剩余能量值的请求消息。
该S804具体说明可参阅S204的描述。
第九实施例
请参阅图3，图3是本发明分布式网络的消息广播方法一实施例的流程图。本实施例中，该方法可由第一实施例所述的普通节点执行，用于确定普通节点是否广播请求竞选簇首节点的消息，该方法包括以下步骤：
S901：普通节点在选取簇首阶段判断自身剩余能量值是否小于设定阈值；若是，则执行S902，否则执行S903。
其中，该设定阈值的描述请参阅上述第三实施例中的设定阈值。
S902：不广播包含所述自身剩余能量值的请求消息。
其中，所述请求消息用于请求当选所述簇首节点。该S902具体说明可参阅S204的描述。
S903：广播包含自身剩余能量值的请求消息。
该S903具体说明可参阅S203的描述。
广播该请求消息后，该普通节点可执行上述S805以确定自身为新簇首节点，例如，普通节点判断自身是否为广播过所述请求消息的簇内节点中剩余能量最高或与汇聚节点距离最近的节点，若是，则确定自身为新簇首节点，并广播自身作为新簇首节点的通知消息。在当选为新簇首节点后，该普通节点可如本发明其他实施例或其组合方式进行所述进行数据传输和重新划分所在簇。
在另一实施例中，该S902具体包括以下子步骤：
S9021：根据之前接收到的邻居普通节点的数据的信号强度，确定所述邻居普通节点的剩余能量值是否低于设定能量值。
例如，该分布式网络设定的通信协议包括当节点检测到自身剩余能量值低于设定能量值，则改变其发送数据时的信号强度，具体此时可将信号调大或者调小。在上一周期的数据传输阶段中，普通节点记录其接收到邻居节点的数据或控制消息的信号强度。本步骤中，通过将记录的信号强度与协议中的正常信号强度作比较，若发现邻居节点的信号强度发生上述变化时，即可确定该邻居节点的剩余能量值低于设定能量值。
S9022：若确定剩余能量值低于所述设定能量值的邻居普通节点数量低于设定数量，则不广播包含所述自身剩余能量值的请求消息。
该普通节点进一步在自身剩余能量值不小于设定阈值，或自身剩余能量值小于设定阈值但剩余能量值低于所述设定能量值的邻居普通节点数量不低于设定数时执行该S903。
可依照上述方式对所有上一周期曾接收过其信号的邻居节点进行判断，当该普通节点确定其剩余能量低于设定能量值的邻居节点数量不低于一数值，则可认为该普通节点的邻居节点能量状态大部分处于较低状态，可能均在执行本实施例方法后不广播。为避免邻居节点均不广播的情况发生，普通节点此时则广播其请求消息。当该普通节点确定其剩余能量低于设定能量值的邻居节点数量低于一数值，则可认为邻居节点存在全部不广播的可能性较小，故此时则不广播该请求消息。
相比于现有网络所有普通节点均发送请求消息以竞选簇首节点的方式，本实施例中普通节点根据自身剩余能量选择性广播其请求消息，即限 制了剩余能量较少的普通节点的请求消息，故减少了由选取簇首节点产生的传输开销，也节省了节点的能量。
第十实施例
本发明提供分布式网络的簇首选取方法一实施例。本实施例中，该方法可由第一实施例所述的簇首节点执行，用于无需普通节点发送竞争簇首请求消息，即可实现簇首选取，该方法包括：
S1001：簇首节点接收所在簇的簇成员节点发送的数据，并由所述数据得到所述簇成员节点的当前剩余能量值。
S1002：在进入下一簇首选取阶段时，比较所在簇节点的当前剩余能量值，并查找出当前剩余能量值最大的节点。
可以理解的是，在簇首节点不可连续作为簇首节点的实施例中，簇首节点可以查找出当前剩余能量值最大的簇成员节点。
S1003：广播确定所述当前剩余能量值最大的节点为新簇首节点的通知消息。
第十一实施例
本发明提供分布式网络的通信方法一实施例。本实施例中，该方法可由第一实施例所述的簇首节点执行，用于使用簇内发送功率实现簇间通信，该方法包括：
S1101：簇首节点判断待发送数据的目标节点是否为邻居簇首节点。若是，则执行S1102，否则执行S1104。
其中，在该待发送数据的目标节点为在该待发送数据的传输路径中该簇首节点的下一跳节点，也即簇首节点需要将该待发送数据发送至的下一跳节点。
S1102：搜索出与所述目标节点关联的簇成员节点。
在另一实施例中，在S1102之前，该方法还包括：以所述第一发射功率广播测试信号；接收簇成员节点发送的反馈信号，其中，所述反馈信号包含所述簇成员节点可接收到其测试信号的邻居簇首节点的信息如该邻居簇首节点的地址；建立所述簇成员节点与所述簇成员节点可接收到其测试信号的邻居簇首节点之间的关联。在建立该关联前，先查询下是否已建立该邻居簇首节点与其他簇成员节点间的关联，若是，则不建立该关联，若否，则建立该关联。由此，簇首节点保存有至少一个邻居簇首节点的关联关系。
S1103：以第一发射功率将所述待发送数据发送至所述关联的簇成员节点，以通过所述关联的簇成员节点将所述待发送数据转发至所述目标节点。
例如，簇首节点在确定该目标节点为邻居簇首节点时，将目标节点的 地址与预存关联关系中的邻居簇首节点地址进行对比，以查找是否存在与该目标节点地址匹配的邻居簇首节点地址；若存在，则根据预存关联关系获取与该目标节点关联的簇成员节点信息，并以第一发射功率将所述待发送数据发送至该簇成员节点；若不存在，则以第二发射功率将所述待发送数据直接发送至所述目标节点。
其中，所述第一发射功率(也称为簇内发射功率)满足所述簇首节点与其所有簇成员节点通信，但不能满足所述簇首节点与所有邻居簇首节点通信。所述第二发送功率(也称为簇外发射功率)大于所述第一发射功率，能够满足所述簇首节点与所有邻居簇首节点的通信。例如，该第一发射功率实现的通信范围为
Figure PCTCN2016108156-appb-000009
第二发射功率实现的通信范围为R。
S1104：以第一发射功率将所述待发送数据发送至所述目标节点。
当判断该目标节点不为邻居簇首节点时，即该目标节点为簇成员节点。
第十二实施例
本发明提供分布式网络的通信方法另一实施例。本实施例中，该方法可由第一实施例所述的簇成员节点执行，用于使用簇内发送功率实现簇间通信，该方法包括：
S1201：簇成员节点接收簇内簇首节点以第一发射功率发送的数据。
其中，所述第一发射功率满足所述簇首节点与簇内所有簇成员节点通信，但不能满足所述簇首节点与所有邻居簇首节点通信。
S1202：获取所述数据中包含的目标节点信息，并检测所述数据的目标节点是否为邻居簇首节点。
如上述十一实施例所述，簇首节点以第一发射功率发送的数据可能是直接发送至簇内节点也可能是需要发送至邻居簇首节点的，故簇成员节点接收到该数据后，根据数据中的目标节点信息如目标节点地址，判断该数据的目标节点为邻居簇首节点还是簇成员节点，若是邻居簇首节点，则执行S1203。若是簇成员节点，则确定该数据的目标节点为自身，并对该数据进行相应处理，结束流程。其中，本实施例所述的目标节点如上述十一实施例所述。
S1203：将所述数据转发至所述邻居簇首节点。
在一实施例中，该簇成员节点是以第一发射功率进行簇内通信，同样地，该簇成员节点以第一发射功率将所述数据转发至所述邻居簇首节点。由此，簇成员节点无需提高自身的发射功率即可实现协助簇首节点与邻居簇首节点之间的通信。进一步地，在该S1202之前，该方法还可包括：接收邻居簇首节点以所述第一发射功率广播的测试信号；生成包含所述邻居簇首节点的信息的反馈信息，并发送至簇内簇首节点，以使该簇首节点根 据该反馈信息建立该簇成员节点与该邻居簇首节点之间的关联。
上述第十一和十二实施例中的簇首节点和簇成员节点在簇首选取节点可以采用上面实施例实现簇首选取或请求消息广播。
以上两个实施例中，簇首节点通过以簇内发射功率将数据发送至簇成员节点，并由该簇成员节点将数据转发至邻居簇首节点，故簇首节点仅以簇内发射功率实现了簇间通信，节约簇首节点能量。
第十三实施例
本发明提供分布式网络的通信调整方法一实施例。本实施例中，该消息广播方法可由第一实施例所述的簇首节点执行，用于适应性调整簇间发射功率，节省节点能量，具体该方法包括以下步骤：
S1301：簇首节点检测与相邻簇首节点的通信质量。
该簇首节点可定时检测与相邻簇首节点的通信质量，或者在数据通信阶段的设定时刻如开始时进行该检测。所述通信质量具体可为可表征该簇首节点与相邻簇首节点之间的通信状态的任意参数，例如该簇首节点与所述相邻簇首节点在设定时间内通信的误码率等。
S1302：根据所述通信质量，调整与所述相邻簇首节点通信时的发射功率。
本实施例中，簇首节点与相邻簇首节点之间的通信的发射功率是可以调整的，具体簇首节点根据与该相邻簇首节点之间的通信质量进行调整。例如，若所述通信质量满足第一设定条件，则将与所述相邻簇首节点通信时的发射功率上调；若所述通信质量满足第二设定条件，则将与所述相邻簇首节点通信时的发射功率下调。其中，可按照设定步长进行上调或下调，或者按照当前通信质量与该设定条件的差异确定需要调整的功率值。
进一步地，上述第一设定条件为所述簇首节点与所述相邻簇首节点在设定时间内通信的误码率小于第一设定值；上述第二设定条件为所述簇首节点与所述相邻簇首节点在所述设定时间内通信的误码率大于第二设定值；其中，所述第二设定值大于或者等于所述第一设定值。当然，若所述通信质量满足第三设定条件，则保持当前与所述相邻簇首节点通信时的发射功率。例如该第三设定条件为簇首节点与所述相邻簇首节点在所述设定时间内通信的误码率在第一设定值与第二设定值之间。
进一步地，该方法还可包括以下步骤：
S1303：簇首节点检测与簇内簇成员节点的通信质量。
S1304：根据所述与簇内簇成员节点的通信质量，调整与所述簇成员节点通信时的发射功率。
同理于上述S1302，簇首节点根据该与簇成员节点的通信质量对与簇内 发射功率进行调整。
本实施例，簇首节点根据与邻居簇首节点的通信质量对与邻居簇首节点通信时的发射功率进行调整，实现了簇间通信的发射功率的适应性调整，避免了簇间通信时簇首节点能量的多余浪费，加强了簇首节点能量的有效利用。
第十四实施例
本发明提供分布式网络的通信调整方法一实施例。本实施例中，该消息广播方法可由第一实施例所述的簇首节点执行，用于适应性调整簇间发射功率，节省节点能量，具体该方法包括以下步骤：
S1401：簇首节点获取与相邻簇首节点间的距离。
具体，簇首节点向相邻簇首节点发送询问其位置信息的消息，并由其相邻簇首节点响应该询问消息而反馈其位置信息；或者相邻簇首节点在向簇首节点发送数据时主动将位置信息包含在数据中，具体可如第五或第十五实施例通过组网节点或广播当选簇首节点的通知消息发送其位置信息，簇首节点从该数据中提取位置信息并保存，在进行调整时获取预存的相邻簇首节点的位置信息，并由所述位置信息计算得到所述簇首节点与相邻簇首节点间的距离。
S1402：根据所述距离，调整与所述相邻簇首节点通信时的发射功率。
本实施例中，簇首节点与相邻簇首节点之间的通信的发射功率是可以调整的。具体簇首节点预设有不同通信范围与不同发射功率值的对应关系，该S1402可包括：从预设的与不同通信范围对应的发射功率值中，搜索出与所述距离匹配的通信范围对应的发射功率值；将所述与所述相邻簇首节点通信时的发射功率调整至所述搜索出的发射功率值。
进一步地，该方法还可包括以下步骤：
S1403：簇首节点获取与簇内簇成员节点间的距离。
该距离的获取方式可参阅上述邻居簇首节点的距离获取。
S1404：根据所述与簇内簇成员节点的距离，调整与所述簇成员节点通信时的发射功率。
同理于上述S1402，簇首节点根据该与簇成员节点的距离对与簇内发射功率进行调整。
当然该簇首节点也可执行上述S1303-S1304以调整与簇成员节点通信时的发射功率。
本实施例，簇首节点根据与邻居簇首节点的距离对与邻居簇首节点通信时的发射功率进行调整，实现了簇间通信的发射功率的适应性调整，避免了簇间通信时簇首节点能量的多余浪费，加强了簇首节点能量的有效利 用。
上述第十三和十四实施例中调整后的簇首节点与簇成员节点通信时的发射功率即可作为本发明其他实施例中的第一发射功率，调整后的簇首节点与相邻簇首节点通信时的发射功率即可作为本发明其他实施例中的第二发射功率，在调整后，可采用本发明其他实施例利用该第一发射功率和第二发射功率进行通信、重新划分所在簇以及进行簇首选取或请求消息广播。
第十五实施例
本发明提供分布式网络的通信方法一实施例。本实施例中，该通信方法可由第一实施例所述的簇首节点执行，用于簇首节点在数据传输时基于节点位置实现路由选择，具体该方法包括以下步骤：
S1501：簇首节点根据预存的邻居簇首节点的位置信息，选择出与所述汇聚节点距离最短的邻居簇首节点。
其中，所述邻居簇首节点的位置信息源于所述邻居簇首节点在当选簇首节点时广播的通知消息。该位置信息具体可包括所述邻居簇首节点与所述汇聚节点的距离，或包括其他可得到该邻居簇首节点与汇聚节点间距离的信息。
本步骤发生在上述数据传输阶段。例如，该簇首节点将所在簇的簇成员节点发送的数据上传至汇聚节点时，该簇首节点获取在簇首广播阶段保存的邻居位置信息，并在保存的信息中查找出其邻居簇首节点的位置消息，将获取得到的至少一个邻居簇首节点位置信息进行比较，得到其中与汇聚节点距离最短的邻居簇首节点。
S1502：将所述消息发送至所述选择的邻居簇首节点，以通过所述选择的邻居簇首节点将所述消息转发至所述汇聚节点。
例如，簇首节点如上述第四实施例所述进行簇内和簇外通信。具体地，簇首节点在确定与汇聚节点最近的邻居簇首节点通信之后，以上述簇外发射功率向所述选择的邻居簇首节点发送所述消息。该邻居簇首节点在接收到该消息后，可同样利用本方法实施例将该消息转发至下一个距离汇聚节点最近的其邻居簇首节点，每个转发节点均以此类推进行转发，直至消息到达汇聚节点。
在另一实施例中，在S1501之前，所述方法还包括以下步骤：
S1503：接收邻居簇首节点在当选簇首节点时广播的通知消息。
S1504：从所述通知消息中获取并保存所述邻居簇首节点的地址及位置信息。
上述该S1503-S1504执行在簇首广播子阶段。所述通知消息包括所述邻居簇首节点的地址及位置信息。例如，簇首节点从通知消息中获得该地 址和位置信息，并将其建立映射关系后进行保存。
另外，簇首节点可在当选簇首节点时，生成包括自身地址和位置信息的通知消息，并广播所述通知消息，以通知其当选簇首节点。其他邻居簇首节点接收到该组网消息，即可同样执行本方法步骤以获得其邻居簇首节点的位置信息。
另外，本实施例所述簇首节点还可采用本发明其他实施例重新划分所在簇以及进行簇首选取或请求消息广播等。
本实施例利用确定其当选簇首节点的通知消息中的位置信息确定出与汇聚节点距离最近的邻居簇首节点，以利用与汇聚节点距离最近的邻居簇首节点转发消息至汇聚节点，故减少了数据传输至汇聚节点的时间和开销，最大程度上缩短传输路径，提高了路由效率，而且上述路由方式直接利用通知消息中携带位置信息实现，无需新增路由消息进行，故减少其控制开销。
第十六实施例
本发明提供分布式网络的管理方法一实施例。本实施例中，该管理方法可由第一实施例所述的簇首节点执行，用于在组网节阶段后重新划分所在簇，具体该方法包括以下步骤：
S1601：簇首节点统计簇内节点数量。
该簇内节点可包含该簇首节点或者不包括该簇首节点仅包括所在簇的簇成员节点。例如，簇首节点广播探测信号，其中，所述探测信号用于请求簇内簇成员节点响应所述探测信号；接收簇内簇成员节点响应所述探测信号发送的作答信号；统计接收到的作答信号以获得簇内节点数量。
进一步地，该探测信号可上述用于通知其当选簇首节点的通知消息，具体，所述簇首节点在确定作为簇首节点时广播所述探测信号，所述探测信号包括所述簇首节点的地址，还用于通知簇内普通节点其当选簇首节点。簇首节点接收到该作答后，可通过统计接收到的作答数量得到其簇内簇成员节点；
S1602：判断所述簇内节点数量是否大于设定值；若大于，则执行S1603，否则确定无需分簇，结束流程。
其中，该设定值可以从汇聚节点广播的组网消息中得到的，也可由自身根据所在簇的之前通信情况和/或剩余能量情况确定的，如判断所在簇节点目前的剩余能量值在预设的哪个能量范围中，并将所述簇内节点数量与该能量范围中匹配的设定值进行比较。
S1603：将所在簇划分为至少两个簇，并将划分结果上传至汇聚节点。
具体，可根据当前所在簇节点数量与该设定值之间的差值确定划分多 少簇，例如，若该差值低于该所在簇节点数据的三分之一，则划分为两个簇，若该差值位于该所在簇节点数据的三分之一与1倍之间，则划分为3个簇，若该差值大于该所在簇节点数据的1倍，则划分为4个簇。
在确定好划分情况之后，将该划分结果转发至邻居簇首节点以通过该邻居簇首节点发送至汇聚节点，并将该划分结果广播至簇内节点。
进一步地，簇首节点在划分之后，还可确定划分后每个簇的簇首节点，例如查找出所述至少两个簇中不包括所述簇首节点的簇；将所述查找出的每个簇中剩余能量值最高的节点确定为对应簇的簇首节点，并在簇内广播所述确定结果，簇内节点接收到上述划分结果和确定结果后，按照接收内容划分新簇并确定新簇的簇首节点。
当然，簇首节点也可不确定每个簇的簇首节点，簇内节点在根据上述划分结果分簇后，可执行如上述实施例选取其簇首节点或者广播竞争簇首节点的请求消息并实现簇首的选取。
更进一步地，划分好新簇后，该簇成员节点可如上述十三、十四实施例对其发射功率进行调整。且，该簇首节点进行上述簇间通信和簇内通信可参阅以上相关实施例的描述。
在另一实施例中，该方法还包括：在组网阶段，根据组网策略确定所在簇的边长；其中，所述组网策略为越靠近若所述汇聚节点则所在簇的面积越大。该组网策略至少包括三种尺寸的簇，例如所述组网策略具体包括节点与所述汇聚节点间的距离在第一距离范围内时，所在簇为边长为第一长度的正方形；当节点与所述汇聚节点间的距离在第一距离范围外且在第二距离范围内时，所在簇为边长为第二长度的正方形；当节点与所述汇聚节点间的距离在第二距离范围外且在第三距离范围内时，所在簇为边长为第三长度的正方形；其中，所述第一长度小于第二长度小于第三长度。
本实施例簇首节点还可采用本发明其他实施例进行簇间或簇内通信以及进行簇首选取或请求消息广播。
本实施例中，簇首节点可根据当前所在簇的簇内节点数量重新划分所在簇，实现了分布式网络中簇划分的智能调整，且限制了该网络中簇节点的数量，避免簇首节点由于簇内节点过多而能量消耗过大的情况，在一定程度上可实现网络节点能量均匀化。
第十七实施例
请参阅图5，本实施例中，该节点可以为图1所示的普通节点。该节点包括检测模块171、第一广播模块172和第二广播模块173。
检测模块171用于在选取簇首阶段判断自身剩余能量值是否小于设定阈值；
第一广播模块172用于在小于时，不广播包含所述自身剩余能量值的请求消息；
第二广播模块173用于在不小于时，广播包含所述自身剩余能量值的请求消息；
其中，所述请求消息用于请求当选所述簇首节点。
可选地，该节点还包括调整模块，用于若在设定时间内未接收到簇内其他普通节点发送的请求消息，则将所述设定阈值下调。检测模块171进一步以调整后的所述设定阈值进行所述检测。
可选地，该节点还包括取值模块，用于在所在簇的前一簇首节点在前一周期竞争簇首时的剩余能量值与0的区间中，以均匀分布的概率随机取一个值作为所述设定阈值。
可选地，第一广播模块172具体用于根据之前接收到的邻居普通节点的数据的信号强度，确定所述邻居普通节点的剩余能量值是否低于设定能量值；若确定剩余能量值低于所述设定能量值的邻居普通节点数量低于设定数量，则不广播包含所述自身剩余能量值的请求消息；第一广播模块172具体用于若自身剩余能量值不小于设定阈值，或自身剩余能量值小于设定阈值但剩余能量值低于所述设定能量值的邻居普通节点数量不低于设定数，则广播包含所述自身剩余能量值的请求消息。
可选地，该节点还包括第三广播模块，用于判断自身是否为广播过所述请求消息的簇内节点中剩余能量最高或与汇聚节点距离最近的节点，若是，则广播自身作为新簇首节点的通知消息。
可选地，该节点还包括发送模块，用于当作为新簇首节点时，接收所在簇的其他普通节点发送的数据；以第一发射功率向所述其他普通节点反馈回应消息，并以第二发射功率将所述数据通过邻居簇首节点转发至汇聚节点，其中，所述第一发射功率小于所述第二发射功率。
可选地，当所述普通节点与所述传感网络中的汇聚节点间的距离在第一距离范围内时，所在簇为边长为第一长度的正方形；当所述普通节点与所述汇聚节点间的距离在第一距离范围外时，所在簇为边长为第二长度的正方形；其中，所述第一长度小于第二长度。
上述节点的各个模块可分别执行上述方法实施例中对应步骤，故在此不对各模块进行赘述，详细请参阅以上对应步骤的说明。可以理解的是，上述节点的上述模块还可执行上述方法实施例中的其他步骤，或者上述节点还可包括其他功能模块用以执行上述方法实施例中的其他步骤。
请参阅图6，图6是本发明分布式网络节点另一实施例的结构示意图。该节点为图1所示的普通节点，该节点可以执行上述方法中步骤。相关内 容请参见上述方法中的详细说明，在此不再赘叙。
本实施例中，该节点180包括：发送器181、接收器182、一个或多个处理器183、存储器184和总线185。
发送器181用于向分布式网络中的其他节点发送消息，如采集的传感数据、组网消息等。接收器182用于接收分布式网络中的其他节点发送的消息，如采集的传感数据、组网消息等存储器184包括只读存储器和随机存取存储器。存储器184的一部分还可以包括非易失性随机存取存储器(NVRAM)。
处理器183还可以称为CPU(Central Processing Unit，中央处理单元)。具体的应用中，节点的各个组件可通过总线185耦合在一起，其中总线185除包括数据总线之外，还可以包括电源总线、控制总线和状态信号总线等。但是为了清楚说明起见，在图中将各种总线都标为总线185。当然，在其他实施例中，节点也可不包括该总线。
本发明实施例中，节点180还包括多个应用程序以及一个或多个程序，所述多个应用程序以及一个或多个程序存储在存储器184中，并且配置为被所述处理器183执行。所述一个或多个程序包括指令。处理器183通过调用存储器184存储的所述一个或多个程序中的指令，上述处理器183具体可用于执行上述方法实施例或其组合，具体请参考上述方法实施例的描述。
以上方案可减少控制开销，从而节约节点能量，延长节点和网络的寿命，也提高了网络通信的可靠性。
以上所述仅为本发明的实施方式，并非因此限制本发明的专利范围，凡是利用本发明说明书及附图内容所作的等效结构或等效流程变换，或直接或间接运用在其他相关的技术领域，均同理包括在本发明的专利保护范围内。

Claims (15)

  1. 一种分布式网络的消息广播方法，其特征在于，所述分布式网络基于节点的剩余能量值选取簇首节点，所述方法包括：
    普通节点在选取簇首阶段判断自身剩余能量值是否小于设定阈值；
    若是，则不广播包含所述自身剩余能量值的请求消息；
    若否，则广播包含所述自身剩余能量值的请求消息；
    其中，所述请求消息用于请求当选所述簇首节点。
  2. 根据权利要求1所述的方法，其特征在于，在所述不广播包含所述自身剩余能量值的请求消息之后，还包括：
    若在设定时间内未接收到簇内其他普通节点发送的请求消息，则将所述设定阈值下调，并以调整后的所述设定阈值重新执行本方法。
  3. 根据权利要求1所述的方法，其特征在于，还包括：
    在所在簇的前一簇首节点在前一周期竞争簇首时的剩余能量值与0的区间中，以均匀分布的概率随机取一个值作为所述设定阈值。
  4. 根据权利要求3所述的方法，其特征在于，所述不广播包含所述自身剩余能量值的请求消息，包括：
    根据之前接收到的邻居普通节点的数据的信号强度，确定所述邻居普通节点的剩余能量值是否低于设定能量值；
    若确定剩余能量值低于所述设定能量值的邻居普通节点数量低于设定数量，则不广播包含所述自身剩余能量值的请求消息；
    所述若否，则广播包含所述自身剩余能量值的请求消息，包括：
    若自身剩余能量值不小于设定阈值，或自身剩余能量值小于设定阈值但剩余能量值低于所述设定能量值的邻居普通节点数量不低于设定数，则广播包含所述自身剩余能量值的请求消息。
  5. 根据权利要求1所述的方法，其特征在于，在所述广播包含所述自身剩余能量值的请求消息之后，还包括：
    判断自身是否为广播过所述请求消息的簇内节点中剩余能量最高或与汇聚节点距离最近的节点，若是，则广播自身作为新簇首节点的通知消息。
  6. 根据权利要求5所述的方法，其特征在于，还包括：
    当作为新簇首节点时，接收所在簇的其他普通节点发送的数据；
    以第一发射功率向所述其他普通节点反馈回应消息，并以第二发射功率将所述数据通过邻居簇首节点转发至汇聚节点，其中，所述第一发射功率小于所述第二发射功率。
  7. 根据权利要求1所述的方法，其特征在于，当所述普通节点与所述传感网络中的汇聚节点间的距离在第一距离范围内时，所在簇为边长为第 一长度的正方形；当所述普通节点与所述汇聚节点间的距离在第一距离范围外时，所在簇为边长为第二长度的正方形；
    其中，所述第一长度小于第二长度。
  8. 一种分布式网络节点，其特征在于，所述分布式网络基于节点的剩余能量值选取簇首节点，所述分布式网络节点当前为普通节点，包括发送器、接收器、存储器和处理器，
    所述发送器用于向其他节点发送消息；所述接收器用于接收其他节点发送的消息；所述存储器用于存储计算机指令；所述处理器执行所述计算机指令，用于：
    在选取簇首阶段判断自身剩余能量值是否小于设定阈值；
    在小于时，控制所述发送器不广播包含所述自身剩余能量值的请求消息；
    在不小于时，通过所述发送器广播包含所述自身剩余能量值的请求消息。
  9. 根据权利要求8所述的节点，其特征在于，在所述不广播包含所述自身剩余能量值的请求消息之后，所述处理器还用于：
    若在设定时间内未接收到簇内其他普通节点发送的请求消息，则将所述设定阈值下调，并以调整后的所述设定阈值重新执行本方法。
  10. 根据权利要求8所述的方法，其特征在于，所述处理器还用于：
    在所在簇的前一簇首节点在前一周期竞争簇首时的剩余能量值与0的区间中，以均匀分布的概率随机取一个值作为所述设定阈值。
  11. 根据权利要求8所述的节点，其特征在于，所述处理器执行所述不广播包含所述自身剩余能量值的请求消息，包括：
    根据之前接收到的邻居普通节点的数据的信号强度，确定所述邻居普通节点的剩余能量值是否低于设定能量值；
    若确定剩余能量值低于所述设定能量值的邻居普通节点数量低于设定数量，则不广播包含所述自身剩余能量值的请求消息；
    所述若否，则广播包含所述自身剩余能量值的请求消息，包括：
    若自身剩余能量值不小于设定阈值，或自身剩余能量值小于设定阈值但剩余能量值低于所述设定能量值的邻居普通节点数量不低于设定数，则广播包含所述自身剩余能量值的请求消息。
  12. 根据权利要求8所述的节点，其特征在于，在所述广播包含所述自身剩余能量值的请求消息之后，所述处理器还用于：
    判断自身是否为广播过所述请求消息的簇内节点中剩余能量最高或与汇聚节点距离最近的节点，若是，则广播自身作为新簇首节点的通知消息。
  13. 根据权利要求12所述的节点，其特征在于，所述处理器还用于：
    当作为新簇首节点时，接收所在簇的其他普通节点发送的数据；
    以第一发射功率向所述其他普通节点反馈回应消息，并以第二发射功率将所述数据通过邻居簇首节点转发至汇聚节点，其中，所述第一发射功率小于所述第二发射功率。
  14. 根据权利要求8所述的节点，其特征在于，当所述普通节点与所述传感网络中的汇聚节点间的距离在第一距离范围内时，所在簇为边长为第一长度的正方形；当所述普通节点与所述汇聚节点间的距离在第一距离范围外时，所在簇为边长为第二长度的正方形；
    其中，所述第一长度小于第二长度。
  15. 一种分布式网络系统，其特征在于，包括汇聚节点和多个普通节点，所述多个普通节点被划分为至少一个簇，所述簇中的至少一个普通节点包括至少一个簇首节点和簇成员节点，其中，
    所述簇成员节点用于将需上传的数据发送至簇首节点；
    所述簇首节点用于将所述数据转发至邻居簇首节点以上传至所述汇聚节点或直接将所述数据转发至所述汇聚节点；
    其中，所述普通节点还为上述权利要求8所述的节点。
PCT/CN2016/108156 2016-11-30 2016-11-30 分布式网络的消息广播方法、节点及系统 WO2018098756A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108156 WO2018098756A1 (zh) 2016-11-30 2016-11-30 分布式网络的消息广播方法、节点及系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108156 WO2018098756A1 (zh) 2016-11-30 2016-11-30 分布式网络的消息广播方法、节点及系统

Publications (1)

Publication Number Publication Date
WO2018098756A1 true WO2018098756A1 (zh) 2018-06-07

Family

ID=62241578

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/108156 WO2018098756A1 (zh) 2016-11-30 2016-11-30 分布式网络的消息广播方法、节点及系统

Country Status (1)

Country Link
WO (1) WO2018098756A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110381560A (zh) * 2019-07-30 2019-10-25 广东电网有限责任公司 适用于电力现场的无线传感器网络通信方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101801113A (zh) * 2009-02-05 2010-08-11 华为技术有限公司 网络拓扑分簇处理方法和处理系统
CN102572991A (zh) * 2010-12-31 2012-07-11 中国人民解放军总参谋部第六十一研究所 一种基于信任控制的低功耗传输方法
CN103052130A (zh) * 2012-11-20 2013-04-17 南京邮电大学 一种基于粗糙集的无线多媒体传感器网络数据融合方法
KR101560523B1 (ko) * 2015-02-17 2015-10-15 성균관대학교산학협력단 에너지 효율성을 고려한 무선센서 네트워크 운영방법

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101801113A (zh) * 2009-02-05 2010-08-11 华为技术有限公司 网络拓扑分簇处理方法和处理系统
CN102572991A (zh) * 2010-12-31 2012-07-11 中国人民解放军总参谋部第六十一研究所 一种基于信任控制的低功耗传输方法
CN103052130A (zh) * 2012-11-20 2013-04-17 南京邮电大学 一种基于粗糙集的无线多媒体传感器网络数据融合方法
KR101560523B1 (ko) * 2015-02-17 2015-10-15 성균관대학교산학협력단 에너지 효율성을 고려한 무선센서 네트워크 운영방법

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110381560A (zh) * 2019-07-30 2019-10-25 广东电网有限责任公司 适用于电力现场的无线传感器网络通信方法

Similar Documents

Publication Publication Date Title
WO2018098759A1 (zh) 分布式网络的簇首选取方法、节点及系统
WO2018098737A1 (zh) 分布式网络的簇首选取方法、节点及系统
WO2018098753A1 (zh) 分布式网络的管理方法、节点及系统
CN108600942B (zh) 一种无人机自组网的路由方法
WO2018098750A1 (zh) 分布式网络的消息传输方法及节点
TWI398182B (zh) 應用於無線感測器網路之多跳路由演算法
WO2018098745A1 (zh) 分布式网络的通信方法、节点及系统
WO2018098755A1 (zh) 分布式网络的簇首选取方法、节点及系统
Martirosyan et al. A taxonomy of cluster-based routing protocols for wireless sensor networks
US20130279410A1 (en) Communicating Data in a Mesh Network
WO2016188116A1 (zh) 一种车载自组网中基于信任度检测的安全路由协议
CN108770036B (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 (zh) 分布式网络的簇首选取方法、节点及系统
Bakaraniya et al. Features of wsn and various routing techniques for wsn: a survey
CN108513331B (zh) 一种面向水中机器人的水下组网方法
Arshad et al. Energy efficient cluster head selection in mobile wireless sensor networks
Shanthy et al. A zone routing protocol incorporated with sleep scheduling for MANETs
WO2018098748A1 (zh) 分布式网络的通信方法、节点及系统
Mahajan et al. A novel chain based wireless data sensor network (ECBSN) technique
WO2018098756A1 (zh) 分布式网络的消息广播方法、节点及系统
WO2018098749A1 (zh) 分布式网络的消息广播方法及节点
Hong et al. A hybrid beaconless geographic routing for different packets in WSN
WO2018098747A1 (zh) 分布式网络的通信方法、节点及系统

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

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

Country of ref document: EP

Kind code of ref document: A1