Shivam Garg

Dr. Shivam Garg

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
27 December 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
Shivam GargShivam Garg
Shivam Garg
AIAlexander Ihler
Alexander Ihler
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
SKSunil Kumar
Sunil Kumar
Autonomous and decentralized UAV networks are used in many applications, including disaster management, environment monitoring and surveillance. The performance of the routing protocols in these networks drops significantly due to frequent route breaks and traffic congestion at high node speeds. This is partly because the routing metrics used in many of the existing protocols are sensitive to the intra-flow interference after the source node starts transmission on the selected route. Moreover, these schemes do not estimate potential packet drops or take preventive measures, such as route switching and queue management. To address these issues, we present a cross-layer, mobility and congestion-aware optimized link state routing (MCA-OLSR) protocol for an autonomous and decentralized UAV network, which incorporates the following mechanisms: ( i ) Multi-metric route selection which includes hop count, route lifetime, estimated time-to-destination and number of interfering links; ( ii ) Preemptive route switching which prevents packet transmission over the broken and congested routes; and ( iii ) Queue management to prioritize transmission of packets based on their survivability score. We also present key observations on routing protocol design and a theoretical analysis to show the impact of data rate, route length and interfering links on the packet service rate and congestion. The proposed routing scheme achieves a significantly higher packet delivery ratio and lower route computation overhead for delay-sensitive data flows at different data rates, node densities and high speeds, as compared to the standard and multi-metric OLSR protocols.

8 February 2021 in IEEE Access
Verified
Journal Article
Open access
Shivam GargShivam Garg
Shivam Garg
VKVenu Sri Sushma Kuchipudi
Venu Sri Sushma Kuchipudi
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
SKSunil Kumar
Sunil Kumar
Time division multiple access (TDMA) based medium access control (MAC) schemes are widely used for communication among directional nodes since they can provide a conflict-free transmission schedule. However, the existing directional TDMA schemes introduce significant overhead and delay, and cannot adapt in real-time to topology changes in a directional multi-hop network. These schemes also incur considerable overhead and delay in order to support the QoS (quality of service) traffic. In this paper, a novel, real-time, distributed, directional TDMA scheme is presented for directional multi-hop wireless networks. This scheme adapts to the topology changes and/or flow requirements in real-time, and facilitates QoS-aware communication with no notification overhead. In the proposed scheme, the 1-hop neighborhood of every node is divided into fully connected 1-hop neighborhoods, which allows the node to intelligently serve multiple routes without requiring a globally converged scheduling solution. This feature allows the use of a low-complexity rank-based mechanism to obtain a distributed, real-time transmission schedule for a directional multi-hop network. The following new features are also added in the proposed scheme: (${i}$ ) REQ period which reduces slot wastage, (ii) throughput scaling which ensures fairness and helps in congestion management, and (iii) piggyback reservation period which increases the spatial reuse and adapts to the dynamic requirements of multiple flows in real-time. The control-period overhead in our scheme is low and linearly changes with the number of nodes in a fully connected 1-hop neighborhood, instead of the total number of nodes in the entire network. Simulation results and comparisons with other recent, distributed TDMA-based schemes show that our scheme provides a higher throughput with very low control overhead for both static and mobile network topologies.

14 May 2025 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
Shivam GargShivam Garg
Shivam Garg
AIAlexander Ihler
Alexander Ihler
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
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 monitoring, search, and surveillance of inaccessible areas. A decentralized and autonomous approach ensures robustness to failures; the UAVs explore and sense within the area and forward their information, in a multihop manner, to nearby aerial gateway nodes. However, the unpredictable nature of the events, relatively high speed of the UAVs and dynamic trajectories cause the network topology to change significantly over time, resulting in frequent route breaks. A holistic routing approach is needed to support multiple traffic flows in these networks to provide mobility- and congestion-aware, high-quality routes when needed, with low control and computational overhead, using the information collected in a distributed manner. Existing routing schemes do not address all the mentioned issues. This paper presents a hybrid reactive routing protocol for decentralized UAV networks called Hyd-AODV. It searches routes on-demand (using a multi-metric route selection), monitors a region around the selected route (the “pipe”), and proactively switches to an alternative route before the current route's quality degrades below a threshold. The impact of pipe width is empirically and theoretically evaluated to find alternate high-quality routes within the pipe and the overhead required to maintain the pipe. A queue management scheme is also incorporated to prioritize packet transmissions based on their age of information (AoI). Compared to existing reactive routing schemes, the proposed approach achieves higher throughput and reduces the number of route discoveries, overhead, and resulting flow interruptions at different traffic loads, node density, and speeds. Despite having limited network topology information and low overhead and route computation complexity, the proposed scheme achieves a superior throughput to proactive optimized link state routing (OLSR) scheme for different network and traffic settings. The relative performance of reactive and proactive routing schemes is also studied.

13 February 2025 in Drones
Verified
Journal Article
Open access
PDF file
SDShreyas Devaraju
Shreyas Devaraju
Shivam GargShivam Garg
Shivam Garg
AIAlexander Ihler
Alexander Ihler
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
SKSunil Kumar
Sunil Kumar
This paper considers a decentralized and autonomous wireless network of low SWaP (size, weight, and power) fixed-wing UAVs (unmanned aerial vehicles) used for remote exploration and monitoring of targets in an inaccessible area lacking communication infrastructure. Here, the UAVs collaborate to find target(s) and use routing protocols to forward the sensed data of target(s) to an aerial base station (BS) in real-time through multihop communication, which can then transmit the data to a control center. However, the unpredictability of target locations and the highly dynamic nature of autonomous, decentralized UAV networks result in frequent route breaks or traffic disruptions. Traditional routing schemes cannot quickly adapt to dynamic UAV networks and can incur large control overhead and delays. In addition, their performance suffers from poor network connectivity in sparse networks with multiple objectives (exploration and monitoring of targets), which results in frequent route unavailability. To address these challenges, we propose two routing schemes: Pipe routing and TC-Pipe routing. Pipe routing is a mobility-, congestion-, and energy-aware scheme that discovers routes to the BS on-demand and proactively switches to alternate high-quality routes within a limited region around the routes (referred to as the “pipe”) when needed. TC-Pipe routing extends this approach by incorporating a decentralized topology control mechanism to help maintain robust connectivity in the pipe region around the routes, resulting in improved route stability and availability. The proposed schemes adopt a novel approach by integrating the topology control with routing protocol and mobility model, and rely only on local information in a distributed manner. Comprehensive evaluations under diverse network and traffic conditions—including UAV density and speed, number of targets, and fault tolerance—show that the proposed schemes improve throughput by reducing flow interruptions and packet drops caused by mobility, congestion, and node failures. At the same time, the impact on coverage performance (measured in terms of coverage and coverage fairness) is minimal, even with multiple targets. Additionally, the performance of both schemes degrades gracefully as the percentage of UAV failures in the network increases. Compared to schemes that use dedicated UAVs as relay nodes to establish a route to the BS when the UAV density is low, Pipe and TC-Pipe routing offer better coverage and connectivity trade-offs, with the TC-Pipe providing the best trade-off.

1 July 2022
Verified
Conference Paper
Open access
Shivam GargShivam Garg
Shivam Garg
NVNandini Venkatraman
Nandini Venkatraman
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
SKSunil Kumar
Sunil Kumar
A node equipped with a multi-beam antenna can achieve a throughput of up to $m$ times as compared to a single-beam antenna, by simultaneously communicating on its $m$ non-interfering beams. However, the existing multi-beam medium access control (MAC) schemes can achieve concurrent data communication only when the transmitter nodes are locally synchronized. Asynchronous packet arrival at a multi-beam receiver node would increase the node deafness and MAC-layer capture problems, and thereby limit the data throughput. This paper presents an asynchronous multi-beam MAC protocol for multi-hop wireless networks, which makes the following enhancements to the existing multi-beam MAC schemes (i) A windowing mechanism to achieve concurrent communication when the packet arrival is asynchronous, (ii) A smart packet processing mechanism which reduces the node deafness, hidden terminals and MAC-layer capture problems, and (iii) A channel access mechanism which decreases resource wastage and node starvation. Our proposed protocol also works in the networks that deploy the nodes equipped with single-beam as well as multi-beam antennas. Simulation results demonstrate a superior performance of our proposed protocol.