WO2018098749A1 - Procédé de diffusion de message dans un réseau distribué et nœud - Google Patents

Procédé de diffusion de message dans un réseau distribué et nœud Download PDF

Info

Publication number
WO2018098749A1
WO2018098749A1 PCT/CN2016/108148 CN2016108148W WO2018098749A1 WO 2018098749 A1 WO2018098749 A1 WO 2018098749A1 CN 2016108148 W CN2016108148 W CN 2016108148W WO 2018098749 A1 WO2018098749 A1 WO 2018098749A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
cluster
request message
energy value
remaining energy
Prior art date
Application number
PCT/CN2016/108148
Other languages
English (en)
Chinese (zh)
Inventor
任智
赵亚楠
吕昱辉
王坤龙
王斌
Original Assignee
深圳天珑无线科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳天珑无线科技有限公司 filed Critical 深圳天珑无线科技有限公司
Priority to PCT/CN2016/108148 priority Critical patent/WO2018098749A1/fr
Publication of WO2018098749A1 publication Critical patent/WO2018098749A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • 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
    • H04W84/20—Master-slave selection or change arrangements

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a message broadcast method and a node 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 based on sensor nodes. It can acquire information of various environments or monitoring objects in the network distribution area and transmit them to users remotely. Through remote sensing telemetry, people can obtain a large amount of detailed information, thus for military and civilian use. The field has broad application prospects.
  • 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 common node determines the common node with the highest remaining energy by comparing the remaining energy of other common nodes with its residual energy. Is the cluster head node of the cluster.
  • 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 and a node of 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 first stage to detect whether a request message broadcast by another common node in the cluster is received, wherein the request message includes a remaining energy value of a node that broadcasts the request message, and is used to request that the cluster head node is elected; Determining whether the remaining energy value of the ordinary node is greater than the remaining energy value included in the request message; if yes, broadcasting a request message including its own remaining energy value to request election of the cluster head node; And the request message containing the remaining energy value of the self is not broadcasted.
  • 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 a node, and the node includes: a detecting module, configured to select The cluster stage detects whether other ordinary nodes in the cluster are received.
  • a broadcast request message where the request message includes a remaining energy value of a node that broadcasts the request message, for requesting selection of the cluster head node; and a determining module, configured to determine, when received, the common node Whether the remaining energy value is greater than the remaining energy value included in the request message; and a broadcast module, configured to: when the remaining energy value of the normal node is greater than the remaining energy value included in the request message, the broadcast includes itself a request message of the remaining energy value to request the cluster head node to be elected; when the remaining energy value of the normal node is not greater than the remaining energy value included in the request message, the remaining energy value including the self is not broadcasted Request message.
  • the present invention adopts another technical solution, and provides a distributed network node, where the node is a common node of the distributed network, including a transmitter, a receiver, a memory, and a processor, and the sending
  • the device is configured to send a message to other nodes;
  • the receiver is configured to receive messages sent by other nodes;
  • the memory is configured to store computer instructions;
  • the processor executes the computer instructions to detect the receiving in a clustering stage Whether the device receives the request message broadcast by other ordinary nodes in the cluster, wherein the request message includes a remaining energy value of the node that broadcasts the request message, and is used to request that the cluster head node is elected; if received, the Whether the residual energy value of the normal node is greater than the remaining energy value included in the request message; if yes, controlling the transmitter to broadcast a request message including its own remaining energy value to request to select the cluster head node; If not, then the transmitter is controlled not to broadcast the request cancellation containing its own remaining energy value.
  • the ordinary node first detects whether the request message of other common nodes in the cluster is received in the first stage of the cluster selection, and when received, determines whether the remaining energy value of the cluster is greater than the remaining of other common nodes in the cluster in the request message.
  • the energy value if yes, broadcasts its request message, otherwise it is determined that it is impossible to become the cluster head node of the cluster, and thus does not broadcast its request message, that is, the request message of the ordinary node with less remaining energy is limited, so the selection is reduced.
  • the transmission overhead generated by the cluster head node 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 partial 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 another embodiment of a message broadcast method of a distributed network according to the present invention.
  • FIG. 5 is a flow chart of an embodiment of a communication method of a distributed network according to the present invention.
  • FIG. 6 is a flowchart of an embodiment of a message transmission method of a distributed network according to the present invention.
  • FIGS. 7a-7d are partial schematic structural diagrams of an embodiment of a distributed network node according to the present invention.
  • FIG. 8 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 can be divided into several clusters by the participation of the aggregation node 112 and the ordinary node 111 by means of the location information of the node.
  • One (or more) nodes are selected as the cluster head node 111a among the ordinary nodes 111 located in each cluster by a certain mechanism (such as position centering, maximum remaining energy, etc.). If the information of the cluster member node needs to be collected and uploaded (refers to the direction from the ordinary node to the aggregation node), the cluster head node 111a allocates the shared channel resource to the cluster member node 111b by using a certain mechanism (such as TDMA).
  • a certain mechanism such as TDMA
  • 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 within a range of 1 hop with a default communication radius R (ie, a maximum communication radius, which can be directly represented by R), and the network message may include the address, location, and location of the aggregation node 112. Clustering strategy, etc.
  • R a default communication radius
  • the clustering policy may include the identifiers and side lengths of the clusters in the system.
  • the side lengths of the various clusters 110 to be set may be included and The location information of the cluster 110 is set correspondingly in the system.
  • the clustering strategy includes setting a cluster of squares of two sizes, wherein one cluster is 1/4 of the area of another cluster.
  • the clustering strategy includes, based on (x0, y0) of the X, Y coordinates (or latitude and longitude) of the aggregation node,
  • the length of the side formed in the area is Virtual mesh (cluster of squares) so that the area near the sink node is smaller and the cluster members are smaller to save node energy; and outside the area, the side length is The larger virtual grid, as shown in Figure 2. Since the clusters close to the aggregation node include fewer nodes, the cluster head node reduces the message management burden on the cluster member nodes in the cluster, thereby reducing the data overhead in the cluster, saving the energy consumed in the cluster, and balancing the cluster head.
  • the node forwards other cluster messages to the energy consumed outside the cluster of the aggregation node, thus avoiding the excessive consumption of its node energy.
  • the division of the area is not limited to two levels, and may also be three levels or more, wherein the cluster size that can be set to be closer to the level region of the aggregation node is smaller, and of course, the cluster size in different level regions.
  • the setting can be adjusted according to the actual situation.
  • the clusters in this embodiment are square, and in other embodiments, they may be approximately square, or rectangular or other polygons, which is not limited herein.
  • the networking message may not include a clustering policy, and the ordinary node directly determines the size and scale of each cluster according to its own communication radius and inter-cluster connectivity.
  • the networking message may further include selecting a duration of the cluster initial stage.
  • the first stage of the selection cluster will continue for a period of time for the nodes in the cluster to boot or recommend other nodes as the cluster head node.
  • the duration can be preset according to conditions and requirements, for example, the default time value can be set 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. For example, when the distance between the common node 111 and the sink node 12 is within the first distance range, 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 When the outer layer is located, 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 cluster node may determine whether the cluster is located in the cluster. The cluster member node selects the cluster to join based on the distance from the cluster head node. That is, after the cluster head node is determined, the cluster member node re-determines its cluster.
  • the normal node 111 may establish a neighbor node table to record the address information of the previous hop node carried in the network message, and may also record the hop node in the network message.
  • the address of other nodes that is, all nodes that have forwarded the network message
  • the common node 111 can also establish a routing table to establish a routing entry to the aggregation node 112 in the table (for example, the destination node of the entry is the aggregation node 112, and the next hop node is the node of the broadcast networking message). That is, the last hop node).
  • the network message 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. Further, if the system 100 compares the remaining energy based on different nodes, the first sub-phase of the selected cluster may also be referred to as the first sub-stage of the competition cluster. Specifically, after the broadcast networking message, the ordinary node 111 needs to compete. As the cluster head node, a request message (also referred to as a contention cluster head message) including a self address and a current residual energy value is generated, and the request message is used to request the cluster head node of the cluster in which the broadcast node is elected.
  • a request message also referred to as a contention cluster head message
  • the normal node 111 then broadcasts the request message.
  • the cluster of the system is divided into different sizes according to the distance from the sink node, as shown in FIG. 2, it is determined whether the coordinates of the system are located. In the area; if it is, you can adjust the transmit power to make your communication range smaller Then perform the operation of the subsequent broadcast request message; if not, the transmit power can be adjusted to reduce the communication range of the user to The subsequent operation of the broadcast request message is performed.
  • the cluster head node can be selected by a single node
  • the sub-phase may not be included.
  • the new cluster head needs to be re-selected. Node, at this time, a node in the cluster directly determines the cluster head node of the new cycle according to the previous cycle condition, without going through the selection of the cluster first 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 second embodiment and the third embodiment) is compared by comparing itself Whether the remaining energy value meets the set energy condition, for example, determining whether the remaining energy value of itself is greater than the remaining energy value in the request message broadcasted by the intra-cluster node received during the first sub-phase of the selected cluster; if not, determining other common nodes Selecting the cluster head node of the cluster; if yes, determining that the remaining energy in the cluster is the largest, that is, the normal node has elected the cluster head node of the cluster, and generates a cluster head notification message, where the message includes the address of the common node 111 and The identifier of the cluster is broadcasted in a range of one hop, so that other nodes in the cluster receiving the message determine that the common node 111 is the cluster head node of the cluster 110 according to the identifier of
  • the other common node 111 that receives the cluster header notification message extracts information such as the node address and the cluster identifier carried by the message, and can compare the cluster identifier with the identifier of the cluster in which the cluster identifier is saved. Whether it is consistent, to determine whether it belongs to the cluster, and if so, save 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, determine whether it is the cluster head node, if , the address information of the cluster head node is saved as the address of the cluster head node of the neighbor cluster, otherwise it is not saved.
  • 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 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.
  • a neighbor cluster is another cluster that includes its neighbor nodes.
  • 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 expressed His ordinary node is the same node that is specifically referred to, of course, except for some steps that can be clearly understood as a series of actions performed by the same other common nodes (such as S308 below).
  • FIG. 3 is a flowchart of an embodiment of a message broadcast method of a distributed network according to the present invention.
  • the distributed network may be as shown in FIG. 1.
  • the distributed network selects a cluster head node based on the remaining energy value of the node, and the message broadcast method may be performed by the ordinary node 111 shown in FIG.
  • Execution which is used to determine whether the ordinary node broadcasts a message requesting the election of the cluster head node, and the method includes the following steps:
  • S301 The common 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, S302 is performed, and if not, S303 is performed.
  • the distributed network After the distributed network is broadcasted, the distributed network enters the first stage of the selected cluster.
  • the normal node can request the cluster head node as the cluster.
  • the ordinary node requests the cluster head node of the cluster to be elected by sending a request message including the node address and its current remaining energy value, and the time point of the ordinary node broadcasting the request message is not synchronized, that is, the difference in the network.
  • broadcast request messages are successively transmitted between ordinary nodes.
  • the distributed network uses the intra-cluster node with the largest remaining energy as its cluster head node, and the ordinary node first detects whether to receive the request message of the other intra-cluster node before broadcasting the above request, and receives the other intra-cluster node.
  • the residual energy value is compared to its own residual energy value to determine if it is capable of competing for the cluster head node.
  • the ordinary node may first extract information such as a node address and a residual energy value carried in the request message; and then, query the neighbor node table to determine whether the node is in the same state as itself. In one cluster, if so, the following S302 is executed.
  • 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).
  • S302 Determine whether the remaining energy value of the common node is greater than the remaining energy value included in the request message.
  • the ordinary node can detect its own residual energy value, which can be the remaining power value.
  • the normal node After receiving the request message of other common nodes, the normal node first determines whether the other common node that sends the request message is an intra-cluster node. For example, the common node locally stores the addresses of all the common nodes in the cluster (the address can be determined according to the information in the networking message, or after the distributed network is clustered, the nodes broadcast each other), and the common node judges Whether the node address in the request message belongs to the node address of the cluster, and if so, determining that the other common node is a node within the cluster; and, for example, the request message further includes a cluster of the node that broadcasts the request message.
  • the identifier indicates that the common node determines whether the cluster identifier in the request message is consistent with the cluster identifier of the local storage, and if yes, determines that the other common node is a cluster node.
  • the other common node that broadcasts the request message After determining that the other common node that broadcasts the request message is an intra-cluster node, it acquires its current residual energy value, and determines whether its current residual energy value is greater than the remaining energy value of the node in the request message, if , then execute S303, otherwise execute S304.
  • S303 Broadcast a request message including its own remaining energy value to request that the cluster head node be elected.
  • the normal node determines that its residual energy is greater than the remaining energy values of other common nodes in the currently received cluster, it determines that it has the qualification of the competing cluster head node, and generates a request containing its own current remaining energy value. Message.
  • the method of the present embodiment is also performed to determine whether to broadcast its request message when broadcasting its request message. If other ordinary nodes in the cluster receive the request message after broadcasting the request message, the remaining energy value in the request message may be saved to compare the remaining energy value with the received after the cluster beginning phase is selected. The remaining energy value in the request message, and whether it can be used as the cluster head node according to the comparison result, of course, it is also possible to directly determine that it has no qualification for the first node of the competition cluster.
  • S304 The request message including the remaining energy value of the self is not broadcasted.
  • the normal node determines that its residual energy is not greater than the remaining energy value of other common nodes in the currently received cluster, it determines that it does not have the qualification of the competing cluster head node (the other common nodes that broadcast the request message) The remaining energy is higher than the ordinary node, so the ordinary node cannot become the cluster head node), and the ordinary node does not broadcast its request message in the first stage of the selection cluster.
  • the ordinary node since the normal node has determined that it does not have the qualification to compete for the cluster head node, the ordinary node does not need to save the remaining energy value in the request message even after receiving the request message sent by other ordinary nodes after S304, and thus does not need to After the end of the clustering phase is selected, the residual energy value is used to determine whether it is a cluster head node.
  • the normal node may also perform the following steps:
  • S305 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, execute S306, and if yes, execute S307.
  • S306 Determine the cluster head node as the cluster, and pass the message to all other common nodes of the cluster.
  • the remaining energy value of the intra-cluster node that is broadcast earlier than the normal node is lower than the normal node, and after the ordinary node broadcasts its request message, no new one is received.
  • the request message of the intra-cluster node indicates that the intra-cluster node broadcasted later than the normal node performs the method of the embodiment to determine that the remaining energy value is lower than the remaining energy value of the ordinary node, so the request message is not broadcasted, so in this case,
  • the normal node can determine that it can be the cluster head node of the cluster, and can broadcast a notification message including its node address and the identity of the cluster in a hop range to notify all other common nodes in the cluster that the common node is located.
  • the cluster head node of the cluster can be the cluster head node of the cluster.
  • S307 directly determine that the common node is not the cluster head node of the cluster.
  • the ordinary node Since the ordinary node receives the request message of the intra-cluster node of the late broadcast, that is, the remaining energy value of the intra-cluster node of the late broadcast is higher than the common node, the ordinary node does not process the newly received request message, and directly determines the The normal node is not the cluster head node of the cluster in which it is located.
  • S308 When receiving a notification message sent by another common node to determine that the other common node is the cluster head node, obtain an address of the other common node in the notification message, and save the cluster head node address as the cluster. .
  • the normal node receives the notification message sent by the cluster head node of the neighbor cluster, and the notification message includes the address of the neighbor cluster node and the identifier of the cluster in which the cluster is located.
  • the ordinary node saves the node address and the cluster identifier in the message as the routing information of the neighbor node of the neighbor cluster.
  • the normal node receives the notification message broadcasted by other common nodes in the cluster as the cluster head node in the above manner, and the notification message includes the addresses of other common nodes in the cluster and the identifier of the cluster in which the cluster is located.
  • the normal node saves at least the node address in the message as the cluster head node information of the cluster in which it resides.
  • the common node in this embodiment first detects whether the request message of other common nodes in the cluster is received in the cluster initial stage, and Upon receiving, it is determined whether its own residual energy value is greater than the remaining energy value of other common nodes in the cluster in the request message, and if so, broadcasts its request message, otherwise it is determined that it cannot become the cluster head node of the cluster, and thus does not broadcast
  • the request message that is, the request message of the ordinary node with less residual energy is limited, so the transmission overhead generated by selecting the cluster head node is reduced, and the energy of the node is also saved.
  • FIG. 4 is a flowchart of still another embodiment of a message broadcast method of a distributed network according to the present invention.
  • the distributed network may be as shown in FIG. 1.
  • the distributed network selects a cluster head node based on the remaining energy value of the node, and the message broadcast method may start from the common node 111 shown in FIG. Execution, which 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 S402, otherwise executing S403.
  • the ordinary node can request the cluster head node as the cluster. Specifically, the ordinary node requests the cluster head node of the cluster to be elected by sending a request message including the node address and its current remaining energy value.
  • the normal node starts executing the method after entering the first stage of selecting the cluster to determine when to broadcast its request message.
  • the distributed network uses the intra-cluster node with the largest remaining energy as its cluster head node, and the common node determines the time of the broadcast request message by using the principle of priority broadcast with larger residual 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. For example, after entering the first stage of the selected cluster, the residual energy value included in the request message broadcasted by the node of the cluster head in the previous cycle of each common node in the previous period is the upper limit (the first period is the initial initial of the node) The energy value) takes 0 as the lower limit value (excluding 0), and randomly takes a value as the set threshold value in the interval with the probability of uniform distribution. Then, the above determination is performed using the set threshold.
  • 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 setting of the fixed value may be determined according to a majority of node energy states or average node energy values of the network.
  • the ordinary node after determining that the residual energy value of the cluster is less than the set threshold, the ordinary node further performs: if in the first set time If the request message sent by another ordinary node is not received, the set threshold is adjusted, and the above determination whether the remaining energy value is less than the set threshold is re-executed.
  • the first set time may be set according to actual requirements, and the embodiment may be set to be smaller than the delay time in S402. Therefore, the ordinary node can timely discover that all nodes in the cluster are delayed in transmission, and then re-adjust whether it delays the broadcast threshold and re-determine whether to delay the broadcast.
  • the set threshold is the random value
  • the random value may be re-executed, and if the set threshold is a fixed value, the step size may be reduced.
  • S402 Delay transmitting a request message including the self-remaining energy value.
  • the residual energy value of the node itself is less than the set threshold, it is considered that the node is less likely to be the cluster head node, so the request message is delayed to be broadcast.
  • the delay time can be set to a certain value, for example, half of the networking time, and can also be adjusted according to the remaining energy value of the node. For example, the delay time is set to multiple levels such as 5s, 10s, 15s, if the node currently has remaining energy. If the value is less than 30% of the set threshold, the delay is 15s; if the current remaining energy value of the node is 20%-30% smaller than the set threshold, the delay is 10s; the current residual energy value of the node is less than 20% less than the set threshold. Then delay 5s.
  • the delay time can be calculated by directly calculating the residual energy value into the preset time algorithm, and thus is not limited herein.
  • the first cluster of the cluster in the cluster is in the previous period.
  • the value of the value of the evenly distributed probability is randomly selected.
  • the foregoing S402 may further include the following sub-steps:
  • S4021 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 ordinary 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 instant broadcast includes the self-remaining energy value.
  • Request message otherwise delaying the broadcast of the request message containing the self-remaining energy value.
  • 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 lower state, and may all delay the broadcast after performing the method of the embodiment. In order to prevent the neighbor nodes from delaying the broadcast, the messages of all the neighbor nodes are still sent simultaneously after the delay, and the ordinary node performs the following S403 to broadcast the request message immediately.
  • 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 can be considered that there is less possibility that the neighbor node has all delayed broadcasts, so the broadcast is delayed at this time.
  • S403 Instantly broadcast a request message including the self-remaining energy value.
  • the instant performs the S403 in the next step according to the normal working frequency after performing the judgment of S401 without any delay.
  • the normal node performs the foregoing request message in the foregoing S402 and S403 to include the self-remaining energy value, and specifically includes the method step of the second embodiment, to first determine whether the request message needs to be broadcasted, and then according to the determination result. Broadcast or not broadcast its request message. In this embodiment, the normal node determines whether it is a cluster head node. See also the related description of the second embodiment.
  • the normal node may also perform the method of determining whether to broadcast the request message in the method of the embodiment, that is, all the nodes broadcast the request message, and only the broadcast time is different.
  • the ordinary node after performing the foregoing S401-S403, the ordinary node further performs the following steps to determine whether it is a cluster head node, and specifically: the ordinary node determines whether the remaining energy value of the self is greater than the second setting. The remaining energy value in the request message sent by all other ordinary nodes is received in the interval; if so, it is determined that it is the cluster head node of the cluster, and the message is passed to other sensor nodes of the cluster.
  • the second set time may be set according to actual requirements, and the embodiment may be set to be smaller than the delay time described in S402.
  • the method can at least averagely broadcast the normal node with large residual energy earlier than the ordinary node with small remaining energy to broadcast its node, so the ordinary node will receive the request within the second preset time after executing the above S401.
  • the remaining energy values in the message are compared above, and after comparison, the remaining energy of the ordinary node can be considered to be at least greater than the remaining energy of most other common nodes in the cluster, because it can be determined as the cluster head node, and the message is passed.
  • the steps after the cluster head node may be referred to the related description of the second embodiment, and are not described herein.
  • the ordinary node determines whether the remaining energy value is less than the set threshold, and if it is less than, delays broadcasting the request message for campaigning for the cluster head, otherwise the request message is broadcasted instantaneously, and in this way, the distributed network is made.
  • the ordinary nodes are broadcast separately to avoid congestion of the communication channel.
  • the ordinary node may also perform the method of the second embodiment to determine whether to broadcast, and determine whether it is necessary to send according to the delay time. Since the ordinary node with smaller residual energy is broadcasted at least on average at least on average, the common node with smaller residual energy can be determined according to the method of the second embodiment, and then it is determined that broadcast is not required, so it can be reduced. Broadcasting the number of nodes of the request message, thereby reducing the control overhead, that is, reducing the transmission overhead of the selected cluster head node, and saving the node energy.
  • FIG. 5 is a flowchart of an embodiment of a communication method of a distributed network according to the present invention.
  • the distributed network may be as shown in FIG. 1.
  • the communication method may be performed by the cluster head node 111a shown in FIG. 1 during the data transmission phase, and is used to adjust the communication range according to intra-cluster and inter-cluster transmission.
  • the method includes the following steps:
  • the cluster head node determines whether the node to be communicated with is a node in the cluster or a node outside the cluster.
  • the S501 may specifically include: determining whether the node address to be communicated belongs to the node address of the cluster; if it belongs, determining the node in the cluster, otherwise determining the node outside the cluster.
  • S502 If it is an intra-cluster node, communicate with the intra-cluster node with the first transmit power.
  • the S502 may specifically include: sending a response message to the intra-cluster node by using the first transmit power, where the response message is used to indicate that the data sent by the intra-cluster node has been received.
  • S503 If it is an out-of-cluster node, communicate with the out-of-cluster node with a second transmit power, where the first transmit power (also referred to as intra-cluster transmit power) is smaller than the second transmit power (also referred to as an out-of-cluster) Transmit power).
  • the first transmit power also referred to as intra-cluster transmit power
  • the second transmit power also referred to as an out-of-cluster
  • the S502 may specifically include: sending, by using the second transmit power, the neighboring cluster head node. Data, wherein the data includes its own data and/or data sent by cluster member nodes of the cluster.
  • a cluster head node receives sensor data sent by its cluster member node, and when the cluster head node needs to reply a response message (such as an ACK frame), the destination node of the response message is a cluster member node.
  • a response message such as an ACK frame
  • the transmit power can be adjusted to the first transmit power through the cross-layer operation of the network layer/MAC sublayer-physical layer to adjust the communication range to
  • the cluster head node receives a message sent by a neighbor cluster head node, and the target node of the message is a sink node, that is, the cluster head node selects another neighbor cluster head node that can lead to the sink node, and can pass through the network layer/
  • the MAC sublayer-physical layer cross-layer operation adjusts the transmit power to the second transmit power to adjust the communication range to R, and the message is used to forward the message to the selected neighbor cluster head node.
  • the distributed network may divide the two size clusters according to the distance from the sink node, such as when the distance between the cluster head node and the sink node is within the first distance range, where the cluster is edge Length is the first length as a square; when the distance between the cluster head node and the sink node is outside the first distance range, the cluster is the side length of the second length Square.
  • the communication range of the second transmit power may be set to R, and when the length of the cluster side is the first length, the communication range of the first transmit power may be set to When the length of the cluster side is the second length, the communication range of the first transmit power can be set to
  • the cluster head node when the cluster head node communicates with a node, it first determines whether the node is an intra-cluster node or an extra-cluster node, and communicates with the first transmit power when it is a intra-cluster node, and is an out-of-cluster node.
  • the second transmit power is communicated with it, the adaptive adjustment of the communication range is realized. Since the distance between the nodes outside the cluster is often larger than the nodes in the cluster, the intra-cluster communication is performed with less power, which can ensure that any node in the cluster can be guaranteed.
  • the communication can reduce the interference to the neighbor clusters; the intra-cluster communication is carried out with larger power to ensure the success of the inter-cluster communication, that is, the inter-cluster interference is reduced under the premise of ensuring the success of communication within the cluster and between the clusters. And save the energy of the cluster head node.
  • FIG. 6 is a flowchart of an embodiment of a message transmission method of a distributed network according to the present invention.
  • the distributed network may be as shown in FIG. 1.
  • the message transmission method may be performed by the ordinary node 111 shown in FIG. 1 during the clustering phase and the data transmission phase, and is used for the normal node based on data transmission.
  • the node location implements routing, and the method includes the following steps:
  • S601 The ordinary node receives the networking message sent by the first neighbor normal node.
  • the ordinary node receives the first neighbor sent by the ordinary node.
  • Networking messages The networking message is derived from the aggregation node of the distributed network, and may be specifically described in the first embodiment.
  • the networking message further includes location information of the first neighbor common node. The location information may specifically include a distance between the first neighbor normal node and the sink node that sends the network message.
  • S602 Acquire and save location information of the first neighbor common node from the networking message.
  • the networking message further includes address and location information of the first neighbor common node.
  • the common node obtains and stores the location information and the address of the first neighbor common node from the networking message, and establishes a correspondence between the location information and the address of the first neighbor common node.
  • a plurality of first neighboring ordinary nodes may send a networking message to the ordinary node, so the ordinary node saves the location information of the multiple first neighbor common nodes.
  • the neighbor routing table can be established, and the address and location information of each first neighbor common node are recorded in the table.
  • 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.
  • the method may further include: receiving, by the ordinary node, a notification message sent by the second neighboring ordinary node to notify the cluster head node, where the notification message includes an address of the second neighbor common node.
  • the notification message includes an address of the second neighbor common node.
  • This step is performed in the cluster head advertisement phase, and the second neighbor normal node may be multiple.
  • the ordinary node only saves the location information of the neighboring cluster head node, and deletes the previously saved location information of the neighbor node that is not the cluster head node, which reduces the occupation of the storage space and reduces the search location information. The complexity.
  • the first neighboring ordinary node and the second neighboring ordinary node are all represented as neighboring ordinary nodes of the node performing the method, and the first neighboring ordinary node and the second neighboring ordinary node may be the same or different nodes.
  • S603 When sending a message to the sink node as a cluster head node, select a neighbor cluster head node that has the shortest distance from the sink node according to the saved location information.
  • the S603 corresponding may include: searching for location information of all neighbor cluster head nodes according to the established correspondence relationship and addresses of all neighbor cluster head nodes; and comparing location information of all neighbor cluster head nodes, comparing The distance between all neighbor cluster head nodes and the sink node is obtained to obtain a neighbor cluster head node that has the shortest distance from the sink node.
  • the normal node acts as a cluster head node and needs to send a message to the sink node, such as uploading data sent by other common nodes of the cluster to the aggregation.
  • the common node obtains the neighbor routing table saved in the networking phase, and finds the location message of the neighboring cluster head node in the table, where the neighbor routing table contains the location information of the neighbor node of the non-cluster head node.
  • the location information of the node in the neighbor routing table whose address is consistent with the address of the neighbor node of the neighboring cluster recorded in the neighbor routing table may be obtained according to the address of the neighboring cluster head node recorded when the neighboring cluster head node broadcasts the notification in the cluster heading stage.
  • the obtained at least one neighbor cluster head node location information is compared to obtain a neighbor cluster head node in which the distance from the sink node is the shortest.
  • S604 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 neighboring cluster head node communication closest to the sink node, the normal node sends the message to the selected neighbor cluster head node with the above-mentioned out-of-cluster transmit power. 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 node adds its location information to the networking message.
  • the ordinary node saves the location information of the neighboring ordinary node in the networking message, and then sends the message to the aggregation node.
  • the aggregation node uses the saved location information to determine the neighbor cluster head node closest to the sink node, to forward the message to the sink node by using the neighbor cluster head node closest to the sink node, thereby reducing the time and overhead of data transmission to the sink node.
  • the foregoing routing mode 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 node may be a common node or a cluster head node as shown in FIG. 1.
  • the node includes a detection module 701, a first determination module 702, and a first broadcast module 703.
  • the detecting module 701 is configured to detect, in the selecting a cluster stage, whether a request message broadcast by another common node in the cluster is received, where the request message includes a remaining energy value of a node that broadcasts the request message, and is used to request that the cluster be elected. The first node.
  • the first determining module 702 is configured to determine, when received, whether the remaining energy value of the common node is greater than the remaining energy value included in the request message.
  • the first broadcast module 703 is configured to: when the remaining energy value of the common node is greater than the remaining energy value included in the request message, broadcast a request message including a self-remaining energy value to request to select the cluster head node; When the remaining energy value of the normal node is not greater than the remaining energy value included in the request message, the request message including its own remaining energy value is not broadcasted.
  • the node further includes a second determining module 704 and a second broadcast module 705.
  • Second judgment The breaking module 704 is configured to determine whether the residual energy value of the self is less than a set threshold in the first stage of selecting the cluster; the second broadcast module 705 is configured to delay the broadcast of the request including the self-remaining energy value when the residual energy value thereof is less than the set threshold a message; when the remaining energy value is not less than a set threshold, the request message including the self-remaining energy value is broadcasted in real time; wherein the request message is used to request that the cluster head node be elected.
  • the node is a cluster head node, and further includes a third determining module 706, a first communications module 707, and a second communications module 708.
  • the third determining module 706 is configured to determine whether the node that needs to communicate with the node is an intra-cluster node or an extra-cluster node;
  • the first communication module 707 is configured to communicate with the intra-cluster node with the first transmit power when the node that needs to communicate with the node is an intra-cluster node;
  • the second communication module 708 is configured to communicate with the out-of-cluster node with a second transmit power when the node that needs to communicate with the cluster is an out-of-cluster node;
  • the first transmit power is less than the second transmit power.
  • the node further includes a receiving module 709, a saving module 710, a selecting module 711, and a forwarding module 712.
  • the receiving module 709 is configured to receive the networking message sent by the first neighboring ordinary node, where the networking message is derived from the aggregation node of the distributed network, and includes the location information of the first neighbor common node; the saving module 710 is used by the receiving module 710.
  • the selecting module 711 is configured to: when sending the message to the sink node as the cluster head node, select, according to the saved location information, a neighbor cluster head node that has the shortest distance from the sink node; the forwarding module 712 is configured to send the message to the selected neighbor cluster head node to forward the message to the selected neighbor cluster head node Said aggregation node.
  • 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.
  • the node can include some of the above modules as needed.
  • the node may include only the detection module 701, the first determination module 702 and the first broadcast module 703, the second determination module 704 and the second broadcast module 705, the third determination module 706, the first communication module 707, and the second communication.
  • the module 708 is a receiving module 709, a saving module 710, a selecting module 711, and a forwarding module 712.
  • the node includes the above plurality of modules, wherein the combination of each group of modules can refer to the sequence of the above method steps.
  • FIG. 8 is a schematic structural diagram of another embodiment of a distributed network node according to the present invention.
  • the node is a normal node or a cluster head node as shown in FIG. 1, and the node can perform the steps in the above method.
  • the node can perform the steps in the above method.
  • the node 80 includes a transmitter 81, a receiver 82, one or more processors 83, a memory 84, and a bus 85.
  • the transmitter 81 is configured to send messages to other nodes in the distributed network, such as collected sensor data, networking messages, and the like.
  • the receiver 82 is configured to receive messages sent by other nodes in the distributed network, such as the collected sensor data, networking messages, etc.
  • the memory 84 includes a read only memory and a random access memory. A portion of memory 84 may also include non-volatile random access memory (NVRAM).
  • the processor 83 may also be referred to as a CPU (Central Processing Unit).
  • the bus 85 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 85 in the figure.
  • node 80 further includes a plurality of applications and one or more programs, said plurality of applications and one or more programs being stored in memory 84 and configured to be executed by said processor 83.
  • the one or more programs include instructions.
  • the processor 83 performs the following operations by invoking instructions in the one or more programs stored by the memory 84:
  • the normal node broadcasts the message requesting the election of the cluster head node, specifically: detecting, in the first stage of selecting the cluster, whether to receive the request message broadcast by other common nodes in the cluster, wherein the request message includes broadcasting the request message a residual energy value of the node, configured to request the cluster head node to be elected; if received, determining whether the remaining energy value of the normal node is greater than the remaining energy value included in the request message; if yes, the broadcast includes a request message of its own residual energy value to request the election of the cluster head node; if not, the request message containing its own remaining energy value is not broadcasted.
  • the communication range is adjusted according to the intra-cluster and inter-cluster transmission, and specifically includes: determining whether the node to be communicated with is a cluster node or a cluster node; if it is a cluster node, Communicating with the intra-cluster node with a first transmit power; if it is an out-of-cluster node, communicating with the out-of-cluster node with a second transmit power; wherein the first transmit power is less than the second transmit power.
  • the routing is performed based on the node location when the common node is in the data transmission, and the method includes: receiving the networking message sent by the first neighboring ordinary node, where the networking message is derived from the distributed a convergence node of the network, including location information of the first neighbor normal node; acquiring and storing location information of the first neighbor common node from the networking message; sending a message to the aggregation node as a cluster head node And selecting, according to the saved location information, a neighbor cluster head node that has the shortest distance from the sink node; sending the message to the selected neighbor cluster head node to pass the selected neighbor cluster head node Forwarding the message to the sink node.
  • each step performed by the foregoing processor may be the corresponding step in the foregoing method embodiment, and therefore, the steps are not described herein. For details, refer to the description of the corresponding steps.
  • the processor 83 can perform the above four aspects as needed.
  • the processor 83 performs only one or more of the aspects described above.
  • the combination of the multiple aspects may refer to the sequence of the above method steps.
  • the first, second and fourth aspects of the above solution make the control overhead smaller and the routing efficiency higher from the following two aspects:
  • the routing information in the networking message is directly used to implement routing, and no additional control message and control information need to be sent, thereby reducing control overhead and improving routing efficiency, and adopting
  • the sink node forwards the shortest neighbor cluster head node to minimize the transmission path.
  • the third aspect of the above solution enables the cluster head node to use a relatively smaller communication range when communicating with the nodes in the cluster, and the transmission power and power consumption are reduced, thereby saving the energy of the cluster head node.
  • the first, second, and fourth aspects of the above solution reduce the transmission and reception of control messages, and can also save node energy and prolong the life of nodes and networks.
  • the third aspect of the above solution enables the cluster head node to use a relatively smaller communication range when communicating with the intra-cluster node, thereby reducing the interference of the wireless signal to the neighbor cluster, making the communication relatively more reliable, and facilitating the data packet transmission success rate. improve.

Landscapes

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

Abstract

L'invention concerne un procédé de diffusion de message dans un réseau distribué et un nœud. Le procédé comprend les étapes suivantes : un nœud ordinaire détecte, pendant une période de sélection de tête de grappe, si un message de demande diffusé par un autre nœud ordinaire dans une grappe est reçu ou non, le message de demande comprenant une valeur d'énergie résiduelle d'un nœud diffusant le message de demande pour demander à être sélectionné en tant que nœud de tête de grappe; dans l'affirmative, determination du fait de savoir si la valeur d'énergie résiduelle du nœud ordinaire est supérieure ou non à la valeur d'énergie résiduelle comprise dans le message de demande; dans l'affirmative, diffusion du message de demande comprenant sa propre valeur d'énergie résiduelle pour demander à être sélectionné en tant que nœud de tête de grappe; à défaut, non diffusion du message de demande comprenant la valeur d'énergie résiduelle propre. Le procédé selon l'invention permet de réduire le surdébit de transmission généré par la sélection d'un nœud de tête de grappe.
PCT/CN2016/108148 2016-11-30 2016-11-30 Procédé de diffusion de message dans un réseau distribué et nœud WO2018098749A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108148 WO2018098749A1 (fr) 2016-11-30 2016-11-30 Procédé de diffusion de message dans un réseau distribué et nœud

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/108148 WO2018098749A1 (fr) 2016-11-30 2016-11-30 Procédé de diffusion de message dans un réseau distribué et nœud

Publications (1)

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

Family

ID=62241010

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/108148 WO2018098749A1 (fr) 2016-11-30 2016-11-30 Procédé de diffusion de message dans un réseau distribué et nœud

Country Status (1)

Country Link
WO (1) WO2018098749A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112055394A (zh) * 2019-06-06 2020-12-08 佛山科学技术学院 快速包含排除的无线传感器网络分簇路由方法及系统
CN116141342A (zh) * 2023-04-23 2023-05-23 福勤智能科技（昆山）有限公司 分布式机器人的信息同步与任务协作方法、装置及机器人

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100073826A (ko) * 2008-12-23 2010-07-01 주식회사 케이티 이종 센서 네트워크에서의 클러스터링 방법
CN102711180A (zh) * 2012-05-25 2012-10-03 杭州电子科技大学 一种簇头多重选择能量均衡路由方法
CN103237334A (zh) * 2013-04-12 2013-08-07 太原理工大学 一种基于巷道环境的无线传感器网络分簇路由方法
CN103298054A (zh) * 2013-06-04 2013-09-11 四川大学 一种基于节点深度的无线传感器网络分簇路由协议
CN103945484A (zh) * 2014-03-11 2014-07-23 北京农业信息技术研究中心 农田无线自组织网络拓扑密度关联路径选择优化方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100073826A (ko) * 2008-12-23 2010-07-01 주식회사 케이티 이종 센서 네트워크에서의 클러스터링 방법
CN102711180A (zh) * 2012-05-25 2012-10-03 杭州电子科技大学 一种簇头多重选择能量均衡路由方法
CN103237334A (zh) * 2013-04-12 2013-08-07 太原理工大学 一种基于巷道环境的无线传感器网络分簇路由方法
CN103298054A (zh) * 2013-06-04 2013-09-11 四川大学 一种基于节点深度的无线传感器网络分簇路由协议
CN103945484A (zh) * 2014-03-11 2014-07-23 北京农业信息技术研究中心 农田无线自组织网络拓扑密度关联路径选择优化方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112055394A (zh) * 2019-06-06 2020-12-08 佛山科学技术学院 快速包含排除的无线传感器网络分簇路由方法及系统
CN116141342A (zh) * 2023-04-23 2023-05-23 福勤智能科技（昆山）有限公司 分布式机器人的信息同步与任务协作方法、装置及机器人
CN116141342B (zh) * 2023-04-23 2023-06-30 福勤智能科技（昆山）有限公司 分布式机器人的信息同步与任务协作方法、装置及机器人

Similar Documents

Publication Publication Date Title
WO2018098750A1 (fr) Procédé de transmission de message dans un réseau distribué et nœud
Kumar et al. Location-based routing protocols for wireless sensor networks: A survey
WO2018098759A1 (fr) Procédé de sélection de tête de grappe dans un réseau distribué, nœud, et système
WO2018098737A1 (fr) Procédé de sélection de tête de grappe dans un réseau distribué, nœud et système
US9788257B2 (en) Method and system for dynamically forming service aware bluetooth low energy (BLE) mesh network
Poudel et al. Medium access control protocols for unmanned aerial vehicle-aided wireless sensor networks: A survey
WO2018098753A1 (fr) Procédé de gestion de réseau distribué, nœud et système
US9980207B2 (en) Delayed response to requesting device
CN103906207A (zh) 基于自适应按需唤醒技术的无线传感器网络数据传输方法
Bhola et al. A study on research issues and challenges in WSAN
Galluccio et al. A MAC/Routing cross-layer approach to geographic forwarding in wireless sensor networks
WO2018098748A1 (fr) Procédé de communication dans un réseau distribué, nœud et système
WO2018098755A1 (fr) Procédé de sélection de tête de grappe pour réseau distribué, nœud et système
WO2018098745A1 (fr) Procédé de communication dans un réseau distribué, nœud, et système
Sengul et al. A survey of adaptive services to cope with dynamics in wireless self-organizing networks
Bernard et al. Slot scheduling for wireless sensor networks
WO2018098749A1 (fr) Procédé de diffusion de message dans un réseau distribué et nœud
WO2018098752A1 (fr) Procédé de diffusion de message pour réseau distribué, et nœud
WO2018098754A1 (fr) Procédé de sélection de tête de grappe pour réseau distribué, nœud et système
Ali et al. Real-time support and energy efficiency in wireless sensor networks
Hong et al. A hybrid beaconless geographic routing for different packets in WSN
Cheng et al. Contention‐based geographic forwarding in asynchronous duty‐cycled wireless sensor networks
CN112867169A (zh) 一种综合管廊异构网络自组网通信方法及其系统
US20150029916A1 (en) Power Saving for Multi-Hop Communications
Soni et al. An investigation on energy efficient routing protocol for wireless sensor network

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

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

Country of ref document: EP

Kind code of ref document: A1