Ashok Karukutla
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ashok Karukutla has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Harsh Kumar
R.B. Annis School of Engineering, University of Indianapolis, Indianapolis, IN 46227, USA
3 shared publications - Henok Berhanu Tsegaye
Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, USA
3 shared publications - Michael Devetsikiotis
Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, USA
3 shared publications - Petro Mushidi Tshakwanda
Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, USA
3 shared publications - Raddad Almaayn
Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, USA
3 shared publications - Abid Mohammad Ali
Department of Electrical and Computer Engineering, The University of New Mexico, Albuquerque, NM 87106, USA
2 shared publications
Latest Publications
- Open Access
- 2 November 2026
- Published by MDPI AG in Electronics
- Vol. 15 (21) , 5086
Unified Blockchain Provenance and Bayesian Reputation for Additive Manufacturing Supply Chains
In additive manufacturing (AM) supply chains, systems that record provenance and score reputation as separate transactions let lifecycle records and assessments diverge. We present a Hyperledger Fabric chaincode that commits a provenance event, the Bayesian reputation update it implies and their link in one read–write set. An on-chain policy admits ratings only from counterparty organizations; reputation gates authorize future activities but never block recording outcomes. Under client crashes in the measured partial-write window, the unified design produced no divergence in 3900 trials (2900 with version 1.0, 1000 with version 1.1), while a client-orchestrated two-chaincode deployment diverged in all 1000 trials of two control batches. A same-channel InvokeChaincode arrangement also produced none in 1000, at 4.5 ms more endorsement and 11.7% lower throughput at 100 transactions in flight. On four desktops, open-loop load saturates near 12 tx/s, and a 12-h soak at 6 tx/s committed 98.7% of submissions with no partial record found. Ledger experiments cover gate refusal, failed outcomes, recovery and disputes; with client retry, 540 contended ratings each committed once. A simulation quantifies gate errors and shows that evaluation-time decay reacts slowly when active actors’ performance drops. The scores record submitted outcomes; they are not validated measures of performance.
- 2 November 2026
- Published by MDPI AG in Electronics
- Vol. 15 (21) , 5086
Open AccessUnified Blockchain Provenance and Bayesian Reputation for Additive Manufacturing Supply Chains
In additive manufacturing (AM) supply chains, systems that record provenance and score reputation as separate transactions let lifecycle records and assessments diverge. We present a Hyperledger Fabric chaincode that commits a provenance event, the Bayesian reputation update it implies and their link in one read–write set. An on-chain policy admits ratings only from counterparty organizations; reputation gates authorize future activities but never block recording outcomes. Under client crashes in the measured partial-write window, the unified design produced no divergence in 3900 trials (2900 with version 1.0, 1000 with version 1.1), while a client-orchestrated two-chaincode deployment diverged in all 1000 trials of two control batches. A same-channel InvokeChaincode arrangement also produced none in 1000, at 4.5 ms more endorsement and 11.7% lower throughput at 100 transactions in flight. On four desktops, open-loop load saturates near 12 tx/s, and a 12-h soak at 6 tx/s committed 98.7% of submissions with no partial record found. Ledger experiments cover gate refusal, failed outcomes, recovery and disputes; with client retry, 540 contended ratings each committed once. A simulation quantifies gate errors and shows that evaluation-time decay reacts slowly when active actors’ performance drops. The scores record submitted outcomes; they are not validated measures of performance.
- Open Access
- 26 December 2025
- Published by MDPI AG in Automation
- Vol. 7 (1) , 5
Reinforcement Learning for Uplink Access Optimization in UAV-Assisted 5G Networks Under Emergency Response
We study UAV-assisted 5G uplink connectivity for disaster response, in which a UAV (unmanned aerial vehicle) acts as an aerial base station to restore service to ground users. We formulate a joint control problem coupling UAV kinematics (bounded acceleration and velocity), per-subchannel uplink power allocation, and uplink non-orthogonal multiple access (UL-NOMA) scheduling with adaptive successive interference cancellation (SIC) under a minimum user-rate constraint. The wireless channel follows 3GPP urban macro (UMa) with probabilistic line of sight/non-line of sight (LoS/NLoS), realistic receiver noise levels and noise figure, and user equipment (UE) transmit-power limits. We propose a bounded-action proximal policy optimization with generalized advantage estimation (PPO-GAE) agent that parameterizes acceleration and power with squashed distributions and enforces feasibility by design. Across four user distributions (clustered, uniform, ring, and edge-heavy) and multiple rate thresholds, our method increases the fraction of users meeting the target rate by 8.2–10.1 percentage points compared to strong baselines (OFDMA with heuristic placement, PSO-based placement/power, and PPO without NOMA) while reducing median UE transmit power by . The results are averaged over at least five random seeds, with confidence intervals. Ablations isolate the gains from NOMA, adaptive SIC order, and bounded-action parameterization. We discuss robustness to imperfect SIC and CSI errors and release code/configurations to support reproducibility.- 26 December 2025
- Published by MDPI AG in Automation
- Vol. 7 (1) , 5
Open AccessReinforcement Learning for Uplink Access Optimization in UAV-Assisted 5G Networks Under Emergency Response
We study UAV-assisted 5G uplink connectivity for disaster response, in which a UAV (unmanned aerial vehicle) acts as an aerial base station to restore service to ground users. We formulate a joint control problem coupling UAV kinematics (bounded acceleration and velocity), per-subchannel uplink power allocation, and uplink non-orthogonal multiple access (UL-NOMA) scheduling with adaptive successive interference cancellation (SIC) under a minimum user-rate constraint. The wireless channel follows 3GPP urban macro (UMa) with probabilistic line of sight/non-line of sight (LoS/NLoS), realistic receiver noise levels and noise figure, and user equipment (UE) transmit-power limits. We propose a bounded-action proximal policy optimization with generalized advantage estimation (PPO-GAE) agent that parameterizes acceleration and power with squashed distributions and enforces feasibility by design. Across four user distributions (clustered, uniform, ring, and edge-heavy) and multiple rate thresholds, our method increases the fraction of users meeting the target rate by 8.2–10.1 percentage points compared to strong baselines (OFDMA with heuristic placement, PSO-based placement/power, and PPO without NOMA) while reducing median UE transmit power by . The results are averaged over at least five random seeds, with confidence intervals. Ablations isolate the gains from NOMA, adaptive SIC order, and bounded-action parameterization. We discuss robustness to imperfect SIC and CSI errors and release code/configurations to support reproducibility. - Open Access
- 24 September 2025
- Published by MDPI AG in Preprints.org
Reinforcement Learning for Uplink Access Optimization in UAV-Assisted 5G Networks Under Emergency Response
We study Unmanned Aerial Vehicle (UAV) assisted 5G uplink connectivity for disaster response, where a UAV acts as an aerial base station to restore service to ground users. We formulate a joint control problem coupling UAV kinematics (bounded acceleration and velocity), per-subchannel uplink power allocation, and uplink Non-Orthogonal Multiple Access (UL-NOMA) scheduling with adaptive successive interference cancellation (SIC) under a minimum user-rate constraint. The wireless channel follows 3GPP urban macro (UMa) with probabilistic Line of Sight/Non Line of Sight (LoS/NLoS), realistic receiver noise and noise figure, and user equipment (UE) transmit-power limits. We propose a bounded-action proximal policy optimization with generalized advantage estimation (PPO-GAE) agent that parameterizes acceleration and power with squashed distributions and enforces feasibility by design. Across four user distributions (clustered, uniform, ring, edge-heavy) and multiple rate thresholds, our method increases the fraction of users meeting the target rate by 8.2−10.1 percentage points over strong baselines (OFDMA with heuristic placement, PSO-based placement/power, PPO without NOMA) while reducing median UE transmit power by 64.6%. Results are averaged over ≥5 random seeds with 95% confidence intervals; ablations isolate the gains from NOMA, adaptive SIC order, and bounded action parameterization. We discuss robustness to imperfect SIC and CSI errors, and release code/configurations to support reproducibility.
- 24 September 2025
- Published by MDPI AG in Preprints.org
Open AccessReinforcement Learning for Uplink Access Optimization in UAV-Assisted 5G Networks Under Emergency Response
We study Unmanned Aerial Vehicle (UAV) assisted 5G uplink connectivity for disaster response, where a UAV acts as an aerial base station to restore service to ground users. We formulate a joint control problem coupling UAV kinematics (bounded acceleration and velocity), per-subchannel uplink power allocation, and uplink Non-Orthogonal Multiple Access (UL-NOMA) scheduling with adaptive successive interference cancellation (SIC) under a minimum user-rate constraint. The wireless channel follows 3GPP urban macro (UMa) with probabilistic Line of Sight/Non Line of Sight (LoS/NLoS), realistic receiver noise and noise figure, and user equipment (UE) transmit-power limits. We propose a bounded-action proximal policy optimization with generalized advantage estimation (PPO-GAE) agent that parameterizes acceleration and power with squashed distributions and enforces feasibility by design. Across four user distributions (clustered, uniform, ring, edge-heavy) and multiple rate thresholds, our method increases the fraction of users meeting the target rate by 8.2−10.1 percentage points over strong baselines (OFDMA with heuristic placement, PSO-based placement/power, PPO without NOMA) while reducing median UE transmit power by 64.6%. Results are averaged over ≥5 random seeds with 95% confidence intervals; ablations isolate the gains from NOMA, adaptive SIC order, and bounded action parameterization. We discuss robustness to imperfect SIC and CSI errors, and release code/configurations to support reproducibility.