Cronbach alpha reliability coefficient-based reputation mechanism for mitigating root node attack in MANETs

Objectives: Comparison of performance efficiency of AODV and OLSR routing protocol in MANETs using NS2 tool. The parameters considered and compared for throughput, packet delivery ratio, energy spent and delays. Methods/Analysis: Using NS2, first a sample of 50 nodes was generated and moved move randomly. Dynamic clustering was done within the sample area of 500x500sq.m. 50 nodes were set up as sink nodes and attached a local agent and loss monitor for each node. These nodes were positioned in the sample area. The nodes 17, 28, 35 were set up as source and nodes were set up as destination for transmission of packets, respectively. Findings: The four performance measures were: Energy spent, PDR, end-to-end delay and throughput with number of nodes as constant (50) and with different speed (time) of node like 2,4,6,8,10s are taken for comparison. Transmission of packet was tested using AODV and the performance metrics are traced. Similarly the performance metrics were tested with OLSR protocol. The values were tabulated and a graph was generated for each metric in Y-axis and time in X-axis. Novelty of the Study: A VMware workstation was installed and tested in unix environment using tool command language the modules were created in vi editor. They were executed using ns command. This paper is main module. Further malicious node detection and elimination was done to still prove OLSR outperforms than AODV. Conclusion: In all the above four metrics the OLSR protocol performance is efficient than AODV when data transmission occurs between nodes in MANETs. From the results obtained we can observe OLSR outperforms AODV in all four parameters irrespective of different speed (time).

V2X (Vehicle-to-Everything) communications play a crucial role in enabling the efficient and reliable exchange of information among vehicles, infrastructure, and other entities in smart transportation systems. However, the inherent vulnerabilities and dynamic nature of V2X networks present significant challenges for ensuring secure and trustworthy communication. By enhancing the security of the OLSR (Optimized Link State Routing) protocol through secure MultiPoint Relays (MPRs) Selection, this research aims to provide a robust approach that enhances the overall security posture of V2X networks, enabling safe and secure interactions between vehicles and their environment. The proposed method is based on the Byzantine general’s problem, which is the principle used in blockchain. Compared to the classical flooding mechanism, this technique greatly reduces network traffic overhead and improves the efficiency of bandwidth utilization. The results demonstrated that the proposed algorithm performed better than the well-used UM-OLSR implementation. The outcome proved that our MPR election algorithm guarantees a better packet delivery ratio, and it also performs very well in the detection and isolation of malicious nodes, leading to increased security of the OLSR protocol control plane.

A trust management-based secure routing protocol with AUV-aided path repairing for Underwater Acoustic Sensor Networks

This paper investigates packet loss issue in multicast enabled network mobility management using network simulator.Network mobility management namely PMIPv6 has the capacity to reduce mobile IPv6 performance problems.But PMIPv6 basic architecture is limited to unicast communication.Therefore, this paper proposes PMIPv6 with context delivery and multicast fast reroute mechanisms to enable multicast services.In this paper, the configuration of multicast enabled PMIPv6 is done in network simulator called NS3.The aimed is to solve packet loss problem.This paper assumes that packet loss as the number of packets that are lost in a multicast communication.Packet loss is unescapable particularly in mobile multicast communication.It is a network system requirement to meet the threshold value of acceptable packet loss rate below than 5%.The packet loss ratio and the packet delivery ratio are extracted from the trace-file produced by the simulation process in NS3 simulator.The analyses of the packet loss ratio and packet delivery ratio are hereby presented.

In multi-hop networks like MANETs, the mobile nodes rely upon the intermediate nodes for routing the packets. But, the existence of root node attack in an ad hoc environment may degrade the network performance. Hence, the critical issues that could arise due to the existence of root node attack are considered as one of the important research issues to be solved. In this paper, we propose a Kuder-Richardson Reputation Co-efficient based Cooperation Enforcement Mechanism (KRRCM) for mitigating Root node attack based on Kuder-Richardson Reputation Co-efficient (KRRC) that quantifies the reputation level of mobile node. This Kuder-Richardson Reputation Co-efficient is calculated based on second hard reputation. The coefficient value obtained through KRRCM approach reflects an individual root node’s behaviour in relation to cooperation, so that the particular node can be selected as core point for group communication. The performance analysis of KRRCM was carried out based on ns-2 simulator and the proposed KRRCM approach outperforms the existing mechanisms by increasing the packet delivery ratio and throughput by 23 percent and 28 percent, while decreasing the control overhead and total overhead in an average by 18 percent and 29 percent respectively. Further, KRRCM ideally mitigates the root node attack at a faster rate of 32 percent than the considered benchmark mechanism considered for investigation.

Security is an essential requirement in mobile ad hoc networks (MANETs). Compared to wired networks, MANETs are more vulnerable to security attacks due to the lack of a trusted centralized authority, easy eavesdropping, dynamic network topology, and limited resources. The security issue of MANETs in group communications is even more challenging because of the involvement of multiple senders and multiple receivers. In this paper, we present a simulationbased study of the impacts of different types of attacks on mesh-based multicast in MANETs. We consider the most common types of attacks, namely rushing attack, blackhole attack, neighbor attack and jellyfish attack. Specifically we study how the processing delay of legitimate nodes, the number of attackers and their positions affect the performance metrics of a multicast session such as packet delivery ratio, throughput, end-to-end delay, and delay jitter. To the best of our knowledge, this is the first paper that studies the vulnerability and the performance of multicast in MANETs under various security threats.

Exploration on enhanced Quality of Services for MANET through modified Lumer and Fai-eta algorithm with modified AODV and DSR protocol

A wireless sensor network (WSN) is a standalone device that consists of a discrete group of sensor nodes (SN) for information gathering, device monitoring, and environmental position sensing. The main challenge is to present an energy-efficient framework and conserve energy while building a route path alongside each sensor node at SN due to the limited energy resources available. Nonetheless, a great deal of energy-efficient methods concentrated heavily on energy harvesting and decreased energy usage, but they were unable to enable energy-efficient routing in WSNs with low energy usage. The research work uses Kinetic Gas Molecules Optimization (KGMO) based Modified Reptile Search Algorithm for cluster head selection to minimise the energy consumption in order to address this issue. Utilising a modified version of the Reptile search algorithm, the inertia weight of the KGMO is determined by evaluating trust (direct and indirect) based on energy, distance, probability of risk, delay, and Received Signal Strength Indicator (RSSI), with the optimal CH being chosen. Lastly, to find the shortest path, use an energy-efficient cross-layer-based expedient routing protocol (E-CERP), which lowers network overhead dynamically. Assuring security for the massive amounts of data being generated by sensors is the most difficult task. It must balance the trade-offs with a number of other factors, including power consumption, delay, latency, and data aggregation, in order to ensure security and make room for different types of research. The work's concept is to use a Bidirectional Recurrent Neural Network (BiRNN) model to identify the malicious nodes. When compared to previous methods, the proposed model demonstrated exceptional results by achieving a Packet Delivery Ratio (PDR) of 0.99, Throughput of 0.98, Packet Delay reduced to 0.05, Power Consumption minimized to 1.52, and an outstanding Accuracy of 99.21%. These findings underscore its efficacy in enhancing both network performance.

In wireless, every device can moves anywhere without any infrastructure also the information can be maintained constantly for routing the traffic. The open issues of wireless Adhoc network the attacks which are chosen the forwarding attack that is dropped by malicious node to corrupt the network performance then the information integrity exposure. Aim of the problem that existing methods in Adhoc network for malicious node detection which cannot assure the traceability of the node as well as the fairness of node detection. In this paper, the proposed heterogeneous cluster based secure routing scheme provides trust based secure network for detection of attacks such as wormhole and black hole caused by malicious nodes presence in wireless Adhoc network. The simulation result shows that the proposed model is detect the malicious nodes effectively in wireless Adhoc networks. The malicious node detection efficiency can be achieved 96% also energy consumption also 10% better than existing method.

A sensor network is a collection of different nodes which are randomly deployed in sensor area to measure environmental changes like humidity, pressure and temperature. This paper proposes the performance of CSMA and TDMA Protocols for various Quality of Services of the sensor network. End to End Delay, Throughput, Energy consumption, Packet delivery ratio are the some Quality of Services of the sensor network. In this paper analyze QoS is proposed against Size and Rate. The results are taken for CSMA and TDMA using NS2 simulator. Results are compared for average end to end delay, packet delivery ratio, energy consumption and throughput.

Control overhead is a very important indicator for measure performance of ZigBee routing protocol. More control overhead will add network energy consumption and reduce network survival time. By analyzing the architecture features of ZigBee network and the key technologies of network layer, researching ZigBee routing protocol based on ZigBee Cluster-Tree network architecture, an improved routing algorithm of control overhead is proposed. The algorithm uses Cluster-Tree parameter of ZigBee network and network addresses of destination nodes to control the transmission range and restrict its transmission direction. The algorithm performance is simulated by NS-2 simulator. The simulating results indicate that control overhead is reduced about a half without influencing packet delivery ratio and path length of ZigBee network.

The research letter emphasises the hardware chip design of homogeneous clustered optimised link state routing (HMC-OLSR) protocol for Mobile Ad-hoc Networks (MANET). The homogeneously distributed clustering allows for parallel processing and distributes the burden evenly among the clusters to reduce the network complexity and computational time. The chip design is evaluated based on field programmable gate array (FPGA) performance metrics for the proposed HMC-OLSR protocol, which significantly reduced hardware utilisation by 27.45%, 48.8% of slices, 28.71%, 55.82% of flip-flops, 8.35%, 13.60% of look-up tables (LUTs), and 36.4% of input/output blocks (IoBs) compared to existing OLSR and destination-Sequenced distance vector (DSDV) protocols, respectively. The recommended protocol also outperformed OLSR and DSDV routing protocols in FPGA timing constraints such as minimum time before the clock, maximum time after the clock, and minimum propagation period. The novelty of the work is in the incorporation of an FPGA-integrated scalable network design that surpasses maximum throughput, packet delivery ratio (PDR), minimum power consumption, end-to-end delay, and control overhead.

Rapid advancements in peer-to-peer (P2P) streaming technologies have significantly impacted digital communication, enabling scalable, decentralized, and real-time content distribution. Despite these advancements, challenges persist, including dynamic topology management, high latency, security vulnerabilities, and unfair resource sharing (e.g., free rider). While software-defined networking (SDN) and blockchain individually address aspects of these limitations, their combined potential for comprehensive optimization remains underexplored. This study proposes a distributed SDN (DSDN) architecture enhanced with blockchain support to provide secure, scalable, and reliable P2P video streaming. We identified research gaps through critical analysis of the literature. We systematically compared traditional P2P, SDN-enhanced, and hybrid architectures across six performance metrics: latency, throughput, packet loss, authentication accuracy, packet delivery ratio, and control overhead. Simulations with 200 peers demonstrate that the proposed hybrid SDN–blockchain framework achieves a latency of 140 ms, a throughput of 340 Mbps, an authentication accuracy of 98%, a packet delivery ratio of 97.8%, a packet loss ratio of 2.2%, and a control overhead of 9.3%, outperforming state-of-the-art solutions such as NodeMaps, the reinforcement learning-based routing framework (RL-RF), and content delivery networks-P2P networks (CDN-P2P). This work establishes a scalable and attack-resilient foundation for next-generation P2P streaming.

Mobile ad-hoc network is infrastructure less networks having nodes which can act as a transmitter, router or receiver. MANETs have a dynamic topology where nodes are mobile. To monitor the working of the nodes and nature in which they behave while sending, receiving or forwarding data is classified by a set of rules known as routing protocols. Many routing protocols have been designed to fit the needs of Communication in MANET. These protocols have their own advantages and disadvantages depending in which network they are used. This paper will discuss the evaluation of performances of three routing protocols which include Dynamic Source Routing (DSR), Ad Hoc On-demand Distance Vector (AODV) and Destination Sequenced Distance Vector DSDV. The goal of our work is to study the behavior of above mentioned routing protocols with multimedia traffic source in the network based on the following performance metrics: energy consumption, jitter, packet delivery ratio, and packet drop, control overhead, delay. A simulation model using Network Simulator 2 (NS2) is developed to study the scenario and evaluate them.

AODV is a reactive routing protocol that sets up routes between source and destination nodes as and whenneeded. The performance of AODV protocol depends on the choice of certain parameters including route requestretries which is, by default, set as two in the corresponding RFC. In the present work, the effect of Route RequestRetries (RRR) on a set of performance metrics viz. Normalized Routing Load (NRL), Average End-to-End Delay(AEED), Packet Delivery Ratio (PDR) and Throughput has been investigated for a linear ad hoc network of fivenodes. Three different scenarios have been investigated wherein middle node is made to remain stationary, mobilewith low mobility and mobile with high mobility. Mobility of the middle node is found to be having significanteffect on the performance of such linear ad hoc networks. RRR has no influence on the performance of linear adhoc network of stationary nodes. However, RRR is having significant effect on the performance of linear ad hocnetwork if a node is made mobile. Performance of such linear ad hoc network is also affected by the choice ofduration of simulation.