In mobile ad hoc network due to node movements, there exists route failure in active data transmission which results in data loss and communication overheads. Hence, in such a dynamic… Click to show full abstract
In mobile ad hoc network due to node movements, there exists route failure in active data transmission which results in data loss and communication overheads. Hence, in such a dynamic network, routing through reliable path is one of the tedious tasks. In this paper, we propose a novel Decision Tree based Routing Protocol (DTRP) a data mining technique in route selection process from source to destination. The proposed DTRP protocol selects the one hop neighbors based on the parameters such as speed, Link Expiration Time, trip_time and node life time. Thus the performance of a route discovery mechanism is enhanced by selecting the stable one-hop neighbors along the path to reach the destination. The simulated results show that the lifetime of the route is increased and hence the data loss and end to end delay are minimized thereby increasing the throughput of the network using the proposed DTRP routing protocol compared to existing routing protocols.
               
Click one of the above tabs to view related content.