Enhancing performance of trust based routing using hybrid algorithm in mobile ad hoc network

Abstract

The wireless networks where the data are transmitted opportunistically at the time contact are called Opportunistic Networks (Oppnets). The Opportunistic Routing (OR) is efficient for these kinds of networks compared to fixed path routing. It is essential that the Opportunistic Routing protocols will have to implement some security as performance at the same time. There are difficulties concerning security, like heterogeneity, mobility, and delayed tolerance while designing the Opportunistic routing. The Opportunistic Routing is different from that of traditional routing as it permits a dynamic path routing through an opportunistic relay selection and these Opportunistic Routing will broadcast data packets to a candidate set as opposed to a single relay that is predetermined. Normally such candidate forwarders will be prioritized in accordance to one particular measure. Once the data broadcast is complete the candidate relays will receive a data packet run of a coordination system. The main of such system will be to choose the optimal relay on such receivers for forwarding the packets. As soon as it is chosen, the relay will carry on packet forwarding and such iterations will be repeated till the packet reaches a destination. The routing protocols and their opportunity will be improved by means of applying the routing decisions based on sensor network node trust values. For increasing the chances of the packet for reaching its destination the wireless nodes that will be able to utilize its trust based route and its dependability information. The Extremely Opportunistic Routing (ExOR) is a famous Opportunistic Routing protocols that will choose the candidate set in accordance to its Expected Transmission Count (ETX) metric. The ExOR has better efficiency and are more reliable when compared to the popular routing protocols. The selection of candidates by means of incorporating its trust value with a link delivery probability and such metrics make attempts at trying a minimization of its obtained trust. The local search is that technique which includes the starting of a feasible solution to the problem in hand and will continuously make changes to the solution for improving its objectives and for this work the Opportunistic Routing protocol that is trust based has been proposed newline