Trust Management for Secure Routing Forwarding Data Using Delay Tolerant Networks

Delay Tolerant Networks (DTNs) have established the connection to source and destination. For example this often faces disconnection and unreliable wireless connections. A delay tolerant network (DTNs) provides a network imposes disruption or delay. The delay tolerant networks operate in limited resources such as memory size, central processing unit. Trust management protocol uses a dynamic threshold updating which overcomes the problems .The dynamic threshold update reduces the false detection probability of the malicious nodes. The system proposes a secure routing management schemes to adopt information security principles successfully. It analyzes the basic security principles and operations for trust authentication which is applicable in delay tolerant networks (DTNs).For security the proposed system identifies the store and forward approach in network communications and analyzes the routing in cases like selfish contact and collaboration contact methods. The proposed method identifies ZRP protocol scheme and it enhances the scheme using methods namely distributed operation, mobility, delay analysis, security association and trust modules. This security scheme analyzes the performance analysis and proposed algorithm based on parameter time, authentication, security, and secure routing. From this analysis, this research work identifies the issues in DTNs secure routing and enhances ZRP (Zone Routing Protocol) by suggesting an authentication principle as a noted security principle for extremely information security concepts

Bayesian based selfish aware routing on Delay Tolerant Networks

Delay Tolerant Networks (DTNs) aim to increase messages delivery ratio in environments where it is not possible to establish an end-to-end connection. Although the research of new DTN routing protocols has been gaining some relevance, those protocols usually assume that nodes in a network will collaborate. Nodes can behave selfishly, leading to the inappropriate use of resources, following up the malfunction of the network environment. This paper presents an extension based on bayesian game theory to existing routing protocols. Each node tries to figure others node’s type using the Naive Bayes classifier and behaves appropriately in order to achieve optimal results across the cooperative nodes. The regarded data through the exchangeable events between nodes can also be used to calculate each node’s selfishness, assigning the acceptance and respective delivery probability of a message to its destination. The filter extension improved the delivery ratio of the cooperative nodes on selfish networks.FEDER Funds through the Programa Operacional Fatores de Competitividade COMPETE and by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project FCOMP-01-0124-FEDER-02267

A routing defense mechanism using evolutionary game theory for Delay Tolerant Networks

Delay Tolerant Networks (DTNs) often suffer from intermittent disruption due to factors such as mobility and energy. Though lots of routing algorithms in DTNs have been proposed in the last few years, the routing security problems have not attracted enough attention. DTNs are still facing the threats from different kinds of routing attacks. In this paper, a general purpose defense mechanism is proposed against various routing attacks on DTNs. The defense mechanism is based on the routing path information acquired from the forwarded messages and the acknowledgment (ACK), and it is suitable for different routing schemes. Evolutionary game theory is applied with the defense mechanism to analyze and facilitate the strategy changes of the nodes in the networks. Simulation results show that the proposed evolutionary game theory based defense scheme can achieve high average delivery ratio, low network overhead and low average transmission delay in various routing attack scenarios. By introducing the game theory, the networks can avoid being attacked and provide normal transmission service. The networks can reach evolutionary strategy stable (ESS) under special conditions after evolution. The initial parameters will affect the convergence speed and the final ESS, but the initial ratio of the nodes choosing different strategies can only affect the game process