Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ...Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.展开更多
A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filte...A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.展开更多
The worldwide research status of head tracking is introduced and the works made in the research of the predictive algorithm and in the exploration of the rule of the head tracking are set forth. A time delay model f...The worldwide research status of head tracking is introduced and the works made in the research of the predictive algorithm and in the exploration of the rule of the head tracking are set forth. A time delay model for the telerobotic scout system is built. In respect of eliminating error caused by time delay and making reasonable prediction to the data stream, many methods are experimented in order to realize the aim of real time tracking. The application of extrapolation algorithm and auto recursive algorithm in the orientation tracking is described in detail. These two algorithms are realized in Matlab environment. Through analysis of the curves generated by using these two predictive algorithms, an appropriate method was applied in the telerobotic scout system. The effect is satisfying.展开更多
Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalma...Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalman filtering algorithm to determine the position of the target centroid and subsequently adjust the current search window adaptively according to the target centroid position and the previous frame search window boundary.The derived search window is more closely matched to the location of the target,which improves the accuracy and reliability of tracking.The environmental influence and other influencing factors on the algorithm are also reduced.Through comparison and analysis of the experiments,the modified algorithm demonstrates good stability and adaptability,and can effectively solve the problem of large area occlusion and similar interference.展开更多
Real-time seam tracking can improve welding quality and enhance welding efficiency during the welding process in automobile manufacturing.However,the teaching-playing welding process,an off-line seam tracking method,i...Real-time seam tracking can improve welding quality and enhance welding efficiency during the welding process in automobile manufacturing.However,the teaching-playing welding process,an off-line seam tracking method,is still dominant in automobile industry,which is less flexible when welding objects or situation change.A novel real-time algorithm consisting of seam detection and generation is proposed to track seam.Using captured 3D points,space vectors were created between two adjacent points along each laser line and then a vector angle based algorithm was developed to detect target points on the seam.Least square method was used to fit target points to a welding trajectory for seam tracking.Furthermore,the real-time seam tracking process was simulated in MATLAB/Simulink.The trend of joint angles vs.time was logged and a comparison between the off-line and the proposed seam tracking algorithm was conducted.Results show that the proposed real-time seam tracking algorithm can work in a real-time scenario and have high accuracy in welding point positioning.展开更多
Dynamic alliance(DA),namely,virtual corporations (VCs),is an enterprise management method. It means a temporary union formed by some independent commercial processes or corporations.Here, genetic algorithms(GA) is app...Dynamic alliance(DA),namely,virtual corporations (VCs),is an enterprise management method. It means a temporary union formed by some independent commercial processes or corporations.Here, genetic algorithms(GA) is applied to the research of nodes DA selection optimization in wireless sensor networks(WSN) target tracking(TT) problem.The detailed optimized selection method is presented in the paper and a typical simulation is conducted to verify the effectiveness of our model.展开更多
Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system....Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system.A multi-sensor data association is proposed based on aftinity propagation(AP)algorithm.The proposed method needs an initial similarity,a distance between any two points,as a parameter,therefore,the similarity matrix is calculated by track position,velocity and azimuth of track data.The approach can automatically obtain the optimal classification of uncertain target based on clustering validity index.Furthermore,the same kind of data are fused based on the variance of measured data and the fusion result can be taken as a new measured data of the target.Finally,the measured data are classified to a certain target based on the nearest neighbor ideas and its characteristics,then filtering and target tracking are conducted.The experimental results show that the proposed method can effectively achieve multi-sensor and multi-target track association.展开更多
For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） wit...For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） with Message Passing Interface （MPI） is built. The proposed Multi-Deme Parallel FGA （MDPFGA） is run on the platform. A serial of special MDPFGAs are used to determine the static and the dynamic solutions of generalized m-best S-D assignment problem respectively, as well as target states estimation in track management. Such an assignment-based parallel algorithm is demonstrated on simulated passive sensor track formation and maintenance problem. While illustrating the feasibility of the proposed algorithm in multisensor multitarget tracking, simulation results indicate that the MDPFGAs-based algorithm has greater efficiency and speed than the FGAs-based algorithm.展开更多
As the cyber security has attracted great attention in recent years,and with all kinds of tools’(such as Network Agent,VPN and so on)help,traditional methods of tracking users like log analysis and cookie have been n...As the cyber security has attracted great attention in recent years,and with all kinds of tools’(such as Network Agent,VPN and so on)help,traditional methods of tracking users like log analysis and cookie have been not that effective.Especially for some privacy sensitive users who changed their browser configuration frequently to hide themselves.The Browser Fingerprinting technology proposed by Electronic Frontier Foundation(EFF)gives a new approach of tracking users,and then our team designed an enhanced fingerprint dealing solution based on browser fingerprinting technology.Our enhanced solution plays well in recognizing the similar fingerprints,but it is not that efficient.Nowadays we improve the algorithm and propose a high-performance,efficient Browser Fingerprint Recognition Model.Our new model reforms the fingerprint items set by EFF and propose a Fingerprint Tracking Algorithm(FTA)to deal with collected data.It can associate users with some browser configuration changes in different periods of time quickly and precisely.Through testing with the experimental website built on the public network,we prove the high-performance and efficiency of our algorithm with a 20%time-consuming decrease than ever.展开更多
This paper is mainly on the problem of radiation interception risk control in sensor network for target tracking.Firstly,the sensor radiation interception risk is defined as the product of the interception probability...This paper is mainly on the problem of radiation interception risk control in sensor network for target tracking.Firstly,the sensor radiation interception risk is defined as the product of the interception probability and the cost caused by the interception.Secondly,the radiation interception probability model and cost model are established,based on which the calculation method of interception risk can be obtained.Thirdly,a sensor scheduling model of radiation risk control is established,taking the minimum interception risk as the objective function.Then the Hungarian algorithm is proposed to obtain sensor scheduling scheme.Finally,simulation experiments are mad to prove the effectiveness of the methods proposed in this paper,which shows that compared with the sensor radiation interception probability control method,the interception risk control method can keep the sensor scheduling scheme in low risk as well as protect sensors of importance in the sensor network.展开更多
This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly,...This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly, the analysis of existing energy consuming in the sensing layer and its calculation method were provided to build the energy conserving objective function;What’s more, the other two indicators in target tracking, including target detection probability and tracking accuracy, were combined to be regarded as the constraints of the energy conserving objective function. Fourthly, the three energy conserving approaches, containing optimizing the management scheme, prolonging the time interval between two adjacent observations, and transmitting the observations selectively, were introduced;In addition, the improved lion algorithm combined with the Logistic chaos sequence was proposed to obtain sensor management schemes. Finally, simulations had been made to prove the effectiveness of the proposed methods and algorithm.展开更多
In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating posit...In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating positioning accuracy often occupies many bits,the communication cost from local sensors to the fusion is not always sufficiently low for some wireless communication chan-nels.This paper studies how to compress data for distributed tracking fusion algorithms.Based on the K-singular value decomposition(K-SVD)algorithm,a sparse coding algorithm is presented to sparsely represent the filtering covariance matrix.Then the least square quantization(LSQ)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.展开更多
To compensate motion errors of images from the parallel-track bistatic synthetic aperture radar（BiSAR）,an improved chirp scaling algorithm（CSA） is proposed.Since velocity vector of the moving aircrafts in the para...To compensate motion errors of images from the parallel-track bistatic synthetic aperture radar（BiSAR）,an improved chirp scaling algorithm（CSA） is proposed.Since velocity vector of the moving aircrafts in the parallel-track BiSAR system can not remain invariant in an aperture,an actual aperture is divided into subapertures so that it is reasonable to assume that the aircrafts move with constant acceleration vector in a subaperture.Based on this model,an improved CSA is derived.The new phase factors incorporate three-dimensional acceleration and velocity.The motion compensation procedure is integrated into the CSA without additional operation required.The simulation results show that the presented algorithm can efficiently resolve motion compensation for parallel-track BiSAR.展开更多
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62025110 and 62101308).
文摘Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.
基金supported by National Natural Science Foundation of China (Nos.62265010,62061024)Gansu Province Science and Technology Plan (No.23YFGA0062)Gansu Province Innovation Fund (No.2022A-215)。
文摘A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.
文摘The worldwide research status of head tracking is introduced and the works made in the research of the predictive algorithm and in the exploration of the rule of the head tracking are set forth. A time delay model for the telerobotic scout system is built. In respect of eliminating error caused by time delay and making reasonable prediction to the data stream, many methods are experimented in order to realize the aim of real time tracking. The application of extrapolation algorithm and auto recursive algorithm in the orientation tracking is described in detail. These two algorithms are realized in Matlab environment. Through analysis of the curves generated by using these two predictive algorithms, an appropriate method was applied in the telerobotic scout system. The effect is satisfying.
基金Supported by the Scholarship of China Scholarship Council(CSC)(201606935043)
文摘Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalman filtering algorithm to determine the position of the target centroid and subsequently adjust the current search window adaptively according to the target centroid position and the previous frame search window boundary.The derived search window is more closely matched to the location of the target,which improves the accuracy and reliability of tracking.The environmental influence and other influencing factors on the algorithm are also reduced.Through comparison and analysis of the experiments,the modified algorithm demonstrates good stability and adaptability,and can effectively solve the problem of large area occlusion and similar interference.
基金Supported by Ministerial Level Advanced Research Foundation(65822576)Beijing Municipal Education Commission(KM201310858004,KM201310858001)
文摘Real-time seam tracking can improve welding quality and enhance welding efficiency during the welding process in automobile manufacturing.However,the teaching-playing welding process,an off-line seam tracking method,is still dominant in automobile industry,which is less flexible when welding objects or situation change.A novel real-time algorithm consisting of seam detection and generation is proposed to track seam.Using captured 3D points,space vectors were created between two adjacent points along each laser line and then a vector angle based algorithm was developed to detect target points on the seam.Least square method was used to fit target points to a welding trajectory for seam tracking.Furthermore,the real-time seam tracking process was simulated in MATLAB/Simulink.The trend of joint angles vs.time was logged and a comparison between the off-line and the proposed seam tracking algorithm was conducted.Results show that the proposed real-time seam tracking algorithm can work in a real-time scenario and have high accuracy in welding point positioning.
文摘Dynamic alliance(DA),namely,virtual corporations (VCs),is an enterprise management method. It means a temporary union formed by some independent commercial processes or corporations.Here, genetic algorithms(GA) is applied to the research of nodes DA selection optimization in wireless sensor networks(WSN) target tracking(TT) problem.The detailed optimized selection method is presented in the paper and a typical simulation is conducted to verify the effectiveness of our model.
基金Supported by the National Natural Science Foundation of China(11078001)
文摘Track association of multi-target has been recognized as one of the key technologies in distributed multiple-sensor data fusion system,and its accuracy directly impacts on the performance of the whole tracking system.A multi-sensor data association is proposed based on aftinity propagation(AP)algorithm.The proposed method needs an initial similarity,a distance between any two points,as a parameter,therefore,the similarity matrix is calculated by track position,velocity and azimuth of track data.The approach can automatically obtain the optimal classification of uncertain target based on clustering validity index.Furthermore,the same kind of data are fused based on the variance of measured data and the fusion result can be taken as a new measured data of the target.Finally,the measured data are classified to a certain target based on the nearest neighbor ideas and its characteristics,then filtering and target tracking are conducted.The experimental results show that the proposed method can effectively achieve multi-sensor and multi-target track association.
基金Supported by National Defence Scientific Research Foundation
文摘For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） with Message Passing Interface （MPI） is built. The proposed Multi-Deme Parallel FGA （MDPFGA） is run on the platform. A serial of special MDPFGAs are used to determine the static and the dynamic solutions of generalized m-best S-D assignment problem respectively, as well as target states estimation in track management. Such an assignment-based parallel algorithm is demonstrated on simulated passive sensor track formation and maintenance problem. While illustrating the feasibility of the proposed algorithm in multisensor multitarget tracking, simulation results indicate that the MDPFGAs-based algorithm has greater efficiency and speed than the FGAs-based algorithm.
基金supported by the Beijing Municipal Natural Science Foundation(No.4172006)Humanity and Social Science Youth foundation of Ministry of Education of China under Grant No. 13YJCZH065+2 种基金General Program of Science and Technology Development Project of Beijing Municipal Education Commission of China under Grant No. km201410005012Open Research Fund of Beijing Key Laboratory of Trusted ComputingOpen Research Fund of Key Laboratory of Trustworthy Distributed Computing and Service (BUPT), Ministry of Education..
文摘As the cyber security has attracted great attention in recent years,and with all kinds of tools’(such as Network Agent,VPN and so on)help,traditional methods of tracking users like log analysis and cookie have been not that effective.Especially for some privacy sensitive users who changed their browser configuration frequently to hide themselves.The Browser Fingerprinting technology proposed by Electronic Frontier Foundation(EFF)gives a new approach of tracking users,and then our team designed an enhanced fingerprint dealing solution based on browser fingerprinting technology.Our enhanced solution plays well in recognizing the similar fingerprints,but it is not that efficient.Nowadays we improve the algorithm and propose a high-performance,efficient Browser Fingerprint Recognition Model.Our new model reforms the fingerprint items set by EFF and propose a Fingerprint Tracking Algorithm(FTA)to deal with collected data.It can associate users with some browser configuration changes in different periods of time quickly and precisely.Through testing with the experimental website built on the public network,we prove the high-performance and efficiency of our algorithm with a 20%time-consuming decrease than ever.
基金This article is funded by Chinese national natural science foundation(61573374).
文摘This paper is mainly on the problem of radiation interception risk control in sensor network for target tracking.Firstly,the sensor radiation interception risk is defined as the product of the interception probability and the cost caused by the interception.Secondly,the radiation interception probability model and cost model are established,based on which the calculation method of interception risk can be obtained.Thirdly,a sensor scheduling model of radiation risk control is established,taking the minimum interception risk as the objective function.Then the Hungarian algorithm is proposed to obtain sensor scheduling scheme.Finally,simulation experiments are mad to prove the effectiveness of the methods proposed in this paper,which shows that compared with the sensor radiation interception probability control method,the interception risk control method can keep the sensor scheduling scheme in low risk as well as protect sensors of importance in the sensor network.
基金funded by (Defense Pre-Research Fund Project of China), grant number 012015012600A2203NSFC (Natural Science Foundation of China), grant number 61573374。
文摘This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly, the analysis of existing energy consuming in the sensing layer and its calculation method were provided to build the energy conserving objective function;What’s more, the other two indicators in target tracking, including target detection probability and tracking accuracy, were combined to be regarded as the constraints of the energy conserving objective function. Fourthly, the three energy conserving approaches, containing optimizing the management scheme, prolonging the time interval between two adjacent observations, and transmitting the observations selectively, were introduced;In addition, the improved lion algorithm combined with the Logistic chaos sequence was proposed to obtain sensor management schemes. Finally, simulations had been made to prove the effectiveness of the proposed methods and algorithm.
基金supported in part by the National Laboratory of Radar Signal Processing Xidian Univrsity,Xi’an 710071,China。
文摘In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating positioning accuracy often occupies many bits,the communication cost from local sensors to the fusion is not always sufficiently low for some wireless communication chan-nels.This paper studies how to compress data for distributed tracking fusion algorithms.Based on the K-singular value decomposition(K-SVD)algorithm,a sparse coding algorithm is presented to sparsely represent the filtering covariance matrix.Then the least square quantization(LSQ)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.
文摘To compensate motion errors of images from the parallel-track bistatic synthetic aperture radar（BiSAR）,an improved chirp scaling algorithm（CSA） is proposed.Since velocity vector of the moving aircrafts in the parallel-track BiSAR system can not remain invariant in an aperture,an actual aperture is divided into subapertures so that it is reasonable to assume that the aircrafts move with constant acceleration vector in a subaperture.Based on this model,an improved CSA is derived.The new phase factors incorporate three-dimensional acceleration and velocity.The motion compensation procedure is integrated into the CSA without additional operation required.The simulation results show that the presented algorithm can efficiently resolve motion compensation for parallel-track BiSAR.
