Wednesday, 23 July 2014

Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing



 Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing

ABSTRACT:


 Delay tolerant networks (DTNs) are characterized by high end-to-end latency, frequent disconnection, and opportunistic communication over unreliable wireless links. In this paper, we design and validate a dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes. We develop a novel model-based methodology for the analysis of our trust protocol and validate it via extensive simulation. Moreover, we address dynamic trust management, i.e., determining and applying the best operational settings at runtime in response to dynamically changing network conditions to minimize trust bias and to maximize the routing application performance. We perform a comparative analysis of our proposed routing protocol against Bayesian trust-based and non-trust based (PROPHET and epidemic) routing protocols. The results demonstrate that our protocol is able to deal with selfish behaviors and is resilient against trust-related attacks. Furthermore, our trust-based routing protocol can effectively trade off message overhead and message delay for a significant gain in delivery ratio. Our trust-based routing protocol operating under identified best settings outperforms Bayesian trust-based routing and PROPHET, and approaches the ideal performance of epidemic routing in delivery ratio and message delay without incurring high message or protocol maintenance overhead.
EXISTING SYSTEM:

 A delay tolerant network (DTN) comprises mobile nodes (e.g., humans in a social DTN) experiencing sparse connection, opportunistic communication, and frequently changing network topology. Because of lack of end-to-end connectivity, routing in DTN adopts a store-carry-and-forward scheme by which messages are forwarded through a number of intermediate nodes leveraging opportunistic encountering, hence resulting in high end-to-end latency.
DISADVANTAGES OF EXISTING SYSTEM:
v Trust management protocols and approaches to deal with misbehaving nodes in DTNs.
v Only have Selfish Behaving nodes.

PROPOSED SYSTEM:

 In this paper, we propose dynamic trust management for DTNs to deal with both malicious and selfish misbehaving nodes. Our notion of selfishness is social selfishness as very often humans carrying communication devices (smart phones, GPSs, etc.) in a DTN are socially selfish to outsiders but unselfish to friends. Our notion of maliciousness refers to malicious nodes performing trust-related attacks to disrupt DTN operations built on trust (e.g., trust-based DTN routing considered in this paper). We aim to design and validate a dynamic trust management protocol for DTN routing performance optimization in response to dynamically changing conditions such as the population of misbehaving nodes

ADVANTAGES OF PROPOSED SYSTEM:
v It generally improves the accuracy of predictions when compared with previous recommendation methods.
v Using trust-based admission control strategies.
v Security management protocols for delay-tolerant, self-contained message forwarding applications based on the information-centric networks (ICN).

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

Processor                  -        Pentium –IV

Speed                        -        1.1 Ghz
RAM                         -        512 MB(min)
Hard Disk                 -        40 GB
Key Board                -        Standard Windows Keyboard
Mouse                       -        Two or Three Button Mouse
Monitor                     -        LCD/LED
SOFTWARE REQUIREMENTS:
Operating system      :         Windows XP.
Coding Language      :         .Net
Data Base                 :         SQL Server 2005
Tool                          :         VISUAL STUDIO 2008.

REFERENCE:
Ing-Ray Chen, Fenye Bao ; MoonJeong Chang ; Jin-Hee Cho Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 5, May 2014

No comments:

Post a Comment