In this paper,we study a class of stochastic differential equations with additive noise that contains a non-stationary multifractional Brownian motion(mBm)with a Hurst parameter as a function of time and a Poisson poi...In this paper,we study a class of stochastic differential equations with additive noise that contains a non-stationary multifractional Brownian motion(mBm)with a Hurst parameter as a function of time and a Poisson point process of class(QL).The differential equation of this kind is motivated by the reserve processes in a general insurance model,in which between the claim payment and the past history of liability present the long term dependence.By using the variable order fractional calculus on the fractional Wiener-Poisson space and a multifractional derivative operator,and employing Girsanov theorem for multifractional Brownian motion,we prove the existence of weak solutions to the SDEs under consideration,As a consequence,we deduce the uniqueness in law and the pathwise uniqueness.展开更多
The increase in user mobility and density in modern cellular networks increases the risk of overloading certain base stations in popular locations such as shopping malls or stadiums,which can result in connection loss...The increase in user mobility and density in modern cellular networks increases the risk of overloading certain base stations in popular locations such as shopping malls or stadiums,which can result in connection loss for some users.To combat this,the traffic load of base stations should be kept as balanced as possible.In this paper,we propose an efficient load balancing-aware handover algorithm for highly dynamic beyond 5G heterogeneous networks by assigning mobile users to base stations with lighter loads when a handover is performed.The proposed algorithm is evaluated in a scenario with users having different levels of mobility,such as pedestrians and vehicles,and is shown to outperform the conventional handover mechanism,as well as another algorithm from the literature.As a secondary benefit,the overall energy consumption in the network is shown to be reduced with the proposed algorithm.展开更多
In the classical form,the Poisson Multi-Bernoulli Mixture(PMBM)filter uses a PMBM density to describe target birth,surviving,and death,which does not model the appearance of spawned targets.Although such a model can h...In the classical form,the Poisson Multi-Bernoulli Mixture(PMBM)filter uses a PMBM density to describe target birth,surviving,and death,which does not model the appearance of spawned targets.Although such a model can handle target birth,surviving,and death well,its performance may degrade when target spawning arises.The reason for this is that the original PMBM filter treats the spawned targets as birth targets,ignoring the surviving targets’information.In this paper,we propose a Kullback–Leibler Divergence(KLD)minimization based derivation for the PMBM prediction step,including target spawning,in which the spawned targets are modeled using a Poisson Point Process(PPP).Furthermore,to improve the computational efficiency,three approximations are used to implement the proposed algorithm,such as the Variational MultiBernoulli(VMB)filter,the Measurement-Oriented marginal MeMBer/Poisson(MOMB/P)filter,and the Track-Oriented marginal MeMBer/Poisson(TOMB/P)filter.Finally,simulation results demonstrate the validity of the proposed filter by using the spawning model in these three approximations.展开更多
Sensing coverage is a fundamental design issue in wireless sensor networks(WSNs),while sensor scheduling ensures coverage degree to the monitored event and extends the network lifetime.In this paper,we address k-cover...Sensing coverage is a fundamental design issue in wireless sensor networks(WSNs),while sensor scheduling ensures coverage degree to the monitored event and extends the network lifetime.In this paper,we address k-coverage scheduling problem in dense WSNs,we maintain a connected k-coverage energy efficiently through a novel Hard-Core based Coordinated Scheduling(HCCS),in which hardcore is a thinning process in stochastic geometry that inhibits more than one active sensor covering any area redundantly in a minimum distance. As compared with existing coordinated scheduling,HCCS allows coordination between sensors with little communication overhead.Moreover,due to the traditional sensing models in k-coverage analysis is unsuitable to describe the characteristic of transmit channel in dense WSNs,we propose a novel sensing model integrating Rayleigh Fading and Distribution of Active sensors(RFDA),and derive the coverage measure and k-coverage probability for the monitored event under RFDA. In addition,we analyze the influence factors,i.e. the transmit condition and monitoring degree to the k-coverage probability. Finally,through Monte Carlo simulations,it is shown that the k-coverage probability of HCCS outperforms that of its random scheduling counterpart.展开更多
Several software reliability growth models （SRGM） have been developed to monitor the reliability growth during the testing phase of software development. In most of the existing research available in the literatures...Several software reliability growth models （SRGM） have been developed to monitor the reliability growth during the testing phase of software development. In most of the existing research available in the literatures, it is considered that a similar testing effort is required on each debugging effort. However, in practice, different types of faults may require different amounts of testing efforts for their detection and removal. Consequently, faults are classified into three categories on the basis of severity： simple, hard and complex. This categorization may be extended to r type of faults on the basis of severity. Although some existing research in the literatures has incorporated this concept that fault removal rate （FRR） is different for different types of faults, they assume that the FRR remains constant during the overall testing period. On the contrary, it has been observed that as testing progresses, FRR changes due to changing testing strategy, skill, environment and personnel resources. In this paper, a general discrete SRGM is proposed for errors of different severity in software systems using the change-point concept. Then, the models are formulated for two particular environments. The models were validated on two real-life data sets. The results show better fit and wider applicability of the proposed models as to different types of failure datasets.展开更多
在用户数量激增的应急通信场景下,为保证地面用户的通信质量,提出了基于距离约束的用户自适应接入方案。首先采用泊松点距离约束策略(Poisson Point under Distance Constraint,PPDC)对无人机(Unmanned Aerial Vehicle,UAV)的位置进行建...在用户数量激增的应急通信场景下,为保证地面用户的通信质量,提出了基于距离约束的用户自适应接入方案。首先采用泊松点距离约束策略(Poisson Point under Distance Constraint,PPDC)对无人机(Unmanned Aerial Vehicle,UAV)的位置进行建模,避免无人机区域重叠带来的干扰问题。其次,引入基站负载传输协议(Base Station Load Transfer Protocol,BSLTP),当接入基站的用户数量超过给定阈值时,超载用户由无人机提供服务。此外,分别分析了地面基站和无人机的覆盖性能,得到了系统整体覆盖概率,并研究了无人机高度、覆盖半径、激增用户密度对网络覆盖性能的影响。最后,通过仿真验证了理论结果的正确性,且所提部署方案能够有效提升网络覆盖性能。展开更多
本文研究了在毫微微蜂窝网络(femtocell network,FN)中,协同双小区系统的非正交多址接入(non-orthogonal multiple access,NOMA)与无线携能通信(simultaneous wireless information and power transfer,SWIPT)下行协作通信的中断性能,...本文研究了在毫微微蜂窝网络(femtocell network,FN)中,协同双小区系统的非正交多址接入(non-orthogonal multiple access,NOMA)与无线携能通信(simultaneous wireless information and power transfer,SWIPT)下行协作通信的中断性能,提出了一种边缘用户在邻基站及源基站随机中心用户共同协作的下行接入方案。所提方案共分为两个时隙:第一时隙内由两基站向所有用户广播叠加信号,提供中继服务的中心用户对其所接收的叠加信号逐级解码并收集能量。第二时隙,中心用户将其第一时隙内所收集的能量作为额外功率资源,在优先保证自身通信质量的前提下对成功解码的边缘用户信息进行再编码转发。基于空间均质泊松点过程(Poisson point process,PPP)中心用户的位置模型,推导了中心用户与边缘用户平均中断概率的表达式,进行了蒙特卡罗仿真验证,同时分析了各仿真参数(中心用户分布半径、用户阈值速率、路径损耗指数等)与中心用户、边缘用户平均中断概率的关系。结果表明:所提方案可以改善边缘用户的下行接入中断性能和系统吞吐量。展开更多
文摘In this paper,we study a class of stochastic differential equations with additive noise that contains a non-stationary multifractional Brownian motion(mBm)with a Hurst parameter as a function of time and a Poisson point process of class(QL).The differential equation of this kind is motivated by the reserve processes in a general insurance model,in which between the claim payment and the past history of liability present the long term dependence.By using the variable order fractional calculus on the fractional Wiener-Poisson space and a multifractional derivative operator,and employing Girsanov theorem for multifractional Brownian motion,we prove the existence of weak solutions to the SDEs under consideration,As a consequence,we deduce the uniqueness in law and the pathwise uniqueness.
基金supported in part by the Istanbul Technical University Scientific Research Projects Coordination Unit under Grant FHD-2024-45764in part by TUBITAK 1515 Frontier R&D Laboratories Support Program for Turkcell 6GEN LAB under Grant 5229902Turkcell Technology R&D Center(Law no.5746)has partially supported this study。
文摘The increase in user mobility and density in modern cellular networks increases the risk of overloading certain base stations in popular locations such as shopping malls or stadiums,which can result in connection loss for some users.To combat this,the traffic load of base stations should be kept as balanced as possible.In this paper,we propose an efficient load balancing-aware handover algorithm for highly dynamic beyond 5G heterogeneous networks by assigning mobile users to base stations with lighter loads when a handover is performed.The proposed algorithm is evaluated in a scenario with users having different levels of mobility,such as pedestrians and vehicles,and is shown to outperform the conventional handover mechanism,as well as another algorithm from the literature.As a secondary benefit,the overall energy consumption in the network is shown to be reduced with the proposed algorithm.
基金supported by the National Natural Science Foundation of China(No.61871301)。
文摘In the classical form,the Poisson Multi-Bernoulli Mixture(PMBM)filter uses a PMBM density to describe target birth,surviving,and death,which does not model the appearance of spawned targets.Although such a model can handle target birth,surviving,and death well,its performance may degrade when target spawning arises.The reason for this is that the original PMBM filter treats the spawned targets as birth targets,ignoring the surviving targets’information.In this paper,we propose a Kullback–Leibler Divergence(KLD)minimization based derivation for the PMBM prediction step,including target spawning,in which the spawned targets are modeled using a Poisson Point Process(PPP).Furthermore,to improve the computational efficiency,three approximations are used to implement the proposed algorithm,such as the Variational MultiBernoulli(VMB)filter,the Measurement-Oriented marginal MeMBer/Poisson(MOMB/P)filter,and the Track-Oriented marginal MeMBer/Poisson(TOMB/P)filter.Finally,simulation results demonstrate the validity of the proposed filter by using the spawning model in these three approximations.
基金supported by the National Science Foundation of China under Grant 61271186
文摘Sensing coverage is a fundamental design issue in wireless sensor networks(WSNs),while sensor scheduling ensures coverage degree to the monitored event and extends the network lifetime.In this paper,we address k-coverage scheduling problem in dense WSNs,we maintain a connected k-coverage energy efficiently through a novel Hard-Core based Coordinated Scheduling(HCCS),in which hardcore is a thinning process in stochastic geometry that inhibits more than one active sensor covering any area redundantly in a minimum distance. As compared with existing coordinated scheduling,HCCS allows coordination between sensors with little communication overhead.Moreover,due to the traditional sensing models in k-coverage analysis is unsuitable to describe the characteristic of transmit channel in dense WSNs,we propose a novel sensing model integrating Rayleigh Fading and Distribution of Active sensors(RFDA),and derive the coverage measure and k-coverage probability for the monitored event under RFDA. In addition,we analyze the influence factors,i.e. the transmit condition and monitoring degree to the k-coverage probability. Finally,through Monte Carlo simulations,it is shown that the k-coverage probability of HCCS outperforms that of its random scheduling counterpart.
文摘Several software reliability growth models （SRGM） have been developed to monitor the reliability growth during the testing phase of software development. In most of the existing research available in the literatures, it is considered that a similar testing effort is required on each debugging effort. However, in practice, different types of faults may require different amounts of testing efforts for their detection and removal. Consequently, faults are classified into three categories on the basis of severity： simple, hard and complex. This categorization may be extended to r type of faults on the basis of severity. Although some existing research in the literatures has incorporated this concept that fault removal rate （FRR） is different for different types of faults, they assume that the FRR remains constant during the overall testing period. On the contrary, it has been observed that as testing progresses, FRR changes due to changing testing strategy, skill, environment and personnel resources. In this paper, a general discrete SRGM is proposed for errors of different severity in software systems using the change-point concept. Then, the models are formulated for two particular environments. The models were validated on two real-life data sets. The results show better fit and wider applicability of the proposed models as to different types of failure datasets.
文摘在用户数量激增的应急通信场景下,为保证地面用户的通信质量,提出了基于距离约束的用户自适应接入方案。首先采用泊松点距离约束策略(Poisson Point under Distance Constraint,PPDC)对无人机(Unmanned Aerial Vehicle,UAV)的位置进行建模,避免无人机区域重叠带来的干扰问题。其次,引入基站负载传输协议(Base Station Load Transfer Protocol,BSLTP),当接入基站的用户数量超过给定阈值时,超载用户由无人机提供服务。此外,分别分析了地面基站和无人机的覆盖性能,得到了系统整体覆盖概率,并研究了无人机高度、覆盖半径、激增用户密度对网络覆盖性能的影响。最后,通过仿真验证了理论结果的正确性,且所提部署方案能够有效提升网络覆盖性能。
文摘本文研究了在毫微微蜂窝网络(femtocell network,FN)中,协同双小区系统的非正交多址接入(non-orthogonal multiple access,NOMA)与无线携能通信(simultaneous wireless information and power transfer,SWIPT)下行协作通信的中断性能,提出了一种边缘用户在邻基站及源基站随机中心用户共同协作的下行接入方案。所提方案共分为两个时隙:第一时隙内由两基站向所有用户广播叠加信号,提供中继服务的中心用户对其所接收的叠加信号逐级解码并收集能量。第二时隙,中心用户将其第一时隙内所收集的能量作为额外功率资源,在优先保证自身通信质量的前提下对成功解码的边缘用户信息进行再编码转发。基于空间均质泊松点过程(Poisson point process,PPP)中心用户的位置模型,推导了中心用户与边缘用户平均中断概率的表达式,进行了蒙特卡罗仿真验证,同时分析了各仿真参数(中心用户分布半径、用户阈值速率、路径损耗指数等)与中心用户、边缘用户平均中断概率的关系。结果表明:所提方案可以改善边缘用户的下行接入中断性能和系统吞吐量。
