Defense and Detection of DDOS Attack using Secured Geographic Routing

Due to the absence of routing initiation, the routing protocol requires a secure message transition. The key downside is that there are many current routing protocols. The big downside is the inability of the node to give a message when the attackers are routing. The key attack in the proposed routing model is Distributed Denial of Service (DDOS). The Protected Geographic Routing Protocol (SGRP) is the assured routing carried out in the proposed work. The Protected Geographic Routing Protocol (SGRP) will improve the efficiency of the transmission method by choosing a specific source node. The paper suggested that the Protected Spatial Routing Protocol (PSRP) would recognize and isolate such threats. Several modeling time estimation studies have been carried out to analyze the simulation time and the efficiency of the proposed routing technique. The proposed routing technique demonstrates the performance by calculating the Packets Delivery Ratio(PDR) and Energy consumption. The Routing protocol is used in many applications such as the Industrial Internet of Things (IoT)

Performance Enhancement of Optimized Link State Routing Protocol by Parameter Configuration for UANET

The growing need for wireless communication has resulted in the widespread usage of unmanned aerial vehicles (UAVs) in a variety of applications. Designing a routing protocol for UAVs is paramount as well as challenging due to its dynamic attributes. The difficulty stems from features other than mobile ad hoc networks (MANET), such as aerial mobility in 3D space and frequently changing topology. This paper analyzes the performance of four topology-based routing protocols, dynamic source routing (DSR), ad hoc on-demand distance vector (AODV), geographic routing protocol (GRP), and optimized link state routing (OLSR), by using practical simulation software OPNET 14.5. Performance evaluation carries out various metrics such as throughput, delay, and data drop rate. Moreover, the performance of the OLSR routing protocol is enhanced and named “E-OLSR” by tuning parameters and reducing holding time. The optimized E-OLSR settings provide better performance than the conventional request for comments (RFC 3626) in the experiment, making it suitable for use in UAV ad hoc network (UANET) environments. Simulation results indicate the proposed E-OLSR outperforms the existing OLSR and achieves supremacy over other protocols mentioned in this paper.

Network Coding- Based Energy-Efficient Geographic Routing Protocols in Wireless Sensor Networks Using XOR

Energy awareness is an essential design issue in wireless sensor network. Therefore, attention must be given to the routing protocols since they might differ depending on the application and network architecture. It is desired to design the energy efficient routing protocols to conserve the power supply of sensor node and prolong its lifetime. In this paper Network Coding-Energy efficient geographic routing protocol (NC-EGRPM) in Wireless Sensor network is an energy efficient scheme which prolong the network life time using the mobile sinks. These algorithms focus on the efficiency of network coding, which could be adoptive, flexible, and intelligent enough to distribute the load among the sensor nodes that can enhance the network lifetime. By using NC (Network Coding), we propose an energy efficienct algorithm to handle uncertain level decision better than other models. We also use the concept of XOR encoding and decoding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. XOR-based coding works on a hop-by-hop basis, i.e. packets encoded by a node are decoded by its neighbouring nodes. The idea is that each node v can combine packets using bitwise XOR operations in order to produce an encoded packet. We are implementing our proposed work using NS2 and measure its performance. Keywords: Network coding, XOR, NS2, WSN

WA-GPSR: Weight-Aware GPSR-Based Routing Protocol for VANET

The extremely fast topology has created new requirements for the geographic routing protocol, which has been the most efficient solution for Vehicular Ad-hoc Networks (VANETs). The frequent disconnection of links makes the choice of the next routing node extremely difficult. Hence, an efficient routing algorithm needs to deliver the appropriate path to transfer the data packets with the most relevant quality of service (QoS). In this work, the weight-aware greedy perimeter stateless (WA-GPSR) routing protocol is presented. The enhanced GPSR protocol computes the reliable communication area and selects the next forwarding vehicle based on several routing criteria. The proposal has been evaluated and compared to Maxduration-Minangle GPSR (MM-GPSR) and traditional GPSR using strict metric analysis. Our experimental results using NS-2 and VanetMobiSim, have demonstrated that WA-GPSR has the ability to enhance network performance.