Improving the performance of Dynamic Source Routing for Mobile Ad-hoc Networks in the Presence of Selfish Nodes

Abstract

Mobile Ad-hoc NETwork (MANET) is the type of wireless technology without the aid of infrastructure. Performance degradation occurs in this type of network due to different factors such as the selfish node. In existing Dynamic Source Routing (DSR) there is no mechanism that manages node behavior function during discovering the route from source to destination. Selfishness Identifying based Route Discovery Algorithm (SIRDA) was developed to improve the performance of DSR protocol. The new algorithm manages the route request function of nodes during discovering the path from source to destination. The algorithm counts the number of failed route request messages to identify the selfish node. During route discovery, if a neighbor node drops a control message packet for three consecutive times, then the developed algorithm identifies the node as a selfish node. The proposed solution on DSR node which drops control message was identified by node_ id., they are assigned -1 for indicating the selfishness status of the node. New DSR with SIRDA identifies the node behavior before sending the data packet. The proposed SIRDA simulated on NS-2.35. The routing performance was improved in a new DSR protocol. The simulation results illustrated in terms of packet dropped, end-to-end delay and average throughput. The simulation results of the study show the average improvement of packet dropped from 2528 to 151, an improvement on average throughput from 0.93 to 0.99(6%) and end-to-end delay improved from 1.902 to 1.007. we concluded that new SIRDA show improvement in all evaluated performance metrics.