Simulation of the Performance Metrics for Securing DSDV Routing Protocol Based on Trusted Environments

Abstract

To organize the network in an efficient way to minimize the risk of illegal node and to safeguard protected information, a security mechanism is required to secure communication. In addition, a security mechanism is also required to ensure that received information have not been tampered with. In this paper, a more efficient mechanism for Securing the Destination Sequenced Distance Vector Routing Protocol (SDSDV) is proposed. This paper comprehensively investigates the performance impacts by varying the number of maximum connections and mobility on securing the ad hoc network with Destination Sequenced Distance Vector Routing Protocol (DSDV) Routing Protocol. From simulation results, we explore the causes for performance degradation. Based on the investigation, we indicate that we have to impose restrictions on the maximum connections to acquire an expected performance. These results also reveal that the performance decreases with the increment of the mobility and maximum connections that is unequal to 60. If we want to obtain the optimal performance, the number of nodes in a network should be constrained to be 60 if the maximum connections are 60.