Dynamic trust management and adversary detection in delay tolerant networks

Abstract

Delay Tolerant Network (DTN), refers to a special type of network in which the end- to-end path is usually difficult to establish, and the message propagation in the network has a large delay, making it difficult for the TCP/IP-based protocols on the traditional internet to apply to this network. It is designed to solve technical problems in heterogeneous networks that may lack continuous network connections. Delay Tolerant Networks (DTNs) are a class of emerging networks that experience frequent and long- duration partitions. DTNs differ from conventional networks due to their feature of no end-to-end connectivity involving the source. The topology of delay tolerant networks might change randomly as well as dynamically, and due to the absence of end-to-end connectivity, it faces various challenges for routing. First of all, we present a relay selection scheme for delay tolerant network and introduce a novel hybrid approach which provides an efficient solution for relay selection, buffer and, trust management scheme, this scheme is called as Relay Selection Trust Management (RSTM) model for DTNs. In next phase, we focus of PROPHET routing and introduced Prophet based new routing protocol where we design a new decisionmaking matrix using several parameters such as bandwidth, power, and trust and buffer management. The new matrix helps to design a novel decision-making process for next hop selection. Finally, we work on a Dependable routing scheme that can help sustain connectivity during the store-carry-forward process. The proposed model employs a coalition-building mechanism that incorporates an energy cost and congestion model. We used the idea of coalition forming to add a utility function to help nodes form the best possible coalition. We evaluate the performance of the proposed schemes in terms of delay by varying the time and compared the performance of with the existing techniques. The experiment shows that the proposed approach achieves better performance in terms of communication overhead because it has less end-to-end delay and better packet delivery rate. The results outperform the existing techniques and achieve higher efficacy to prove the efficiency of proposed mechanisms.