No abstract

Abstract-A mobile ad-hoc network is a self-configuring network of mobile hosts connected by wireless links which together form an arbitrary topology. Due to lack of centralized control, dynamic network topology and multihop communications, the provision of making routing secure in mobile ad hoc networks is much more challenging than the security in infrastructure based networks. Several protocols for secure routing in ad hoc networks have been proposed in the literature. But due to their limitations, there is a need to make them robust and more secure so that they can go well with the demanding requirements of ad hoc networks. This paper presents a survey of trust based secure routing protocols for mobile ad hoc networks. Different trust based secure routing protocols are discussed and analyzed in the paper along with their strengths, weaknesses and future enhancements.Index Terms-Routing protocol, trust based secure routing, ad hoc networks.

Summary Opportunistic Networks (OppNets) are intermittently connected infrastructure less wireless networks. There is no continuous end‐to‐end connection between the sender and the receiver, and hence nodes follow a store‐carry‐forward mechanism. The routing algorithm is required to be adaptive to the changing topology of the network. In this work, Q‐Routing technique has been used with forwarding probability and incorporated using Poisson's probability for decision making and controlling transmission energy. The algorithm refines the forwarding decision of finding the next suitable hop by exploiting the characteristics of nodes such as daily routines, mobility pattern, etc. In simulations, the performance of PBQ‐Routing is compared with Q‐Routing, Epidemic Routing, PRoPHET (Probabilistic Routing Protocol using History of Encounters and Transitivity), and HBPR (History Based Prediction Routing) for OppNets. The use of Poisson's distribution improves the effectiveness of the probabilistic forwarding decision. The findings show that the delivery probability of PBQ‐Routing almost gets doubled and overhead ratio reduces to half in comparison with that of Q‐Routing when used in OppNets. PBQ‐Routing outperforms other Q‐Routing based algorithms over Poisson's distribution. As there is less replication in case of PBQ‐Routing, it also saves the transmission energy.

In Wireless Ad Hoc Network environment, there are three ways to understand a routing protocol: (i) monitoring, (ii) simulation and (iii) modeling. In this paper, the different trust based secure routing protocols used in wireless ad hoc networks are analyzed, modeled and described by incorporating process flow diagrams. These process flow diagrams represent stepwise work flow activities and actions. It shows the overall flow of control of a process, program or a protocol. This paper focuses on the security aspects of routing by incorporating trust parameter into account and also highlights methodology used in secure routing protocols. Such protocols have been categorized based on the model used for enforcing security, methodology and information for making effective routing decisions. In this paper, we model, discuss and analyze trust based secure ad hoc routing schemes which do not require each network node to work in promiscuous mode. We propose and design a new protocol - Trust based Routing using Dominating Set Approach (TRDSA) which overcomes the shortcomings of existing protocols.

No abstract