Research article Special Issues

The impact of network delay on Nakamoto consensus mechanism

  • Nakamoto consensus is prevailing in the world largest blockchain-based cryptocurrency systems, such as Bitcoin and Ethereum. Since then, various attempts have been studied to attack Nakamoto consensus worldwide. In recent years, network delay has won more attention for making inconsistent ledgers in blockchain-based applications by virtue of attacking Nakamoto consensus. However, so far as we know, most of the existing works mainly focus on constructing inconsistent ledgers for blockchain systems, but not offering fine-grained theoretical analysis for how to optimize the success probability by flexibly dividing computational power and network delay from the viewpoint of adversary. The paper first utilizes network delay and the partition of controlled computation power of honest miners for making forks as long as possible. Then, formally analysis is provided to show the success probability of the proposed attack, and compute the optimal network delay and splitting for adversarial computation power in theory. Finally, simulation experiments validate the correctness of the formal analysis.

    Citation: Shaochen Lin, Xuyang Liu, Xiujuan Ma, Hongliang Mao, Zijian Zhang, Salabat Khan, Liehuang Zhu. The impact of network delay on Nakamoto consensus mechanism[J]. Electronic Research Archive, 2022, 30(10): 3735-3754. doi: 10.3934/era.2022191

    Related Papers:

    [1] Liping Wang, Runqi Liu, Yangyang Shi . Dynamical analysis of a nonlocal delays spatial malaria model with Wolbachia-infected male mosquitoes release. Electronic Research Archive, 2025, 33(5): 3177-3200. doi: 10.3934/era.2025139
    [2] Songbai Guo, Xin Yang, Zuohuan Zheng . Global dynamics of a time-delayed malaria model with asymptomatic infections and standard incidence rate. Electronic Research Archive, 2023, 31(6): 3534-3551. doi: 10.3934/era.2023179
    [3] Gaohui Fan, Ning Li . Application and analysis of a model with environmental transmission in a periodic environment. Electronic Research Archive, 2023, 31(9): 5815-5844. doi: 10.3934/era.2023296
    [4] Wenxuan Li, Suli Liu . Dynamic analysis of a stochastic epidemic model incorporating the double epidemic hypothesis and Crowley-Martin incidence term. Electronic Research Archive, 2023, 31(10): 6134-6159. doi: 10.3934/era.2023312
    [5] Xueyong Zhou, Xiangyun Shi . Stability analysis and backward bifurcation on an SEIQR epidemic model with nonlinear innate immunity. Electronic Research Archive, 2022, 30(9): 3481-3508. doi: 10.3934/era.2022178
    [6] Tao Zhang, Mengjuan Wu, Chunjie Gao, Yingdan Wang, Lei Wang . Probability of disease extinction and outbreak in a stochastic tuberculosis model with fast-slow progression and relapse. Electronic Research Archive, 2023, 31(11): 7104-7124. doi: 10.3934/era.2023360
    [7] Yike Lv, Xinzhu Meng . Evolution of infectious diseases induced by epidemic prevention publicity and interaction between heterogeneous strains. Electronic Research Archive, 2024, 32(8): 4858-4886. doi: 10.3934/era.2024223
    [8] Ting Kang, Qimin Zhang, Qingyun Wang . Nonlinear adaptive control of avian influenza model with slaughter, educational campaigns and treatment. Electronic Research Archive, 2023, 31(8): 4346-4361. doi: 10.3934/era.2023222
    [9] Jia Chen, Yuming Chen, Qimin Zhang . Ergodic stationary distribution and extinction of stochastic pertussis model with immune and Markov switching. Electronic Research Archive, 2025, 33(5): 2736-2761. doi: 10.3934/era.2025121
    [10] Wenhui Niu, Xinhong Zhang, Daqing Jiang . Dynamics and numerical simulations of a generalized mosquito-borne epidemic model using the Ornstein-Uhlenbeck process: Stability, stationary distribution, and probability density function. Electronic Research Archive, 2024, 32(6): 3777-3818. doi: 10.3934/era.2024172
  • Nakamoto consensus is prevailing in the world largest blockchain-based cryptocurrency systems, such as Bitcoin and Ethereum. Since then, various attempts have been studied to attack Nakamoto consensus worldwide. In recent years, network delay has won more attention for making inconsistent ledgers in blockchain-based applications by virtue of attacking Nakamoto consensus. However, so far as we know, most of the existing works mainly focus on constructing inconsistent ledgers for blockchain systems, but not offering fine-grained theoretical analysis for how to optimize the success probability by flexibly dividing computational power and network delay from the viewpoint of adversary. The paper first utilizes network delay and the partition of controlled computation power of honest miners for making forks as long as possible. Then, formally analysis is provided to show the success probability of the proposed attack, and compute the optimal network delay and splitting for adversarial computation power in theory. Finally, simulation experiments validate the correctness of the formal analysis.



    In the eco-environment, there are a large number of pests or annoying animals such as rodents and mosquitoes that can spread diseases or destroy crops or livestock. They are called vermin. In addition, vermin have the strong reproductive abilities, which makes it necessary to control them [1]. Usually, chemical drugs are used to poison the vermin, which will pollute the environment and destroy the ecological system. In addition, long-term use of chemical drugs will make the vermin resistant to drugs, which makes it impossible to control the vermin effectively for a long time. Ecological research shows that reducing the reproduction rate is an effective way to manage the over-abundance of species. Currently, female sterilant is used to reduce the size of vermin [2,3]. This is because, compared with chemical drugs, sterilants not only have the advantage of not polluting the environment, but also have the dual effects of causing sterility and death of vermin.

    Since the reproductive ability of vermin is related to the age of individuals [4], we can use first-order partial differential equations coupled with integral equations to simulate the dynamics of vermin [5,6]. Along this line, many studies have appeared on population models. To name a few, see [7,8,9,10] for age-dependent models, and [11,12,13,14,15] for size-structured models. Aniţa and Aniţa [7] considered two optimal harvesting problems related to age-structured population dynamics with logistic term and time-periodic control and vital rates. The control variable is the harvest effort, which only depends on time and only appears in the principal equation. Li et al. [9] studied the optimal control of an age-structured model describing mosquito plasticity. He et al. [10] investigated the optimal birth control problem for a nonlinear age-structured population model. The control variable is the birth rate and only appears in the boundary condition. He and Liu [11] and Liu and Liu [12] discussed optimal birth control problems for population models with size structures. Li et al. [13] investigated the optimal harvesting problem for a size-stage-structured population model and the control variable is the harvest effort for the adult population.

    However, only a small amount of work is directly aimed at the contraception control problems for vermin with individual structure [16,17], and no work has yet considered the reproduction law of vermin in modeling. In this paper, we will formulate a nonlinear hierarchical age-structured model to discuss the optimal contraception management problem for vermin. The so-called hierarchical structure of the population is to rank individuals according to their age, body size, or any other structural variables that may affect their life rate [18]. Moreover, Gurney and Nisbet [18] pointed out that the hierarchy of ranks in a population is one of the important factors to maintain species' persistence and ecological stability. Most studies on the hierarchical population models mainly discuss the existence, uniqueness, and numerical approximation of solutions [19,20], and the asymptotic behavior of solutions [18,21]. However, studies on optimal control problems of hierarchical population models are rather rare. He and his collaborators have investigated optimal harvesting problems in hierarchical species [22,23]. The control variables are the harvest effort and only appear in the principal equation.

    Compared with known closely related ones, our model has the following features. Firstly, the control function is the amount of sterilant ingested by an individual, which depends on the individual's age. Secondly, the control variable appears not only in the principal equation (distributed control) but also in the boundary condition (boundary control). Thirdly, the reproduction rate of vermin depends not only on the age of individuals but also on the mechanism of encounters between males and females and an "internal environment". Fourthly, the mortality of vermin depends not only on the intrinsic and weighted total size of vermin but also on the influence of ingested sterilant. The model obtained in this paper is a nonlinear integro-partial differential equation with a global feedback boundary condition. Based on this model, this paper will investigate how to apply the female sterilant to minimize the final size of vermin when the control cost is the lowest.

    In this paper, firstly, the existence of a unique non-negative solution is established based on Theorem 4.1 of [14]. More importantly, by transforming the model into a system of two subsystems, we show that the solution has a separable form. Then, the existence of an optimal policy is discussed with compactness and minimization sequences. To show the compactness, we use the Fréchet-Kolmogorov Theorem and its generalization. Next, the Euler-Lagrange optimality conditions are derived by employing adjoint systems and normal cones techniques. The high nonlinearity of the model makes it difficult to construct the adjoint system. For this reason, we give a new continuous result, that is, the continuity of the solution of an integro-partial differential equation with respect to its boundary distribution and inhomogeneous term.

    Let us make some comments on the difference between our methods and results from those of closely related works. Aniţa and Aniţa [7] only gave the first order necessary optimality conditions by using an adjoint system and normal cones techniques. Li et al. [13] only discussed the existence of the optimal solution for a harvest problem via a maximizing sequence. Hritonenko et al. [15] only gave the maximum principle for a size-structured model of forest and carbon sequestration management via adjoint system. Kato [14] only discussed the existence of the optimal solution for a nonlinear size-structured harvest model by means of a maximizing sequence.

    In this section, taking the reproduction law of vermin into consideration, we will formulate a hierarchical age-structured model to discuss the optimal contraception management problem for vermin. Ecological studies show that the reproduction of vermin follows the following laws [4]:

    (1) The reproductive ability of vermin is related to the age of individuals;

    (2) Most vermin are polygamous hybridization;

    (3) A large proportion of females increases the reproductive intensity of vermin;

    (4) The average number of offspring from middle-aged and elderly individuals is more than that of individuals who first participate in reproduction.

    To build our model, let p(a,t) denote the density of vermin with age a at time t, and a be the maximum age of survival of vermin.

    Firstly, we simulate the reproduction process. Note that most vermin are polygamous hybridization. As in [24], we should consider the mechanism of encounters between males and females when describing the birth process. Here we assume that the sex ratio is determined by fixed environmental or social factors, and ω(a) (0<ω(a)<1) is the proportion of females with age a. Then the number of males at time t is

    S(t)=a0[1ω(a)]p(a,t)da.

    Further, we introduce the function B(a,S(t)) to represent the number of males encountered by a female with age a per unit time.

    From (3) and (4), we see that middle-aged and elderly females play a dominant role in reproduction of vermin. Thus, there exist dominant ranks of individuals in vermin [22]. As in [19], one can assume that the fertility of vermin is related to its "internal environment" E(p)(a,t), which is given by

    E(p)(a,t)=αa0ω(r)p(r,t)dr+aaω(r)p(r,t)dr,0α<1.

    The parameter α is the hierarchical coefficient, which is the weight of the lower ranks (i.e., age smaller than a). From [21], α=0 (i.e., "contest competition") implies an absolute hierarchical structure, whereas α tending to 1 means that the effect of higher ranks is similar to that of lower ranks. Moreover, the limiting case α=1 (i.e., "scramble competition") means that there is no hierarchy. Hence, the fertility of vermin can be defined as ˜β(a,t,E(p)(a,t)), which denotes the average number of offspring produced per an encounter of a male with a female with age a at time t.

    Next, we simulate the sterile process and death process. In order to inhibit the excessive reproduction of vermin, humans put female sterilant into their living environment of vermin. For the convenience of modeling, we assume that the sterilant used at any time will be completely eaten by vermin (including males), and individuals of the same age will eat the same amount of sterilant at the same time [16]. Liu et al. pointed out that sterilant can not only cause sterility of vermin but also kill them [25]. Thus, when the amount of sterilant ingested by an individual with age a at time t is u(a,t), we can use δ1u(a,t) and δ2u(a,t), respectively, to describe the mortality and infertility rates caused by ingestion of sterilant. Hence, the density of fertile females with age a at time t can be written as [1δ2u(a,t)]ω(a)p(a,t), and the total number of newborns that are produced at time t is given by

    a0˜β(a,t,E(p)(a,t))B(a,S(t))[1δ2u(a,t)]ω(a)p(a,t)da.

    Next we denote β(a,t,E(p)(a,t),S(t))˜β(a,t,E(p))B(a,S(t))ω(a). In addition, the restriction of living space or habitat can lead to an increase of mortality. Thus, in addition to natural mortality μ(a,t) and external mortality δ1u(a,t), we assume that the vermin also has a mortality Φ(I(t)), which depends on the total size I(t) weighted by m(a). That is,

    I(t)=a0m(a)p(a,t)da.

    Finally, we build our model. Motivated by the above discussions, in this paper, we propose the following hierarchical age-structured model to describe the contraception control problem of vermin

    {p(a,t)t+p(a,t)a=f(a,t)[μ(a,t)+δ1u(a,t)+Φ(I(t))]p(a,t),(a,t)D,p(0,t)=a0β(a,t,E(p)(a,t),S(t))[1δ2u(a,t)]p(a,t)da,t[0,T],p(a,0)=p0(a),a[0,a),I(t)=a0m(a)p(a,t)da,S(t)=a0[1ω(a)]p(a,t)da,t[0,T],E(p)(a,t)=αa0ω(r)p(r,t)dr+aaω(r)p(r,t)dr,(a,t)D, (2.1)

    where D=(0,a)×(0,T) and T(0,+) is the control horizon. f(a,t) is the rate of immigration. The control variable uU={uL(D):0u(a,t)L,a.e.(a,t)D}, where L>0 is a constant. Biologically, we have δ2L<1. Let pu(a,t) be the solution of (2.1) with uU. The optimization problem discussed in this paper is

    minuU J(u), (2.2)

    where

    J(u)=a0pu(a,T)da+T0[r(t)a0u(a,t)pu(a,t)da]dt.

    Here the first integral represents the total number of vermin at time T, while r(t)a0u(a,t)pu(a,t)da is the cost of infertility control at time t. The purpose of this paper is to investigate how to apply female sterilant to minimize the final size of vermin when the control cost is the lowest.

    After rewriting our model (see Section 3), we see it is a special case of (4.1) in [14]. Note this model contains some exiting ones. Assume that β(a,t,E(p)(a,t),S(t))=β(a,t) and Φ(I(t))=0. If δ1=δ2=0, then our model reduces to model (2.1.1) in [6]; if δ1=1 and δ2=0, then model (2.1) becomes the harvest control model (3.1.1) in [6]. Assume that f(a,t)=0, m(a)=1, and β(a,t,E(p)(a,t),S(t))=β(a,t). Then we get model (2.2.15) in [6] by letting δ1=δ2=0 and the harvest control model (3.2.1) in [6] by letting δ1=1 and δ2=0. Moreover, if we take f(a,t)=0, m(a)=1, δ1=δ2=0 and β(a,t,E(p)(a,t),S(t))=β(a,t)ω(a,t), then model (2.1) improves the age-structured birth control model in [10].

    Let R+[0,+), L1+L1(0,a;R+) and L+L(0,a;R+). In this paper, we assume that:

    (A1) For each t[0,T], μ(,t)L1loc[0,a) and a0μ(a,t)da=+.

    (A2) Φ:R+R+ is bounded, that is, there is a constant ˉΦ>0 such that Φ(s)ˉΦ for all sR+. Moreover, there is an increasing function CΦ:R+R+ such that

    |Φ(s1)Φ(s2)|CΦ(r)|s1s2|,0s1,s2r.

    (A3) β:D×R+×R+R+ is measurable and 0β(a,t,s,q)ˉβ for some ˉβ>0. Moreover, there exists an increasing function Cβ:R+R+ such that for a[0,a) and t[0,T]

    |β(a,t,s1,q1)β(a,t,s2,q2)|Cβ(r)(|s1s2|+|q1q2|),0s1,s2,q1,q2r.

    (A4) fL(0,T;L1+), p0L1+, ωL+, mL+ and 0ω(a)ˉω<1, 0m(a)ˉm for any a[0,a). Here ˉω and ˉm are positive constants.

    In this section, we show that (2.1) admits solutions in a separable form. First, we show (2.1) is well posed. For any uU and ϕL1, let

    G(t,ϕ)(a)=f(a,t)[μ(a,t)+δ1u(a,t)+Φ(Iϕ)]ϕ(a),a[0,a), (3.1)
    F(t,ϕ)=a0β(a,t,E(ϕ)(a),Sϕ)[1δ2u(a,t)]ϕ(a)da, (3.2)

    where Iϕ=a0m(a)ϕ(a)da, E(ϕ)(a)=αa0ω(r)ϕ(r)dr+aaω(r)ϕ(r)dr a[0,a), and Sϕ=a0[1ω(a)]ϕ(a)da. Then (2.1) can be written in the following general form

    {p(a,t)t+p(a,t)a=G(t,p(,t))(a),(a,t)[0,a)×[0,T],p(0,t)=F(t,p(,t)),t[0,T],p(a,0)=p0(a),x[0,a).

    This is a special case of (4.1) in [14] with V(x,t)=1. Obviously, under (A1)(A4), G satisfies (G0) and (G1) in [14]. Now, we show F satisfies (F0) and (F1) in [14]. For any ϕiL1 with ϕiL1r (i=1,2), we have

    |E(ϕi)(a)|=|αa0ω(r)ϕi(r)dr+aaω(r)ϕi(r)dr|ˉωa0|ϕi(r)|drϕiL1r,|Sϕi|=|a0[1ω(a)]ϕi(a)da|a0|ϕi(r)|dr=ϕiL1r.

    Then, by (A3), we get

    |β(a,t,E(ϕ1)(a),Sϕ1)β(a,t,E(ϕ2)(a),Sϕ2)|Cβ(r)|αa0ω(r)[ϕ1(r)ϕ2(r)]dr+aaω(r)[ϕ1(r)ϕ2(r)]dr|+Cβ(r)|a0[1ω(a)][ϕ1(a)ϕ2(a)]da|Cβ(r){αa0|ω(r)||ϕ1(r)ϕ2(r)|dr+aa|ω(r)||ϕ1(r)ϕ2(r)|dr}+Cβ(r)a0[1ω(a)]|ϕ1(a)ϕ2(a)|da(ˉω+1)Cβ(r)a0|ϕ1(r)ϕ2(r)|dr=(ˉω+1)Cβ(r)ϕ1ϕ2L1.

    Hence,

    |F(t,ϕ1)F(t,ϕ2)|a0|β(a,t,E(ϕ1)(a),Sϕ1)β(a,t,E(ϕ2)(a),Sϕ2)||ϕ1(a)|da+a0|β(a,t,E(ϕ2)(a),Sϕ2)||ϕ1(a)ϕ2(a)|da(ˉω+1)Cβ(r)ϕ1ϕ2L1a0|ϕ1(a)|da+ˉβa0|ϕ1(a)ϕ2(a)|da[(ˉω+1)Cβ(r)r+ˉβ]ϕ1ϕ2L1.

    Let CF(r)=(ˉω+1)Cβ(r)r+ˉβ. By (A3), we know that CF is an increasing function. Thus, (F0) in [14] holds. Clearly, F satisfies (F1) in [14]. In addition, take ω1(t)=f(,t)L1 and ω2(t)=ˉβ. Then all conditions of [14] are satisfied. Similar to the proof of [14], we have the following result.

    Theorem 3.1. For each uU, model (2.1) has a unique global solution pC([0,T];L1+), which satisfies

    p(,t)L1eˉβtp0L1+t0eˉβ(ts)f(,s)L1ds. (3.3)

    Next we consider the solution of model (2.1) in the following form

    p(a,t)=y(t)ˉp(a,t). (3.4)

    From (2.1) and (3.4), we get two subsystems about ˉp(a,t) and y(t) as follows

    {ˉp(a,t)t+ˉp(a,t)a=f(a,t)y(t)[μ(a,t)+δ1u(a,t)]ˉp(a,t),(a,t)D,ˉp(0,t)=a0β(a,t,y(t)E(ˉp)(a,t),y(t)ˉS(t))[1δ2u(a,t)]ˉp(a,t)da,t[0,T],ˉS(t)=a0[1ω(a)]ˉp(a,t)da,t[0,T],E(ˉp)(t)=αa0ω(r)ˉp(r,t)dr+aaω(r)ˉp(r,t)dr,t[0,T],ˉp(a,0)=p0(a),a[0,a), (3.5)
    {y(t)+Φ(y(t)ˉI(t))y(t)=0,t[0,T],ˉI(t)=a0m(a)ˉp(a,t)da,t[0,T],y(0)=1. (3.6)

    Definition 1. A pair of functions (ˉp(a,t),y(t)) with ˉpC([0,T];L1+) and yC([0,T];R+) is said to be a solution of (3.5)–(3.6) if it satisfies

    ˉp(a,t)={Fy(τ,ˉp(,τ))+tτGy(s,ˉp(,s))(st+a)ds,at,p0(at)+t0Gy(s,ˉp(,s))(st+a)ds,a>t, (3.7)
    y(t)=exp{t0Φ(y(s)ˉI(s))ds}, (3.8)

    where τ=ta, ˉI(s)=a0m(a)ˉp(a,s)da, and

    Fy(t,ϕ)=a0β(a,t,y(t)E(ϕ)(a),y(t)Sϕ)[1δ2u(a,t)]ϕ(a)da,Gy(t,ϕ)(a)=μ(a,t)ϕ(a)δ1u(a,t)ϕ(a)+f(a,t)y(t),a[0,a)

    for t[0,T] and ϕL1. Here E(ϕ)(a)=αa0ω(r)ϕ(r)dr+aaω(r)ϕ(r)dr and Sϕ=a0[1ω(a)]ϕ(a)da.

    Denote θexp{ˉΦT}>0 and define S={hC[0,T]:θh(t)1,t[0,T]}. In addition, define an equivalent norm in C[0,T] by

    hλ=supt[0,T]eλt|h(t)|forhC[0,T] (3.9)

    for some λ>0. Clearly, (S,λ) is a Banach space.

    For any yS, by Theorem 3.1, system (3.5) has a unique non-negative solution ˉpyC([0,T];L1+) satisfying

    ˉpy(,t)L1eˉβtp0L1+t0eˉβ(ts)f(,s)y(s)L1dseˉβtp0L1+t0eˉβ(ts)f(,s)L1y(s)dseˉβT(p0L1+f(,)L1(D)θ)r0. (3.10)

    Lemma 3.2. There is a positive constant M such that

    ˉpy1(,t)ˉpy2(,t)L1Mt0|y1(s)y2(s)|ds, (3.11)
    eλtˉpy1(,t)ˉpy2(,t)L1Mλy1y2λ (3.12)

    for all t[0,T] and y1, y2S.

    Proof. Since (3.12) can be obtained directly from (3.11), we only need to prove (3.11). For any yS, from (3.10) and 0<ω(a)ˉω<1, it follows that

    |E(ˉpy)(a,t)|=|αa0ω(a)ˉpy(a,t)da+aaω(a)ˉpy(a,t)da|ˉωa0|ˉpy(a,t)|dar0, (3.13)
    |ˉSy(t)|=|a0[1ω(a)]ˉpy(a,t)da|a0|ˉpy(a,t)|dar0, (3.14)

    and

    |E(ˉpy1)E(ˉpy2)|(a,t)=|αa0ω(r)[ˉpy1ˉpy2](r,t)dr+aaω(r)[ˉpy1ˉpy2](r,t)dr|αa0|ω(r)||ˉpy1ˉpy2|(r,t)dr+aa|ω(r)||ˉuy1ˉuy2|(r,t)drˉωa0|ˉpy1ˉpy2|(a,t)daˉpy1(,t)ˉpy2(,t)L1, (3.15)
    |ˉSy1(t)ˉSy2(t)|=|a0[1ω(a)]ˉpy1(a,t)daa0[1ω(a)]ˉpy2(a,t)da|a0|ˉpy1(a,t)ˉpy2(a,t)|da=ˉpy1(,t)ˉpy2(,t)L1. (3.16)

    Moreover, using (3.7), we have

    ˉpy1(,t)ˉpy2(,t)L1=t0|ˉpy1(a,t)ˉpy2(a,t)|da+at|ˉpy1(a,t)ˉpy2(a,t)|dat0|Fy1(τ,ˉpy1(,τ))Fy2(τ,ˉpy2(,τ))|da+t0tτ|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dsda+att0|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dsdaI1+I2+I3. (3.17)

    It follows from Fubini's Theorem that

    I2+I3=t0tts|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dads+t0at|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dads=t0ats|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dads.

    Using the transformation s=ta, we have s=t when a=0 while s=0 when a=t, and ds=da. Thus, by (3.13)–(3.16), we obtain

    I1=t0|a0β(a,s,y1(s)E(ˉpy1)(a,s),y1(s)ˉSy1(s))[1δ2u(a,s)]ˉpy1(a,s)daa0β(a,s,y2(s)E(ˉpy2)(a,s),y2(s)ˉSy2(s))[1δ2u(a,s)]ˉpy2(a,s)da|dsˉβt0a0|ˉpy1(a,s)ˉpy2(a,s)|dads+Cβ(r0)t0a0[|E(ˉpy1)E(ˉpy2)|(a,s)+|ˉSy1(s)ˉSy2(s)|]|ˉpy2(a,s)|dads+Cβ(r0)t0a0[E(ˉpy2)(a,s)+ˉSy2(s)]|y1(s)y2(s)||ˉpy2(a,s)|dadsˉβt0ˉpy1(,s)ˉpy2(,s)L1ds+2Cβ(r0)r0t0|y1(s)y2(s)|a0|ˉpy2(a,s)|dads+2Cβ(r0)t0ˉpy1(,s)ˉpy2(,s)L1a0|ˉpy2(a,s)|dads(ˉβ+2Cβ(r0)r0)t0ˉpy1(,s)ˉpy2(,s)L1ds+2Cβ(r0)r20t0|y1(s)y2(s)|ds. (3.18)

    Using the transformation η=st+a, we have η=0 when a=ts while η=st+aa (ts0) when a=a, and dη=da. Thus, we obtain

    I2+I3t0a0|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(η)dηdst0a0|(μ(η,s)+δ1u(η,s))(ˉpy1(η,s)ˉpy2(η,s))+(f(η,s)y1(s)f(η,s)y2(s))|dηds(ˉμ+δ1L)t0a0|ˉpy1(η,s)ˉpy2(η,s)|dηds+t0a0|f(η,s)y1(s)f(η,s)y2(s)|dηds=(ˉμ+δ1L)t0a0|ˉpy1(η,s)ˉpy2(η,s)|dηds+t0|1y1(s)1y2(s)|f(,s)L1ds(ˉμ+δ1L)t0ˉpy1(,s)ˉpy2(,s)L1ds+fL(0,T;L1)θ2t0|y1(s)y2(s)|ds. (3.19)

    Here ˉμ is the upper bound of μ(a,t). From (3.17)–(3.19), we have

    ˉpy1(,t)ˉpy2(,t)L1(ˉβ+2Cβ(r0)r0+ˉμ+δ1L)t0ˉpy1(,s)ˉpy2(,s)ds+(2Cβ(r0)r20+fL(0,T;L1)θ2)t0|y1(s)y2(s)|ds. (3.20)

    Then (3.11) follows from Gronwall's inequality.

    Theorem 3.3. For any p0L1+ and uU, (3.5)–(3.6) has a unique solution (ˉpy,y)C([0,T];L1+)×C([0,T];R+). In addition, p(a,t)=ˉpy(a,t)y(t) is the unique solution of (2.1).

    Proof. First, we show that for any yS there is a unique ˉyS such that

    ˉy(t)=exp{t0Φ(ˉIy(s)ˉy(s))ds}. (3.21)

    Here ˉIy(t)=a0m(a)ˉpy(a,t)da. From (3.10), it is easy to show

    |ˉIy(t)|=|a0m(a)ˉpy(a,t)da|ˉma0|ˉpy(a,t)|daˉmr0r1. (3.22)

    For fixed ˉIy, define the operator A:SC[0,T] by

    [Ah](t)=exp{t0Φ(ˉIy(s)h(s))ds}forhS.

    Clearly, [Ah](t)θ for each hS. Thus, A maps S into itself. In addition, for any h1, h2S, we have

    (Ah1)(t)(Ah2)(t)λ=supt[0,T]{eλt|(Ah1)(t)(Ah2)(t)|}supt[0,T]{eλtt0|Φ(ˉIy(s)h1(s))Φ(ˉIy(s)h2(s))|ds}supt[0,T]{eλtCΦ(r1)r1t0eλseλs|h1(s)h2(s)|ds}CΦ(r1)r1λh1h2λ.

    Taking λ>0 large enough such that λ>CΦ(r1)r1, we see that A is a contraction on (S,λ). Fixed point theory shows that A owns a unique fixed point ˉy in S, and ˉy satisfies (3.21).

    Next, based on (3.21), we define another operator B:SS by

    By=ˉyforyS. (3.23)

    For any y1, y2S, it is easy to show that

    |ˉIy1(s)ˉIy2(s)|=|a0m(a)ˉpy1(a,s)daa0m(a)ˉpy2(a,s)da|ˉmˉpy1(,s)ˉpy2(,s)L1.

    Then, together with (3.12), one yields

    eλtt0|ˉIy1(s)ˉIy2(s)|dsˉmeλtt0ˉpy1(,s)ˉpy2(,s)L1dsMˉmλ2y1y2λ.

    Further, it follows from (3.21) and (3.22) that

    eλt|˜y1(t)˜y2(t)|=eλt|(By1)(t)(By2)(t)|eλt|t0Φ(ˉIy1(s)ˉy1(s))dst0Φ(ˉIy2(s)ˉy2(s))ds|eλtCΦ(r1)t0|ˉIy1(s)ˉy1(s)ˉIy2(s)ˉy2(s)|dsCΦ(r1)Mˉmλ2y1y2λ+CΦ(r1)r1t0eλs|ˉy1(s)ˉy2(s)|ds. (3.24)

    The Gronwall's inequality implies

    eλt|ˉy1(t)ˉy2(t)|CΦ(r1)MˉmeCΦ(r1)r1Tλ2y1y2λ.

    Thus, B is a contraction on (S,λ) by choosing λ>0 such that CΦ(r1)MˉmeCΦ(r1)r1T/λ2<1. Let y be the unique fixed point of B in S. Then (ˉp,y)=(ˉpy,y) is the solution to (3.5)–(3.6), which is non-negative and bounded.

    Finally, from Theorem 3.1, model (2.1) has a unique solution. In addition, it is easy to verify that p(a,t)=ˉpy(a,t)y(t) satisfies (2.1). Thus, p(a,t)=ˉpy(a,t)y(t) is the unique solution to (2.1). In summary, model (2.1) has a unique non-negative solution p(a,t), which is uniformly bounded.

    Theorem 3.4. The solution pu of model (2.1) is continuous in uU. That is, for any u1, u2U, there are positive constants K1 and K2 such that

    p1p2L(0,T;L1(0,a))K1Tu1u2L(0,T;L1(0,a)),p1p2L1(D)K2Tu1u2L1(D),

    where pi is the solution of (2.1) with respect to ui(i=1,2).

    Proof. By Theorem 3.3, one has pi(a,t)=yi(t)ˉpyi(a,t), i=1,2. Here (ˉpyi,yi) is the solution of (3.5)–(3.6) with respect to uiU. From (3.10), it follows that

    p1(,t)p2(,t)L1ˉpy1(,t)ˉpy2(,t)L1+r0|y1(t)y2(t)|. (3.25)

    Recall that |ˉI(s)|r1. Then, by y(t)1, (A2), and (3.8), we obtain

    |y1(t)y2(t)|t0|Φ(y1(s)ˉIy1(s))Φ(y2(s)ˉIy2(s))|dsCΦ(r1)t0|y1(s)ˉIy1(s)y2(s)ˉIy2(s)|dsCΦ(r1)r1t0|y1(s)y2(s)|ds+CΦ(r1)ˉmt0ˉpy1(,s)ˉpy2(,s)L1ds.

    Applying the Gronwall's inequality produces

    |y1(t)y2(t)|M1t0ˉuy1(,s)ˉuy2(,s)L1ds, (3.26)

    where M1=C2Φ(r1)r1ˉmTeCΦ(r1)r1T+CΦ(r1)ˉm. Further, it can be seen from (3.7) that

    ˉpy1(,t)ˉpy2(,t)L1t0|Fy1(τ,ˉpy1(,τ))Fy2(τ,ˉpy2(,τ))|da+t0tτ|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dsda+att0|Gy1(s,ˉpy1(,s))Gy2(s,ˉpy2(,s))|(st+a)dsdaI4+I5+I6. (3.27)

    Arguing similarly as for I1 and I2+I3, respectively, we can show that

    I4ˉβt0ˉpy1(,s)ˉpy2(,s)L1ds+δ2ˉβt0ˉpy2(,s)L1a0|u1(a,s)u2(a,s)|dads+2Cβ(r0)t0ˉpy1(,s)ˉpy2(,s)L1a0|ˉpy2(a,s)|dads+2Cβ(r0)r0t0|y1(s)y2(s)|a0|ˉpy2(a,s)|dads(ˉβ+2Cβ(r0)r0)t0ˉpy1(,s)ˉpy2(,s)L1ds+2Cβ(r0)r20t0|y1(s)y2(s)|ds+δ2ˉβr0t0u1(,s)u2(,s)L1ds (3.28)

    and

    I5+I6t0a0|(f(η,s)y1(s)f(η,s)y2(s))μ(η,s)(ˉuy1(η,s)ˉuy2(η,s))δ1(u1(η,s)ˉpy1(η,s)u2(η,s)ˉpy2(η,s))|dηds=t0a0|(f(η,s)y1(s)f(η,s)y2(s))μ(η,s)(ˉuy1(η,s)ˉuy2(η,s))δ1u1(η,s)(ˉpy1(η,s)ˉpy2(η,s))δ1(u1(η,s)u2(η,s))ˉpy2(η,s)|dηds(ˉμ+δ1L)t0ˉpy1(,s)ˉpy2(,s)L1ds+δ1r0t0u(,s)u(,s)L1ds+fL(0,T;L1)θ2t0|y1(s)y2(s)|ds. (3.29)

    It follows from (3.27)–(3.29) that

    ˉpy1(,t)ˉpy2(,t)L1(ˉβ+2Cβ(r0)r0+ˉμ+δ1L)t0ˉpy1(,s)ˉpy2(,s)L1ds+(2Cβ(r0)r20+fL(0,T;L1)θ2)t0|y1(s)y2(s)|ds+(δ1r0+δ2ˉβr0)t0u1(,s)u2(,s)L1ds. (3.30)

    This, together with (3.26), yields

    ˉpy1(,t)ˉpy2(,t)L1M2t0ˉpy1(,s)ˉpy2(,s)L1ds+(δ1r0+δ2ˉβr0)t0u1(,s)u2(,s)L1ds,

    where M2=(ˉβ+2Cβ(r0)r0+ˉμ+δ1L)+M1T(2Cβ(r0)r20+fL(0,T;L1)θ2). By Gronwall's inequality, we have

    ˉpy1(,t)ˉpy2(,t)L1M3t0u1(,s)u2(,s)L1ds, (3.31)

    where M3=(δ1r0+δ2ˉβr0)(1++M2TeM2T). Substituting (3.26) and (3.31) into (3.25), one yields

    p1(,t)p2(,t)L1ˉpy1(,t)ˉpy2(,t)L1+r0M1t0ˉpy1(,s)ˉpy2(,s)L1dsM3(1+r0M1T)t0u1(,s)u2(,s)L1ds.

    The conclusion then follows immediately from the above analysis.

    The purpose of this section is to prove the existence of optimal management policy. To this end, we first establish two lemmas on compactness.

    Lemma 4.1. Let Iu(t)=a0m(a)pu(a,t)da and Su(t)=a0[1ω(a)]pu(a,t)da. Then {Iu:uU} and {Su:uU} are relatively compact sets in L2(0,T).

    Proof. We only show that {Iu:uU} is relatively compact in L2(0,T) as {Su:uU} can be dealt with similarity. For given ε>0 sufficiently small, define

    Iu,ε(t)=aε0m(a)pu(a,t)da.

    Since pu is uniformly bounded in u, there is a positive constant MT such that

    |Iu(t)Iu,ε(t)|=aaεm(a)pu(a,t)daˉmMTε,t[0,T],uU.

    Obviously, the relative compactness of {Iu,ε:uU} in L2(0,T) implies that the set {Iu:uU} is also relatively compact in L2(0,T).

    Now, by using Fréchet-Kolmogorov Theorem [26], we show that {Iu,ε:uU} is relatively compact in L2(0,T). For convenience, we denote Iu,ε(t)=0 if t<0 or t>T.

    1) For each uU, by Theorem 3.1, we have

    supuUIu,ε=supuU(R[Iu,ε(t)]2dt)12=supuU(T0[aε0m(a)pu(a,t)da]2dt)12supuU(ˉmT0[pu(,t)L1]2dt)12<+.

    2) It is easy to verify that

    limx+|s|>x[Iu,ε(s)]2ds=0.

    3) We need to show that limt0T0[Iu,ε(s+t)Iu,ε(s)]2ds=0 for any uU. Note that

    T0[Iu,ε(s+t)Iu(s,ε)]2ds=T0[s+tsdIu,ε(r)drdr]2ds|t|TT0(dIu,ε(r)dr)2dr.

    It suffices to show that dIu,ε(t)dt is uniformly bounded about u. Clearly,

    dIu,ε(t)dt=aε0m(a)pu(a,t)tda.

    Multiplying (2.1) by m(a) and integrating on (0,aε), one yields

    aε0m(a)pu(a,t)tda=aε0m(a){f(a,t)[μ(a,t)+δ1u(a,t)+Φ(Iu(t))]pu(a,t)}daaε0m(a)pu(a,t)adaI7+I8.

    By assumptions and Theorem 3.1, we know that I7 is uniformly bounded about u. For I8, by the second equation of (2.1), we obtain

    I8=m(aε)pu(aε,t)+m(0)pu(0,t)+aε0m(a)pu(a,t)da=m(0)aε0β(a,t,E(pu)(a,t),Sα(t))[1δ2u(a,t)]pu(a,t)da+a0m(a)pu(a,t)dam(aε)pu(aε,t).

    Similarly, I8 is also uniformly bounded about u. In summary, we have proved that dIu,ε(t)dt is uniformly bounded about u. Hence, we can obtain

    limt0T0[Iu,ε(s+t)Iu,ε(s)]2ds=0.

    Thus, by Fréchet-Kolmogorov Theorem, we know that {Iu,ε:uU} is relatively compact in L2(0,T). The proof is complete.

    Lemma 4.2. Let E(pu)(a,t)=αa0ω(r)pu(r,t)dr+aaω(r)pu(r,t)dr. Then the set {E(pu):uU} is relatively compact in L2(D).

    Proof. For given ε>0 sufficiently small, define

    Eε(pu)(a,t)=αa0ω(r)pu(r,t)dr+aεaω(r)pu(r,t)dr,(a,t)D.

    With a similar discussion as that in the proof of Lemma 4.1, we only need to show that {Eε(pu):uU} is relatively compact in L2(D). We shall use Fréchet-Kolmogorov Theorem (with S=R2) to prove this. For convenience, we extend Eε(pu) to R2 by defining Eε(pu)(a,t)=0 for (a,t)=R2D.

    1) For any uU, by Theorem 3.1, we have

    supuUEε(pu)=supuU(R2[Eε(pu)(a,t)]2dadt)12=supuU(T0a0[αa0ω(r)pu(r,t)dr+aεaω(r)pu(r,t)dr]2dadt)12supuU(ˉωT0a0[pu(,t)L1]2dadt)12<+.

    2) It is clear that

    limx+y+|a|>x|t|>y[Eε(pu)(a,t)]2dadt=0.

    3) It remains to show that

    limΔa0Δt0T0a0[Eε(pu)(a+Δa,t+Δt)Eε(pu)(a,t)]2dadt=0for anyuU. (4.1)

    Obviously, we have

    T0a0[Eε(pu)(a+Δa,t+Δt)Eε(pu)(a,t)]2dadt=T0a0[Eε(pu)(a+θ1Δa,t+Δt)aΔa+Eε(pu)(a,t+θ2Δt)tΔt]2dadt,

    where θ1, θ2[0,1]. To show (4.1), we should discuss the uniform boundedness of Eε(pu)(a,t)a and Eε(pu)(a,t)t with respect to u. Multiplying the first equation in model (2.1) by ω(a) and integrating on (0,aε), we obtain

    αa0ω(r)[pu(r,t)t+pu(r,t)r]dr+aεaω(r)[pu(r,t)t+pu(r,t)r]dr=αa0ω(r)[f(r,t)[μ(r,t)δ1u(r,t)Φ(Iu(t))]pu(r,t)]dr+aεaω(r)[f(r,t)[μ(r,t)δ1u(r,t)Φ(Iu(t))]pu(r,t)]dr.

    Thus,

    Eε(pu)(a,t)t=[αa0ω(r)pu(r,t)dr+aεaω(r)pu(r,t)dr]t=αa0ω(r)pu(r,t)tdr+aεaω(r)pu(r,t)tdr=αa0ω(r)[f(r,t)[μ(r,t)δ1u(r,t)Φ(Iu(t))]pu(r,t)]dr+aεaω(r)[f(r,t)[μ(r,t)δ1u(r,t)Φ(Iu(t))]pu(r,t)]dr[αa0ω(r)pu(r,t)rdr+aεaω(r)pu(r,t)rdr].

    Denote I9[αa0ω(r)pu(r,t)rdr+aεaω(r)pu(r,t)rdr]. Then, using the second equation in (2.1), we can obtain

    I9=[αω(a)pu(a,t)αω(0)pu(0,t)αa0ω(r)pu(r,t)dr+ω(aε)pu(aε,t)ω(a)pu(a,t)aεaω(r)pu(r,t)dr]=(1α)ω(a)pu(a,t)+αω(0)a0β(a,t,E(pu)(a,t),Sα(t))[1δ2u(a,t)]pu(a,t)da+αa0ω(r)pu(r,t)dr+aεaω(r)pu(r,t)drω(aε)pu(aε,t).

    Hence,

    Eε(pu)(a,t)t=αa0{ω(r)[f(r,t)[μ(r,t)δ1u(r,t)Φ(Iu(t))]pu(r,t)]+ω(r)pu(r,t)}dr+aεa{ω(r)[f(r,t)[μ(r,t)δ1u(r,t)Φ(Iu(t))]pu(r,t)]+ω(r)pu(r,t)}dr+(1α)ω(a)pu(a,t)+αω(0)a0β(a,t,E(pu)(a,t),Sα(t))[1δ2u(a,t)]pu(a,t)daω(aε)pu(aε,t).

    By assumptions and Theorem 3.1, Eε(pu)(a,t)t is uniformly bounded about u. On the other hand, we have

    Eε(pu)(a,t)a=αω(a)pu(a,t)ω(a)pu(a,t)=(α1)ω(a)pu(a,t).

    Similarly, E(pu)(a,t)a is also uniformly bounded about uU. Hence, we have (4.1).

    By now, we have verified all conditions of Fréchet-Kolmogorov Theorem (with S=R2) and hence {Eε(pu):uU} is relatively compact in L2(D). The proof is complete.

    Theorem 4.3. There is at least one solution to the optimal management problem (2.1)–(2.2).

    Proof. Let d=infuUJ(u). For any uU, by Theorem 3.1, we have

    0<J(u)pu(,T)L1+ˉrLT0pu(,t)L1dt<+.

    Thus, d[0,+). For any n1, according to the definition of d, there exists unU such that

    dJ(un)<d+1n.

    The boundness of {pun:unU} implies that there is a subsequence of {un}, still recorded as {un}, such that

    punweaklypinL2(D)asn+. (4.2)

    By Lemmas 4.1 and 4.2, there exists a subsequence of {un}, still recorded as {un}, such that

    IunI,SunS,E(pun)E(p), (4.3)
    Iun(t)I(t),Sun(t)S(t),E(pun)(a,t)E(p)(a,t), (4.4)

    as n+. Here I,SL2(0,T) and E(p)L2(D). Further, from (4.2)–(4.4), we can infer that

    I(t)=a0m(a)p(a,t)da,S(t)=a0[1ω(a)]p(a,t)da,t[0,T].E(p)(a,t)=αa0ω(r)p(r,t)dr+aaω(r)p(r,t)dr,(a,t)D.

    Moreover, by Mazur Theorem, we can obtain the convex combination of {pun} as follows

    ˜pn(a,t)=kni=n+1λnipui(a,t),λni0,kni=n+1λni=1,knn+1, (4.5)

    such that

    ˜pnstronglypinL2(D)asn+. (4.6)

    Now, define a new control sequence {˜un} as follows

    ˜un(a,t)={kni=n+1λnipui(a,t)ui(a,t)kni=n+1λnipui(a,t)ifkni=n+1λnipui(a,t)0,0ifkni=n+1λnipui(a,t)=0. (4.7)

    It is easy to verify that ˜unU. Since {˜un} is bounded, the weak compactness of bounded sequence implies that there is a subsequence of {˜un}, still recorded as {˜un}, such that

    ˜unweaklyuinL2(D)asn+.

    From (2.1), (4.5) and (4.7), it follows that

    {˜pnt+˜pna=f(a,t)[μ(a,t)+δ1˜un(a,t)]˜pn(a,t)kni=n+1λniΦ(Iui(t))pui(a,t),˜pn(0,t)=a0kni=n+1λniβ(a,t,E(pui)(a,t),Sui(t))[1δ2ui(a,t)]pui(a,t)da,˜pn(a,0)=p0(a), (4.8)

    where Iui(t)=a0m(a)pui(a,t)da, E(pui)(a,t)=αa0ω(r)pui(r,t)dr+aaω(r)pui(r,t)dr and Sui(t)=a0[1ω(a)]pui(a,t)da. From (A2)(A3) and the boundedness of pu, there is a positive constant M4 such that

    |kni=n+1λniβ(a,t,E(pui),Sui)[1δ2ui]puiβ(a,t,E(p),S)[1δ2u]p|kni=n+1λni|β(a,t,E(pui),Sui)β(a,t,E(p),S)||pui|+ˉβδ2|kni=n+1λniuipuiukni=n+1λnipui|+ˉβ|kni=n+1λnipuikni=n+1λnip|M4kni=n+1λni[|E(pui)(a,t)E(p)(a,t)|+|Sui(t)S(t)|]+ˉβδ2|˜un(a,t)˜pn(a,t)u(a,t)˜pn(a,t)|+ˉβ|˜pn(a,t)p(a,t)|.

    By (4.4) and (4.6), we get

    kni=n+1λniβ(a,t,E(pui)(a,t),Sui(t))[1δ2ui(a,t)]puiβ(a,t,E(p)(a,t),S(t))[1δ2u(a,t)]p

    as n+. Similarly, we also get

    kni=n+1λniΦ(Iui(t))pui(a,t)Φ(I(t))p(a,t)asn+.

    Hence, in the sense of weak solutions, we have p(a,t)=pu(a,t), I(t)=Iu(t), S(t)=Su(t) and E(p)(a,t)=E(pu)(a,t).

    Finally, arguing similarly as in the proof of [16], we can show that uU is an optimal policy for the management problem (2.2). This completes the proof.

    In this section, we will establish the optimality conditions for the management problem (2.2). For any uU, let TU(u) and NU(u) be, respectively, the tangent cone and normal cone of U at the element u [27]. To show the optimality conditions, we need the following two lemmas.

    Lemma 5.1. Assume that η0L1+, μi(i=1,2), βjL(D)(j=1,2,3), fnL1(D), bnL1[0,T], n1. Let ηn be the solution of

    {ηt+ηa=fn(a,t)μ1(a,t)η(a,t)μ2(a,t)I(t),(a,t)D,η(0,t)=a0[β1(a,t)η(a,t)+β2(a,t)S(t)+β3(a,t)E(η)(a,t)]da+bn(t),t[0,T],η(a,0)=η0(a),a[0,a),I(t)=a0m(a)η(a,t)da,S(t)=a0[1ω(a)]η(a,t)da,t[0,T],E(η)(a,t)=αa0ω(a)η(a,t)da+aaω(a)η(a,t)da,(a,t)D. (5.1)

    If (fn,bn)(f,b) in L1(D)×L1[0,T] as n+, then ηnη in L(0,T;L1(0,a)) as n+. Here η is the solution of (5.1) with respect to fn=f and bn=b.

    Proof. Similar to the prove of [14], model (5.1) has a unique solution. Moreover, on the characteristic lines, the solution to (5.1) has the form

    ηn(a,t)={F(τ,ηn(,τ))+tτG(s,ηn(,s))(st+a)ds,at,η0(at)+t0G(s,ηn(,s))(st+a)ds,a>t,

    where τ=ta and, for t[0,T] and ϕL1,

    F(t,ϕ)=a0[β1(a,t)ϕ(a)+β2(a,t)Sϕ+β3(a,t)E(ϕ)(a)]da+bn(t),G(t,ϕ)(a)=fn(a,t)μ1(a,t)ϕ(a)μ2(a,t)Iϕ,a[0,a).

    Here Sϕ=a0[1ω(a)]ϕ(a)da, E(ϕ)(a)=αa0ω(r)ϕ(r)dr+aaω(r)ϕ(r)dr, a[0,a) and Iϕ=a0m(a)ϕ(a)da.

    Let ηn and η be solutions of (5.1) with respect to (fn,bn) and (f,b), respectively. Then we have

    |SηnSη|(t)=|a0[1ω(a)]ηn(a,t)daa0[1ω(a)]η(a,t)da|a0|ηn(a,t)η(a,t)|da=ηn(,t)η(,t)L1, (5.2)
    |IηnIη|(t)=|a0m(a)ηn(a,t)daa0m(a)η(a,t)da|ˉma0|ηn(a,t)η(a,t)|da=ˉmηn(,t)η(,t)L1, (5.3)
    |E(ηn)E(η)|(a,t)=|αa0ω(r)[ηnη](r,t)dr+aaω(r)[ηnη](r,t)dr|αa0|ω(r)||ηnη|(r,t)dr+aa|ω(r)||ηnη|(r,t)drˉωa0|ηnη|(a,t)daηn(,t)η(,t)L1. (5.4)

    Moreover,

    ηn(,t)η(,t)L1t0|F(τ,ηn(,τ))F(τ,η(,τ))|da+t0tτ|G(s,ηn(,s))G(s,η(,s))|(st+a)dsda+att0|G(s,ηn(,s))G(s,η(,s))|(st+a)dsdaI10+I11+I12. (5.5)

    Arguing similarly as for I1 and I2+I3, we can show that

    I10t0a0|β1(a,s)||ηn(a,s)η(a,s)|dads+t0a0|β2(a,s)||SηnSη|(s)dads+t0a0|β3(a,s)||E(ηn)E(η)|(a,s)dads+t0|bn(s)b(s)|ds3i=1βiL(D)t0ηn(,s)η(,s)L1ds+t0|bn(s)b(s)|ds (5.6)

    and

    I11+I12t0a0|fn(ς,s)f(ς,s)|dςds+t0a0|μ1(ς,s)||ηn(ς,s)η(ς,s)|dςds+t0a0|μ2(ς,s)||IηnIη|(s)dςdst0a0|fn(ς,s)f(ς,s)|dςds+(μ1L(D)+ˉmμ2L(D))t0ηn(,s)η(,s)L1ds. (5.7)

    From (5.5)–(5.7), we can obtain

    ηn(,t)η(,t)L1t0|bn(s)b(s)|ds+t0a0|fn(ς,s)f(ς,s)|dςds+M5t0ηn(,s)η(,s)L1ds,

    where M5=3i=1βiL(D)+μ1L(D)+ˉmμ2L(D). Thus, Gronwall's inequality implies that

    ηn(,t)η(,t)L1M6t0|bn(s)b(s)|ds+M6t0a0|fn(ς,s)f(ς,s)|dςds,

    where M6=1+M5TeM5T. Hence, we can claim that ηnη in L(0,T;L1(0,a)) as n+.

    Lemma 5.2. For any uU, vTU(u) and sufficiently small ε>0, if u+εvU, we have

    limε0+pu+εv(a,t)pu(a,t)ε=z(a,t),

    where pu+εv and pu are, respectively, solutions of (2.1) corresponding to u+εv and u, and z satisfies

    {z(a,t)t+z(a,t)t=[μ(a,t)+δ1u(a,t)+Φ(Iu(t))]z(a,t)Φ(Iu(t))pu(a,t)P(t)δ1v(a,t)pu(a,t),z(0,t)=a0[1δ2u(a,t)][β(a,t,E(pu)(a,t),Su(t))z(a,t)+βE(a,t,E(pu)(a,t),Su(t))×E(z)(a,t)pu(a,t)+βS(a,t,E(pu)(a,t),Su(t))pu(a,t)Q(t)]daa0δ2β(a,t,E(pu)(a,t),Su(t))v(a,t)pu(a,t)da,z(a,0)=0,P(t)=a0m(a)z(a,t)da,Q(t)=a0[1ω(a)]z(a,t)da,E(z)(a,t)=αa0ω(r)z(r,t)da+aaω(r)z(r,t)dr. (5.8)

    Here, βE and βS are, respectively, the derivatives of β with respect to E and S.

    Proof. Denote pε(a,t)pu+εv(a,t). A similar discussion as that in Theorem 3.3 shows that system (5.8) has a unique solution. Now, we prove the existence of limε0+pε(a,t)pu(a,t)ε. Let

    θε(a,t)1ε[pε(a,t)pu(a,t)]z(a,t).

    Firstly, from (2.1) and (5.8), it follows that

    θε(a,t)t+θε(a,t)a=[μ(a,t)+δ1u(a,t)+Φ(Iu(t))]θε(a,t)δ1v(a,t)[pε(a,t)pu(a,t)]Φ(Iu(t))1ε[Iε(t)Iu(t)]pε(a,t)+Φ(Iu(t))pu(a,t)P(t)=[μ(a,t)+δ1u(a,t)+Φ(Iu(t))]θε(a,t)δ1v(a,t)[pε(a,t)pu(a,t)]Φ(Iu(t))I(θε)(t)pε(a,t)+Φ(Iu(t))P(t)[pε(a,t)pu(a,t)],

    where I(θε)(t)=a0m(a){1ε[pε(a,t)pu(a,t)]z(a,t)}da=a0m(a)θε(a,t)da.

    Secondly, a simple calculation shows that

    where and .

    Then, we can obtain the system with as follows

    (5.9)

    By Theorem 3.4, we have as , and

    Passing to , we can obtain the following limit system of (5.9)

    (5.10)

    Clearly, (5.10) is a homogeneous linear system with the zero initial value. Thus, (see [22, Theorem 4.1]). Further, from Lemma 5.1, we can claim that . Hence,

    and satisfies (5.8). The proof is complete.

    Theorem 5.3. Let be an optimal policy for the management problem (2.1)–(2.2). Then

    (5.11)

    where satisfies the following adjoint system

    (5.12)

    Here is the solution of model (2.1) corresponding to , , and .

    Proof. For any and sufficiently small , we have . Let be the solution of (2.1) with respect to . Then the optimality of implies , that is,

    It follows from Theorem 3.4 and Lemma 5.2 that

    (5.13)

    Here is the solution of (5.8) with and being replaced by and , respectively.

    In system (5.8) (with and being replaced by and , respectively), multiplying the first equation by and integrating on yield

    (5.14)

    Using integration by parts and (5.8), one can derive

    (5.15)

    Thus, from (5.14) and (5.15) and a simple calculation, we obtain

    (5.16)

    Multiplying on both sides of the first equation of (5.12) and integrating on , we get

    (5.17)

    Thus, from (5.16) and (5.17), we have

    (5.18)

    For each , by (5.13) and (5.18), we claim that

    That is, . Hence, the conclusion follows from using the structure of normal cone.

    In this section, we will give an illustrative example to show the conditions for the existence are not empty.

    Example 1. Let the parameters be , , , , , . Obviously, . With the weight functions and , the immigration rate and the initial age distribution , we can easily verify that assumption holds. Choose the natural mortality rate to be

    For , a direct calculation gives

    which means that assumption holds. Assume that . It is easy to show that for any . Moreover, for any , , we have

    Thus assumption holds. For any , take the birth rate as

    By a simple computation, we have for any . Moreover, for any , , , , , when , we have

    when , we have

    when , we have

    Thus, for any and , we have

    This implies that assumption holds. Hence, from Theorems 3.1–3.3, for any and , system (2.1) has a unique non-negative solution . Moreover, the solution has the form . Here is the solution of (3.5)–(3.6).

    In view of the reproductive laws of vermin, we formulated and analyzed a hierarchical age-structured vermin contraception control model. The model is based on the assumption that the reproductive ability of vermin mainly depends on older females. It also considers the encounter mechanism between females and males. This allows the fertility of an individual to depend not only on age and time but also on their "internal environment" and the size of males. Note that sterilant has the dual effects of causing infertility and death of vermin. Thus, we assumed that the mortality of vermin depends not only on its intrinsic dynamics (including natural mortality and mortality caused by competition) but also on the effect of female sterilant. The dual effects of sterilant make the control variable appear not only in the principal equation (distributed control) but also in the boundary condition (boundary control). Our model contains some existing ones as special cases.

    By transforming our model into two subsystems and using the contraction mapping principle, we have shown that the model has a unique non-negative bounded solution, which has a separable form. In this work, we discussed the existence of optimal management policy and derived the Euler-Lagrange optimality conditions. The former is established by using compactness and minimization sequences, while the latter is derived by employing adjoint systems and normal cones techniques. To show the compactness, we used the Fréchet-Kolmogorov Theorem (see Lemma 4.1) and its generalization (see Lemma 4.2). In order to construct the adjoint system, we used the continuity of the solution on the control parameters (see Theorem 3.4) and the continuity of the solution of an integro-partial differential equation with respect to its boundary distribution and inhomogeneous term (see Lemma 5.1).

    This paper only discussed the existence and structure of the optimal management policy and did not carry out any numerical simulations. This is because it is very challenging to choose an appropriate numerical algorithm and analyze its convergence. The relevant numerical algorithm can be found in [20]. However, our model is more complicated than that in [20], because the birth rate depends not only on the "internal environment" of vermin but also on the number of males. We leave the study on the numerical algorithm of our optimal control problem as future work.

    This work was supported by the National Natural Science Foundation of China (Nos. 12071418, 12001341).

    The authors declare there is no conflict of interest.



    [1] S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, Decentralized Bus. Rev., (2008), 21260. Available from: https://people.eecs.berkeley.edu/raluca/cs261-f15/readings/bitcoin.pdf.
    [2] J. Garay, A. Kiayias, N. Leonardos, The bitcoin backbone protocol: Analysis and applications, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, Heidelberg, 9057 (2015), 281–310. https://doi.org/10.1007/978-3-662-46803-6_10
    [3] C. Dwork, N. Lynch, L. Stockmeyer, Consensus in the presence of partial synchrony, J. ACM, 35 (1988), 288–323. https://doi.org/10.1145/42282.42283 doi: 10.1145/42282.42283
    [4] C. Decker, R. Wattenhofer, Information propagation in the bitcoin network, in IEEE P2P 2013 Proceedings, IEEE, (2013), 1–10. https://doi.org/10.1109/P2P.2013.6688704
    [5] R. Pass, L. Seeman, A. Shelat, Analysis of the blockchain protocol in asynchronous networks, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 10211 (2017), 643–673. https://doi.org/10.1007/978-3-319-56614-6_22
    [6] P. Wei, Q. Yuan, Y. Zheng, Security of the blockchain against long delay attack, in International Conference on the Theory and Application of Cryptology and Information Security, Springer, 11274 (2018), 250–275. https://doi.org/10.1007/978-3-030-03332-3_10
    [7] Q. Yuan, P. Wei, K. Jia, H. Xue, Analysis of blockchain protocol against static adversarial miners corrupted by long delay attackers, Sci. China Inf. Sci., 63 (2020), 1–15. https://doi.org/10.1007/s11432-019-9916-5 doi: 10.1007/s11432-019-9916-5
    [8] L. Shi, T. Wang, J. Li, S. Zhang, Pooling is not favorable: Decentralize mining power of pow blockchain using age-of-work, preprint, arXiv: 2104.01918.
    [9] C. Li, B. Palanisamy, Comparison of decentralization in dpos and pow blockchains, Lect. Notes Comput. Sci., 12404 (2020). https://doi.org/10.1007/978-3-030-59638-5_2 doi: 10.1007/978-3-030-59638-5_2
    [10] J. Bhosale, S. Mavale, Volatility of select crypto-currencies: A comparison of bitcoin, ethereum and litecoin, Annu. Res. J. SCMS, Pune, 6 (2018). Available from: https://www.scmspune.ac.in/journal/pdf/current/Paper%2010%20-%20Jaysing%20Bhosale.pdf.
    [11] H. Chen, M. Pendleton, L. Njilla, S. Xu, A survey on ethereum systems security: Vulnerabilities, attacks, and defenses, ACM Comput. Surv., 53 (2020), 1–43. https://doi.org/10.1145/3391195 doi: 10.1145/3391195
    [12] R. Pass, A. Shelat, Micropayments for decentralized currencies, in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (2015), 207–218. https://doi.org/10.1145/2810103.2813713
    [13] J. Poon, T. Dryja, The bitcoin lightning network: Scalable off-chain instant payments, 2016. Available from: https://lightning.network/lightning-network-paper.pdf.
    [14] K. Gai, Y. Wu, L. Zhu, M. Qiu, M. Shen, Privacy-preserving energy trading using consortium blockchain in smart grid, IEEE Trans. Ind. Inf., 15 (2019), 3548–3558. https://doi.org/10.1109/TII.2019.2893433 doi: 10.1109/TII.2019.2893433
    [15] L. Zhu, Y. Wu, K. Gai, K. Choo, Controllable and trustworthy blockchain-based cloud data management, Future Gener. Comput. Syst., 91 (2018), 527–535. https://doi.org/10.1016/j.future.2018.09.019 doi: 10.1016/j.future.2018.09.019
    [16] K. Gai, Y. Wu, L. Zhu, Z. Zhang, M. Qiu, Differential privacy-based blockchain for industrial internet-of-things, IEEE Trans. Ind. Inf., 16 (2020), 4156–4165. https://doi.org/10.1109/TII.2019.2948094 doi: 10.1109/TII.2019.2948094
    [17] G. Xu, J. Dong, C. Ma, J. Liu, U. G. O. Cliff, A certificateless signcryption mechanism based on blockchain for edge computing, IEEE Internet Things J., 2022 (2022). https://doi.org/10.1109/JIOT.2022.3151359 doi: 10.1109/JIOT.2022.3151359
    [18] I. Bentov, R. Kumaresan, How to use bitcoin to design fair protocols, Lect. Notes Comput. Sci., Springer, Berlin, Heidelberg, 8617 (2014), 421–439. https://doi.org/10.1007/978-3-662-44381-1_24
    [19] K. Gai, J. Guo, L. Zhu, S. Yu, Blockchain meets cloud computing: A survey, IEEE Commun. Surv. Tutorials, 22 (2020), 2009–2030. https://doi.org/10.1109/COMST.2020.2989392 doi: 10.1109/COMST.2020.2989392
    [20] F. Yang, J. Tian, T. Feng, F. Xu, C. Qiu, C. Zhao, Blockchain-enabled parallel learning in industrial edge-cloud network: A fuzzy dpost-pbft approach, in 2021 IEEE Globecom Workshops (GC Wkshps), (2021), 1–6. https://doi.org/10.1109/GCWkshps52748.2021.9681977
    [21] G. Xu, Y. Liu, P. W. Khan, Improvement of the dpos consensus mechanism in blockchain based on vague sets, IEEE Trans. Ind. Inf., 16 (2020), 4252–4259. https://doi.org/10.1109/TII.2019.2955719 doi: 10.1109/TII.2019.2955719
    [22] Y. Liu, G. Xu, Fixed degree of decentralization dpos consensus mechanism in blockchain based on adjacency vote and the average fuzziness of vague value, Comput. Networks, 199 (2021), 108432. https://doi.org/10.1016/j.comnet.2021.108432 doi: 10.1016/j.comnet.2021.108432
    [23] K. M. Elleithy, D. Blagovic, W. Cheng, P. Sideleau, Denial of service attack techniques: Analysis, implementation and comparison, J. Syst. Cybern. Inf., 3 (2005), 66–71. Available from: https://www.researchgate.net/publication/242497142.
    [24] E. Heilman, A. Kendler, A. Zohar, S. Goldberg, Eclipse attacks on bitcoin's peer-to-peer network, in Proceedings of the 24th USENIX Conference on Security Symposium, (2015), 129–144. Available from: https://eprint.iacr.org/2015/263.pdf.
    [25] M. Apostolaki, A. Zohar, L. Vanbever, Hijacking bitcoin: Routing attacks on cryptocurrencies, in 2017 IEEE Symposium on Security and Privacy (SP), IEEE, 2017 (2017), 375–392. https://doi.org/10.1109/SP.2017.29
    [26] J. Bonneau, E. W. Felten, S. Goldfeder, J. A. Kroll, A. Narayanan, Why buy when you can rent? Bribery attacks on bitcoin consensus. Available from: https://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=C77871712694860A06EFCEC0665234B6?doi=10.1.1.698.738&rep=rep1&type=pdf.
    [27] G. O. Karame, E. Androulaki, S. Capkun, Double-spending fast payments in bitcoin, in Proceedings of the 2012 ACM Conference on Computer and Communications Security, (2012), 906–917. https://doi.org/10.1145/2382196.2382292
    [28] I. Eyal, E. G. Sirer, Majority is not enough: Bitcoin mining is vulnerable, Lect. Notes Comput. Sci., Springer, Berlin, Heidelberg, 8437 (2013). https://doi.org/10.1007/978-3-662-45472-5_28
    [29] J. Göbel, H. P. Keeler, A. E. Krzesinski, P. G. Taylor, Bitcoin blockchain dynamics: The selfish-mine strategy in the presence of propagation delay, Perform. Eval., 104 (2016), 23–41. https://doi.org/10.1016/j.peva.2016.07.001 doi: 10.1016/j.peva.2016.07.001
    [30] Y. Sompolinsky, A. Zohar, Secure high-rate transaction processing in bitcoin, in International Conference on Financial Cryptography and Data Security, Springer, Berlin, Heidelberg, 8975 (2015), 507–527. https://doi.org/10.1007/978-3-662-47854-7_32
  • This article has been cited by:

    1. ChungYuen Khew, Rahmad Akbar, Norfarhan Mohd-Assaad, Progress and challenges for the application of machine learning for neglected tropical diseases, 2023, 12, 2046-1402, 287, 10.12688/f1000research.129064.1
    2. ChungYuen Khew, Rahmad Akbar, Norfarhan Mohd-Assaad, Progress and challenges for the application of machine learning for neglected tropical diseases, 2025, 12, 2046-1402, 287, 10.12688/f1000research.129064.2
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2481) PDF downloads(85) Cited by(0)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog