WO2022121234A1

WO2022121234A1 - Data transmission method and device, storage medium and electronic device

Info

Publication number: WO2022121234A1
Application number: PCT/CN2021/093928
Authority: WO
Inventors: 虞晓韩; 李鑫; 严军荣
Original assignee: 三维通信股份有限公司
Priority date: 2020-12-08
Filing date: 2021-05-14
Publication date: 2022-06-16
Also published as: CN112566210A; CN112566210B

Abstract

The present invention provides a data transmission method and device, a storage medium and an electronic device. Said method comprises: determining a maximum independent set in a target sensor network; determining a target node set in a first node set in the target sensor network, wherein the first node set is a set composed of nodes which do not belong to the maximum independent set in the target sensor network; determining each node in the maximum independent set and the target node set as one node in a connected dominating set corresponding to the target sensor network, to obtain the connected dominating set; according to the connected dominating set, clustering the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network; and by means of the nodes in the connected dominating set, transferring to a base station data sent by a cluster member node in at least one cluster of the plurality of clusters. The present invention solves the technical problem in the related art that when data transmission is performed in a sensor network, a node consumes much energy.

Description

Data transmission method and device, storage medium and electronic device

technical field

The present invention relates to the technical field of wireless communication, and in particular, to a data transmission method and device, a storage medium and an electronic device.

Background technique

In the related art, the wireless sensor network is clustered, and the cluster member nodes send the data to be transmitted to the corresponding cluster head node, and the cluster head node sends the data to the base station communicating with the wireless sensor network. However, since the clusters divided by the wireless sensor network are fixed, and the cluster head node is also fixed, when the cluster head node directly sends data to the base station, the cluster head node consumes more energy, thus shortening the cluster head. The transmission lifetime (aka usage time) of the node.

Aiming at the technical problem in the related art that nodes consume a lot of energy during data transmission in a sensor network, no effective technical solution has been proposed.

SUMMARY OF THE INVENTION

Embodiments of the present invention provide a data transmission method and device, a storage medium, and an electronic device to at least solve the technical problem in the related art that nodes consume more energy during data transmission in a sensor network.

According to an embodiment of the present invention, a data transmission method is provided, comprising: determining a maximum independent set in a target sensor network, wherein the maximum independent set is formed by two non-adjacent sets of the target sensor network. A set of nodes, each node in the target sensor network corresponds to a sensor one-to-one; determine a target node set in a first node set in the target sensor network, wherein the first node set is composed of all A set of nodes in the target sensor network that do not belong to the maximum independent set, each target node in the target node set conforms to a preset condition, and the preset condition is used to indicate that a target node is in the maximum independent set. There are two neighbor nodes in the independent set; each node in the maximum independent set and the target node set is determined as a node in the connected dominating set corresponding to the target sensor network, and the connected dominating set is obtained, wherein, Any two nodes in the connected domination set can communicate with each other; according to the connected domination set, the nodes in the target sensor network are clustered to obtain multiple clusters in the target sensor network, wherein, Each node in the connected domination set is a cluster head node of one of the multiple clusters; through the nodes in the connected domination set, the cluster member nodes in at least one of the multiple clusters send the The data is relayed to the base station.

According to another embodiment of the present invention, there is provided a data transmission apparatus, comprising: a processing module configured to determine a maximum independent set in a target sensor network, wherein the maximum independent set is determined by the target sensor network A set composed of two non-adjacent nodes, each node in the target sensor network corresponds to a sensor one-to-one; the processing module is further configured to determine the target in the first node set in the target sensor network A node set, wherein the first node set is a set composed of nodes in the target sensor network that do not belong to the maximum independent set, and each target node in the target node set meets a preset condition, so The preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set; the processing module is also configured to determine the maximum independent set and each node in the target node set as the maximum independent set. A node in the connected domination set corresponding to the target sensor network, to obtain the connected domination set, wherein any two nodes in the connected domination set can communicate with each other; the processing module is further configured to Dominant set, cluster the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network, wherein each node in the connected domination set is a cluster of one of the plurality of clusters A cluster head node; a transmission module, configured to relay the data sent by the cluster member nodes in at least one of the multiple clusters to the base station through the nodes in the connectivity control set.

Through the present invention, the maximum independent set in the target sensor network is determined, wherein the maximum independent set is a set composed of nodes in the target sensor network that are not adjacent to each other, each of the target sensor network One-to-one correspondence between nodes and sensors; determining a target node set in a first node set in the target sensor network, wherein the first node set is composed of nodes in the target sensor network that do not belong to the maximum independent set Each target node in the target node set conforms to a preset condition, and the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set; the maximum independent set And each node in the target node set is determined as a node in the connected domination set corresponding to the target sensor network, and the connected domination set is obtained, wherein any two nodes in the connected domination set can communicate with each other. communication; according to the connected domination set, cluster the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network, wherein each node in the connected domination set is the plurality of clusters A cluster head node of one of the clusters; through the nodes in the connectivity control set, the data sent by the cluster member nodes in at least one of the multiple clusters is forwarded to the base station. Therefore, in the related art, the technical problem that the nodes consume more energy during data transmission in the sensor network can be solved, the energy consumption of the nodes in the sensor network is reduced, and the lifespan of the nodes is prolonged.

Description of drawings

The accompanying drawings described herein are used to provide a further understanding of the present invention and constitute a part of the present application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the attached image:

1 is a flowchart of a data transmission method according to an embodiment of the present invention;

2 is a schematic diagram of a node attribute according to an embodiment of the present invention;

3 is a schematic diagram of an initial state of a target sensor network according to an embodiment of the present invention;

4 is a schematic diagram of a maximum independent set in a target sensor network according to an embodiment of the present invention;

5 is a schematic diagram of a connected dominating set in a target sensor network according to an embodiment of the present invention;

6 is a schematic diagram of a target sensor network clustering according to an embodiment of the present invention;

7 is a structural block diagram of a data transmission apparatus according to an embodiment of the present invention;

FIG. 8 is a schematic structural diagram of an optional electronic device according to an embodiment of the present invention.

Detailed ways

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings and in conjunction with embodiments. It should be noted that the embodiments in the present application and the features of the embodiments may be combined with each other in the case of no conflict.

It should be noted that the terms "first", "second" and the like in the description and claims of the present invention and the above drawings are used to distinguish similar objects, and are not necessarily used to describe a specific sequence or sequence.

First, the meanings of the technical terms involved in the embodiments of the present invention are explained as follows:

Compressive Sensing (CS): Sparse or compressible signals can be sampled in a way that is much lower than the standard of the Shannon-Nyquist sampling theorem, and it can still achieve sparse or compressible data. Accurate reconstruction of compressible signals. The following linear formula models are involved:

y=Ax,

where ^y∈Rm is the measurement vector, x∈Rn is the original data vector, A∈Rm ^×n ^is the perception matrix, and m, n are integers. The vector x is said to be k-sparse under the basis ψ (satisfying x=ψc), where the number c' of non-zero entries in the matrix c does not exceed k, k is an integer, and ψ represents a matrix, also known as the basis matrix.

In CS, the perception matrix A is usually a Gaussian random matrix, that is, each item in A is independently sampled from a Gaussian distribution N(0,1/m), where N is an integer. When m=O(k log(n)) and k<<n, the k-sparse vector x can be changed from

Calculated in , where a _ji is the (j, i)-th element in A (that is, the element in the j-th row and the i-th column), and i and j are integers. In the embodiment of the present invention, a given number of measurement values can be effectively collected from the sensor nodes, and a sufficient amount of measurement data can be collected at the collection point (including but not limited to the base station), and the original data can be reliably recovered. vector.

For a sensor network with n sensors (also called transmitters) v ₁ , v ₂ ,..., v _n , these sensors are deployed in an area with v ₁ as the sink node, sensor v ₁ can obtain a sensor with x ₁ represents the parameters, then the set of sensor parameters, that is, the data vector, is x=[x ₁ , . . . , x _n ]. In the case that all nodes in a sensor network share a common wireless channel, the distance between nodes v _i and v _j is denoted as |v _i -v _j |. In a slotted system, where the slots are of equal duration, and a node can transmit a unit-sized data packet in each slot. For the protocol interference model (PrIM): if the communication radius of the node is r (r is a natural number), if |v _i -v _j |≤r and for concurrent transmitter v _t |v _t -v _j |≥(1 +δ)r (δ>0 is a constant), then node v _i can successfully transmit data to v _j . In PrIM, if the distance between any two transmitters is ρr (ρ=2+δ), these two transmitters can transmit data at the same time, and these two transmitters are called concurrent transmitters. Construct the communication graph G=(V,E) obtained by PrIM, where V={v ₁ ,v ₂ ,...,v _n } is the set of nodes, when |v _i -v _j |≤r, there is an edge (v _i ,v _j )∈E.

The definition of the dominating set is as follows: For a given undirected graph G=(V, E), where V is the set of points and E is the set of edges, a subset S of V is called the dominating set if and only if for any of V-S A point v has a certain point u in the subset S, such that when (u, v) ∈ E, the dominant set is established.

Connected dominating set: that is, all nodes on the backbone of the dominating set are connected to each other, and any two nodes can communicate with each other. In the embodiment of the present invention, a layered and diffused selection method is used to select the dominant node, and specifically starting from the sink node, the dominant node is obtained by filtering down layer by layer until the entire wireless sensor network is traversed, so as to obtain the A set of dominating nodes is a connected dominating set.

An embodiment of the present invention provides a data transmission method. FIG. 1 is a flowchart of a data transmission method according to an embodiment of the present invention. As shown in FIG. 1 , the method includes: step S102 , determining the maximum independent set in the target sensor network , wherein the maximum independent set is a set composed of nodes in the target sensor network that are not adjacent to each other, and each node in the target sensor network corresponds to a sensor one-to-one; step S104, determine the A target node set in the first node set in the target sensor network, wherein the first node set is a set composed of nodes in the target sensor network that do not belong to the maximum independent set, and the target node set is Each target node of the target node meets a preset condition, and the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set; Step S106, put the maximum independent set and the target node set in the maximum independent set. Each node in the target sensor network is determined as a node in the connected domination set corresponding to the target sensor network, and the connected domination set is obtained, wherein any two nodes in the connected domination set can communicate with each other; Step S108, according to the the connected dominating set, clustering the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network, wherein each node in the connected dominating set is one of the plurality of clusters The cluster head node of the cluster; in step S110, the data sent by the cluster member nodes in at least one of the multiple clusters is forwarded to the base station through the nodes in the connectivity control set. Through the present invention, the maximum independent set in the target sensor network is determined, wherein the maximum independent set is a set composed of nodes in the target sensor network that are not adjacent to each other, each of the target sensor network One-to-one correspondence between nodes and sensors; determining a target node set in a first node set in the target sensor network, wherein the first node set is composed of nodes in the target sensor network that do not belong to the maximum independent set Each target node in the target node set conforms to a preset condition, and the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set; the maximum independent set And each node in the target node set is determined as a node in the connected domination set corresponding to the target sensor network, and the connected domination set is obtained, wherein any two nodes in the connected domination set can communicate with each other. communication; according to the connected domination set, cluster the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network, wherein each node in the connected domination set is the plurality of clusters A cluster head node of one of the clusters; through the nodes in the connectivity control set, the data sent by the cluster member nodes in at least one of the multiple clusters is forwarded to the base station. Therefore, in the related art, the technical problem that the nodes consume more energy during data transmission in the sensor network can be solved, the energy consumption of the nodes in the sensor network is reduced, and the lifespan of the nodes is prolonged.

Optionally, before the determining of the maximum independent set in the target sensor network, the method includes: setting the node attributes of all nodes in the target sensor network to be empty; wherein, the determining of the maximum independent set in the target sensor network The maximum independent set includes: updating the node attribute of the sink node in the target sensor network to the first attribute, and according to the node attribute of each node _sh in the target sensor network except the sink node and The notification message received by the node _sh from the neighbor nodes of the node _sh _updates the node attribute of the node sh, so as to update the node attributes of all nodes in the target sensor network to the target attribute , where h∈[1, n′], n′ is the number of nodes in the target sensor network other than the sink node, and the notification message carries the attribute of the node sending the notification message , the target attribute includes the first attribute and the second attribute, each node with the first attribute is determined as a node in the maximum independent set, and each node with the second attribute is determined is a node in the first node set. It should be noted that, in the above embodiment, the neighbor nodes are all one-hop nodes, that is, the neighbor nodes of a certain node, which are nodes directly connected to the certain node.

Optionally, according to the node attribute of each node _sh in the target sensor network except the sink node, and the message received by the node _sh from the neighbor nodes of the node _sh , updating the node attributes of the node _sh , so as to update the node attributes of all nodes in the target sensor network to one of the target attributes, including: the node attribute of the node _sh is empty, and If the notification messages are all messages carrying the first attribute, update the node attribute of the node _sh to the second attribute; when the node attribute of the node _sh is empty and In the case that the notification messages are all messages carrying the second attribute, the node attribute of the node _sh is updated to the third attribute, wherein each node with the third attribute is determined is a candidate node of the maximum independent centralized node; the node attribute of the node _sh is empty, and the notification message includes a message carrying the first attribute and a message carrying the second attribute In the case of the message of the node _sh , the node attribute of the node sh is updated to the second attribute.

Optionally, after updating the node attribute of the node _sh to the third attribute, the method further includes: determining a second node set from all candidate nodes having the third attribute, wherein all The second node set includes the node _sh , and all the nodes in the second node set have the same level identifier, and all the nodes in the second node set form a connected path, and the level identifier uses In order to indicate the node level at which the node with the level identifier is located in the target sensor network, the number of nodes in the second node set is greater than 1; the first node with the largest remaining energy in the second node set is The node attribute of the node is updated to the first attribute.

Wherein, all the nodes in the second node set form a connected path, that is, there is no isolated node in the second node set, wherein the isolated node is a node that does not have a direct connection relationship with any node in the second node set .

It should be noted that, in the above-mentioned embodiment, the level identifier of the node is used to indicate the level where the node is located in the target sensor network, and different level identifiers are used to represent different layers, that is, the target sensor network is identified by the level identifier. All nodes in are layered. For example, a level ID of 1 indicates that a node is at level 1 in the target sensor network, and a node with level ID 1 is at a level above the node with level ID 2.

Optionally, after updating the node attribute of the first node with the largest remaining energy in the second node set to the first attribute, the method further includes: sending the second node to the second node through the first node. The second node in the node set sends a notification message, wherein the second node is a neighbor node of the first node, and the notification message sent by the first node carries the information of the first node. level identification and node attributes of the first node; perform the following operations on each node in the second node set except the first node, to remove the first node in the second node set The node attribute of each node other than the node is updated to the first attribute or the second attribute, wherein the current node is initialized as the second node: the node attribute at the current node is the third attribute attribute, and the node attribute carried in the notification message received by the current node is the first attribute, update the node attribute of the current node to the second attribute; When the node attribute is the third attribute and the node attribute carried in the notification message received by the current node is the second attribute, update the node attribute of the current node to the first attribute , wherein the notification message received by the current node is sent to the current node by the neighbor node of the current node in the second node set; After the update, a notification message is sent by the current node to the neighbor nodes of the current node in the second node set, wherein the notification message sent by the current node carries the information of the current node. The level identifier and the node attribute of the current node; the neighbor node of the current node in the second node set is determined as the current node.

Optionally, in the case where there is no neighbor node of the node _sh in all the candidate nodes with the third attribute, update the node attribute of the node _sh to the first attribute, and pass the The node _sh sends a notification message to the neighbor node of the node _sh , wherein the notification message sent by the node _sh _carries the level identifier of the node sh and the information of the node _sh . Node properties. Among them, in the case where there is no neighbor node of the node _sh in all the candidate nodes, the node _sh is not directly connected to any node in the candidate nodes, that is, the node _sh is an isolated node whose node attribute is the third attribute. , so the node attribute of node _sh is directly updated to the first attribute, so that node _sh becomes a node in the maximum independent set.

Optionally, the determining the target node set in the first node set in the target sensor network includes: after updating the node attributes of all nodes in the target sensor network to the target attribute, adding the first node attribute to the target sensor network. The set composed of all nodes with two attributes is determined as the first node set; the third node set composed of target nodes in the first node set that meet the preset conditions is determined, wherein the preset conditions include the following One: the hierarchical identification of one of the two neighbor nodes of the one target node is greater than the hierarchical identification of the one target node, and the hierarchical identification of the other node of the two neighbor nodes is smaller than the The hierarchical identification of a target node; the hierarchical identification of one of the two neighbor nodes of the one target node is equal to the hierarchical identification of the one target node, and the hierarchical identification of the other node of the two neighbor nodes The identifier is greater than the hierarchy identifier of the one target node; the hierarchy identifier of one of the two neighbor nodes of the one target node is equal to the hierarchy identifier of the one target node, and the other one of the two neighbor nodes is equal to the hierarchy identifier of the one target node. The level identifier of one node is smaller than the level identifier of the one target node; the target node set is determined from the third node set.

Optionally, the determining the target node set from the third node set includes: in the case that there are multiple nodes with the same level identifier in the third node set, determining that the multiple nodes have the same level identifier. The number of neighbor nodes in the maximum independent set for each node in the nodes identified at the same level; the node with the largest number of neighbor nodes is determined as a node in the target node set; each node in the third node set is In the case where the hierarchical identifiers of the nodes are all different, each node in the third node set is determined as a node in the target node set; wherein, in the third node set from the third node set After the target node set is determined, the method further includes: removing redundant nodes from the target node set, wherein the redundant node and a node in the maximum independent set have the same neighbor node, and all The same neighbor node is a node in the maximum independent set; after the redundant node is eliminated from the target node set, the node attribute of each node in the target node set is updated to the first node attribute. an attribute.

Optionally, according to the connected dominating set, clustering the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network, comprising: sending each cluster head node to each cluster head node. Each neighbor node of the cluster head node broadcasts a target packet, wherein the target packet carries the node identifier of the cluster head node sending the target packet and the rest of the cluster head node sending the target packet Energy information; for each node Cq in the fourth node set, according to all target packets received by the node Cq, determine the cluster head node to which the node Cq belongs, wherein the cluster head to which the node Cq belongs The node is the cluster head node with the largest residual energy among the neighbor nodes of the node Cq, the q∈[1, m'], the m' is the number of nodes in the fourth node set, the The four-node set is a set composed of all nodes in the target sensor network except the cluster head node; a request message is sent through the node Cq to the cluster head node to which the node Cq belongs, wherein the request message It is used to request the cluster head node to which the node Cq belongs to add the node Cq as its own cluster member node. Through the above embodiment, after the cluster head node to which each node in the fourth set belongs is determined, the target sensor network is divided into multiple clusters.

Optionally, transferring the data sent by the cluster member nodes in at least one of the multiple clusters to the base station through the nodes in the connectivity dominance set includes: sending data to at least one cluster in the at least one cluster. The data sent by the member node performs the following operations until the neighbor node of the current cluster head node is the base station, wherein the current cluster head node is initialized as the cluster head node to which the at least one cluster member node belongs: through the current cluster head node The node receives the data sent by the cluster member node of the cluster where the current cluster head node is located; the current cluster head node pairs the data received from the cluster member node of the cluster where the current cluster head node is located and the current cluster head node. Linearly combine the data received from the child nodes of the current cluster head node to obtain first data, and send the first data to the parent node of the current cluster head node, wherein the level of the child node is The identification is smaller than the level identification of the current cluster head node, and the child node is a cluster head node in the neighbor nodes of the current cluster head node, and the level identification of the parent node is greater than the level of the current cluster head node. and the parent node is a cluster head node among the neighbor nodes of the current cluster head node; the parent node of the current cluster head node is determined as the current cluster head node.

The data transmission method in the above embodiment is explained below with reference to an example, but is not used to limit the technical solution of the embodiment of the present invention.

In the related art, there are problems in the following aspects: First, the solutions in the related art are basically performed under the assumption that the perception matrix is a dense matrix (each element in the matrix is a non-zero element), but in fact the perception matrix is executed. The matrix can also be a sparse matrix (most elements in the matrix are zero elements), and the compressed sensing data collection method based on sparse matrix can further improve the data collection efficiency; The complete spanning tree of the root, and then collect the data of each node according to the spanning tree. In the process of collecting the measurement value, each node in the network needs to send data; third, each cluster head node in the transmission backbone will merge The data is directly sent to the base station, resulting in a large and unnecessary consumption of the energy generated when the dominant node far from the base station transmits the data directly to the base station. However, in the embodiment of the present invention, a compressed data collection method is provided that combines the connected dominating set and the compressed data collection. Through the embodiments of the present invention, the energy consumption of nodes during data collection is saved, and the compressed sensing of sparse random matrix is used to improve the data collection efficiency of the wireless sensor network, and at the same time, the data collection efficiency of the wireless sensor network based on the pipeline technology is realized. data collection.

In the embodiment of the present invention, a reasonable connected dominating set is established to constitute the transmission backbone of the data transmission, and thus each reasonably distributed cluster is formed through a reasonable clustering algorithm. Among them, a hierarchical diffusion method is used to select the dominant node, specifically starting from the sink node, and filtering down layer by layer until the entire wireless sensor network is traversed; and in the sparse matrix-based compressed sensing data collection method, Only the nodes that need to send data participate in the collection of measurement values, so energy can be saved and data collection delay can be shortened; in addition, each cluster head node in the transmission backbone no longer sends the merged data directly to the base station, but adopts hierarchical transmission. In this way, the large and unnecessary consumption of energy generated when the dominant node far away from the base station transmits data directly to the base station can be avoided.

In an optional embodiment of the present invention, there is provided a data collection method (that is, a data transmission method) based on a hierarchical diffusion connected dominating set, including the following steps:

Step 1, the initialization phase of the clustering algorithm: n'+1 sensor nodes (taking the number of sink nodes in the target sensor network as 1 and the number of nodes other than sink nodes in the target sensor network as n' as an example) , optionally, n′+1=n) is randomly deployed in a preset area of the target sensor network (including but not limited to a square monitoring area); After the cluster is divided, the network model composed of the cluster head node and the cluster member nodes is used to transmit the data.

Step 2, the maximum independent set construction process: In the embodiment of the present invention, a hierarchical diffusion type maximum independent set is constructed first, and then a connected dominating set is determined based on the maximum independent set. Among them, the sink node sends a notification message to start the construction process of the largest independent set, and other nodes determine their own node attributes through the content carried in the received notification message, and continue to send notification messages to their respective neighbor nodes to determine the next The node attributes of the layer nodes, until all nodes are screened, the construction process of the largest independent set is completed;

It should be noted that, in the above embodiment, after all nodes are screened (that is, after updating the node attributes of all nodes), the node attributes of all nodes are the target attributes, that is, after the screening is completed, the node attributes of all nodes are Both are one of the following attributes: first attribute, second attribute. Optionally, as shown in FIG. 2 , nodes with different node attributes are represented by different icons, wherein a node with an empty node attribute is also called a white node, a node with the first attribute is also called a black node, and the node with the first attribute is also called a black node. The node with the second attribute is also called the gray node, and the node with the third attribute is also called the green node; when the node whose node attribute is the second attribute meets the preset conditions, the node attribute of the node is updated to the fourth attribute, and the node become the target node, and the node attribute of the target node is finally updated to the first attribute, and the node with the fourth attribute is also called the blue node.

Step 3: Connected domination set construction process: each gray node finds out whether there are more than two black nodes in its neighbor nodes, and filters some gray nodes to become connected nodes and the original black nodes through the conditional filter to form the final connected domination. set.

Step 4: The process of forming a cluster according to the connected dominating set: all the gray nodes become the cluster member nodes in the cluster with the black node as the cluster head node by finding the black node with the highest residual energy in their respective neighbor nodes; among them, When all gray nodes have determined the cluster to which they belong, the clustering process is completed.

Step 5, data transmission initialization phase: all sensor nodes in the target sensor network that are located in the connected dominating set generate a uniform sparse random matrix (ie, the perception matrix A∈Rm ^×n ), in which the sensor nodes can collect the measured values. The process (ie, the data transmission process) calculates the data to be transmitted according to the random matrix.

Step 6, data transmission process: the cluster member nodes first transmit the data to be transmitted to their respective cluster head nodes, and each cluster head node then converts the data into multiple data sample points and transmits it layer by layer to the next layer through the compressed data collection method. , and finally transmitted to the base station. At the same time, the pipeline technology is also adopted in the process of data sample point transmission between cluster head nodes, and the next round of transmission has already started before the previous round of data sample point transmission has ended.

Step 7: Extraction of original data in the network: After the base station has collected enough measurement values, it recovers the original data of each sensor according to the data recovery algorithm.

Optionally, the above step 1 includes the following steps: Step 1.1: the initial color of all nodes is white (wherein, the color of the node is the node attribute of the node, that is, the node attribute of all nodes is set to be empty), after the implementation of this embodiment is completed. After the method in , all nodes are finally transformed into black nodes or gray nodes. Black indicates that the node is selected to join the maximum independent set as the cluster head node; green indicates that the node is in an active state; gray indicates that the cluster member node that has not joined the maximum independent set; blue indicates that the gray node is selected as the connecting node (that is, the target node). Step 1.2: Each node broadcasts a first message (for example, Msg_Build message), which carries the respective node identifiers (including but not limited to node identifiers (for example, node IDs)) and numbers (that is, the hierarchical identifiers in the above-mentioned embodiments) of the nodes. ); by receiving the Msg_Build message sent by other nodes, each node can construct its own neighbor node information table. Among them, the neighbor node information table is a z×4 two-dimensional array, where z is the number of neighbor nodes around each, the first column is the number of the neighbor node, and the second column is the color of the neighbor node (the initial color of each node). are all white), the third column is the number of black nodes around the neighbor node (the initial value of this column is zero), and the fourth column is the remaining energy of each neighbor node.

Optionally, the above step 2 includes the following steps: Step 2.1: Update the node attribute of the sink node to the first attribute, that is, the sink node first marks itself as black, and sends a second packet (for example, a Msg_Deliver packet), Msg_Deliver The message contains its own number f (ie, the level identifier: f), where f=1 of the sink node. Then, the sink node sends a third message (for example, a Msg_Dominator message, or a sink message) at the same time, and starts the process of constructing a maximum independent set (Maximum Independent Set, MIS for short). Step 2.2: The neighbor node of the sink node, that is, the first-hop node sets its own number to f=f+1 after receiving the message, and continues to send the fourth message (eg Msg_Deliver message) to the next-hop node. By analogy, each node finally completes its own number according to the setting of the number of hops away from the sink node. Step 2.3: The white node that receives the Msg_Dominator message sent by the sink node sets the sink node as the parent node, and marks the node color as black in its neighbor node information table, and marks itself as a gray node, and sends the first node. Five messages (eg Msg_Dominatee message). Step 2.4: If other white nodes receive the Msg_Dominatee message sent by the neighbor node, they will mark themselves as green (green corresponds to the third attribute in the above embodiment), enter the active state at the same time, and send the sixth message (for example, Msg_Active). message). The message carries the information about the number of surrounding white neighbor nodes and its remaining energy; if the white node receives both the Msg_Dominator message and the Msg_Dominatee message, the Msg_Dominator message has a higher priority, and the white node has a higher priority. Mark itself as gray, and send Msg_Dominatee message; if green node receives Msg_Dominatee message from neighbor node, it will mark the second column corresponding to this node in neighbor node table as gray; if green node receives Msg_Dominatee message from neighbor node To the Msg_Active message, mark the corresponding second column in the neighbor node table as green; at this time, the adjacent green nodes participate in the election. If a green node has the largest remaining energy in its green neighbor nodes, it will mark itself as black, and send the Msg_Dominator message; if the green node receives the Msg_Dominator message sent by the neighbor node, set it as the parent node, then update the color of the node in the neighbor node table to black, mark itself as gray, and send Msg_Dominatee message, so far the node's participation in this round of election is over. Step 2.5: If the gray node receives the Msg_Dominator message sent by the neighbor node, the color of the node in the neighbor node table is marked as black; if the gray node receives the Msg_Dominatee message sent by the neighbor node, the node in the neighbor node table The color is marked as gray, and the round of determining the maximum independent set ends until there are no white nodes in the network.

It should be noted that the notification message in the above embodiment includes the above-mentioned third message and the fifth message, wherein the third message carries the node identifier and node attribute of the node sending the third message, and may also It includes the hierarchical identifier of the node sending the third message; the fifth message carries the node identifier and node attribute of the node sending the fifth message, and may also include the hierarchical identifier of the node sending the fifth message.

Figure 3 is a schematic diagram of the initial state of the target sensor network, in which node A is a sink node, and node A initiates the construction process of the maximum independent set. Taking Figure 3 as an example, the construction of the maximum independent set is as follows: Node A sends a Msg_Dominator report After the message, the node {B,C,D,E} marks itself as gray and sets its own number to 2 and sends Msg_Dominatee messages to the respective neighbor nodes, and determines the parent node of the node {B,C,D,E} is the A node. After receiving the Msg_Dominatee message, the node {F,G,H} marks itself as green, and sets its own number to 3, and sends the Msg_Active message to participate in the competition. The competition process is as follows: First, compare the nodes {F,G,H } remaining energy, and finally the F node with higher remaining energy becomes the black cluster head and sends the Msg_Dominator message. Since the nodes {F, G, H} are connected in series (that is, three nodes form a connected path) and compete at the same time, node G turns gray after receiving the Msg_Dominator message sent by F and sends the Msg_Dominatee message, and then node H receives the message. After reaching the Msg_Dominatee message, it becomes the black cluster head node and sends the Msg_Dominator message, and finally forms multiple green nodes connected in series in the same layer and finally forms a situation where each black node is connected in series with a gray node.

Node I receives the Msg_Dominatee message sent by node G, and becomes a new gray node after receiving the Msg_Dominator message sent by node F, and sets its own number to 4, and sends the Msg_Dominatee message. At this time, the parent node of node I It is node G or node F; node J becomes a black node after receiving the Msg_Dominatee message sent by node G, and sets its own number to 4, and sends a Msg_Dominator message. At this time, the parent node of node J is node G. At the same time, node K receives the Msg_Dominator message sent by node H, and becomes a new gray node after receiving the Msg_Dominatee message sent by node G, and sets its own number to 4, and sends the Msg_Dominatee message. At this time, the father of node K The node is either a G node or an H node. After receiving the Msg_Dominator message sent by node H, node L becomes a new gray node and sets its own number to 4, and sends the Msg_Dominatee message. At this time, the parent node of node L is node H.

Figure 4 shows the maximum independent set in a target sensor network formed according to the above steps, wherein the maximum independent set is a set composed of node A, node F, node H and node J, and the nodes of all nodes in the maximum independent set are Attributes are all first attributes.

Optionally, the above step 3 includes the following steps: Step 3.1: the sink node sends a Msg_Deliver message to the neighbor node, and the message includes its own number f (f=1 of the sink node). Step 3.2: The neighbor node of the sink node, that is, the first-hop node sets its own number to f after receiving the message, where f=f+1 and continues to send the Msg_Deliver message to the next-hop node. Step 3.3: By analogy, each node completes its own number according to the setting of the number of hops away from the sink node. Step 3.4: Each gray node looks up whether there are more than two black nodes in its neighbor nodes and one of the following conditions is satisfied: The black nodes are its own previous hop node and the node with the same hop as itself, that is, the same number. ; The black nodes are their own next hop node and the node with the same hop number as their own respectively; the black nodes are their own previous hop node and next hop node respectively. Step 3.5: If the above conditions are met, the node will be marked as blue, and the node will send the seventh message (eg Msg_Border message). When the black node in the neighbor node receives the Msg_Border message, it will establish a connection with the blue connection of colored nodes. It should be noted that the blue node is a target node in the third node set in the above embodiment; wherein, when a blue node and a node in the maximum independent set have the same neighbor node, and the same neighbor node When the node is a node in the maximum independent set, the blue node is cancelled to be marked as blue, that is, the blue node is restored to a gray node (corresponding to restoring the node attribute of the node to the second attribute). Step 3.6: After all the gray nodes have gone through the above screening steps, mark all the blue nodes as black nodes, so that all the black nodes constitute a connected dominating set.

In the process of determining the connected dominating set based on the maximum independent set, it mainly involves the selection of the connected nodes in the connected dominating set. The specific steps are as follows:

First, start filtering from the sink node A to the next hop. The nodes {B, C, D, E} in the second hop are all gray nodes, and then continue to enter the next hop (that is, enter the screening of the next layer of nodes). At this time, the black node {F,H} numbered 3 is in this hop, and there is a gray node D in the previous hop number 2, which can connect the two nodes to the black node A numbered 1 at the same time, Therefore, node D is selected as the connecting node before entering the next hop. Continue to check that there is a black node J in the node numbered 4, and its neighbor nodes have a gray node G in the previous hop numbered 3 connected to the black node {F,H} numbered 3, so node G is Selected as the connection node. When all gray nodes are filtered out, mark all blue nodes as black nodes.

5 is a schematic diagram of a connected dominating set in a target sensor network according to an embodiment of the present invention, wherein the connected dominating set is a set consisting of node A, node D, node F, node G, node H, and node J, and is connected to The backbone nodes in the domination set, namely node A, node D, node G, and node J, form a connected path.

Optionally, the above step 4 includes the following steps: Step 4.1: The node in the connectivity dominance set sends the message Msg_Head (that is, the target message in the above embodiment) that it becomes the cluster head node to the surrounding neighbor nodes, and in the The message adds its own remaining energy information. Step 4.2: The cluster member node determines the cluster head node with the most remaining energy according to one or several Msg_Head packets received from different cluster head nodes, and sends a Msg_Join packet to the cluster head node with the most remaining energy to apply for Join the cluster corresponding to the cluster head node with the most remaining energy. Step 4.3: The cluster head node receives the Msg_Join message sent from the member nodes in its cluster, and deletes the nodes that do not belong to the cluster from its neighbor node information summary table.

6 is a schematic diagram of clustering a target sensor network according to an embodiment of the present invention, wherein node B, node E, and node C join the cluster where the cluster head node A is located, node I joins the cluster where the cluster head node F is located, and the node K. Node L joins the cluster where the cluster head node H is located.

Optionally, the above step 6 includes the following steps: Step 6.1: First, the cluster head node determines the level to which it belongs according to the number of node hops through which data is transmitted to the base station. The cluster head node that transmits data directly to the base station after one hop is selected as the first-level cluster head node (ie, the level ID is 1), and the cluster head node that transmits data to the base station through the parent node becomes the second-level cluster head node. And so on, adding one for each additional hop level. Step 6.2: The energy transmission between the cluster head nodes uses the compressed data collection method, and each node sends a linear combination of the original data instead of the original data itself; among them, each cluster member node sends the data to the cluster head node to which it belongs. Send the original data. After each cluster head node receives the data, it linearly combines the data with the data received by the previous hop node to obtain m data sample points and transmits them, so that the number of transmissions on any link is m . Among them, after each cluster head node receives data, it linearly combines the data with the data received by the previous hop node so that the number of transmissions on any link is m, including:

According to the formula

Each y _j is obtained by calculation, and one of y is transmitted in each transmission, that is, the transmission of y ₁ to y _j is completed through m times of transmission, so that the data transmission amount on the link is m. Step 6.3: Without affecting the previous round of transmission, after a round of transmission of the cluster head node at the previous level is completed, after the transmission condition is determined by the interference radius condition, after a short standby time, it is in the next round of transmission. The cluster head node of the hierarchical level starts the next round of data sample point transmission, instead of starting the next round of data transmission after the entire wireless network has completed one round of data transmission. Among them, the standby time is affected by the condition of the interference radius. The transmission conditions are determined.

In the above-mentioned embodiment, compressed sensing theory is applied in the data collection process of the wireless network, so the original signal can be extracted from a linear combination of a smaller amount of original signals. However, in the scheme of applying a dense sensing matrix in the related art, each element in the sensing matrix is non-zero. Therefore, in the process of collecting measurement values by applying compressed sensing technology, it is often necessary to construct a complete spanning tree, one based on the base station. It is the root and covers the spanning tree of each node. Each node on the spanning tree needs to send its own data to the base station. However, in the above embodiment, the performance of the sparse sensing matrix used in restoring the original signal can reach the same level as the dense sensing matrix, and a sparse random matrix applied in the compressed sensing technology can be constructed through the above embodiment. Moreover, in the compressed sensing data collection process based on sparse random matrix, each round requires those nodes whose weighting coefficients are not zero to send the collected measurement data to the base station. In addition, in order to ensure the connectivity of the network, although some nodes have a weighting coefficient of zero, they are responsible for forwarding data, so as to ensure that the base station can receive all the required data. In the above embodiment, the target sensor network is decomposed into different cells (clusters), and the cells are connected to each other like a chain, so it is only necessary to keep at least one node (cluster head node) in each cell active, The connectivity of the entire network can be guaranteed. The above embodiment also adopts the pipeline technology, that is, the next round of measurement value collection starts when the previous round of measurement value collection is not over, and the time for each cell to send data does not affect other data transmissions. As early as possible, in order to reduce the delay of data collection, while reducing the energy consumption of the entire network, the delay of data collection can also be reduced. In addition, because each node has the same probability of remaining active during each round of measurement value collection, the data collection method in the above embodiment can also ensure that the load of the entire network is also balanced.

Through the above embodiment, the following technical effects can be achieved: (1) Low energy consumption: In the above embodiment, not every sensor participates in the process of data reception and transmission during the whole process of collecting measurement values, but only the Sensors and relay sensors that contribute to the ongoing measurement participate in the reception and transmission of data. Moreover, when the sensor is not sending or receiving data, the sensor will enter a sleep state to save energy. (2) Low latency: When collecting each measurement value, only some of the nodes related to the measurement value participate in the reception and transmission of data, so the time consumed by collecting each measurement value in this way will be reduced. Moreover, in the above-mentioned embodiment, the pipeline technology in which the collection process of the next round of measurement values is started before the previous round of measurement value collection is completed, further reduces the delay required for the entire data collection. (3) Load balancing: each node has the same probability of sending data to collect each round of measurement values. According to the probability correlation theory, after the entire data collection is over, the energy consumed by each node is roughly the same, and the difference is also small, so the load of each sensor is more balanced.

From the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is better implementation. Based on this understanding, the technical solutions of the present invention can be embodied in the form of software products in essence or the parts that make contributions to the prior art, and the computer software products are stored in a storage medium (such as ROM/RAM, magnetic disk, CD-ROM), including several instructions to make a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in the various embodiments of the present invention.

According to another embodiment of the present invention, a data transmission apparatus is provided, and the apparatus is configured to implement the above-mentioned embodiments and preferred implementations, and what has been described will not be repeated. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, implementations in hardware, or a combination of software and hardware, are also possible and contemplated.

7 is a structural block diagram of a data transmission apparatus according to an embodiment of the present invention, the apparatus includes: a processing module 72 configured to determine a maximum independent set in a target sensor network, wherein the maximum independent set is generated by the target sensor A set of nodes in the network that are not adjacent to each other, each node in the target sensor network corresponds to a sensor one-to-one; the processing module 72 is further configured to determine the first node in the target sensor network The target node set in the set, wherein the first node set is a set composed of nodes in the target sensor network that do not belong to the maximum independent set, and each target node in the target node set meets the predetermined Set a condition, the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set; the processing module 72 is further configured to set each of the maximum independent set and the target node set to Each node is determined to be a node in the connected domination set corresponding to the target sensor network, and the connected domination set is obtained, wherein any two nodes in the connected domination set can communicate with each other; the processing module 72, further It is set to cluster the nodes in the target sensor network according to the connected dominating set to obtain a plurality of clusters in the target sensor network, wherein each node in the connected dominating set is the plurality of clusters. A cluster head node of one of the clusters; the transmission module 74 is configured to transfer the data sent by the cluster member nodes in at least one of the multiple clusters to the base station through the nodes in the connectivity control set.

Optionally, the processing module is further configured to set the node attributes of all nodes in the target sensor network to null before the determination of the maximum independent set in the target sensor network; wherein the processing module, It is also set to: update the node attribute of the sink node in the target sensor network to the first attribute, and according to the node attribute of each node _sh in the target sensor network except the sink node and the The notification message received by the node _sh from the neighbor nodes of the node _sh _updates the node attribute of the node sh, so as to update the node attributes of all nodes in the target sensor network to the target attribute, wherein , the h∈[1, n′], where n′ is the number of nodes in the target sensor network other than the sink node, and the notification message carries the information that sends the notification message a node attribute of a node, the target attribute includes the first attribute and a second attribute, each node with the first attribute is determined as a node in the maximum independent set, each with the second attribute The node of is determined as a node in the first node set.

Optionally, the processing module is further configured to: in the case that the node attribute of the node _sh is empty and the notification packets are all packets carrying the first attribute, the node The node attribute of _sh is updated to the second attribute; when the node attribute of the node _sh is empty and the notification packets are all packets carrying the second attribute, the The node attribute of the node _sh is updated to a third attribute, wherein each node with the third attribute is determined as a candidate node of the maximum independent set of nodes; the node attribute of the node _sh is empty, And if the notification message includes a message carrying the first attribute and a message carrying the second attribute, the node attribute of the node _sh is updated to the second attribute.

Optionally, the processing module is further configured to: after updating the node attribute of the node _sh to the third attribute, determine a second node set from all candidate nodes having the third attribute, Wherein, the second node set includes the node _sh , and all nodes in the second node set have the same level identifier, and all nodes in the second node set form a connected path, and the The level identifier is used to indicate the node level of the node with the level identifier in the target sensor network, and the number of nodes in the second node set is greater than 1; the remaining energy in the second node set is maximized The node attribute of the first node of is updated to the first attribute.

Optionally, the processing module is further configured to: after updating the node attribute of the first node with the largest remaining energy in the second node set to the first attribute, send the information to all nodes through the first node. The second node in the second node set sends a notification message, wherein the second node is a neighbor node of the first node, and the notification message sent by the first node carries the first node. The hierarchical identification of a node and the node attribute of the first node; the following operations are performed for each node in the second node set except the first node, so as to remove all nodes in the second node set except the first node. The node attribute of each node other than the first node is updated to the first attribute or the second attribute, wherein the current node is initialized as the second node: the node attribute of the current node is all When the third attribute is used and the node attribute carried in the notification message received by the current node is the first attribute, update the node attribute of the current node to the second attribute; When the node attribute of the current node is the third attribute and the node attribute carried in the notification message received by the current node is the second attribute, update the node attribute of the current node to the The first attribute, wherein the notification message received by the current node is sent to the current node by the neighbor node of the current node in the second node set; After the node attribute of the node is updated, a notification message is sent by the current node to the neighbor nodes of the current node in the second node set, wherein the notification message sent by the current node carries the The level identifier of the current node and the node attribute of the current node; the neighbor node of the current node in the second node set is determined as the current node.

Wherein, the processing module is further configured to: _update the node attribute of the node _sh as the the first attribute, and send a notification message to the neighbor nodes of the node _sh through the node _sh , wherein the notification message sent by the node _sh _carries the level identifier of the node sh and the node attributes of said node _sh .

Optionally, the processing module is further configured to: after updating the node attributes of all nodes in the target sensor network to the target attribute, determine a set composed of all nodes with the second attribute as the first A node set; determining a third node set consisting of target nodes in the first node set that meet the preset condition, wherein the preset condition includes one of the following: the two target nodes of the one target node The hierarchical identification of one node in the neighbor nodes is greater than the hierarchical identification of the one target node, and the hierarchical identification of the other node in the two neighbor nodes is smaller than the hierarchical identification of the one target node; The hierarchical identification of one node in the two neighbor nodes is equal to the hierarchical identification of the one target node, and the hierarchical identification of the other node in the two neighbor nodes is greater than the hierarchical identification of the one target node; the The level identifier of one of the two neighbor nodes of a target node is equal to the level identifier of the one target node, and the level identifier of the other node of the two neighbor nodes is smaller than the level identifier of the one target node identifying; determining the target node set from the third node set.

Optionally, the processing module is further configured to: when there are multiple nodes with the same level identifier in the third node set, determine each node in the multiple nodes with the same level identifier The number of neighbor nodes in the largest independent set; the node with the largest number of neighbor nodes is determined as a node in the target node set; in the case that the level identifiers of each node in the third node set are different Next, each node in the third node set is determined as a node in the target node set; wherein, after the target node set is determined from the third node set, the The method further includes: removing redundant nodes from the target node set, wherein the redundant node and a node in the maximum independent set have the same neighbor node, and the same neighbor node is the maximum independent node a node in the set; after the redundant nodes are eliminated from the target node set, the node attribute of each node in the target node set is updated to the first attribute.

Optionally, the processing module is further configured to: broadcast a target message to neighbor nodes of each cluster head node through each of the cluster head nodes, wherein the target message carries the The node identifier of the cluster head node of the target message and the remaining energy information of the cluster head node sending the target message; for each node Cq in the fourth node set, according to all the target messages received by the node Cq , determine the cluster head node to which the node Cq belongs, wherein the cluster head node to which the node Cq belongs is the cluster head node with the largest residual energy among the neighbor nodes of the node Cq, and the q∈[1, m '], the m' is the number of nodes in the fourth node set, and the fourth node set is a set composed of all nodes in the target sensor network except all the cluster head nodes; by The node Cq sends a request message to the cluster head node to which the node Cq belongs, where the request message is used to request the cluster head node to which the node Cq belongs to add the node Cq as its own cluster member node .

Optionally, the transmission module is further configured to: perform the following operations on the data sent by at least one cluster member node in the at least one cluster, until the neighbor node of the current cluster head node is the base station, wherein the current cluster The head node is initialized as the cluster head node to which the at least one cluster member node belongs: the current cluster head node receives data sent by the cluster member nodes of the cluster where the current cluster head node is located; The data received from the cluster member nodes of the cluster where the current cluster head node is located and the data received by the current cluster head node from the child nodes of the current cluster head node are linearly combined to obtain the first data, and the The first data is sent to the parent node of the current cluster head node, wherein the level identification of the child node is smaller than the level identification of the current cluster head node, and the child node is the neighbor of the current cluster head node A cluster head node in the node, the hierarchical identification of the parent node is greater than the hierarchical identification of the current cluster head node, and the parent node is a cluster head node in the neighbor nodes of the current cluster head node; The parent node of the current cluster head node is determined as the current cluster head node.

An embodiment of the present invention further provides a storage medium, where the storage medium includes a stored program, wherein the above-mentioned program executes any one of the above-mentioned methods when running. Optionally, in this embodiment, the above-mentioned storage medium may be configured to store program codes for executing the following steps:

S1. Determine the maximum independent set in the target sensor network, where the maximum independent set is a set composed of nodes in the target sensor network that are not adjacent to each other, and each node in the target sensor network is connected to Sensors are in one-to-one correspondence; S2, determine a target node set in a first node set in the target sensor network, where the first node set is composed of nodes in the target sensor network that do not belong to the maximum independent set Each target node in the target node set conforms to a preset condition, and the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set; S3, the maximum independent set Each node in the independent set and the target node set is determined as a node in the connected domination set corresponding to the target sensor network, and the connected domination set is obtained, wherein, between any two nodes in the connected domination set can communicate with each other; S4, according to the connected domination set, cluster the nodes in the target sensor network to obtain multiple clusters in the target sensor network, wherein each node in the connected domination set is A cluster head node of one of the multiple clusters; S5, through the nodes in the connectivity control set, relay the data sent by the cluster member nodes in at least one of the multiple clusters to the base station.

Optionally, in this embodiment, the above-mentioned storage medium may include but is not limited to: a USB flash drive, a read-only memory (Read-Only Memory, referred to as ROM), a random access memory (Random Access Memory, referred to as RAM), Various media that can store program codes, such as removable hard disks, magnetic disks, or optical disks.

Optionally, for specific examples in this embodiment, reference may be made to the examples described in the foregoing embodiments and optional implementation manners, and details are not described herein again in this embodiment.

An embodiment of the present invention also provides an electronic device, comprising a memory and a processor, where a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any of the above method embodiments.

Optionally, the above-mentioned electronic device may further include a transmission device and an input-output device, wherein the transmission device is connected to the above-mentioned processor, and the input-output device is connected to the above-mentioned processor.

Optionally, in this embodiment, the above-mentioned processor may be configured to perform the following steps through a computer program: S1, determine the maximum independent set in the target sensor network, wherein the maximum independent set is determined by the target sensor network A set composed of two non-adjacent nodes in the target sensor network, each node in the target sensor network corresponds to a sensor one-to-one; S2, determine the target node set in the first node set in the target sensor network, wherein , the first node set is a set consisting of nodes in the target sensor network that do not belong to the maximum independent set, each target node in the target node set meets a preset condition, and the preset condition Used to indicate that a target node has two neighbor nodes in the maximum independent set; S3, determine the maximum independent set and each node in the target node set as the target sensor network corresponding to the connected domination set. a node to obtain the connected domination set, wherein any two nodes in the connected domination set can communicate with each other; S4, according to the connected domination set, cluster the nodes in the target sensor network, Obtaining a plurality of clusters in the target sensor network, wherein each node in the connectivity domination set is a cluster head node of a cluster in the plurality of clusters; S5, through the nodes in the connectivity domination set, convert the The data sent by the cluster member nodes in at least one of the multiple clusters is relayed to the base station.

FIG. 8 is a schematic structural diagram of an optional electronic device according to an embodiment of the present invention. Optionally, those of ordinary skill in the art can understand that the structure shown in FIG. 8 is only for illustration, and the electronic device can also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a handheld computer, and a mobile Internet device (Mobile Internet device). Internet Devices, MID), PAD and other terminal equipment. FIG. 8 does not limit the structure of the above electronic device. For example, the electronic device may also include more or less components than those shown in FIG. 8 (eg, network interfaces, etc.), or have a different configuration than that shown in FIG. 8 .

Wherein, the memory 1002 can be configured to store software programs and modules, such as program instructions/modules corresponding to the data transmission method and the data transmission device in the embodiment of the present invention, and the processor 1004 runs the software programs and modules stored in the memory 1002, Thereby, various functional applications and data processing are performed, that is, the above-mentioned data transmission method is realized. Memory 1002 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, memory 1002 may further include memory located remotely from processor 1004, and these remote memories may be connected to the terminal through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof. As an example, the above-mentioned memory 1002 may include, but is not limited to, the processing module 72 and the transmission module 74 of the above-mentioned data transmission apparatus. In addition, it may also include, but is not limited to, other module units in the above-mentioned data transmission apparatus, which will not be repeated in this example.

Optionally, the above-mentioned transmission device 1006 is configured to receive or send data via a network. Specific examples of the above-mentioned networks may include wired networks and wireless networks. In one example, the transmission device 1006 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices and routers through a network cable to communicate with the Internet or a local area network. In one example, the transmission device 1006 is a radio frequency (RF) module configured to communicate with the Internet wirelessly.

In addition, the above electronic device further includes: a display 1008 configured to display a picture; and a connection bus 1010 configured to connect various module components in the above electronic device.

Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the present invention can be implemented by a general-purpose computing device, which can be centralized on a single computing device, or distributed in a network composed of multiple computing devices Alternatively, they may be implemented in program code executable by a computing device, such that they may be stored in a storage device and executed by the computing device, and in some cases, in a different order than here The steps shown or described are performed either by fabricating them separately into individual integrated circuit modules, or by fabricating multiple modules or steps of them into a single integrated circuit module. As such, the present invention is not limited to any particular combination of hardware and software. The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention shall be included within the protection scope of the present invention.

Optionally, in this embodiment, the above-mentioned storage medium may include but is not limited to: a USB flash drive, a read-only memory (Read-Only Memory, referred to as ROM), a random access memory (Random Access Memory, referred to as RAM), Various media that can store program codes, such as removable hard disks, magnetic disks, or optical disks. Optionally, for specific examples in this embodiment, reference may be made to the examples described in the foregoing embodiments and optional implementation manners, and details are not described herein again in this embodiment.

Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the present invention can be implemented by a general-purpose computing device, which can be centralized on a single computing device, or distributed in a network composed of multiple computing devices Alternatively, they may be implemented in program code executable by a computing device, whereby they may be stored in a storage device and executed by the computing device, and in some cases, in a different order than here The steps shown or described are performed either by fabricating them separately into individual integrated circuit modules, or by fabricating multiple modules or steps of them into a single integrated circuit module. As such, the present invention is not limited to any particular combination of hardware and software. The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention shall be included within the protection scope of the present invention.

Claims

A method of data transmission, comprising:

Determine the maximum independent set in the target sensor network, wherein the maximum independent set is a set composed of nodes in the target sensor network that are not adjacent to each other, and each node in the target sensor network is one with the sensor. one correspondence;

determining a target node set in a first node set in the target sensor network, wherein the first node set is a set consisting of nodes in the target sensor network that do not belong to the maximum independent set, the target Each target node in the node set meets a preset condition, and the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set;

Determine the maximum independent set and each node in the target node set as a node in the connected domination set corresponding to the target sensor network, and obtain the connected domination set, wherein any two in the connected domination set are determined. The nodes can communicate with each other;

According to the connected dominating set, cluster the nodes in the target sensor network to obtain a plurality of clusters in the target sensor network, wherein each node in the connected dominating set is one of the plurality of clusters the cluster head node of a cluster;

The data sent by the cluster member nodes in at least one of the multiple clusters is forwarded to the base station through the nodes in the connectivity dominating set.
The method of claim 1, wherein prior to said determining the largest independent set in the target sensor network, the method comprises:

Setting the node attributes of all nodes in the target sensor network to be empty;

Wherein, the determining the maximum independent set in the target sensor network includes:

Update the node attribute of the sink node in the target sensor network to the first attribute, and according to the node attribute of each node sh in the target sensor network except the sink node and the node sh from The notification message received by the neighbor nodes of the node sh updates the node attributes of the node sh to update the node attributes of all nodes in the target sensor network to the target attributes, where h∈ [ 1, n′], n′ is the number of nodes in the target sensor network other than the sink node, the notification message carries the node attribute of the node sending the notification message, the target Attributes include the first attribute and a second attribute, each node with the first attribute is determined as a node in the maximum independent set, and each node with the second attribute is determined as the first attribute. A node in a set of nodes.
The method according to claim 2, wherein the node attribute of each node sh in the target sensor network except the sink node, and the node sh from the node sh The message received by the neighbor node updates the node attributes of the node sh , so as to update the node attributes of all nodes in the target sensor network to one of the target attributes, including:

When the node attribute of the node sh is empty and the notification messages are all packets carrying the first attribute, updating the node attribute of the node sh to the second attribute;

In the case that the node attribute of the node sh is empty and the notification packets are all packets carrying the second attribute, the node attribute of the node sh is updated to the third attribute, wherein , each node with the third attribute is determined as a candidate node of the maximum independent set of nodes;

In the case that the node attribute of the node s h is empty, and the notification packet includes a packet carrying the first attribute and a packet carrying the second attribute, the node s The node attribute of h is updated to the second attribute.
The method according to claim 3, wherein after updating the node attribute of the node sh to the third attribute, the method further comprises:

determining a second set of nodes among all candidate nodes having the third attribute, wherein the second set of nodes includes the node sh , and all nodes in the second set of nodes have the same level identification, and all nodes in the second node set form a connected path, the level identifier is used to indicate the node level where the node with the level identifier is located in the target sensor network, and the second node set is The number of nodes is greater than 1;

The node attribute of the first node with the largest remaining energy in the second node set is updated to the first attribute.
The method according to claim 4, wherein after updating the node attribute of the first node with the largest remaining energy in the second node set to the first attribute, the method further comprises:

Send a notification message to a second node in the second node set by the first node, where the second node is a neighbor node of the first node, and the notification sent by the first node The message carries the hierarchical identifier of the first node and the node attribute of the first node;

Perform the following operations on each node in the second node set except the first node to update the node attribute of each node in the second node set except the first node to The first attribute or the second attribute, wherein the current node is initialized to the second node:

When the node attribute of the current node is the third attribute and the node attribute carried in the notification message received by the current node is the first attribute, update the node attribute of the current node is the second attribute;

When the node attribute of the current node is the third attribute and the node attribute carried in the notification message received by the current node is the second attribute, update the node attribute of the current node is the first attribute, wherein the notification message received by the current node is sent to the current node by a neighbor node of the current node in the second node set;

After the node attribute update of the current node is completed, a notification message is sent by the current node to the neighbor nodes of the current node in the second node set, wherein the notification message sent by the current node is The message carries the level identifier of the current node and the node attribute of the current node;

A neighbor node of the current node in the second node set is determined as the current node.
The method according to claim 4, wherein in the case where no neighbor node of the node sh exists in all the candidate nodes with the third attribute, the node attribute of the node sh is updated to the the first attribute, and send a notification message to the neighbor nodes of the node sh through the node sh , wherein the notification message sent by the node sh carries the level identifier of the node sh and the node attributes of said node sh .
The method of claim 2, wherein the determining the target node set in the first node set in the target sensor network comprises:

After updating the node attributes of all nodes in the target sensor network to the target attribute, determining a set composed of all nodes having the second attribute as the first node set;

Determine a third node set consisting of target nodes that meet the preset conditions in the first node set, wherein the preset conditions include one of the following:

The level identifier of one of the two neighbor nodes of the one target node is greater than the level identifier of the one target node, and the level identifier of the other node of the two neighbor nodes is smaller than the one target node. 's level identification;

The hierarchical identification of one of the two neighbor nodes of the one target node is equal to the hierarchical identification of the one target node, and the hierarchical identification of the other node of the two neighbor nodes is greater than the one target node. 's level identification;

The level identifier of one of the two neighbor nodes of the one target node is equal to the level identifier of the one target node, and the level identifier of the other node of the two neighbor nodes is smaller than the one target node. 's level identification;

The target node set is determined from the third node set.
The method of claim 7, wherein the determining the target node set from the third node set comprises:

In the case that there are multiple nodes with the same level identifier in the third node set, determining the number of neighbor nodes in the maximum independent set for each of the multiple nodes with the same level identifier;

Determine the node with the largest number of neighbor nodes as a node in the target node set;

In the case that the hierarchical identifiers of each node in the third node set are different, each node in the third node set is determined as a node in the target node set;

Wherein, after determining the target node set from the third node set, the method further includes: removing redundant nodes from the target node set, wherein the redundant nodes are the same as the maximum node set. A node in the independent set has the same neighbor node, and the same neighbor node is a node in the maximum independent set;

After the redundant nodes are removed from the target node set, the node attribute of each node in the target node set is updated to the first attribute.
The method according to claim 1, wherein the clustering of nodes in the target sensor network according to the connected dominance set to obtain a plurality of clusters in the target sensor network, comprising:

A target packet is broadcast to the neighbor nodes of each cluster head node through each cluster head node, wherein the target packet carries the node identifier of the cluster head node that sends the target packet and the destination node that sends the target packet. Describe the remaining energy information of the cluster head node of the target message;

For each node Cq in the fourth node set, the cluster head node to which the node Cq belongs is determined according to all the target packets received by the node Cq, wherein the cluster head node to which the node Cq belongs is the is the cluster head node with the largest residual energy among the neighbor nodes of the node Cq, q∈[1, m'], m' is the number of nodes in the fourth node set, and the fourth node set is the target The set of all nodes in the sensor network except the cluster head node;

Send a request message to the cluster head node to which the node Cq belongs through the node Cq, where the request message is used to request the cluster head node to which the node Cq belongs to add the node Cq as its own cluster member node.
The method according to claim 1, wherein the transferring the data sent by the cluster member nodes in at least one of the multiple clusters to the base station through the nodes in the connectivity control set comprises:

Perform the following operations on the data sent by at least one cluster member node in the at least one cluster, until the neighbor node of the current cluster head node is the base station, wherein the current cluster head node is initialized as the at least one cluster member node belongs to The cluster head node of:

Receive, through the current cluster head node, the data sent by the cluster member nodes of the cluster where the current cluster head node is located;

The current cluster head node performs a linear combination of the data received from the cluster member nodes of the cluster where the current cluster head node is located and the data received by the current cluster head node from the child nodes of the current cluster head node , obtain the first data, and send the first data to the parent node of the current cluster head node, wherein the level identification of the child node is smaller than the level identification of the current cluster head node, and the child node is a cluster head node in the neighbor nodes of the current cluster head node, the hierarchical identification of the parent node is greater than the hierarchical identification of the current cluster head node, and the parent node is the neighbor node of the current cluster head node a cluster head node in ;

The parent node of the current cluster head node is determined as the current cluster head node.
A data transmission device, comprising:

The processing module is configured to determine the maximum independent set in the target sensor network, wherein the maximum independent set is a set composed of nodes in the target sensor network that are not adjacent to each other, and each node in the target sensor network Each node corresponds to the sensor one by one;

The processing module is further configured to determine a target node set in a first node set in the target sensor network, wherein the first node set is composed of nodes in the target sensor network that do not belong to the maximum independent set a set of nodes, where each target node in the target node set meets a preset condition, and the preset condition is used to indicate that a target node has two neighbor nodes in the maximum independent set;

The processing module is further configured to determine each node in the maximum independent set and the target node set as a node in the connected dominating set corresponding to the target sensor network, to obtain the connected dominating set, wherein, Any two nodes in the connectivity domination set can communicate with each other;

The processing module is further configured to cluster the nodes in the target sensor network according to the connected dominance set, to obtain a plurality of clusters in the target sensor network, wherein each of the connected dominance sets is The node is a cluster head node of one of the multiple clusters;

The transmission module is configured to forward the data sent by the cluster member nodes in at least one of the multiple clusters to the base station through the nodes in the connectivity control set.
A storage medium having stored therein a computer program, wherein the computer program is arranged to execute the method of any one of claims 1 to 10 when run.
An electronic device comprising a memory and a processor, the memory having a computer program stored therein, the processor being arranged to perform the method of any one of claims 1 to 10 by means of the computer program.