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

被引:138
|
作者
Chen, Ing-Ray [1 ]
Bao, Fenye [1 ]
Chang, MoonJeong [1 ]
Cho, Jin-Hee [2 ]
机构
[1] Virginia Polytech Inst & State Univ, Dept Comp Sci, Falls Church, VA 22043 USA
[2] US Army Res Lab, Computat & Informat Sci Directorate, Adelphi, MD 20783 USA
关键词
Delay tolerant networks; dynamic trust management; secure routing; performance analysis; design and validation; ADMISSION CONTROL; ADVERSARY DETECTION; ALGORITHM;
D O I
10.1109/TPDS.2013.116
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:1200 / 1210
页数:11
相关论文
共 50 条
  • [1] Trust Management for Encounter-Based Routing in Delay Tolerant Networks
    Chen, Ing-Ray
    Bao, Fenye
    Chang, Moonjeong
    Cho, Jin-Hee
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [2] An Efficient method for Secure Routing in Delay Tolerant Networks
    Sobin, C. C.
    Labeeba, C. T.
    Chandran, Deepika K.
    8TH INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING & COMMUNICATIONS (ICACC-2018), 2018, 143 : 820 - 826
  • [3] Integrated Social and QoS Trust-Based Routing in Delay Tolerant Networks
    Ing-Ray Chen
    Fenye Bao
    MoonJeong Chang
    Jin-Hee Cho
    Wireless Personal Communications, 2012, 66 : 443 - 459
  • [4] Integrated Social and QoS Trust-Based Routing in Delay Tolerant Networks
    Chen, Ing-Ray
    Bao, Fenye
    Chang, MoonJeong
    Cho, Jin-Hee
    WIRELESS PERSONAL COMMUNICATIONS, 2012, 66 (02) : 443 - 459
  • [5] Secure Multi-copy Routing in Compromised Delay Tolerant Networks
    Eyuphan Bulut
    Boeslaw K. Szymanski
    Wireless Personal Communications, 2013, 73 : 149 - 168
  • [6] Secure Multi-copy Routing in Compromised Delay Tolerant Networks
    Bulut, Eyuphan
    Szymanski, Boeslaw K.
    WIRELESS PERSONAL COMMUNICATIONS, 2013, 73 (01) : 149 - 168
  • [7] On Exploiting Dynamic Trusted Routing Scheme in Delay Tolerant Networks
    Vandana Juyal
    Ravish Saggar
    Nitin Pandey
    Wireless Personal Communications, 2020, 112 : 1705 - 1718
  • [8] On Exploiting Dynamic Trusted Routing Scheme in Delay Tolerant Networks
    Juyal, Vandana
    Saggar, Ravish
    Pandey, Nitin
    WIRELESS PERSONAL COMMUNICATIONS, 2020, 112 (03) : 1705 - 1718
  • [9] A Framework for Routing Performance Analysis in Delay Tolerant Networks with Application to Noncooperative Networks
    Resta, Giovanni
    Santi, Paolo
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (01) : 2 - 10
  • [10] Optimal management of dynamic information in Delay Tolerant Networks
    Yahui Wu
    Su Deng
    Hongbin Huang
    The Journal of Supercomputing, 2013, 66 : 320 - 338