Paritosh Ramanan

Paritosh Ramanan

Auto-generated profile, based on publicly available information

Paritosh Ramanan

School of Computational Science and Engineering Georgia Institute of Technology 30332 Atlanta GA USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 August 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
PRParitosh Ramanan
Paritosh Ramanan
DLDan Li
Dan Li
NGNagi Gebraeel
Nagi Gebraeel
Large-scale power systems are composed of regional utilities with assets that stream sensor readings in real time. In order to detect cyberattacks, the globally acquired, real-time sensor data needs to be analyzed in a centralized fashion. However, owing to operational constraints, such a centralized sharing mechanism turns out to be a major obstacle. In this article, we propose a blockchain-based decentralized framework for detecting coordinated replay attacks with full privacy of sensor data. We develop a Bayesian inference mechanism employing locally reported attack probabilities that is tailor made for a blockchain framework. We compare our framework to a traditional decentralized algorithm based on the broadcast gossip framework both theoretically as well as empirically. With the help of experiments on a private Ethereum blockchain, we show that our approach achieves good detection quality and significantly outperforms gossip-driven approaches in terms of accuracy, timeliness, and scalability.

9 April 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
PRParitosh Ramanan
Paritosh Ramanan
MYMurat Yildirim
Murat Yildirim
ECEdmond Chow
Edmond Chow
NGNagi Gebraeel
Nagi Gebraeel
With increased reliance on cyber infrastructure, large scale power networks face new challenges owing to computational scalability. In this paper, we focus on developing an asynchronous decentralized solution framework for the unit commitment problem for large scale power networks. We exploit the inherent asynchrony in a region based decomposition arising out of imbalance in regional subproblems to boost computational efficiency. A two-phase algorithm is proposed that relies on the convex relaxation and privacy preserving valid inequalities in order to deliver algorithmic improvements. Our algorithm employs a novel interleaved binary mechanism that locally switches from the convex subproblem to its binary counterpart based on consistent local convergent behavior. We develop a high-performance computing oriented software framework that uses message passing interface to drive our benchmark studies. Our simulations performed on the IEEE 3012 bus case are benchmarked against the centralized and a state-of-the-art synchronous decentralized method. The results demonstrate that the asynchronous method improves computational efficiency by a significant amount and provides a competitive solution quality rivaling the benchmark methods.

1 December 2020
Verified
Conference Paper
Open access
DLDan Li
Dan Li
PRParitosh Ramanan
Paritosh Ramanan
NGNagi Gebraeel
Nagi Gebraeel
KPKamran Paynabar
Kamran Paynabar
Cybersecurity of Industrial Control Systems (ICS) is drawing significant concerns as data communication increasingly leverages wireless networks. A lot of data-driven methods were developed for detecting cyberattacks, but few are focused on distinguishing them from equipment faults. In this paper, we develop a data-driven framework that can be used to detect, diagnose, and localize a type of cyberattack called covert attacks on smart grids. The framework has a hybrid design that combines an autoencoder, a recurrent neural network (RNN) with a Long-Short-Term-Memory (LSTM) layer, and a Deep Neural Network (DNN). This data-driven framework considers the temporal behavior of a generic physical system that extracts features from the time series of the sensor measurements that can be used for detecting covert attacks, distinguishing them from equipment faults, as well as localize the attack/fault. We evaluate the performance of the proposed method through a realistic simulation study on the IEEE 14-bus model as a typical example of ICS. We compare the performance of the proposed method with the traditional model-based method to show its applicability and efficacy.

1 June 2021 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
PRParitosh Ramanan
Paritosh Ramanan
MYMurat Yildirim
Murat Yildirim
NGNagi Gebraeel
Nagi Gebraeel
ECEdmond Chow
Edmond Chow
Unit Commitment (UC) is a fundamental problem in power system operations. When coupled with generation maintenance, the joint optimization problem poses significant computational challenges due to coupling constraints linking maintenance and UC decisions. Obviously, these challenges grow with the size of the network. With the introduction of sensors for monitoring generator health and condition-based maintenance(CBM), these challenges have been magnified. ADMM-based decentralized methods have shown promise in solving large-scale UC problems, especially in vertically integrated power systems. However, in their current form, these methods fail to deliver similar computational performance and scalability when considering the joint UC and CBM problem. This paper provides a novel decentralized optimization framework for solving large-scale, joint UC and CBM problems. Our approach relies on the novel use of the subgradient method to temporally decouple various subproblems of the ADMM-based formulation of the joint problem along the maintenance horizon. By effectively utilizing multithreading, our decentralized subgradient approach delivers superior computational performance and eliminates the need to move sensor data thereby alleviating privacy and security concerns. Using experiments on large scale test cases, we show that our framework can provide a speedup of upto 50x as compared to various state of the art benchmarks without compromising on solution quality.

10 October 2022 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
PRParitosh Ramanan
Paritosh Ramanan
MYMurat Yildirim
Murat Yildirim
NGNagi Gebraeel
Nagi Gebraeel
ECEdmond Chow
Edmond Chow
Increasing sensor instrumentation has been critical to the improvement of power network operations and maintenance while challenges linked to data ownership and privacy remain. To this end, decentralized methods have been popular for their computational scalability while enabling data ownership by utility stakeholders. However, decentralization also requires sharing network flow estimates over public channels raising privacy concerns. In this paper, we propose a differential privacy driven, ADMM approach for decentralized, mixed integer optimization of operations and maintenance problems which preserves privacy of network flow estimates. We prove strong privacy guarantees by leveraging the linear relationship between the phase angles and flow. To address challenges associated with the mixed integer and dynamic nature of the problem, we introduce an exponential moving average based consensus mechanism to enhance convergence, coupled with a control chart based convergence criteria to improve stability. Our results demonstrate that our privacy preserving approach is robust to a range of noise levels and operational scenarios, delivering solutions on par with benchmark methods.

18 October 2020 in arXiv
Verified
Preprint
Open access
PDF file
PRParitosh Ramanan
Paritosh Ramanan
KNKiyoshi Nakayama
Kiyoshi Nakayama
A key aspect of Federated Learning (FL) is the requirement of a centralized aggregator to maintain and update the global model. However, in many cases orchestrating a centralized aggregator might be infeasible due to numerous operational constraints. In this paper, we introduce BAFFLE, an aggregator free, blockchain driven, FL environment that is inherently decentralized. BAFFLE leverages Smart Contracts (SC) to coordinate the round delineation, model aggregation and update tasks in FL. BAFFLE boosts computational performance by decomposing the global parameter space into distinct chunks followed by a score and bid strategy. In order to characterize the performance of BAFFLE, we conduct experiments on a private Ethereum network and use the centralized and aggregator driven methods as our benchmark. We show that BAFFLE significantly reduces the gas costs for FL on the blockchain as compared to a direct adaptation of the aggregator based method. Our results also show that BAFFLE achieves high scalability and computational efficiency while delivering similar accuracy as the benchmark methods.