Anish Arora
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anish Arora has a total of 130 co-authors. Here are the top co-authors by number of shared publications:
- Nadim
Iowa State University, Ames, USA
4 shared publications - Salil Reddy
The Ohio State University, Columbus, Ohio, USA
4 shared publications - Sarath Babu
Iowa State University, Ames, USA
4 shared publications - Yung-Fu Chen
The Ohio State University
4 shared publications - Arsalan Ahmad
Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA
3 shared publications - Chengzhang Li
The Ohio State University, Columbus, Ohio, USA
3 shared publications
Latest Publications
- Open Access
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 501-510
Communication-Aware Model Distributed Inference via Latent Representation Compression
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 501-510
Open AccessCommunication-Aware Model Distributed Inference via Latent Representation Compression
- Open Access
- 31 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Co-Designing Agentic AI and Wireless/Edge Networks: A Vision for Self-Evolving, Trustworthy Network Intelligence
- 31 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessCo-Designing Agentic AI and Wireless/Edge Networks: A Vision for Self-Evolving, Trustworthy Network Intelligence
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-21
AraOptical System and Testbed for Long-Range, High-Capacity FSOC in Rural Wireless X-Haul Networks
Long-range, high-capacity free-space optical communications (FSOC) is critical for terrestrial rural wireless x-haul and rural broadband in general. Existing terrestrial FSOC systems are however designed primarily for short-range communications. Long-range FSOC faces major challenges such as scintillation, weather, telescope misalignment, and sun noise, and there is a lack of FSOC systems and testbeds for investigating the feasibility and behavior of long-range, high-capacity terrestrial FSOC in realistic rural settings. To fill the gap, we design and implement AraOptical, a first-of-its-kind 10+ km FSOC x-haul system. We permanently deploy the AraOptical system and make it publicly available as the rural ARA testbed for empowering researchers worldwide to investigate long-range FSOC and wireless x-haul solutions. The AraOptical system features innovative designs for addressing key challenges of long-range FSOC. It effectively uses optimized COTS components such as feedback-controlled-low-noise-amplifiers and transceivers compatible with conventional routers, and it invents a novel multi-level auto-alignment algorithm tailored for the AraOptical system. The software framework of the AraOptical system features custom-designed APIs and facilitates the establishment of the ARA wireless living lab for real-world experimentation. Using the field-deployed ARA, we demonstrate, for the first time, the real-world feasibility of long-range terrestrial FSOC. AraOptical achieves a maximum throughput of 2.92 Gbps on a single channel, and, with 16 parallel channels, AraOptical is well-poised to scale to an aggregate capacity of 160 Gbps using 10G SFP+ transceivers, with potential for multi-Tbps capacity using 100G/400G coherent transceivers. We also quantitatively characterize the impact of scintillation and weather on long-range terrestrial FSOC, and we will publicly share the first-of-its-kind measurement data. The unique lessons learned from this pioneering real-world deployment of long-range FSOC systems will also facilitate future real-world studies and adoption.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-21
Open AccessAraOptical System and Testbed for Long-Range, High-Capacity FSOC in Rural Wireless X-Haul Networks
Long-range, high-capacity free-space optical communications (FSOC) is critical for terrestrial rural wireless x-haul and rural broadband in general. Existing terrestrial FSOC systems are however designed primarily for short-range communications. Long-range FSOC faces major challenges such as scintillation, weather, telescope misalignment, and sun noise, and there is a lack of FSOC systems and testbeds for investigating the feasibility and behavior of long-range, high-capacity terrestrial FSOC in realistic rural settings. To fill the gap, we design and implement AraOptical, a first-of-its-kind 10+ km FSOC x-haul system. We permanently deploy the AraOptical system and make it publicly available as the rural ARA testbed for empowering researchers worldwide to investigate long-range FSOC and wireless x-haul solutions. The AraOptical system features innovative designs for addressing key challenges of long-range FSOC. It effectively uses optimized COTS components such as feedback-controlled-low-noise-amplifiers and transceivers compatible with conventional routers, and it invents a novel multi-level auto-alignment algorithm tailored for the AraOptical system. The software framework of the AraOptical system features custom-designed APIs and facilitates the establishment of the ARA wireless living lab for real-world experimentation. Using the field-deployed ARA, we demonstrate, for the first time, the real-world feasibility of long-range terrestrial FSOC. AraOptical achieves a maximum throughput of 2.92 Gbps on a single channel, and, with 16 parallel channels, AraOptical is well-poised to scale to an aggregate capacity of 160 Gbps using 10G SFP+ transceivers, with potential for multi-Tbps capacity using 100G/400G coherent transceivers. We also quantitatively characterize the impact of scintillation and weather on long-range terrestrial FSOC, and we will publicly share the first-of-its-kind measurement data. The unique lessons learned from this pioneering real-world deployment of long-range FSOC systems will also facilitate future real-world studies and adoption.
- 18 November 2025
- Published by Springer Nature
- p. 128-145
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
- 18 November 2025
- Published by Springer Nature
- p. 128-145
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
- Open Access
MoCap2Radar: A Spatiotemporal Transformer for Synthesizing Micro-Doppler Radar Signatures from Motion Capture
We present a pure machine learning process for synthesizing radar spectrograms from Motion-Capture (MoCap) data. We formulate MoCap-to-spectrogram translation as a windowed sequence-to-sequence task using a transformer-based model that jointly captures spatial relations among MoCap markers and temporal dynamics across frames. Real-world experiments show that the proposed approach produces visually and quantitatively plausible doppler radar spectrograms and achieves good generalizability. Ablation experiments show that the learned model includes both the ability to convert multi-part motion into doppler signatures and an understanding of the spatial relations between different parts of the human body. The result is an interesting example of using transformers for time-series signal processing. It is especially applicable to edge computing and Internet of Things (IoT) radars. It also suggests the ability to augment scarce radar datasets using more abundant MoCap data for training higher-level applications. Finally, it requires far less computation than physics-based methods for generating radar data.
Open AccessMoCap2Radar: A Spatiotemporal Transformer for Synthesizing Micro-Doppler Radar Signatures from Motion Capture
We present a pure machine learning process for synthesizing radar spectrograms from Motion-Capture (MoCap) data. We formulate MoCap-to-spectrogram translation as a windowed sequence-to-sequence task using a transformer-based model that jointly captures spatial relations among MoCap markers and temporal dynamics across frames. Real-world experiments show that the proposed approach produces visually and quantitatively plausible doppler radar spectrograms and achieves good generalizability. Ablation experiments show that the learned model includes both the ability to convert multi-part motion into doppler signatures and an understanding of the spatial relations between different parts of the human body. The result is an interesting example of using transformers for time-series signal processing. It is especially applicable to edge computing and Internet of Things (IoT) radars. It also suggests the ability to augment scarce radar datasets using more abundant MoCap data for training higher-level applications. Finally, it requires far less computation than physics-based methods for generating radar data.
- Open Access
- 11 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 76-85
MUDAS: Mote-scale Unsupervised Domain Adaptation in Multi-label Sound Classification
- 11 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 76-85
Open AccessMUDAS: Mote-scale Unsupervised Domain Adaptation in Multi-label Sound Classification
- Open Access
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
We propose a simple algorithm that needs only a few data samples from a single graph for learning local routing policies that generalize across a rich class of geometric random graphs in Euclidean metric spaces. We thus solve the all-pairs near-shortest path problem by training deep neural networks (DNNs) that let each graph node efficiently and scalably route (i.e., forward) packets by considering only the node's state and the state of the neighboring nodes. Our algorithm design exploits network domain knowledge in the selection of input features and design of the policy function for learning an approximately optimal policy. Domain knowledge also provides theoretical assurance that the choice of a ``seed graph'' and its node data sampling suffices for generalizable learning. Remarkably, one of these DNNs we train -- using distance-to-destination as the only input feature -- learns a policy that exactly matches the well-known Greedy Forwarding policy, which forwards packets to the neighbor with the shortest distance to the destination. We also learn a new policy, which we call GreedyTensile routing -- using both distance-to-destination and node stretch as the input features -- that almost always outperforms greedy forwarding. We demonstrate the explainability and ultra-low latency run-time operation of Greedy Tensile routing by symbolically interpreting its DNN in low-complexity terms of two linear actions.
Open AccessKnowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
We propose a simple algorithm that needs only a few data samples from a single graph for learning local routing policies that generalize across a rich class of geometric random graphs in Euclidean metric spaces. We thus solve the all-pairs near-shortest path problem by training deep neural networks (DNNs) that let each graph node efficiently and scalably route (i.e., forward) packets by considering only the node's state and the state of the neighboring nodes. Our algorithm design exploits network domain knowledge in the selection of input features and design of the policy function for learning an approximately optimal policy. Domain knowledge also provides theoretical assurance that the choice of a ``seed graph'' and its node data sampling suffices for generalizable learning. Remarkably, one of these DNNs we train -- using distance-to-destination as the only input feature -- learns a policy that exactly matches the well-known Greedy Forwarding policy, which forwards packets to the neighbor with the shortest distance to the destination. We also learn a new policy, which we call GreedyTensile routing -- using both distance-to-destination and node stretch as the input features -- that almost always outperforms greedy forwarding. We demonstrate the explainability and ultra-low latency run-time operation of Greedy Tensile routing by symbolically interpreting its DNN in low-complexity terms of two linear actions.
- Open Access
MILAAP: Mobile Link Allocation via Attention-based Prediction
Channel hopping (CS) communication systems must adapt to interference changes in the wireless network and to node mobility for maintaining throughput efficiency. Optimal scheduling requires up-to-date network state information (i.e., of channel occupancy) to select non-overlapping channels for links in interference regions. However, state sharing among nodes introduces significant communication overhead, especially as network size or node mobility scale, thereby decreasing throughput efficiency of already capacity-limited networks. In this paper, we eschew state sharing while adapting the CS schedule based on a learning-based channel occupancy prediction. We propose the MiLAAP attention-based prediction framework for machine learning models of spectral, spatial, and temporal dependencies among network nodes. MiLAAP uses a self-attention mechanism that lets each node capture the temporospectral CS pattern in its interference region and accordingly predict the channel occupancy state within that region. Notably, the prediction relies only on locally and passively observed channel activities, and thus introduces no communication overhead. To deal with node mobility, MiLAAP also uses a multi-head self-attention mechanism that lets each node locally capture the spatiotemporal dependencies on other network nodes that can interfere with it and accordingly predict the motion trajectory of those nodes. Detecting nodes that enter or move outside the interference region is used to further improve the prediction accuracy of channel occupancy. We show that for dynamic networks that use local CS sequences to support relatively long-lived flow traffics, the channel state prediction accuracy of MiLAAP is remarkably ~100% across different node mobility patterns and it achieves zero-shot generalizability across different periods of CS sequences.
Open AccessMILAAP: Mobile Link Allocation via Attention-based Prediction
Channel hopping (CS) communication systems must adapt to interference changes in the wireless network and to node mobility for maintaining throughput efficiency. Optimal scheduling requires up-to-date network state information (i.e., of channel occupancy) to select non-overlapping channels for links in interference regions. However, state sharing among nodes introduces significant communication overhead, especially as network size or node mobility scale, thereby decreasing throughput efficiency of already capacity-limited networks. In this paper, we eschew state sharing while adapting the CS schedule based on a learning-based channel occupancy prediction. We propose the MiLAAP attention-based prediction framework for machine learning models of spectral, spatial, and temporal dependencies among network nodes. MiLAAP uses a self-attention mechanism that lets each node capture the temporospectral CS pattern in its interference region and accordingly predict the channel occupancy state within that region. Notably, the prediction relies only on locally and passively observed channel activities, and thus introduces no communication overhead. To deal with node mobility, MiLAAP also uses a multi-head self-attention mechanism that lets each node locally capture the spatiotemporal dependencies on other network nodes that can interfere with it and accordingly predict the motion trajectory of those nodes. Detecting nodes that enter or move outside the interference region is used to further improve the prediction accuracy of channel occupancy. We show that for dynamic networks that use local CS sequences to support relatively long-lived flow traffics, the channel state prediction accuracy of MiLAAP is remarkably ~100% across different node mobility patterns and it achieves zero-shot generalizability across different periods of CS sequences.
- 19 March 2025
- Published by Elsevier in Computer Networks
- Vol. 263
Design and implementation of ARA wireless living lab for rural broadband and applications
- 19 March 2025
- Published by Elsevier in Computer Networks
- Vol. 263
Design and implementation of ARA wireless living lab for rural broadband and applications
- Open Access
- 4 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1898-1905
AraSync: Precision Time Synchronization in Rural Wireless Living Lab
Time synchronization is a critical component in network operation and management, and it is also required by Ultra-Reliable, Low-Latency Communications (URLLC) in next-generation wireless systems such as those of 5G, 6G, and Open RAN. In this context, we design and implement AraSync as an end-to-end time synchronization system in the ARA wireless living lab to enable advanced wireless experiments and applications involving stringent time constraints. We make use of Precision Time Protocol (PTP) at different levels to achieve synchronization accuracy in the order of nanoseconds. Along with fiber networks, AraSync enables time synchronization across the AraHaul wireless x-haul network consisting of long-range, high-capacity mmWave and microwave links. In this paper, we present the detailed design and implementation of AraSync, including its hardware and software components and the PTP network topology. Further, we experimentally characterize the performance of AraSync from spatial and temporal dimensions. Our measurement and analysis of the clock offset and mean path delay show the impact of the wireless channel and weather conditions on the PTP synchronization accuracy.
- 4 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1898-1905
Open AccessAraSync: Precision Time Synchronization in Rural Wireless Living Lab
Time synchronization is a critical component in network operation and management, and it is also required by Ultra-Reliable, Low-Latency Communications (URLLC) in next-generation wireless systems such as those of 5G, 6G, and Open RAN. In this context, we design and implement AraSync as an end-to-end time synchronization system in the ARA wireless living lab to enable advanced wireless experiments and applications involving stringent time constraints. We make use of Precision Time Protocol (PTP) at different levels to achieve synchronization accuracy in the order of nanoseconds. Along with fiber networks, AraSync enables time synchronization across the AraHaul wireless x-haul network consisting of long-range, high-capacity mmWave and microwave links. In this paper, we present the detailed design and implementation of AraSync, including its hardware and software components and the PTP network topology. Further, we experimentally characterize the performance of AraSync from spatial and temporal dimensions. Our measurement and analysis of the clock offset and mean path delay show the impact of the wireless channel and weather conditions on the PTP synchronization accuracy.