JAJuhi Agrawal

Juhi Agrawal

*This is an algorithmically generated author record based on publicly available information.

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


Juhi Agrawal has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    HCPMR: A Hierarchically Coordinated Proximal Multi-Hop Routing Scheme for FANETs in Mission-Critical Environments

    by Juhi Agrawal, Anil Kumar, Muhammad Morshed Alam, Muhammad Yeasir Arafat

    In mission-critical environments, designing efficient routing protocols for unmanned aerial vehicles (UAVs) is challenging due to limited energy resources, high-speed mobility, and highly dynamic link conditions. This paper proposes a hierarchical routing framework, termed hierarchically coordinated proximal multi-hop routing (HCPMR) scheme, which integrates multi-agent proximal policy optimization (MAPPO) with graph neural networks (GNNs) to enable scalable, stable, and energy-efficient UAV communication. HCPMR organizes UAVs into energy- and stability-aware clusters, where GNN- assisted intra-cluster coordination is performed by cluster leaders, who also manage inter-cluster routing through periodically synchronized exchanges under a centralized training and decentralized execution (CTDE) paradigm. GNN-based embeddings allow UAVs to capture spatial dependencies within their local neighbourhoods, enabling adaptive routing with reduced control overhead, enhanced reliability, and improved energy efficiency. The proposed scheme incorporates a multi-objective reward function to jointly optimize energy consumption, fairness, delivery reliability, and terrain adaptability. Simulation results using NS-3/ns3-gym across urban, desert, and mountainous scenarios demonstrate that HCPMR increases packet delivery ratio by 6.5% compared to coordinated Q-learning-based multi-hop routing (CQMR) and by 16% compared to improved Q-learning–based multi-hop routing (IQMR). Moreover, HCPMR achieves approximately 13% higher residual energy than CQMR and 58% higher than IQMR, while reducing control overhead by 20% and 38.5%, respectively. These results establish HCPMR as an adaptive and efficient routing framework for dynamic FANETs in mission-critical operations, effectively enhancing routing decisions through GNN-driven embeddings and MAPPO-based coordination.


  • UAV‐SHUTTLE‐MMM: UAV‐shuttle‐enabled mobility management model in sparsely deployed flying ad hoc networks

    by Juhi Agrawal, Monit Kapoor

    Summary: The reliable surveillance of a large region typically needs a large number of unmanned aerial vehicles (UAVs), which leads to high operational costs in flying ad hoc networks (FANETs). Therefore, the UAV mobility model plays an important role that affecting the performance of FANET. This research paper comes up with a novel UAV‐shuttle‐enabled mobility management model (US‐MMM) that is a crucial attribute for the large and highly sparse network. The proposed mobility model uses UAV shuttles. A relatively lesser number of UAVs are used than comparative approaches to enhance the connectivity among the UAVs in a sparse network. UAV shuttle is the special self‐governing node, which traverses the network and collects the data to deliver to the base station (BS). The main strength of the proposed mobility model is the self‐governing ability of the UAV shuttle, which leads to high connectivity in the network. The UAV shuttle executes the proposed dynamic path planning algorithm and uses the adaptive ranking algorithm to determine its target. The main contribution of this research work is to develop a subnet scan and Number of Neighbor and Distance‐based Adaptive Ranking of Targets (NN‐DART) algorithm for dynamic route planning of UAV shuttle. The proposed mobility model is used with various routing schemes to check the difference in the performance of various routing schemes. The proposed mobility model is simulated in NS‐2.35, and the results have shown an improvement in the packet delivery ratio, routing overhead, and end‐to‐end delay.


  • ARMS‐EGR—Adaptive ranking and mobile sink‐enabled energy‐efficient geographic routing protocol in flying ad hoc networks

    by Juhi Agrawal, Monit Kapoor

    Summary: Unmanned aerial vehicles (UAVs) have become widespread because of their involvement in a variety of applications. The task of designing the energy‐efficient routing between UAVs has been considered a matter of great interest due to the inherent challenges of controlling the dynamics exhibited by UAVs. Energy limitations are considered the main limitations of UAVs. This research paper proposes a novel routing protocol, adaptive ranking and mobile sink (MS)‐enabled energy‐efficient geographic routing (ARMS‐EGR) for flying ad hoc networks. In ARMS‐EGR, the whole network is partitioned into cells. The cell contains cell members (CM) and cell heads (CHs). The CH works as a cluster head. Additionally, two MSs have been used to collect data captured by CM. Multihop communication on the network leads to an increase in traffic and consumes the energy of the UAVs located near the base station (BS). MSs are used for power distribution and load balancing across the network. Adaptive ranking of forwarder UAVs and CHs is performed during intracell and intercell multihop communication, respectively, using adaptive ranking. A cell with one‐hop communication can directly send packets to the MS, but the ARMS‐EGR routing protocol has been proposed for multihop communication. The proposed approach is simulated in NS‐2.35 software. The results show that end‐to‐end latency and power consumption during packet transmission are greatly minimized. ARMS‐EGR also demonstrates improvements in message success rates, number of alive nodes, and packet delivery ratio, making ARMS‐EGR particularly suitable for flying ad hoc networks (FANETs).


  • A ferry mobility based direction and time‐aware greedy delay‐tolerant routing (FM‐DT‐GDR) protocol for sparse flying ad‐hoc network

    by Juhi Agrawal, Monit Kapoor, Ravi Tomar

    Flying Ad‐hoc Networks (FANETs) play a major role in various civilian and non‐civilian applications especially in search and rescue operations after natural disasters. Unmanned aerial vehicles (UAVs) collect critical information in the form of images and videos from disaster areas and send it to the ground station (GS) for immediate rescue operations. UAVs capture the information and send it to the GS to carry out the rescue operations without any delay. A small number of UAVs operate over a large geographic area for rescue operations when a sudden natural disaster occurs that creates a sparse or intermittent network. Therefore, routing is the most challenging issue in sparse FANETs due to the low‐node density network and high mobility of UAVs Existing routing protocols for connected or dense FANETs cannot be directly adopted in extremely sparse FANETs. Only a few works exist that focus on sparse networks as most of the work is based on connected networks. Traditional routing algorithms for sparse FANETs are based on a flood‐based strategy that creates unnecessary delays in the network. Some recently developed routing algorithms directly adopt greedy‐based forwarding for routing in sparse networks and consider the non‐realistic assumption without considering delay as a significant constraint of search and rescue operations. This paper presents a novel ferry mobility‐based direction and time‐aware greedy delay‐tolerant routing (FM‐DT‐GDR) protocol for data transfer to GS during disaster relief operations in the sparse FANETs without delay. FM‐DT‐GDR uses a store, carry, and forward (SCF) mechanism to prevent data loss when no neighbors are present. Upon receiving the beacon from the ferry node, the search nodes calculate the nearest destination from their location between the ferry and the GS and send the data accordingly. The ferry collects data from the search UAVs and sends it to the GS. Optimized ferry trajectories significantly improve route availability between GS and search UAVs Furthermore, the proposed routing scheme efficiently selects the forwarder node to send the data to the selected destination without any delay. FM‐DT‐GDR provides significant improvements in packet delivery ratio, routing overhead, and end‐to‐end delay compared to traditional routing protocols.


  • A novel unmanned aerial vehicle‐sink enabled mobility model for military operations in sparse flying ad‐hoc network

    by Juhi Agrawal, Monit Kapoor, Ravi Tomar

    The flying ad‐hoc network (FANET) is a self‐configured, rapidly deployable network for a variety of time‐critical applications such as military and disaster relief operations. Most mobility models view FANETs as dense networks leading to unrealistic network scenarios and may not provide real‐world results. Unmanned aerial vehicles (UAVs) may not always be connected due to low battery, malfunction, budget constraints, or the nature of the application. Existing mobility models do not work in realistic FANET scenarios, that is, sparse FANETs, and simulate the model in a two‐dimensional domain. To address the issues, a novel mobility model has been proposed for military operations in sparse FANETs. This is the first paper that addresses the issue of sparse networks as well as implementing the proposed work in the simulator in three‐dimensional space. The proposed UAV‐sink enabled mobility model (US‐MM) increases the network performance without impeding the mobility of UAVs as UAVs perform critical functions in military operations. The simulation has been done using NS‐3.25. The obtained results show the efficiency of our proposed model which achieves increased network connectivity and stability of UAV's connection to the base station in the sparse FANETs.


  • A comparative study on geographic‐based routing algorithms for flying ad‐hoc networks

    by Juhi Agrawal, Monit Kapoor

    Summary: The advancement of the technology and broad availability of low‐cost devices (e.g., networking technology, micro‐embedded computers, and sensors, etc.) have opened new ways for the expansion of flying ad‐hoc networks (FANETs). The unmanned aerial vehicles (UAVs) have the potential to change their trajectory freely in the case of FANETs. This freedom demands efficient routing to make the network connection smooth. However, designing routing protocols for FANETs is a crucial task for highly dynamic nodes like UAVs. The position‐based routing demonstrated high efficiency and resilience to handle the high mobility of UAV nodes in FANETs as compared to topology‐based routing protocols. Geographic routing protocols utilize the coordinates of the node to greedily proceed toward the destination. This article presents an extensive review of position‐based or geographic routing protocols in FANETs. Previous survey papers have performed a comparative analysis of all the protocols on different network conditions, assumptions, tools, and settings, therefore their performance is not comparable. The novelty of this survey is that this article performs the comparative analysis of various geographic routing protocols by evaluating all the geographic routing protocols over a common network scenario with a varying number of nodes. The starting phase of this article covers the basic outline of FANETs. Thereafter, an absolute study of the geographic based routing protocol has been presented by distinguishing the routing protocols on the basis of path and packet forwarding strategy. This article further emphasizes on the strength, weaknesses, quality of service (QoS), and comparative analysis of the various characteristics of the geographic routing protocols. Finally, a performance comparison summary of all the analyzed routing protocols for FANETs has been presented. The open research issues have been discussed at the end of this article.


  • Temperature Aware Routing Protocol in the field of Wireless Body Sensor Network

    by Shelly, Juhi Agrawal

    Wireless Body Sensor Network (WBSN) has come into view as a trending field in the recent years, having major application in the medical field. In this, few sensor nodes are put on or around human body which gathers the data and that data is processed for early detection of diseases where we can start early treatment, data is gathered while surgeries are performed. Based on the criticality of the information, it is very important to have routing protocols which are efficient and can be effectively used to gather the data[2]. In WBSN, one of the major concern is whenever we place sensor nodes on the human body, as they are used to gather the data, the temperature of those sensor node increases due to load and which need to be minimize in an effective way, how the packets need to be send in order to minimize the network load, energy saving mechanisms, efficient and effective packet delivery [3]. These few parameters bring the need of routing protocols into the picture. In this paper, we have critically reviewed all the routing protocols proposed so far which take temperature of the node as a metric, popularly known as Temperature-Aware Routing Protocols. We hope this help readers in their future work.

  • Energy-Efficient Clustering With Multiple Sink (Eecms) In Wireless Body Area Network

    by Juhi Agrawal, Shelly, Monit Kapoor

    Wireless Body Area Networks is consists of compact bio sensors that implanted in various body areas of human being. WBAN is a new revolution in the field of health sciences. It monitors the health related data like blood pressure (BP), heartbeat, glucose level, electro-cardiogram etc. It passes these data to the health monitoring systems. WBAN is playing main role in the field of sports, entertainment, medical, psychological and social welfare. Till now there are different routing protocols have been outlined to increase its performance, energy efficiency, throughput, packet delivery ratio (PDR), delay and network lifetime. This paper proposes a routing protocol named energy-efficient clustering with multiple sink (EECMS) in wireless body area network. Which calculates the fitness function using multiple parameters such as Residual Node Energy, Distance of nodes and Transmission Range for Cluster Head selection. After some interval it keep changing the head to maintain the flow of network