VKVinod Kumar

Vinod Kumar

*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


Vinod Kumar has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • RFD Model Based Data Integration in Dengue Domain

    by Runumi Devi, Abid Hussain, Kiran Singh, Vinod Kumar, Yaser Issam Hamodi Aljanabi, Mustafa Moaied Rabeaa

  • A Genetic Algorithm‐Based Approach for Collision Avoidance in a Multi‐UAV Disaster Mitigation Deployment

    by Anuradha Banerjee, Sachin Kumar Gupta, Vinod Kumar

    This research delves into the intricacies of designing trajectories for unmanned aerial vehicles (UAVs) within a multi‐UAV system, specifically addressing the challenges presented during simultaneous rescue operations in neighboring states. The unique scenario introduces a potential risk of UAVs from one state intersecting with those from others, leading to communication issues and the looming threat of collisions. These collisions not only cause delays in emergency operations but also result in additional costs for repairing damaged UAV components. In response to this critical challenge, the study proposes an innovative approach utilizing Genetic Algorithms to facilitate collision avoidance in a multi‐UAV environment, tailored explicitly for disaster mitigation scenarios. This technique is an efficient solution to enhance the safety and effectiveness of UAV operations during disaster response and relief efforts. The proposed trajectory planning method uses a genetic algorithm, with the fitness function strategically designed to optimize two pivotal objectives: utility (maximizing the number of people saved postdisaster) and collision avoidance (minimizing conflicts between multiple UAVs as they navigate predetermined paths). The overarching goal of this approach is to strike a balance, aiming to maximize utility while concurrently minimizing the risk of collisions. By adopting this approach, the research significantly contributes to advancing the field of disaster response strategies, enhancing the overall efficiency of multi‐UAV systems in complex and dynamic environments. The proposed solution not only addresses the immediate challenges posed by potential collisions but also underscores the importance of optimizing UAV trajectories to achieve maximum utility in postdisaster scenarios.


  • AES‐8: A Lightweight AES for Resource‐Constrained IoT Devices

    by Sumit Singh Dhanda, Brahmjit Singh, Poonam Jindal, Vinod Kumar, Sachin Kumar Gupta

    Internet of Things (IoT) is marked by resource‐constrained devices. Information security is the main challenge that arises due to the wireless transmission of data by ubiquitous sensors. In this work, we have presented a lightweight advance encryption scheme (AES) that can be used in small IoT devices. Galois field arithmetic has been used to minimize the size of the S‐box. Slice consumption and throughput are two contradictory parameters in AES design. The design tries to achieve a tradeoff between these two parameters. With a separate S‐box for the key expansion, a high throughput in the range of 52–163 Mbps has been achieved on different FPGAs. In terms of throughput, it matches the latest lightweight designs and outperforms older ones. It occupies 73 slices on an Artix‐7 FPGA. When compared to existing AES designs, the design achieves area savings in the range of 4%–78.33%. In slice consumption, it is on par with most of the lightweight ciphers designed for IoT. The most remarkable feature of the design is its efficiency. It outperforms existing lightweight AES variants with a typical throughput per slice of 210 kbps/slice to 1.409 Mbps/slice. On Virtex‐5, AES‐8 has outperformed lightweight ciphers like Shadow‐64, LEA‐128, DULBC‐80/128, and QARMA. A 24%–67% resource reduction has been achieved from these ciphers. It makes the proposed cipher suitable for application in IoT security.


  • A Comparison of 163‐Bit Hybrid Karatsuba Multiplier and Word‐Serial Multipliers for ECC Processors

    by Sumit Singh Dhanda, Vinod Kumar, Sachin Kumar Gupta, Deepak Panwar, Pardeep Singh

    Elliptic Curve Processors (ECP) are used for high performance in hardware implementation. The finite field multiplier, which occupies the maximum area in the ECP structure, plays an essential role in deciding its size and performance. The resource‐constrained IoT devices employed in real‐time applications demand the design of a compact yet fast multiplier. In this paper, a Hybrid Karatsuba Multiplier (HKMul) for GF (2163) is proposed for use in Elliptic Curve Cryptography (ECC). It is a sub‐quadratic multiplier. A Word‐Serial Multiplier (WSMul) for the same ECP is also re‐implemented in this work. Both multipliers are synthesized using Xilinx PlanAhead software. A detailed comparison has been presented using different Xilinx Field Programmable Gate Arrays (FPGAs) for detailed comparison. The HKMul nearly matches the WSMul in resource consumption and outperforms it in performance. HKMul outperforms WSMul in two instances, on Spartan‐3 and Virtex‐7, with very small differences of 3.3% and 1.6%, respectively. As the WSMul has a very small delay, it uses 4 clock cycles to generate the multiplication. Hence, HKMul comes out 1.01 to 1.63 times faster than WSMul.