Abstract

With advancements in engineering and science, the application dimensions of Cyber–Physical System (CPS) are increasing due to their improving efficiency, safety, reliability, usability and autonomy. By providing on-demand access to shared processing resources, cloud computing reduces infrastructure costs. Ensuring quality of service and information privacy and security is important in such environments. In this paper, we design a new authentication scheme related to the cloud-assisted CPS in two directions: (1) authentication between a user and a cloud server, and (2) authentication between a smart meter and a cloud server. In the former situation, any external party (user) can access the information stored in a cloud server provided that the user is legal and has the right to access information. In the later situation, a smart meter and a cloud server authentication is needed for secure communication of data stored in the cloud server. In both cases, both entities first mutually authenticate each other and only after successful authentication with the help of a trusted authority, establish a session key for their future secure communication. The proposed scheme deals with both the cases and provides high security as compared to other related works, which is shown through formal and informal security analysis. In addition, the mutual authentication using the widely-accepted Burrows–Abadi–Needham logic (BAN logic) and also formal security verification using the broadly-used Automated Validation of Internet Security Protocols and Applications (AVISPA) simulation tool demonstrate further that the scheme is strong in security. Finally, the proposed scheme is shown to be efficient in terms of communication and computation costs as compared to those for other related existing schemes.

Abstract

We propose the notion of quantum coherence for superpositions over states which are not necessarily mutually orthogonal. This anticipatedly leads to a resource theory of non-orthogonal coherence. We characterize free states and free operations in this theory, and connect the latter with free operations in the resource theory of quantum coherence for orthogonal bases. We show that the concept of non-orthogonal coherence naturally furnishes us with a wave-particle duality in quantum double-slit experiments where the channels beyond the slits are leaky between them. Furthermore, we demonstrate existence of a unique maximally coherent qubit state corresponding to any given purity. In addition, and in contradistinction with the case of orthogonal bases, there appears a non-trivial minimally coherent qubit state for a given purity. We also study the behavior of quantum coherence for some typical configurations of …

Abstract

We present a formalism for detection of non-Markovianity (NM) through uncertainty relations. We show that when there is an information back-flow to the system from its environment through CP-divisibility breaking, the Choi-states corresponding to the reduced system evolution contain at least one negative eigenvalue. The consequent break down of uncertainty relations for such states can be used to witness non-Markovian dynamics. We present some relevant examples of the phenomenon for qubit channels. We further prove that square of the variance of a suitable Hermitian operator can act as a non-linear witness of NM. We finally show that NM is necessary in order to decrease the uncertainty of the states undergoing unital dynamics for qubits. This provides another method of certifying NM.

Abstract

We establish a connection between non-Markovianity and negative entropy production rate for various classes of quantum operations. We analyse several aspects of unital and thermal operations in connection with resource theories of purity and thermodynamics. We fully characterize Lindblad operators corresponding to unital operations. We also characterize the Lindblad dynamics for a large class of thermal operations. We next generalize the definition of the entropy production rate for the non-equilibrium case to connect it with the rate of change of free energy of the system, and establish complementary relations between non-Markovianity and maximum loss of free energy. We naturally conclude that non-Markovianity in terms of divisibility breaking is a necessary resource for the backflow of other resources like purity or free energy under the corresponding allowed operations.

Abstract

This paper proposes the use of copula theory for cooperative spectrum sensing (CSS) of orthogonal frequency-division multiplexing (OFDM) based primary user (PU). A distributed detection model is assumed where secondary users (SUs) employ autocorrelation detectors (ADs) for the detection of a PU. In the presence of a PU, it is assumed that the observations across different SUs and subsequently the decision statistics are dependent. For the fusion of these dependent statistics, different copulas such as -copula, Gaussian, Clayton and Gumbel are employed. In the presence of dependence among decision statistics, significant improvement in detection performance is observed while using copula theory instead of the traditional assumption of independence. Simulation results are presented to show the superiority of copula-based spectrum sensing.

Abstract

Cross-tier interference management is one of the major challenges in heterogeneous cellular networks (HetNets). Though the network throughput increases due to a better area spectral efficiency of a HetNet, there is possibility that high interference will make few link capacities close to zero when users regard interference as noise (IAN). In this letter, successive interference cancellation (SIC) is used to cancel the cross-tier interference in a reverse time division duplexing (RTDD) scheme. We demonstrate that by opportunistic use of SIC, a minimum guarantee on the sum link capacity can be ensured for an RTDD HetNet. This minimum sum link capacity is later on proved to be the maximum that can be achieved by orthogonal resource allocation schemes. Through system-level simulations for random allocation, it is shown that the proposed scheme is better than using SIC and IAN alone. To further improve the overall system capacity, an optimization problem for selecting co-channel users is formulated, and the Hungarian algorithm is employed to solve it.

Abstract

This paper analyzes the performance of low earth orbit (LEO) satellites based internet-of-things (IoT) network where each IoT node makes use of multiple satellites to communicate with the ground station (GS). In this work, we consider fixed and variable gain amplify-and-forward (AF) relaying protocol at each satellite where the received signal from each IoT node is amplified before transmitting to the terrestrial GS for data processing. To analyze the performance of this novel LEO satellites based direct access architecture, the closed-form expressions for outage probability are derived considering two combining schemes at the GS:(i) selection combining;(ii) maximal ratio combining. Further, to gain more insights for diversity order and coding gain, asymptotic outage probability analysis at high SNR for both schemes is also performed. Finally, simulation results are presented to validate the analytical results derived and also to develop several interesting insights into the system performance.

Abstract

This paper develops efficient channel estimation techniques for millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems under practical hardware limitations, including an arbitrary array geometry and a hybrid hardware structure. Taking on an angle-based approach, this work adopts a generalized array manifold separation approach via Jacobi-Anger approximation, which transforms a non-ideal, non-uniform array manifold into a virtual array domain with a desired uniform geometric structure to facilitate super-resolution angle estimation and channel acquisition. Accordingly, structure-based optimization techniques are developed to effectively estimate both the channel covariance and the instantaneous channel state information (CSI) within a short sensing time. The different time-varying scales of channel path angles versus path gains are capitalized to design a two-step CSI estimation scheme that can quickly sense fading channels. Theoretical results are provided on the fundamental limits of the proposed technique in terms of sample efficiency. For computational efficiency, a fast iterative algorithm is developed via the alternating direction method of multipliers. Other related issues such as spurious-peak cancellation in non-uniform linear arrays and extensions to higher-dimensional cases are also discussed. Simulations testify the effectiveness of the proposed approaches in hybrid mmWave massive MIMO systems with arbitrary arrays.

Abstract

Coding theoretic techniques have been proposed for synchronous Gradient Descent (GD) on multiple servers to mitigate stragglers. These techniques provide the flexibility that the job is complete when any k out of n servers finish their assigned tasks. The task size on each server is found based on the values of k and n. However, it is assumed that all the n jobs are started when the job is requested. In contrast, we assume a tiered system, where we start with n1 ≥ k tasks, and on completion of c tasks, we start n2 – n1 more tasks. The aim is that as long as k servers can execute their tasks, the job gets completed. This paper exploits the flexibility that not all servers are started at the request time to obtain the achievable task sizes on each server. The task sizes are in general lower than starting all n2 tasks at the request times thus helping achieve lower task sizes which helps to reduce both the job completion time and the total server utilization.

Abstract

Distributed databases often suffer unequal distribution of data among storage nodes, which is known asdata skew'. Data skew arises from a number of causes such as removal of existing storage nodes and addition of new empty nodes to the database. Data skew leads to performance degradations and necessitatesrebalancing'at regular intervals to reduce the amount of skew. We define an -balanced distributed database as a distributed database in which the storage across the nodes has uniform size, and each bit of the data is replicated in distinct storage nodes. We consider the problem of designing such balanced databases along with associated rebalancing schemes which maintain the -balanced property under node removal and addition operations. We present a class of -balanced databases (parameterized by the number of storage nodes) which have the property of structural invariance, ie, the databases designed for different number of storage nodes have the same structure. For this class of -balanced databases, we present rebalancing schemes which use coded transmissions between storage nodes, and characterize their communication loads under node addition and removal. We show that the communication cost incurred to rebalance our distributed database for node addition and removal is optimal, ie, it achieves the minimum possible cost among all possible balanced distributed databases and rebalancing schemes.