Wireless Sensor Networks comprise low-cost, low-power, lightweight, and multifunctional sensor nodes capable of sensing and transmitting data from remote or hazardous environments to a central base station. These networks are widely deployed across various domains, including environmental monitoring, healthcare, and military applications. However, designing energy-efficient routing protocols remains a challenge due to limited battery capacity, constrained computational resources, absence of global addressing, and the dynamic topology of self-organizing nodes. The Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, a widely used cluster-based routing scheme, organizes nodes into clusters where cluster heads (CHs) manage intra-cluster communication using a Time Division Multiple Access (TDMA) schedule. Despite its advantages, LEACH’s TDMA mechanism becomes inefficient under unbalanced clustering, resulting in increased energy consumption at CHs. To overcome this issue, the Modified TDMA (MTDMA) approach was introduced, which adapts scheduling to the largest cluster size. However, MTDMA increases energy usage due to frequent inter-CH communication for determining cluster capacities. This study proposes the Energy-Efficient Modified Time Division Multiple Access (EEMTDMA) algorithm, where the base station centrally determines maximum cluster capacity, eliminating CH-to-CH communication and significantly reducing energy consumption. The algorithm was implemented using the Castalia 3.3 simulator in the OMNeT + + framework. Simulation results show that EEMTDMA outperforms both LEACH with MTDMA and LEACH with standard TDMA, achieving an average energy consumption of 48.4 J and delivering 4.75 packets per node to the base station. These results represent improvements of 7.9 J and 1.62 packets compared to LEACH with MTDMA, and 13.29 J and 2.33 packets compared to LEACH with TDMA.

Vehicular ad hoc networks (VANET) are a subset of mobile ad hoc networks used to communicate between vehicles and infrastructure. During vehicular congestion communication, nodes compete to acquire channels, causing the channels to become congested. The congestion on the vehicle network results in increased delay and packet loss, resulting in reduced VANET performance. To address this problem, we developed a load-aware and priority adaptive traffic congestion control method in vehicular ad hoc networks (VANETs). The proposed scheme identifies less-congested road segments based on the network's load and reduces traffic congestion by suggesting other routes between nearby roadside units (RSUs). This research aims to improve the efficiency of the vehicular environment by utilizing the movement of vehicles with (RSUs) and sharing the traffic load between them. Simulation results demonstrate the effectiveness of the proposed protocol in reducing congestion and enhancing the overall performance of VANETs. To validate the proposed algorithm, we have implemented and tested the proposed algorithm using Network Simulator 3 (NS3) for Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication scenarios and computed the performance of the algorithm on different parameters of the network. The simulation result of the proposed load aware and priority adaptive traffic congestion control method in VANET improved the packet delivery ratio, packet lost ratio, and end-to-end delay by 96%, 4.1%, and 1102 milliseconds, when compared to TDCCA value of 92%, 5.7%, and 1154 milliseconds, respectively

Data security is that the primary concern of every individual and organization. To assure the security of data, cryptography is the prime mechanism. RSA is most widely accepted as a reliable asymmetric key cryptography. Since, its reliability depends on the hardness of factoring large common modulus which is accessible for the public, this accessibility of the common modulus could exposed RSA to various cryptanalysis attacks: Shor’s quantum polynomial-time algorithm, D-Wave quantum computer attacks, double encryption attack, and low private exponent attack. To address this weaknesses, this paper proposes an asymmetric key cryptosystem named as Double Key Pair and Hidden Modulus RSA (DKPHM-RSA) which introduces additional key pair, and the public mask modulus which is a pseudo random masking number derived from real modulus. Replacing the second real modulus, this derived public mask modulus is introduced in a second public key component; as a result, a second real modulus kept hidden from the public unlike the case in RSA. To improve data security, additional public key exponent along with public mask modulus are used for second encryption while additional private key with additional real modulus is used for the first decryption process. For performance analysis Net bean IDE 8.2 is used, and the proposed DKPHM-RSA algorithm is compared with state-of-the-art algorithms: RSA, ESRKGS, HRM-RSA, and MRSA based on key generation speed, encryption speed, decryption speed, time complexity, resistance to attacks, and avalanche effect. The performance analysis shows that DKPHM-RSA is less complex and highly secured than state-of-the-art algorithms. It improves key generation speed of ESRKGS, and MRSA by 298%, 31%; encryption time of RSA, ESRKGS, MRSA, HRM-RSA by 34%, 263%, 1331%, 33%; decryption speed of ESRKGS, MRSA by 51%, 404%, respectively.