Trust Management for Encounter-Based Routing in Delay Tolerant Networks

We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only quality-of-service (QoS) trust properties (connectivity) but also social trust properties (honesty and unselfishness) to evaluate other nodes encountered. Two versions of trust management protocols are considered: an equal-weight QoS and social trust management protocol (called trust-based routing) and a QoS only trust management protocol (called connectivity-based routing). By utilizing a stochastic Petri net model describing a DTN behavior, we analyze the performance characteristics of these two routing protocols in terms of message delivery ratio, latency, and message overhead. We also perform a comparative performance analysis with epidemic routing for a DTN consisting of heterogeneous mobile nodes with vastly different social and networking behaviors. The results indicate that trust-based routing approaches the ideal performance of epidemic routing in delivery ratio, while connectivity-based routing approaches the ideal performance in message delay of epidemic routing, especially as the percentage of selfish and malicious nodes present in the DTN system increases. By properly selecting weights associated with QoS and social trust metrics for trust evaluation, our trust management protocols can approximate the ideal performance obtainable by epidemic routing in delivery ratio and message delay without incurring high message overhead.

[1]  Merkourios Karaliopoulos,et al.  Assessing the vulnerability of DTN data relaying schemes to node selfishness , 2009, IEEE Communications Letters.

[2]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[3]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Xiaodong Lin,et al.  SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks , 2009, IEEE Transactions on Vehicular Technology.

[5]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[6]  Ananthram Swami,et al.  Modeling and Analysis of Trust Management for Cognitive Mission-Driven Group Communication Systems in Mobile Ad Hoc Networks , 2009, 2009 International Conference on Computational Science and Engineering.

[7]  Boleslaw K. Szymanski,et al.  Impact of Social Networks on Delay Tolerant Routing , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[8]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[9]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[10]  Xue Liu,et al.  SReD: A Secure REputation-based Dynamic Window Scheme for disruption-tolerant networks , 2009, MILCOM 2009 - 2009 IEEE Military Communications Conference.

[11]  Marc Ivaldi,et al.  Telecommunications Demand and Pricing Structure: An Econometric Analysis , 2004, Telecommun. Syst..

[12]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[13]  Mads Haahr,et al.  The challenges of disconnected delay-tolerant MANETs , 2010, Ad Hoc Networks.