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

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 pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 2014-05, Vol.25 (5), p.1200-1210
Hauptverfasser: Chen, Ing-Ray, Bao, Fenye, Chang, MoonJeong, Cho, Jin-Hee
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1210
container_issue 5
container_start_page 1200
container_title IEEE transactions on parallel and distributed systems
container_volume 25
creator Chen, Ing-Ray
Bao, Fenye
Chang, MoonJeong
Cho, Jin-Hee
description 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.
doi_str_mv 10.1109/TPDS.2013.116
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_1685776279</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6497435</ieee_id><sourcerecordid>1685776279</sourcerecordid><originalsourceid>FETCH-LOGICAL-c318t-616f4c5b0b24a632cee7e734a868d5d859e9c4f3492490509755274addea38973</originalsourceid><addsrcrecordid>eNpd0DlPwzAUB_AIgUQpjEwsllhYUuz4iseq5ahUDtGwsESu81KlpHGwHaF-exIVMTC9Qz89Pf2j6JLgCSFY3Wav89UkwYT2oziKRoTzNE5ISo_7HjMeq4So0-jM-y3GhHHMRtHHfN_oXWVQ5jof0JNu9AZ20ARUWofmUOs9ymwNTverZwjf1n16pJsCLYJH07atK6NDZRsULFqB6RygN9uFqtmcRyelrj1c_NZx9H5_l80e4-XLw2I2XcaGkjTEgoiSGb7G64RpQRMDIEFSplORFrxIuQJlWEmZSpjCHCvJeSKZLgrQNFWSjqObw93W2a8OfMh3lTdQ17oB2_mciJRLKRKpenr9j25t55r-u5xwwgRVQgwqPijjrPcOyrx11U67fU5wPiSdD0nnQ9L9KHp_dfAVAPxZwZRklNMfId14dA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1514639669</pqid></control><display><type>article</type><title>Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing</title><source>IEEE Electronic Library (IEL)</source><creator>Chen, Ing-Ray ; Bao, Fenye ; Chang, MoonJeong ; Cho, Jin-Hee</creator><creatorcontrib>Chen, Ing-Ray ; Bao, Fenye ; Chang, MoonJeong ; Cho, Jin-Hee</creatorcontrib><description>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.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2013.116</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Analytical models ; Bayesian analysis ; Computer networks ; Delay ; Delay tolerant networks ; Delays ; design and validation ; dynamic trust management ; Dynamics ; History ; Messages ; Networks ; Optimization ; performance analysis ; Protocol ; Protocols ; Quality of service ; Routing ; Routing (telecommunications) ; secure routing ; Trustworthiness ; Wide area networks</subject><ispartof>IEEE transactions on parallel and distributed systems, 2014-05, Vol.25 (5), p.1200-1210</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c318t-616f4c5b0b24a632cee7e734a868d5d859e9c4f3492490509755274addea38973</citedby><cites>FETCH-LOGICAL-c318t-616f4c5b0b24a632cee7e734a868d5d859e9c4f3492490509755274addea38973</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6497435$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6497435$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chen, Ing-Ray</creatorcontrib><creatorcontrib>Bao, Fenye</creatorcontrib><creatorcontrib>Chang, MoonJeong</creatorcontrib><creatorcontrib>Cho, Jin-Hee</creatorcontrib><title>Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>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.</description><subject>Analytical models</subject><subject>Bayesian analysis</subject><subject>Computer networks</subject><subject>Delay</subject><subject>Delay tolerant networks</subject><subject>Delays</subject><subject>design and validation</subject><subject>dynamic trust management</subject><subject>Dynamics</subject><subject>History</subject><subject>Messages</subject><subject>Networks</subject><subject>Optimization</subject><subject>performance analysis</subject><subject>Protocol</subject><subject>Protocols</subject><subject>Quality of service</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>secure routing</subject><subject>Trustworthiness</subject><subject>Wide area networks</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpd0DlPwzAUB_AIgUQpjEwsllhYUuz4iseq5ahUDtGwsESu81KlpHGwHaF-exIVMTC9Qz89Pf2j6JLgCSFY3Wav89UkwYT2oziKRoTzNE5ISo_7HjMeq4So0-jM-y3GhHHMRtHHfN_oXWVQ5jof0JNu9AZ20ARUWofmUOs9ymwNTverZwjf1n16pJsCLYJH07atK6NDZRsULFqB6RygN9uFqtmcRyelrj1c_NZx9H5_l80e4-XLw2I2XcaGkjTEgoiSGb7G64RpQRMDIEFSplORFrxIuQJlWEmZSpjCHCvJeSKZLgrQNFWSjqObw93W2a8OfMh3lTdQ17oB2_mciJRLKRKpenr9j25t55r-u5xwwgRVQgwqPijjrPcOyrx11U67fU5wPiSdD0nnQ9L9KHp_dfAVAPxZwZRklNMfId14dA</recordid><startdate>20140501</startdate><enddate>20140501</enddate><creator>Chen, Ing-Ray</creator><creator>Bao, Fenye</creator><creator>Chang, MoonJeong</creator><creator>Cho, Jin-Hee</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20140501</creationdate><title>Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing</title><author>Chen, Ing-Ray ; Bao, Fenye ; Chang, MoonJeong ; Cho, Jin-Hee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c318t-616f4c5b0b24a632cee7e734a868d5d859e9c4f3492490509755274addea38973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Analytical models</topic><topic>Bayesian analysis</topic><topic>Computer networks</topic><topic>Delay</topic><topic>Delay tolerant networks</topic><topic>Delays</topic><topic>design and validation</topic><topic>dynamic trust management</topic><topic>Dynamics</topic><topic>History</topic><topic>Messages</topic><topic>Networks</topic><topic>Optimization</topic><topic>performance analysis</topic><topic>Protocol</topic><topic>Protocols</topic><topic>Quality of service</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>secure routing</topic><topic>Trustworthiness</topic><topic>Wide area networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Ing-Ray</creatorcontrib><creatorcontrib>Bao, Fenye</creatorcontrib><creatorcontrib>Chang, MoonJeong</creatorcontrib><creatorcontrib>Cho, Jin-Hee</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen, Ing-Ray</au><au>Bao, Fenye</au><au>Chang, MoonJeong</au><au>Cho, Jin-Hee</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2014-05-01</date><risdate>2014</risdate><volume>25</volume><issue>5</issue><spage>1200</spage><epage>1210</epage><pages>1200-1210</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><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.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2013.116</doi><tpages>11</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1045-9219
ispartof IEEE transactions on parallel and distributed systems, 2014-05, Vol.25 (5), p.1200-1210
issn 1045-9219
1558-2183
language eng
recordid cdi_proquest_miscellaneous_1685776279
source IEEE Electronic Library (IEL)
subjects Analytical models
Bayesian analysis
Computer networks
Delay
Delay tolerant networks
Delays
design and validation
dynamic trust management
Dynamics
History
Messages
Networks
Optimization
performance analysis
Protocol
Protocols
Quality of service
Routing
Routing (telecommunications)
secure routing
Trustworthiness
Wide area networks
title Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T04%3A53%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20Trust%20Management%20for%20Delay%20Tolerant%20Networks%20and%20Its%20Application%20to%20Secure%20Routing&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Chen,%20Ing-Ray&rft.date=2014-05-01&rft.volume=25&rft.issue=5&rft.spage=1200&rft.epage=1210&rft.pages=1200-1210&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2013.116&rft_dat=%3Cproquest_RIE%3E1685776279%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1514639669&rft_id=info:pmid/&rft_ieee_id=6497435&rfr_iscdi=true