Showing papers by "Wenjiang Ji published in 2018"

A Blockchain-Based Decentralized Cloud Resource Scheduling Architecture

Abstract: Application services in cloud computing model have complex scheduling, composition, configuration and deployment conditions, even in the multi-condition requirements, it can also be based on the change of time to schedule virtual services. Therefore, the demand of optimizing cloud computing scheduling strategy to ensure cloud data security and recovery ability is increasingly prominent. This paper proposes a trusted distributed audit method for cloud task scheduling, which is used for the trusted storage of cloud task scheduling information in the cloud cluster. This method mainly uses a distributed solution that combines block chain technology and traditional cloud server to solve the problem of integrity and security of cloud task scheduling, in order to prevent potential. The vulnerabilities in the system cause significant losses to the system. The architecture of this paper is composed of four parts: cloud cluster, control system, block chain network, and cloud database. We store the hash data of cloud task scheduling information into blockchain network and store the original data to the cloud data base, which guarantees the cloud task within the cloud cluster. Data security and integrity, and provide a new idea for future research system recovery.

A novel energy-aware trustworthy multi-hop routing model for Internet of things:

Abstract: Internet of things is characterized by limited energy and distributed topology. In this scenario, a secure and energy-saving routing algorithm plays a significant role in ensuring the performance o...

Analysis and Protection of DDOS Attack Based on RSSP-II Protocol

Abstract: CTCS-3 High Speed Rail Communication Based on Railway Signal Security Communication Protocol II use GSM-R wireless communication, the open wireless communication has also brought a lot of security risks. During communication, the communicating parties need to authenticate the peer entity and establish a secure connection. At this time the train may be subject to DDOS attacks. Therefore, we simulated a DDOS attack scenes advance on the NS-3 simulator which high-speed rail communications suffered, analysis it, adding a certain filtering mechanism to filter and forward the sent data packets. The results show that the three filtering methods can mitigate the effects of DDOS attacks to varying degrees.

Metro design specification-oriented knowledge graph node automatic establishment method

Abstract: The invention provides a metro design specification-oriented knowledge graph node automatic establishment method Subject-verb-object sentence pattern specifications in (the Metro Design Specifications) are taken as input texts Subjects, verbs and objects in each specification are divided around predicates Node establishment statements of a graphic database Neo4j for storing a knowledge graph are generated The service for establishing a construction specification knowledge graph is provided According to the method, a predicate dictionary is preprocessed through utilization of a Hash dictionary, so mark searching efficiency is improved After construction specifications are input, knowledge graph node statements can be fully automatically generated Time is reduced, and moreover, the accuracy of establishing the knowledge graph is greatly improved

Train model online parameter identification method based on Gaussian sum filter

Abstract: The invention discloses a train model online parameter identification method based on Gaussian sum filter, comprising the following steps: firstly carrying out force analysis on a train pulling process, and building a nonlinear parameterization state space model of a train; then taking a probability density function of a random noise received by the train as an object, selecting one group of Gaussian probability density functions with different means and variances, and carrying out weighted summation and approximation; and finally combining Bayesian theory and extended Kalman filtering, and obtaining a train state and parameter online estimation result. The method disclosed by the invention solves the problems that modeling of the train pulling process is not accurate, offline parameter identification is difficult to realize real-time control of the train and parameter identification precision is low in the prior art.

Gleer: A Novel Gini-Based Energy Balancing Scheme for Mobile Botnet Retopology

Abstract: Mobile botnet has recently evolved due to the rapid growth of smartphone technologies. Unlike legacy botnets, mobile devices are characterized by limited power capacity, calculation capabilities, and wide communication methods. As such, the logical topology structure and communication mode have to be redesigned for mobile botnets to narrow energy gap and lower the reduction speed of nodes. In this paper, we try to design a novel Gini-based energy balancing scheme (Gleer) for the atomic network, which is a fundamental component of the heterogeneous multilayer mobile botnet. Firstly, for each operation cycle, we utilize the dynamic energy threshold to categorize atomic network into two groups. Then, the Gini coefficient is introduced to estimate botnet energy gap and to regulate the probability for each node to be picked as a region C&C server. Experimental results indicate that our proposed method can effectively prolong the botnet lifetime and prevent the reduction of network size. Meanwhile, the stealthiness of botnet with Gleer scheme is analyzed from users’ perspective, and results show that the proposed scheme works well in the reduction of user’ detection awareness.

Graph spectrum and reachable path number-based sub-graph query method for undirected weighted graph

Abstract: The invention discloses a graph spectrum and reachable path number-based sub-graph query method for an undirected weighted graph. The method comprises the steps of 1, calculating codes of node marks of a query graph and graphs in a known graph data set, codes of weighted adjacent edge marks and a code of a reachable path number; 2, generating graph spectrums of the query graph and the graphs in the known graph data set; 3, by using the codes of the node marks of the graphs in the known graph data set, the codes of the weighted adjacent edge marks, the code of the reachable path number and thegraph spectrums, constructing an index tree; and 4, comparing the query graph and the node graphs of the index tree layer by layer from top to bottom, and meanwhile, performing screening, until the bottommost layer is screened out, wherein the obtained graphs are candidate graphs similar to the query graph. According to the method, the topological information of the graph is better described. Meanwhile, the features are coded, so that the storage is easy, the operation is simple, the comparison between the features can be accelerated, and the query speed of the whole sub-graph can be increased.