Active Authentication Protocol for IoV Environment with Distributed Servers

The Internet of Vehicles(IoV)has evolved as an advancement over the conventional Vehicular Ad-hoc Networks(VANETs)in pursuing a more optimal intelligent transportation system that can provide various intelligent solutions and enable a variety of applications for vehicular traffic.Massive volumes of data are produced and communicated wirelessly among the different relayed entities in these vehicular networks,which might entice adversaries and endanger the system with a wide range of security attacks.To ensure the security of such a sensitive network,we proposed a distributed authentication mechanism for IoV based on blockchain technology as a distributed ledger with an ouroboros algorithm.Using timestamp and challenge-responsemechanisms,the proposed authentication model can withstand several security attacks such asMan-in-Middle(MiM)attacks,Distributed Denial of Service(DDoS)attacks,server spoofing attacks and more.The proposed method also provides a solution for single-point failure,forward secrecy,revocability,etc.We exhibit the security of our proposed model by using formal(mathematical)analysis and informal analysis.We used Random Oracle Model to perform themathematical analysis.In addition,we compared the communication cost,computation cost,and security of the proposed model with the related existing studies.We have verified the security of the model by using AVISPA tool simulation.The security analysis and computation analysis show that the proposed protocol is viable.

Two phase decision algorithm of replica allocation

In distributed parallel server system, location and redundancy of repficas have great influence on availability and efficiency of the system. In order to improve availability and efficiency of the system, two phase decision algorithm of replica allocation is proposed. The algorithm which makes use of auto-regression model dynamically predicts the future count of READ and WRITE operation, and then determines location and redundancy of replicas by considering availability, CPU and bands of the network. The algorithm can not only ensure the requirement of availability, but also reduce the system resources consumed by all the operations in a great scale. Analysis and test show that communication complexity and time complexity of the algorithm satisfy O（n）, resource optimizing scale increases with the increase of READ count.

A Mechanism Supporting the Client/Server Relationship in the Operating System of Distributed System “THUDS”

This paper presents a distributed operating system modeled as an abstract machine that provides all the distributed processes with the same set of services.The kernel of our operating system supports ser- vices which are achieved by a remote procedure call on requests by parallel processes.Therefore,a scheme for solving the client-server relationship is required.In our system there are more than one cli- ents and,at least,a receive would he required for each.Similarly,there are more than one servers such that the send in a client should produce a message that can he received by every server. Consequently,a mechanism well suited for programming multiple-clients/single-server and sin- gle client/multiple-servers interactions is proposed.