Shreyas Devaraju

Shreyas Devaraju

Auto-generated profile, based on publicly available information

Shreyas Devaraju

Computational Science Research Center, San Diego State University, San Diego, CA, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
29 July 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
SDShreyas Devaraju
Shreyas Devaraju
AIAlexander Ihler
Alexander Ihler
SKSunil Kumar
Sunil Kumar
Wireless networks consisting of low SWaP (size, weight, and power), fixed-wing UAVs (unmanned aerial vehicles) are used in many applications, such as search, monitoring and information gathering of inaccessible areas, in which UAVs sense within an area and forward the information, in a multihop manner, to an aerial base station (BS). Robustly performing these tasks requires the UAV network to be decentralized, autonomous, and scalable. An important tradeoff is between area coverage and connectivity: fast area coverage is needed to quickly identify objects of interest, while connectivity must be maintained for coordination and to transmit sensed information to the BS in real time. These factors must be balanced by the mobility model, which for each UAV has access only to locally available information. While [1], [2] attempt to balance these factors using flocking behavior, this only encourages the UAVs to spread, rather than using knowledge of what areas have already been covered. In this paper, we develop a neighborhood- and BS-connectivity aware distributed pheromone mobility model, called BS-CAP, to autonomously coordinate the UAV movements in a decentralized network. By using a pheromone map, we directly incorporate recent coverage information for the area. We then extend our approach to a deep Q-learning policy variant, called BSCAPDQN, to further tune and improve the balance between coverage and connectivity. These mobility models are fully distributed and rely only on information from neighboring UAVs. Our simulations demonstrate that both models achieve efficient area coverage and improved connectivity (both locally and to the BS), providing significant improvements over existing approaches.

25 January 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
SDShreyas Devaraju
Shreyas Devaraju
MPMoein Parsinia
Moein Parsinia
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
SKSunil Kumar
Sunil Kumar
A directional airborne network consisting of nodes equipped with multibeam antennas is considered. These nodes use the frequency division duplex mode of communication. This allows formation of multiple routes between a pair of source and destination nodes, where every forward and reverse route completely overlaps. Each of these routes supports the bidirectional traffic. These routes are formed using the bidirectional ad hoc on-demand multipath distance vector (BAOMDV) routing protocol. In this article, we propose a local route repair scheme, called BAOMDV-LR, when these routes break due to node mobility. The proposed route repair scheme preserves the overlapping and link-disjoint (or node-disjoint) characteristics of the routes, while reducing the need for expensive route rediscovery. The proposed scheme significantly improves the overall network performance for bidirectional traffic (in terms of packet delivery ratio, end-to-end delay, and routing overhead) as compared to the BAOMDV and other existing routing schemes, especially at higher node speeds and data rates.

7 May 2024 in arXiv
Verified
Preprint
Open access
PDF file
SDShreyas Devaraju
Shreyas Devaraju
SGShivam Garg
Shivam Garg
AIAlexander Ihler
Alexander Ihler
SKSunil Kumar
Sunil Kumar
Routing protocols help in transmitting the sensed data from UAVs monitoring the targets (called target UAVs) to the BS. However, the highly dynamic nature of an autonomous, decentralized UAV network leads to frequent route breaks or traffic disruptions. Traditional routing schemes cannot quickly adapt to dynamic UAV networks and/or incur large control overhead and delays. To establish stable, high-quality routes from target UAVs to the BS, we design a hybrid reactive routing scheme called pipe routing that is mobility, congestion, and energy-aware. The pipe routing scheme discovers routes on-demand and proactively switches to alternate high-quality routes within a limited region around the active routes (called the pipe) when needed, reducing the number of route breaks and increasing data throughput. We then design a novel topology control-based pipe routing scheme to maintain robust connectivity in the pipe region around the active routes, leading to improved route stability and increased throughput with minimal impact on the coverage performance of the UAV network.

28 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
SDShreyas Devaraju
Shreyas Devaraju
AIAlexander Ihler
Alexander Ihler
SKSunil Kumar
Sunil Kumar
UAV networks consisting of low SWaP (size, weight, and power), fixed-wing UAVs are used in many applications, including area monitoring, search and rescue, surveillance, and tracking. Performing these operations efficiently requires a scalable, decentralized, autonomous UAV network architecture with high network connectivity. Whereas fast area coverage is needed for quickly sensing the area, strong node degree and base station (BS) connectivity are needed for UAV control and coordination and for transmitting sensed information to the BS in real time. However, the area coverage and connectivity exhibit a fundamental trade-off: maintaining connectivity restricts the UAVs' ability to explore. In this paper, we first present a node degree and BS connectivity-aware distributed pheromone (BS-CAP) mobility model to autonomously coordinate the UAV movements in a decentralized UAV network. This model maintains a desired connectivity among 1-hop neighbors and to the BS while achieving fast area coverage. Next, we propose a deep Q-learning policy based BS-CAP model (BSCAP-DQN) to further tune and improve the coverage and connectivity trade-off. Since it is not practical to know the complete topology of such a network in real time, the proposed mobility models work online, are fully distributed, and rely on neighborhood information. Our simulations demonstrate that both proposed models achieve efficient area coverage and desired node degree and BS connectivity, improving significantly over existing schemes.