Detailed Description
The system model of the present invention is shown in fig. 1. The transmitting end is provided with an energy collecting device and a chargeable battery with limited capacity, wherein the energy collecting device collects energy from the surrounding environment and converts the energy into electric energy to be stored in the battery, so as to provide energy for the transmitting end. After the information generated by the information source is subjected to channel coding and modulation, a symbol with a symbol period of T s is generated and sent to a channel for transmission. The length of the slot is recorded as T ts,Tts>>Ts. The transmitting end dynamically adjusts the transmitting power, the modulation mode and the coding parameters according to the instantaneous channel state and the energy collection condition, and maximizes the long-term time average information transmission rate.
The information sequence generated by the information source takes k bits as a group, and n-bit code words are obtained after binary channel coding, and the code elements after coding are modulated to obtain the transmitting symbols. Let the channel bandwidth be B Hz and the symbol rate R s = B Baud. Assuming that the modulation order is M, the transmission rate of the information is
And x (t) is a unit power signal obtained after modulation at a transmitting end. Assuming that the channel is a flat fading channel, the channel coefficient is h (t), which remains unchanged during one slot. The sending signal is transmitted through a channel, and the signal received by the receiving end is that
Wherein P T (t) is signal transmission power, N (t) is additive Gaussian white noise with average value of 0 and power spectrum density of N 0/2.
Assume that the set of alternative modulation schemes is Ω= { BPSK, QPSK,16QAM,64QAM,256QAM }. When the modulation is adopted, the Bit Error Rate (BER) after demodulation of the receiving end is as follows
Where N 0 is the single-sided power spectral density of additive white gaussian noise,E bav is the average bit energy of the received signal, expressed as a Gaussian Q function
T s is the symbol period, and h (T) is the channel coefficient. The demodulated binary symbol sequence is sent to a decoder for channel coding for decoding by taking the code word as a unit. For block codes with error correction capability of r, when the error occurring in one code word does not exceed r, the error can be corrected, and the probability of the decoder to decode correctly is
For the calculation of the number of combinations, n is the code length.
Codewords that are decoded in error will be discarded. The invention takes the rate of correctly transmitting information on unit bandwidth as an index for measuring the system performance, and the expression is that
K represents the information bit length, M represents the modulation order, R represents the error correction capability, R bt represents the number of information bits transmitted per time slot by the transmitting end, and P eb represents the bit error rate.
The power consumption P (t) of the transmitting end includes the power consumption P cc (t) of the circuit in addition to the power consumption P T (t) of the transmitting signal. The circuit power consumption can be divided into coding circuit power consumption P c (t), modulation circuit power consumption P m (t) and other circuit power consumption P A, namely
P(t)=Pc(t)+Pm(t)+PA+PT(t)=Pcc(t)+PT(t)
The power consumption of a channel encoder is related to the information rate and can be expressed as
Pc(t)=σ1·Rbt
Wherein σ 1 is a constant coefficient, and is related to a specific adopted coding mode, a coding circuit, a circuit parameter and the like. The power consumption of the modulator is proportional to the number of binary symbols modulated per second and can be expressed as
Pm(t)=σ2·Blog2M
Where σ 2 is a constant, a specific value is related to the circuit or signal processing device.
The total power P (t) consumed by the transmitting end in the t time slot is limited by the battery storage capacity E b (t) and the maximum discharge power P d,max:
let the maximum capacity of the battery be E B and the maximum charging power of the rechargeable battery be P c,max. The energy collected by the time slot t is E a (t), and the energy E H (t) stored in the battery by the time slot t can be expressed as
0≤EH(t)≤min(Ea(t),Tts·Pc,max,EB-(Eb(t)-Tts·P(t)))
Wherein the last term of the minimum function is the remaining storage capacity of the battery. After charging and discharging in one time slot, the electric quantity in the battery is updated to
Eb(t+1)=Eb(t)-Tts·P(t)+EH(t)
E H (t) represents the energy of the time slot t to the battery.
It is known that P eb is related to the transmission power P T and the modulation order M, and the error correction capability r of channel coding is related to the code rate. To avoid the change of the length of the code word after coding, the code rate of the coding is generally adjusted in the communication system by changing the information length k in the code word. It is obvious that the larger the transmission power is, the higher the information transmission rate of the current time slot is, but the available energy of the transmitting end is limited, and energy needs to be reasonably allocated and used among the time slots according to the channel state under the constraint of the available energy. The larger M, k is, the higher the information rate sent by the sending end is, but the higher the error probability is, and M, k also affects the power consumption of the coding and modulation circuit, so that the appropriate M, k needs to be selected in combination with the sending power and the channel state, so that the actual information transmission rate is maximized. By combining the analysis, the optimization problem of the invention is to perform joint optimization on the transmission power, the modulation order M and the information bit length k of each time slot under the constraint of energy collection, and maximize the long-term average information transmission rate of the system:
Eb(t+1)=Eb(t)-Tts·P(t)+EH(t)
M∈Ω
k∈K
where E [. Cndot. ] denotes the desired operation, K is a set of selectable information bit lengths in one codeword, and T denotes the total duration of the simulation in relation to the selected channel coding.
Rewriting constraint E b(t+1)=Eb(t)-Tts·P(t)+EH (t) to be
Eb(t+1)-Eb(t)=EH(t)-Tts·P(t)
Time slot T has from 0 to T-1
Superposing the two ends and obtaining the expected availability
Dividing the left and right ends by T, and obtaining the limit of T-infinity
Wherein,Representing the average energy collected per slot and the average power consumption at the transmitting end, respectively. The meaning of the above formula is that the energy collected by the system should be totally consumed in the long term to keep balance between energy collection and use. Relaxing single-slot battery power constraint in optimization problem into long-term time power constraint, and converting the optimization problem into
M∈Ω
k∈K
Delta (X (t)) represents Lyapunov drift, X (t) represents a battery energy virtual queue, V represents a weight between drift and penalty terms, and R b (t) represents a rate of correctly transmitting information per unit bandwidth.
The objective function and constraint condition of the optimization problem relate to long-term average, and the joint optimization of the whole transmission process is required to be carried out under the condition of having future energy collection and channel fading change conditions or statistical information thereof, so that the solving complexity is high. The invention adopts Lyapunov optimization framework to convert long-term average constraint into maintaining virtual queue stability, and approximates the random optimization problem by single time slot optimization. Firstly, constructing a battery energy virtual queue of a transmitting end:
X(t)=Eb(t)-A
Where A is an offset for controlling the charge level of the battery. The update formula of the easily available energy virtual queue according to the battery power update formula E b(t+1)=Eb(t)-Tts·P(t)+EH (t) is as follows
X(t+1)=X(t)-Tts·P(t)+EH(t)
Defining a quadratic Lyapunov function:
lyapunov drift is defined as
The smaller the drift, the smaller the change in queue length between two slots, the closer the battery charge is to a, and the more stable the battery charge. If the energy deficiency line can be kept stable, i.e. the electric quantity of the battery fluctuates within a limited range, the collected energy and the consumed energy are equal in the long term. Taking the negative value of the information transmission rate R b to be maximized as a penalty term, constructing a drift plus penalty together with Lyapunov drift:
Δ(X(t))-VE[Rb(t)|X(t)]
Where V is the weight between the drift and penalty terms. If "drift plus penalty" can be minimized, the transmission rate of information is maximized while maintaining the stability of the virtual queue (i.e., battery power), i.e., satisfying E b(t+1)=Eb(t)-Tts·P(t)+EH (t). The effect of the weight V in the "drift plus penalty" is to trade off the stability of the queue and the maximization of the transmission rate. The drift plus penalty has an upper bound, and the optimization is changed into the minimization of the upper bound, so that the complexity of solving the optimization problem can be further reduced, and the method can be obtained
In the formula (E b(t)-Tts·P(t))2 is a non-negative finite value, so that there is a non-negative constant C to satisfy
Thus there is
ΔX(t)≤C+X(t)E[EH(t)-Tts·P(t)|X(t)]
The upper bound of "drift plus penalty" can be obtained as
ΔX(t)-VE[Rb(t)|X(t)]≤C+X(t)E[EH(t)-Tts·P(t)|X(t)]-VE[Rb(t)|X(t)]
The optimization problem may be approximated with a minimization of the "drift plus penalty" upper bound that removes constraint E b(t+1)=Eb(t)-Tts·P(t)+EH (t). Further removing the mean value operation in the upper bound and substituting the expression of the rate, the optimization problem can be converted into a single-slot optimization problem:
M∈Ω
k∈K
The above method adds a negative sign to the optimization objective function, changes the minimization into the maximization, and the constraint condition Has been satisfied by virtual queue stabilization and therefore no longer appears in the optimization problem.
Recording the optimization objective function in the optimization problem as F (P T (t), M, k), and expanding the expression of the total power P (t) to obtain
The objective function contains three optimization variables, wherein the modulation order M and the information bit length k are discrete values with a limited number, and the transmission power P T (t) under each combination can be optimized by traversing all possible combinations of the modulation order and the information bit length, and M, k and the corresponding P T (t) which maximize the objective function are selected as optimal solutions. The solution of optimal P T (t) given M, k is discussed first below.
The transmission rate of the current slot increases as P T (t) increases, so does the value of item 2 in the objective function. It is apparent that when X (t) > 0, the objective function is a monotonically increasing function of the signal transmission power P T (t). At this time, in order to maximize the objective function, the signal transmission power P T (t) should take the maximum value under the support of the battery discharge power and the stored energy:
In the practical physical sense, X (t) is equal to or greater than 0, which indicates that enough electric quantity in the battery supports information transmission. When X (t) <0, item 1 in the objective function decreases with an increase in P T (t), while item 2 increases with an increase in P T (t), so that it is not possible to directly judge the monotonicity of the optimized objective function, requiring further analysis.
Obtaining the partial derivative of the objective function to the transmission power P T (t) to obtain
If it isWhen the target function is monotonically decreasing, the sending power should be 0; otherwise, the maximum point of the objective function in the range of [0, P T,max (t) ] needs to be found, namely, the maximum point of the objective function meets the requirementIs a solution to (a). Observing the partial derivative expression and the BER expression, it is easy to know that the equation is a high-order nonlinear equation containing integral and exponential functions and related to P T (t), and an analytical solution of the equation cannot be obtained, so that the invention adopts a numerical method to solve. Since there may be more than one extreme point, the transmission power range P T,min,PT,max](PT,min is first divided into a plurality of cells of delta 1, and if the maximum point is included in each cell, the golden section method is then used to find the maximum point. For the ith cell, if there is a maximum point in that region, the objective function is incremented in the right neighborhood of P i and decremented in the left neighborhood of P i+δ1. Thus, if F (P i)<F(Pi+δ2) and F (P i+δ1-δ2)>F(Pi+δ1), there is a maximum point in this interval, where δ 2<δ1 is a small constant. After finding all the extreme points, comparing the objective function values at each extreme point and the boundary point P T,min、PT,max, and selecting the point with the maximum objective function as the optimal power point. The flow of the search is shown in fig. 2.
Any channel coding has a characteristic that when the sequence error probability of an incoming decoder exceeds a certain threshold, the decoding error probability is high, and only when the input sequence error probability is lower than the threshold, the error correction capability of the coding can be exerted, and the error probability of an output sequence can be rapidly reduced along with the reduction of the input error probability. According to the limit of the decoder input error probability threshold BER P eb,max, there is a corresponding minimum received signal power requirement for the modulation mode, corresponding to the minimum transmit power P T,min in the current channel state. If the current channel condition and P T,min>PT,max under the modulation scheme indicate that the BER using the modulation scheme exceeds the threshold required by the channel coding, the BER cannot be used.
After obtaining the optimal transmit power for all available channel coding, modulation scheme combinations, their objective function values F (P T (t), M, k) are compared, and the modulation order and information bit length combination that maximizes the objective function is selected, and the corresponding transmit power is the solution to the optimization problem.
Summarizing the adaptive optimization solution algorithm as shown in algorithm 2:
There are two parameters in the optimization problem, namely the weight V in the "drift plus penalty" and the offset a in the virtual battery level queue. The weight reflects the importance of the system to the optimization target, and the greater the weight value, the system tends to consume more electric quantity so that the current time slot obtains a larger transmission rate, but at the same time, the fluctuation of the electric quantity is increased, and the average electric quantity of the battery is reduced; the smaller the weight value, the lower the transmission rate optimization strength of a single time slot, but the average electric quantity of the battery is increased, and a larger energy scheduling space exists among the time slots. The offset is used for controlling the electric quantity level of the battery, the larger the offset is, the smaller the value of the virtual queue is under the same electric quantity of the battery, the smaller the transmission power is selected in the optimization, and the higher the average electric quantity of the battery is; the smaller the offset, the lower the average power of the battery, and the more preferable the transmission power is selected in the optimization. Both parameters being too large or too small can adversely affect the long-term performance of the system, with optimum values being related to the random nature of the channel and energy, etc. However, even in the case of statistical distribution information of channel fading and energy arrival, it is difficult to obtain optimal values of the two parameters by a mathematical analysis method, and in the case of unknown statistical distribution, it is impossible to determine in advance. One of the features of the Lyapunov method is that the system is adaptively controlled independent of statistical information and future state information of the system, so that both parameters should be adaptively adjusted.
Both the weight V and the virtual queue offset a have a direct effect on the battery charge fluctuation and the average charge level, so that they can be adjusted appropriately according to the charge state of the battery over time. On the premise of not knowing prior information, the data can be divided into different classes by clustering, so that elements in the same class are similar as much as possible, and element differences in different classes are as large as possible. The K-means algorithm is simple, the time complexity and the data integration are in linear relation, and the execution efficiency of the algorithm is high when the data set is small. According to the invention, battery electric quantity points in a period of time are divided into different clusters by using a K-means clustering method based on a sliding window, and fluctuation and average characteristics of the battery electric quantity are reflected by using the relation between the electric quantity in the clusters and the electric quantity among the clusters. The sliding window is recorded as l in size, and the window at the current moment is the past l time slots. The whole thought of the self-adaptive adjustment algorithm is as follows: k-means clustering is carried out on the battery electric quantity of the current sliding window, and the average electric quantity after clusteringAnd weighted average powerAnd (5) analyzing to further determine whether the electric quantity of the battery is stable. Updating the values of the weights and offsets once every d slots toWhether the electric quantity is in the allowable fluctuation range is judged according to whether the electric quantity is stable, and if the electric quantity is not stable, the weight is adjusted; to be used forAnd adjusting the offset according to whether the upper threshold value and the lower threshold value are exceeded.
And taking the time and the electric quantity as coordinates in a two-dimensional Euclidean space, determining a point in the Euclidean space by the time and the battery electric quantity of the time, calculating Euclidean distance between the points, dividing the points in the sliding window into m clusters according to the Euclidean distance, and expressing the electric quantity at the center of the cluster as E c,i, wherein i=1. The average electric quantity and the weighted average electric quantity in the sliding window are respectively
Wherein w i is the weight of the ith cluster, which satisfiesThe closer in time to the current slot the greater the weight of the cluster center, i.e., w 1<w2<…<wi. Taking the ratio of the weighted average electric quantity to the average electric quantity as the electric quantity ascending and descending trend ratio in the sliding window of the time slot t:
the electric quantity up-down trend ratio represents the electric quantity change trend in a sliding window and can be used for measuring the stability of the electric quantity of the battery. q 1 (t) >1 shows a tendency of increasing the amount of electricity in the current sliding window, and q 1 (t) <1 shows a tendency of decreasing. A range [ gamma min,γmax ] is set, and if q 1 (t) is within the range, the electric quantity can be considered to be stable, otherwise the electric quantity fluctuation is considered to be excessive, and the weight should be adjusted. If q 1(t)>γmax shows that the battery power increases rapidly with time, the weight should be increased appropriately to increase the transmission power. If q 1(t)<γmin indicates that the battery charge decreases too rapidly with time, the weight should be reduced appropriately. The step length of the weight adjustment is in direct proportion to the difference value of the weighted average electric quantity and the average electric quantity in the sliding window, and the difference value reflects the increasing or decreasing degree of the electric quantity under the current sliding window. The formula of weight adjustment is
Wherein b 1 is a constant, and V (t-d) is the value of the weight of the previous parameter adjustment time.
The offset a directly affects the average charge of the battery. Defining the relative average electric quantity in the sliding window as the ratio of the average electric quantity to the battery capacity:
For the average power in the sliding window, E B is the battery capacity, when it is between the upper and lower thresholds η max and η min, η min≤q2(t)≤ηmax, indicating that the battery power is maintained in the proper range, the offset does not need to be adjusted, otherwise the offset needs to be adjusted. The formula of the adjustment is
Wherein b 2 is a fixed constant.
The present invention will be described in further detail with reference to the accompanying drawings. Unless otherwise specified, the parameters in the simulation were set as follows: the channel coefficient h (t) obeys a complex gaussian distribution with a mean of 0 and a variance of 2x 10 -9, i.e. the channel attenuation is 87dB; the energy arrival process of the transmitting end is subjected to a poisson process with composite uniform distribution, the arrival rate is lambda=0.5 units/time slot, and the energy of each unit is subjected to uniform distribution between [0,0.2] J; battery capacity E B =50j, initial battery charge of 15J, maximum discharge and charge power of P c,max =0.6w and P d,max =1.2w, respectively; the slot length T ts =1 s, the simulation duration t=1× 5 s; the maximum BER limited by the channel codec is P eb,max=2.5×10-2; noise power spectral density N 0=1×10-17 W/Hz; bandwidth b=1×10 6 Hz, symbol rate R s=1×106 Baud. In algorithm 1The sliding window length in parameter adjustment, i=100 s, the number of clusters, m=4, the weights of the central power points after clustering, w i, i=1,., the set of m is {0.1,0.2,0.3,0.4}, the adjustment interval d=10s for the weights and offsets, the adjustment thresholds are γ min=0.6,γmax=1.4,ηmax=0.8,ηmin=0.1;b1 and b 2 are 0.025 and 0.01, respectively. If not specifically stated, the initial value of the offset a of the battery virtual queue is 42, and the initial value of the penalty weight V is 2.5.
The (n, K, r) BCH code is selected as channel coding, the code length is n=255, and the value set of the information bit length K is K= {247,239,231,223,215,207,199,191,187,179,171,163,155,147,139,131}. The encoding circuit employs a feedback shift register circuit comprising k shift registers and an average of about k/2 exclusive OR (adder). Assuming CMOS circuitry, ignoring static power consumption of the circuitry, the power consumption of a shift register or an exclusive OR is at each clock cycle
Eco=α·CL·Vdd 2
Where α=1 is an activity factor, C L=1.5×10-11 f=15pf is a load capacitance, and V dd =1.0v is an operating voltage. The coding circuit performs a shift operation in one clock cycle, the clock frequency is equal to the rate R s=B·log2 M of the output code element of the coder, so the power consumption of the coder is
T ts is a unit time slot, and modulation is accomplished by using a digital signal processor, for example, a C55x series processor of TI, which operates at a power as low as 0.15mW/MHz. When an M-order modulation mode is adopted, log 2 M operations are needed to be carried out on each symbol obtained by modulation, and Blog 2 M operations are needed to be carried out each second. Assuming that the operation is completed once every two clocks, the power consumption of the modulation part is
Pm(t)=3×10-10·Blog2M
B is the channel bandwidth, M is the modulation order, and the other circuit power consumption is set to P A =0.011W.
The effectiveness of the adaptive adjustment algorithm of the weight V and the offset A is verified. Firstly, the optimal values of the weight and the offset of the highest long-term average information transmission rate can be obtained under the set simulation conditions by a two-dimensional searching method through a computer. And fixing the weight and the offset in the Lyapunov optimization algorithm to the optimal value, and simulating to obtain the long-term average rate serving as a reference for the performance evaluation of the self-adaptive adjustment of the weight and the offset. Fig. 3 shows a three-dimensional plot of average information transmission rate over 5000 slots as a function of offset and weight. It can be seen that the average information transmission rate of the system is highest at the weight v=2.5 and the offset a=42.
Fig. 4 shows the trajectory of the average information transmission rate over time from the start of the simulation to the current slot when the weights V and the offsets a are set to different initial values and adaptively adjusted, these two parameters respectively fixing the average rates of 2.5, 42 set to be optimal as a reference. It can be seen that in the algorithm for adaptively adjusting the weight and the offset, when the initial values are different, the transmission rate values of the initial simulation segment are different, but as the simulation proceeds, the average information transmission rates under different initial values gradually tend to be consistent, and are slightly lower than the average transmission rate with the weight and the offset fixed as the optimal values. This is because the adaptive adjustment process of the weights and offsets is a gradual convergence process, and there is a performance penalty due to the fact that the parameters deviate more from the optimal values at the beginning of the simulation. As the simulation proceeds, the parameters gradually converge to an optimal value, and the performance gradually increases and approaches the optimal value. Simulation results show that the parameter self-adaptive adjustment algorithm provided by the invention is effective.
To verify the performance of the algorithm of the present invention, it is compared with the offline water-filling algorithm, the half-power algorithm, and the fixed ratio algorithm. A specific description of several comparison algorithms follows. (1) offline water-filling algorithm: the transmitting end obtains the change condition of the channel and the energy collection condition in the whole transmission process before transmission, and obtains the total power consumption of the system according to the total energy collected in the transmission process, and the causality of the electric quantity use and the overflow of the battery electric quantity are not considered. And then under the constraint of the total power consumption, adopting an alternate iterative water injection algorithm to obtain the optimal transmission power with the maximized average channel capacity, and combining the optimal modulation order and the information bit length under the transmission power. (2) half-power algorithm (Half Power Algorithm, HPA): the total energy consumed per time slot is half of the current charge in the battery, i.e
(3) Fixed ratio algorithm (Fixed Fraction Policies, FFP): the total energy consumed per time slot is a fixed proportion of the available energy of the battery, the proportion being the ratio of the multiple of the average energy reached over a long period to the battery capacity, the specific multiple value being set in relation to the overflow of the battery charge, expressed as
When the average information transmission rates of the half-power algorithm and the fixed-ratio algorithm are simulated, the total power is obtained according to the algorithm, then the circuit power consumption and the corresponding transmission power under the combination of each modulation order M and the information bit length k are calculated, then the respective information transmission rate R b (t) is calculated, and the maximum value is selected as the information transmission rate reached by the algorithm.
Fig. 5 shows the variation trace of the average information transmission rate of different algorithms with time, and the average information transmission rate per time slot is the average value of the information transmission rates from the simulation start to the current time slot. Simulation results show that the theoretical and actual transmission rates realized by the algorithm of the invention are higher than those of the half-power algorithm and the fixed algorithm. The half power algorithm and the fixed proportion algorithm are used for calculating the transmitting power according to the battery power only, and the influence caused by the change of the channel state is not considered, so that the performance is obviously lower than that of the algorithm optimized according to the channel state and the energy constraint. The optimization objective of the offline water-filling algorithm is to maximize the theoretical long-term average information transmission rate, so that the algorithm is superior to the algorithm in the invention in average channel capacity, and has 1.6% of advantages compared with the algorithm in the invention. However, the off-line water injection algorithm does not have the three variables of modulation order, coding information bit length and transmitting power, and the algorithm of the invention performs the joint optimization of the three variables with the aim of maximizing the actual reachable transmission rate, so that the actual reachable information transmission rate is higher than the algorithm although the channel capacity is lower than that of the off-line water injection algorithm, and the method has the advantage of 9.4 percent.
Fig. 6 shows the variation trace of the battery power of the 3 on-line algorithms with time, and the off-line water injection algorithm directly distributes the power of the total collected energy, without considering the overflow condition of the battery power, so the variation trace of the battery power is not shown. Simulation results show that the battery electric quantity of the algorithm provided by the invention can fluctuate at a certain level, and enough electric quantity is provided for information transmission in each time slot battery, and enough storage space is reserved for the collected energy. The half-power algorithm consumes the pre-stored electric quantity in a short time, and then the electric quantity is stabilized at a very low level; the fixed ratio algorithm is too conservative in power consumption, only uses the fixed ratio part of the stored power in the existing battery, and is not adjusted according to the channel state, so that the performance is lower, and meanwhile, the possibility of overflow of the collected energy is increased due to the smaller residual space of the battery.
In order to verify the applicability of the algorithm, the average transmission rate is simulated under a random wind power generation model and an energy random model with the arrival energy obeying Bernoulli distribution, besides the simulation is performed when the energy arrival process is the composite Poisson uniform distribution. (1) wind power generation: the output electric power P a of the wind power generation module is
Pa=0.5ρSCpvT 3η1η2
Wherein ρ is air density, the simulation takes density of 1.22kg/m 3;vT at 20 ℃ as wind speed which changes randomly, and the simulation is carried out by adopting a four-component random model; the wind energy utilization coefficient C p is 0.593; s is the swept area of the fan blade, the relation between the s=pi R 2;η1 =0.94 and the radius of the fan blade is the energy conversion efficiency of the gear box; η 2 =0.52 is the energy conversion efficiency of the motor.
(2) Bernoulli distribution: the energy reached per time slot is an independent and equidistributed bernoulli random variable:
Where the probability p is the probability of energy arrival.
Fig. 7 shows simulation results of the long-term average information transmission rate as a function of the energy arrival rate λ when the energy obeys the poisson process of composite uniform distribution. As the energy arrival rate increases, the average transmit power of the signal increases, and thus the average information transmission rate of all algorithms increases. Compared with the comparison algorithm, the algorithm of the invention can obtain higher information transmission rate because the transmission power, the modulation mode and the coding parameters are jointly optimized at the practically reachable transmission rate maximization. Since the fixed ratio algorithm and the half power algorithm do not consider the channel condition, the achieved information transmission rate differs significantly from the present invention. The water-filling algorithm is optimized by maximizing the theoretical channel capacity, and the information transmission rate which can be achieved under the practically available channel coding and modulation is not the maximum.
Fig. 8 shows simulation results of the long-term average transmission rate of different fan blade radii R in the wind power generation model. As can be seen from the figure, as the radius of the fan blade increases, the swept area of the wind power generator increases, and the output electric power increases, so that a higher information transmission rate can be obtained. The information transmission rate which can be achieved by the algorithm of the invention is still highest, and then the off-line water injection algorithm and the half-power algorithm are lowest.
Fig. 9 shows simulation results of the long-term average transmission rate of different energy arrival probabilities p when the energy obeys the bernoulli distribution. As can be seen from the figure, as the probability of energy arrival increases, the average transmit power increases, and the information transmission rate increases accordingly. Similar to fig. 8 and 9, the transmission rate obtainable by the algorithm of the present invention is still the highest, followed by the off-line water-filling algorithm and the half-power algorithm is the lowest.