arXiv subjects

Arnab Roy

Publications and source records attributed to Arnab Roy.

75 records · Page 5Linked to original sources

arXiv2018

Initial Access Frameworks for 3GPP NR at mmWave Frequencies

The use of millimeter wave (mmWave) frequencies for communication will be one of the innovations of the next generation of cellular mobile networks (5G). It will provide unprecedented data rates, but is highly susceptible to rapid channel variations and suffers from severe isotropic pathloss. Highly directional antennas at the transmitter and the receiver will be used to compensate for these shortcomings and achieve sufficient link budget in wide area networks. However, directionality demands precise alignment of the transmitter and the receiver beams, an operation which has important implications for control plane procedures, such as initial access, and may increase the delay of the data transmission. This paper provides a comparison of measurement frameworks for initial access in mmWave cellular networks in terms of detection accuracy, reactiveness and overhead, using parameters recently standardized by the 3GPP and a channel model based on real-world measurements. We show that the best strategy depends on the specific environment in which the nodes are deployed, and provide guidelines to characterize the optimal choice as a function of the system parameters.

cs.NI↗

arXiv2015

A Symbolic Logic with Concrete Bounds for Cryptographic Protocols

We present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide axioms for reasoning about digital signatures and random nonces, with security properties based on the concrete security of signature schemes and pseudorandom number generators (PRG). The formal logic supports first-order reasoning and reasoning about protocol invariants, taking concrete security bounds into account. Proofs constructed in our logic also provide conventional asymptotic security guarantees because of the way that concrete bounds accumulate in proofs. As an illustrative example, we use the formal logic to prove an authentication property with concrete bounds of a signature-based challenge-response protocol.

cs.LO↗

arXiv2014

New crossover operators for multiple subset selection tasks

We have introduced two crossover operators, MMX-BLXexploit and MMX-BLXexplore, for simultaneously solving multiple feature/subset selection problems where the features may have numeric attributes and the subset sizes are not predefined. These operators differ on the level of exploration and exploitation they perform; one is designed to produce convergence controlled mutation and the other exhibits a quasi-constant mutation rate. We illustrate the characteristic of these operators by evolving pattern detectors to distinguish alcoholics from controls using their visually evoked response potentials (VERPs). This task encapsulates two groups of subset selection problems; choosing a subset of EEG leads along with the lead-weights (features with attributes) and the other that defines the temporal pattern that characterizes the alcoholic VERPs. We observed better generalization performance from MMX-BLXexplore. Perhaps, MMX-BLXexploit was handicapped by not having a restart mechanism. These operators are novel and appears to hold promise for solving simultaneous feature selection problems.

cs.NE↗