A method for collecting intra-cluster data based on SIC scheduling and power control
By adopting a method based on SIC scheduling and power control in the wireless sensor network, selecting concurrent cluster member nodes and optimizing transmission power, the problems of channel resource waste and energy consumption in traditional data collection strategies are solved, and efficient data transmission and Energy management.
Patent Information
- Application Number
- CN202211032152.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-08-26
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2042-08-26
AI Technical Summary
In large-scale wireless sensor networks, traditional in-cluster data collection strategies lead to waste of channel resources, affecting network transmission performance, and SIC technology has the problem of high energy consumption in energy-constrained networks.
Using an in-cluster data collection method based on SIC scheduling and power control, by defining the feasible SIC region and building a non-uniform M-Level scheduling model, concurrent cluster member nodes are selected to minimize transmission power, realize concurrent transmission, and at the same time optimize the transmission power to reduce Energy loss.
While ensuring concurrent transmission throughput, it reduces network energy loss, improves the energy efficiency of data transmission, and improves the energy efficiency of network.
Smart Images

Figure CN115460682B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of wireless sensor networks, and in particular to a method for collecting intra-cluster data based on SIC scheduling and power control. Background Art
[0002] In large-scale wireless sensor networks, in order to effectively collect and transmit data information, the network is generally managed by cluster topology. Each cluster consists of a cluster head node and multiple cluster member nodes. The cluster head node controls the member nodes in the entire cluster, collects data information from the cluster member nodes and the data information from the previous hop cluster head node, and transmits it to the next hop cluster head node until the data is transmitted to the Sink node. The network topology is as follows: Figure 1 shown.
[0003] The traditional strategy for collecting data within a cluster is to use TDMA to periodically allocate a time slot for each member node in the cluster to transmit data. This method can effectively avoid interference conflicts during data transmission, but the time slot allocation strategy limits the spatial reuse of the spectrum, resulting in a waste of channel resources, thus affecting the transmission performance of the network.
[0004] In order to improve transmission efficiency, the research uses interference cancellation technology to achieve concurrent transmission of multiple nodes within the cluster, thereby improving network throughput. Among them, successive interference cancellation (SIC) is an advanced PHY technology that can achieve concurrent transmission and has the ability to iteratively decode concurrent signals from multiple transmitters. In each iteration, the strongest signal is decoded and the remaining signals are treated as interference. The received composite signal can be decoded and denoised while meeting the signal-to-noise ratio (SINR) requirements. In subsequent iterations, the next strongest signal is decoded, and this process continues until all signals are decoded. The decoding process is as follows: Figure 2 shown.
[0005] Intuitively, a SIC receiver is able to receive multiple signals simultaneously, which greatly improves throughput and spatial reuse. Existing research applies SIC technology to scheduling and routing schemes to find the largest set of concurrent links in each time slot to maximize throughput. However, most studies focus on improving throughput and ignore the issue of transmission energy consumption. Due to the strict limitations of SINR, SIC technology must use high transmission power to overcome the high interference caused by parallel transmission, which poses a severe challenge to energy-constrained wireless networks. Summary of the invention
[0006] The technical problem to be solved by the present invention is to provide a method for collecting data within a cluster based on SIC scheduling and power control, which can reduce the energy loss of the network while ensuring the concurrent transmission throughput and improve the energy efficiency of data transmission.
[0007] The technical solution adopted by the present invention to solve the technical problem is: to provide a method for collecting intra-cluster data based on SIC scheduling and power control, comprising the following steps:
[0008] (1) Define a cluster head node R h The SIC feasible region A is centered SIC , and classify the member nodes in the cluster into SIC feasible nodes and SIC infeasible nodes;
[0009] (2) constructing a non-uniform M-Level scheduling model, wherein the non-uniform M-Level scheduling model is used to determine a group of concurrent cluster member nodes that can achieve concurrent transmission without affecting communication quality;
[0010] (3) In each time slot, a concurrent cluster member node is selected according to the non-uniform M-Level scheduling model, with the goal of minimizing the sum of the transmission powers of the concurrent cluster member nodes in all time slots, and determining the set of concurrent cluster member nodes and the optimal transmission power for each time slot;
[0011] (4) Cluster head node R h In each time slot, the cluster member nodes in the set of concurrent cluster member nodes in the time slot are notified to transmit data simultaneously with the optimal transmission power.
[0012] The SIC feasible region A SIC The radius is: in, Indicates the previous hop cluster head node S h To cluster head node R h distance, α is the path loss index, β represents the cluster head node R h Successfully received from the previous hop cluster head node S h The minimum SINR required for the signal.
[0013] When constructing the non-uniform M-Level scheduling model, the SIC feasible area is divided into a non-uniform M-Level ring, and a SIC feasible node is selected in each level of the ring as a concurrent cluster member node to form a set of concurrent cluster member nodes that can transmit in the same time slot.
[0014] The radius of the i-th level ring in the non-uniform M-Level scheduling model is: in, is the transmission power of the previous hop cluster head node, is a concurrent cluster member node S i The transmission power of the cluster head node R h Successfully received from concurrent cluster member node S i The minimum SINR required for the signal.
[0015] The situation that does not affect the communication quality refers to the maximum number of SIC decodable C max satisfy: Represents the cluster head node R h The strongest interference signal strength received, σ 2 represents the noise power; the maximum number of layers M of the non-uniform M-Level scheduling model satisfies:
[0016]
[0017] The objective function in step (3) is expressed as: in, represents the total transmission power of concurrent cluster member nodes at time slot t, Φ t represents the set of concurrent cluster member nodes selected by the non-uniform M-Level scheduling model at time slot t, where T represents the number of time slots; is a concurrent cluster member node S i The transmission power of is constrained as follows: in, Indicates the previous hop cluster head node S h To cluster head node R h The distance Represents the concurrent cluster member node S i To cluster head node R h The distance, P max represents the maximum transmission power, α is the path loss index, and β represents the cluster head node R h Successfully received from concurrent cluster member node S i The minimum SINR required for the signal.
[0018] Beneficial Effects
[0019] Due to the adoption of the above technical solution, the present invention has the following advantages and positive effects compared with the prior art: the present invention constructs a non-uniform M-Level scheduling model, through which a group of SIC concurrent transmission nodes that can achieve concurrent transmission without affecting the communication quality are determined, and a scheduling and power control strategy is given based on the non-uniform M-Level scheduling model. In order to improve the energy efficiency of transmission, the SIC scheduling and power control decision are converted into a combinatorial optimization problem. The present invention uses SIC technology to effectively implement and manage the concurrent transmission of cluster nodes, combined with power control design, to obtain higher achievable throughput while reducing the energy loss of transmission nodes, thereby obtaining higher network energy efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] Figure 1 It is a network topology diagram of the prior art;
[0021] Figure 2 It is a schematic diagram of the SIC decoding process;
[0022] Figure 3 is a flow chart of an embodiment of the present invention;
[0023] Figure 4 is a schematic diagram of intra-cluster data collection according to an embodiment of the present invention;
[0024] Figure 5 is a schematic diagram of an M-Level non-uniform scheduling model in an implementation manner of the present invention;
[0025] Figure 6 It is a logical schematic diagram of a scheduling frame in an implementation manner of the present invention. DETAILED DESCRIPTION
[0026] The present invention will be further described below in conjunction with specific embodiments. It should be understood that these embodiments are only used to illustrate the present invention and are not intended to limit the scope of the present invention. In addition, it should be understood that after reading the content taught by the present invention, those skilled in the art can make various changes or modifications to the present invention, and these equivalent forms fall within the scope limited by the appended claims of the application equally.
[0027] The embodiment of the present invention relates to a method for collecting data within a cluster based on SIC scheduling and power control. The network used in the method is composed of multiple fixed sensor nodes and a sink node. Each sensor node is equipped with an omnidirectional antenna and operates in half-duplex mode. In addition, each sensor node has continuous interference cancellation capability and can remove interference signals without error. Figure 3 As shown, the specific steps include:
[0028] S1, network initialization and clustering
[0029] After the network deployment is completed, the network is divided into several clusters according to the upper layer protocol. Each cluster contains a cluster head node and multiple cluster member nodes. The cluster head node collects the perception data of the previous hop cluster head node and the member nodes in the cluster for fusion processing.
[0030] S2 constructs the SIC feasible region
[0031] Define a cluster head node R h The SIC feasible region A is centered SIC . Classify the member nodes in the cluster into SIC feasible nodes and SIC infeasible nodes.
[0032] When constructing the SIC feasible area, in order to improve the transmission efficiency, the SIC technology is introduced to avoid transmission interference during link concurrency, so that the cluster head node R h After receiving the previous hop cluster head node Sh Data can be received from multiple cluster member nodes at the same time. Figure 4 shown.
[0033] In order to allow multi-node concurrency without affecting the transmission quality, we first define a cluster head node R h The SIC feasible area A with the center as the circle SIC , whose radius is:
[0034] in, Indicates the previous hop cluster head node S h To cluster head node R h distance, α is the path loss exponent, usually 2≤α≤6, β represents the cluster head node R h Successfully received from the previous hop cluster head node S h The minimum SINR required for the signal.
[0035] The SIC feasible area radius is derived as follows:
[0036] According to the SIC principle, each node must meet the following conditions to successfully transmit data:
[0037]
[0038] in, and are the previous hop cluster head node S h and the transmit power of each concurrent cluster member node; Represented as the distance R between each node h The distance, σ 2 Represents the noise power.
[0039] When the cluster head node R h Data can be received successfully when both of the above conditions are met. The above formula can be converted to
[0040]
[0041] Therefore, under SIC, the cluster head node R h The probability of successfully receiving data is:
[0042]
[0043] Note that when hour,
[0044]
[0045] Because, σ 2 >0 always holds, so p SIC (R h )=0.
[0046] Therefore, we first define a SIC feasible area A SIC , with cluster head node R h As the center, For the radius, when the cluster member nodes outside the SIC feasible area are concurrent, That is, the signal cannot be received simultaneously using SIC.
[0047] When cluster member nodes in the SIC feasible area transmit data simultaneously, the cluster head node can use SIC to receive data from multiple nodes without sacrificing communication quality. On the contrary, cluster member nodes outside the SIC feasible area cannot send data simultaneously. Therefore, the member nodes in the cluster are divided into SIC feasible nodes and SIC infeasible nodes.
[0048] S3 non-uniform M-Level scheduling model
[0049] Then, the SIC feasible area is divided into an M-layer non-uniform ring. In each level of the ring, a SIC feasible node can be selected as a concurrent cluster member node to form a set of SIC concurrent cluster nodes that can transmit in the same time slot (without violating the SINR requirement).
[0050] In this step, after the SIC feasible area is determined, the SIC feasible area is divided into a non-uniform M-Level ring, where the radius of the i-th level ring is: in, is the transmission power of the previous hop cluster head node, is a concurrent cluster member node S i of transmission power.
[0051] The derivation process of the radius of the i-th level ring is as follows:
[0052] When using SIC to receive information from multiple nodes, the probability of successful transmission is
[0053]
[0054] When there are no other cluster member nodes concurrently, the cluster head node R h The SINR condition that needs to be met to successfully receive the data from the previous hop cluster head node is:
[0055] The probability of successful link transmission at this time is:
[0056] Compare SIC (R h ) and p T (R h ), only when
[0057]
[0058] The probability of successful transmission when multiple nodes are concurrent is equal to the probability of successful transmission when there are no concurrent nodes. That is, when the above formula is satisfied, SIC can effectively avoid transmission interference when links are concurrent, thereby improving throughput without affecting transmission quality.
[0059] Assume that there is a set of cluster member nodes Φ in the SIC feasible region t ={S1,S2,…,S M}Send data at the same time, the decoding order is S M ,S M-1 ,…,S1, in order to ensure the transmission quality of concurrent transmission, the SIC concurrent cluster node distance R h The distance satisfies:
[0060]
[0061] The following two cases are discussed
[0062] (1) When i=1
[0063] According to (B.1), we have:
[0064] The above formula is converted to:
[0065] Theorem holds
[0066] (2) When i>1
[0067] Assume that When , formula (B.2) always holds, that is, for all i = [2, m],
[0068]
[0069] When i=m+1, according to the formula, we have:
[0070]
[0071] The above formula can be converted to
[0072]
[0073] The proof is established.
[0074] A SIC concurrent cluster member node can be selected from each level of the ring to form a set of cluster member nodes Φ = {S1, S2, ..., S M} send data at the same time, the transmission interference caused by the concurrent transmission of this node set can be completely eliminated by SIC, so that the cluster head node R hReceive multiple node information simultaneously without affecting communication quality.
[0075] The M-Level non-uniform scheduling model in this implementation is as follows: Figure 5 As shown, to successfully decode multiple signals, the received signal power must meet certain SINR constraints. Therefore, SIC can only decode a limited number of signals. The maximum number of signals that can be decoded by the receiver satisfies: in, Represents the cluster head node R h The strongest interference signal strength received, σ 2 Represents the noise power.
[0076] The derivation process of the maximum number of decodable numbers of the receiver is as follows:
[0077] Assume that all sending nodes arrive at the receiving node R h Receive power ranking
[0078] Lemma 1: Any sending node satisfies the condition
[0079]
[0080] prove:
[0081] (1) i = 1
[0082] When decoding the weakest signal, all previous stronger interferences are removed from the composite interference, and the SINR condition is met:
[0083] (2) i>1
[0084] Assuming that formula (C.1) holds, when i=l, it satisfies:
[0085]
[0086] When i=l+1, when decoding the signal from i=l+1, it satisfies:
[0087]
[0088] The proof is established.
[0089] Theorem: Assume C max is the receiving node R h The upper bound of the number of signals that can be decoded, R h The maximum received power is At the receiving node R h The number of signals that can be successfully decoded is no greater than
[0090]
[0091] Proof: Assume is the received power of any group of successfully decoded signals. Combined with Lemma 1, the maximum received power satisfy
[0092]
[0093] The maximum number of decodable numbers is:
[0094] The proof is established.
[0095] Therefore, the maximum number of layers of M in the M-Level non-uniform scheduling model satisfies:
[0096] S4 Scheduling and Power Control Strategy
[0097] Then, to improve the energy efficiency of transmission, the SIC scheduling and power control decision is converted into a combinatorial optimization problem. The time is divided into T time slots of equal length. In each time slot, the concurrent cluster nodes are selected according to the non-uniform M-Level scheduling model to minimize the sum of the transmission power of the concurrent nodes in all time slots. The concurrent cluster member node set Φ of each time slot is determined. t And the corresponding optimal transmission power.
[0098] In this step, the time is divided into T time slots of equal length. In each time slot, a group of cluster member nodes are scheduled to transmit data simultaneously. The logical representation of the scheduling frame is as follows: Figure 6 As shown, using SIC, the signal is decoded from top to bottom. In the first time slot, the signal from S1 is decoded first, and then the signals from S2 and S3 are decoded in sequence.
[0099] The key to optimal scheduling and transmission power control is to find a scheduling matrix and transmission power matrix that maximizes the network objective function, and determine a group of concurrent cluster member nodes and the corresponding optimal transmission power to transmit data simultaneously in each time slot.
[0100] Assume that there is a set of cluster member nodes Φ in a time slot t t ={S1,S2,…,S M}Send data at the same time, the decoding order is S M ,S M-1 ,…,S1, cluster member node S i The throughput is:
[0101]
[0102] It can be seen that the throughput of each cluster member node depends on the scheduled time period and the order in which the signals are decoded.
[0103] In addition, the cluster head node S h The throughput is:
[0104] In time slot t, cluster member node S i , With cluster head node S h The total throughput of the time slot is:
[0105] According to the total throughput formula, the total throughput in time slot t has nothing to do with the decoding order of the concurrent nodes, but is related to the transmission power of each concurrent node and the distance from the cluster receiving node R. h is related to the distance.
[0106] In addition, it can be seen from the total throughput formula that, on the one hand, when M tends to infinity, the sum of the throughput of the scheduling nodes also tends to infinity. Within the range of decoding allowed by SIC, concurrent transmission can greatly improve the system throughput. On the other hand, the greater the transmission power of each concurrent node, the greater the sum of the throughput, but excessive transmission power will increase the energy loss of the network and reduce the service life of the node. It can be seen that there is a balance between the throughput and energy consumption of the network.
[0107] The average energy consumed per bit of data transmitted in time slot t is: in,
[0108] According to the formula, the energy consumed by transmitting data per bit per time slot is proportional to the total transmission power of the concurrent cluster member nodes, that is, the total transmission power of the concurrent cluster member nodes is The larger it is, the more energy is consumed per bit of data transmission. The derivation process is as follows:
[0109] The average energy consumed per bit of data transmitted in time slot t is:
[0110]
[0111] in, make The above formula is converted to:
[0112]
[0113] right The derivative is:
[0114]
[0115] make Taking its derivative we get:
[0116]
[0117] when hour, Equal to 0, that is, when hour, is an increasing function, when hour, is a decreasing function, since hour, so is always greater than 0, so is an increasing function, The bigger, The larger the value, the greater the total transmission power of the concurrent cluster member nodes. The larger it is, the more energy is consumed per bit of data transmitted.
[0118] In order to improve the energy efficiency of transmission, the SIC scheduling and power control decision is converted into a combinatorial optimization problem, with the goal of minimizing the sum of the transmission power of concurrent nodes in all time slots, and determining the set of concurrent cluster member nodes in each time slot Φ t And the corresponding optimal transmission power, so that the average energy consumed per bit of transmitted data is minimized, and the objective function is defined as:
[0119] According to the non-uniform M-Level scheduling model, the distance from the i-th level SIC concurrent link to the receiving end satisfies the constraint condition:
[0120]
[0121] It can be seen that the transmission power of the i-th level SIC concurrent node satisfies:
[0122]
[0123] In summary, the objective function and constraints are defined as follows:
[0124]
[0125] st
[0126]
[0127] Therefore, by solving an optimal solution, we can obtain the SIC concurrent node set Φ for each time slot. t and the optimal transmission power of each node in the SIC concurrent set.
[0128] S5 Data Collection
[0129] Finally, the cluster head node notifies the concurrent set Φ in each time slot tThe member nodes in the cluster transmit data simultaneously with the optimal transmission power, and the cluster head node completes the data collection and fusion.
[0130] It is not difficult to find that the present invention utilizes SIC technology to effectively implement and manage concurrent transmission of cluster nodes, and combines power control design to obtain higher achievable throughput while reducing energy loss of transmission nodes, thereby obtaining higher network energy efficiency.
Claims
1. A method for collecting intra-cluster data based on SIC scheduling and power control. It is characterized in that The following steps are involved: (1) Define a cluster head node R h The SIC feasible region A is centered SIC , and classify the member nodes in the cluster into SIC feasible nodes and SIC infeasible nodes; wherein the SIC feasible region A SIC The radius is: in, Indicates the previous hop cluster head node S h To cluster head node R h distance, α is the path loss index, β represents the cluster head node R h Successfully received from the previous hop cluster head node S h The minimum SINR required for the signal; (2) Constructing a non-uniform M-Level scheduling model, wherein the non-uniform M-Level scheduling model is used to determine a group of concurrent cluster member nodes that can achieve concurrent transmission without affecting the communication quality; when constructing the non-uniform M-Level scheduling model, the SIC feasible area is divided into a non-uniform M-Level ring, and a SIC feasible node is selected in each level of the ring as a concurrent cluster member node to form a set of concurrent cluster member nodes that can transmit in the same time slot; the radius of the i-th level ring in the non-uniform M-Level scheduling model is: in, is the transmission power of the previous hop cluster head node, is a concurrent cluster member node S i The transmission power of the cluster head node R h Successfully received from concurrent cluster member node S i The minimum SINR required for the signal; the situation that does not affect the communication quality refers to the maximum number of SIC decodable C max satisfy: Represents the cluster head node R h The strongest interference signal strength received, σ 2 represents the noise power; the maximum number of layers M of the non-uniform M-Level scheduling model satisfies: (3) In each time slot, a concurrent cluster member node is selected according to the non-uniform M-Level scheduling model, with the goal of minimizing the sum of the transmission powers of the concurrent cluster member nodes in all time slots, and determining the concurrent cluster member node set and the optimal transmission power for each time slot; wherein the objective function is expressed as: in, represents the total transmission power of concurrent cluster member nodes at time slot t, Φ t represents the set of concurrent cluster member nodes selected by the non-uniform M-Level scheduling model at time slot t, and T represents the number of time slots; the constraints are: C1: in, Represents the concurrent cluster member node S i To cluster head node R h The distance C2: P max Indicates the maximum transmit power; (4) Cluster head node R h In each time slot, the cluster member nodes in the set of concurrent cluster member nodes in the time slot are notified to transmit data simultaneously with the optimal transmission power.
Citation Information
Patent Citations
Cross-layer optimization method of wireless sensor network charging policy based on serial interference cancellation
CN109362086A
Non-orthogonal multiple access energy efficiency optimization method based on spatial modulation in unmanned aerial vehicle communication
CN112788725A
