A dynamic trust model in internet of things

Indicating trust or distrust of a node is a key issue in the trust management of IoT. However, there are some challenges for the management with anonymous nodes, inaccurate communication, etc. Due to huge number of nodes in IoT, one of the possible solutions is predicting trust and distrust values....

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Germany), 2020-04, Vol.24 (8), p.5773-5782
Main Authors: Wang, Eric Ke, Chen, Chien-Ming, Zhao, Dongning, Ip, Wai Hung, Yung, Kai Leung
Format: Article
Language:English
Subjects:
Access control
Algorithms
Artificial Intelligence
Computational Intelligence
Computer networks
Conspiracy
Control
Engineering
Feedback
Focus
Internet of Things
Markov chains
Mathematical Logic and Foundations
Mechatronics
Nodes
Reputations
Robotics
Smoothing
Social networks
Trustworthiness
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503
cites cdi_FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503
container_end_page 5782
container_issue 8
container_start_page 5773
container_title Soft computing (Berlin, Germany)
container_volume 24
creator Wang, Eric Ke
Chen, Chien-Ming
Zhao, Dongning
Ip, Wai Hung
Yung, Kai Leung
description Indicating trust or distrust of a node is a key issue in the trust management of IoT. However, there are some challenges for the management with anonymous nodes, inaccurate communication, etc. Due to huge number of nodes in IoT, one of the possible solutions is predicting trust and distrust values. In this paper, we propose a dynamic trust model based on direct and indirect trust computation, and the most important part of a model, trust prediction. The prediction method mainly depends on the combination of exponential smoothing and a Markov chain. We employ exponential smoothing to predict trustiness and a Markov chain to fix the deviation of the prediction. To test our scheme, we create a simulation to evaluate its performance and effectiveness. The simulation results are encouraging.
doi_str_mv 10.1007/s00500-019-04319-2
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2917976735</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2917976735</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503</originalsourceid><addsrcrecordid>eNp9kEtLAzEQx4MoWKtfwNOCR4nO5LHZHEvxBQUveg5rHnVLu1uT7KHf3tgVvAnDzBz-D_gRco1whwDqPgFIAAqoKQheNjshMxScUyWUPj3-jKpa8HNykdIGgKGSfEZuF5U79O2us1WOY8rVbnB-W3V9mexj73M1hCp_dv06XZKz0G6Tv_q9c_L--PC2fKar16eX5WJFLW9kpo12NrQNWtloHdAKwZwKDXILVliohQctUfmgnfsQ4ILFuhFMC8S6dhL4nNxMufs4fI0-ZbMZxtiXSsM0Kq1qxWVRsUll45BS9MHsY7dr48EgmB8oZoJiChRzhGJYMfHJlIq4X_v4F_2P6xvxZWJp</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2917976735</pqid></control><display><type>article</type><title>A dynamic trust model in internet of things</title><source>Springer Nature</source><creator>Wang, Eric Ke ; Chen, Chien-Ming ; Zhao, Dongning ; Ip, Wai Hung ; Yung, Kai Leung</creator><creatorcontrib>Wang, Eric Ke ; Chen, Chien-Ming ; Zhao, Dongning ; Ip, Wai Hung ; Yung, Kai Leung</creatorcontrib><description>Indicating trust or distrust of a node is a key issue in the trust management of IoT. However, there are some challenges for the management with anonymous nodes, inaccurate communication, etc. Due to huge number of nodes in IoT, one of the possible solutions is predicting trust and distrust values. In this paper, we propose a dynamic trust model based on direct and indirect trust computation, and the most important part of a model, trust prediction. The prediction method mainly depends on the combination of exponential smoothing and a Markov chain. We employ exponential smoothing to predict trustiness and a Markov chain to fix the deviation of the prediction. To test our scheme, we create a simulation to evaluate its performance and effectiveness. The simulation results are encouraging.</description><identifier>ISSN: 1432-7643</identifier><identifier>EISSN: 1433-7479</identifier><identifier>DOI: 10.1007/s00500-019-04319-2</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Access control ; Algorithms ; Artificial Intelligence ; Computational Intelligence ; Computer networks ; Conspiracy ; Control ; Engineering ; Feedback ; Focus ; Internet of Things ; Markov chains ; Mathematical Logic and Foundations ; Mechatronics ; Nodes ; Reputations ; Robotics ; Smoothing ; Social networks ; Trustworthiness</subject><ispartof>Soft computing (Berlin, Germany), 2020-04, Vol.24 (8), p.5773-5782</ispartof><rights>Springer-Verlag GmbH Germany, part of Springer Nature 2019</rights><rights>Springer-Verlag GmbH Germany, part of Springer Nature 2019.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503</citedby><cites>FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Wang, Eric Ke</creatorcontrib><creatorcontrib>Chen, Chien-Ming</creatorcontrib><creatorcontrib>Zhao, Dongning</creatorcontrib><creatorcontrib>Ip, Wai Hung</creatorcontrib><creatorcontrib>Yung, Kai Leung</creatorcontrib><title>A dynamic trust model in internet of things</title><title>Soft computing (Berlin, Germany)</title><addtitle>Soft Comput</addtitle><description>Indicating trust or distrust of a node is a key issue in the trust management of IoT. However, there are some challenges for the management with anonymous nodes, inaccurate communication, etc. Due to huge number of nodes in IoT, one of the possible solutions is predicting trust and distrust values. In this paper, we propose a dynamic trust model based on direct and indirect trust computation, and the most important part of a model, trust prediction. The prediction method mainly depends on the combination of exponential smoothing and a Markov chain. We employ exponential smoothing to predict trustiness and a Markov chain to fix the deviation of the prediction. To test our scheme, we create a simulation to evaluate its performance and effectiveness. The simulation results are encouraging.</description><subject>Access control</subject><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Computational Intelligence</subject><subject>Computer networks</subject><subject>Conspiracy</subject><subject>Control</subject><subject>Engineering</subject><subject>Feedback</subject><subject>Focus</subject><subject>Internet of Things</subject><subject>Markov chains</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Nodes</subject><subject>Reputations</subject><subject>Robotics</subject><subject>Smoothing</subject><subject>Social networks</subject><subject>Trustworthiness</subject><issn>1432-7643</issn><issn>1433-7479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEQx4MoWKtfwNOCR4nO5LHZHEvxBQUveg5rHnVLu1uT7KHf3tgVvAnDzBz-D_gRco1whwDqPgFIAAqoKQheNjshMxScUyWUPj3-jKpa8HNykdIGgKGSfEZuF5U79O2us1WOY8rVbnB-W3V9mexj73M1hCp_dv06XZKz0G6Tv_q9c_L--PC2fKar16eX5WJFLW9kpo12NrQNWtloHdAKwZwKDXILVliohQctUfmgnfsQ4ILFuhFMC8S6dhL4nNxMufs4fI0-ZbMZxtiXSsM0Kq1qxWVRsUll45BS9MHsY7dr48EgmB8oZoJiChRzhGJYMfHJlIq4X_v4F_2P6xvxZWJp</recordid><startdate>20200401</startdate><enddate>20200401</enddate><creator>Wang, Eric Ke</creator><creator>Chen, Chien-Ming</creator><creator>Zhao, Dongning</creator><creator>Ip, Wai Hung</creator><creator>Yung, Kai Leung</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20200401</creationdate><title>A dynamic trust model in internet of things</title><author>Wang, Eric Ke ; Chen, Chien-Ming ; Zhao, Dongning ; Ip, Wai Hung ; Yung, Kai Leung</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Access control</topic><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Computational Intelligence</topic><topic>Computer networks</topic><topic>Conspiracy</topic><topic>Control</topic><topic>Engineering</topic><topic>Feedback</topic><topic>Focus</topic><topic>Internet of Things</topic><topic>Markov chains</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Nodes</topic><topic>Reputations</topic><topic>Robotics</topic><topic>Smoothing</topic><topic>Social networks</topic><topic>Trustworthiness</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Eric Ke</creatorcontrib><creatorcontrib>Chen, Chien-Ming</creatorcontrib><creatorcontrib>Zhao, Dongning</creatorcontrib><creatorcontrib>Ip, Wai Hung</creatorcontrib><creatorcontrib>Yung, Kai Leung</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer science database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Soft computing (Berlin, Germany)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Eric Ke</au><au>Chen, Chien-Ming</au><au>Zhao, Dongning</au><au>Ip, Wai Hung</au><au>Yung, Kai Leung</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A dynamic trust model in internet of things</atitle><jtitle>Soft computing (Berlin, Germany)</jtitle><stitle>Soft Comput</stitle><date>2020-04-01</date><risdate>2020</risdate><volume>24</volume><issue>8</issue><spage>5773</spage><epage>5782</epage><pages>5773-5782</pages><issn>1432-7643</issn><eissn>1433-7479</eissn><abstract>Indicating trust or distrust of a node is a key issue in the trust management of IoT. However, there are some challenges for the management with anonymous nodes, inaccurate communication, etc. Due to huge number of nodes in IoT, one of the possible solutions is predicting trust and distrust values. In this paper, we propose a dynamic trust model based on direct and indirect trust computation, and the most important part of a model, trust prediction. The prediction method mainly depends on the combination of exponential smoothing and a Markov chain. We employ exponential smoothing to predict trustiness and a Markov chain to fix the deviation of the prediction. To test our scheme, we create a simulation to evaluate its performance and effectiveness. The simulation results are encouraging.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00500-019-04319-2</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1432-7643
ispartof Soft computing (Berlin, Germany), 2020-04, Vol.24 (8), p.5773-5782
issn 1432-7643
1433-7479
language eng
recordid cdi_proquest_journals_2917976735
source Springer Nature
subjects Access control
Algorithms
Artificial Intelligence
Computational Intelligence
Computer networks
Conspiracy
Control
Engineering
Feedback
Focus
Internet of Things
Markov chains
Mathematical Logic and Foundations
Mechatronics
Nodes
Reputations
Robotics
Smoothing
Social networks
Trustworthiness
title A dynamic trust model in internet of things
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T15%3A52%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20dynamic%20trust%20model%20in%20internet%20of%20things&rft.jtitle=Soft%20computing%20(Berlin,%20Germany)&rft.au=Wang,%20Eric%20Ke&rft.date=2020-04-01&rft.volume=24&rft.issue=8&rft.spage=5773&rft.epage=5782&rft.pages=5773-5782&rft.issn=1432-7643&rft.eissn=1433-7479&rft_id=info:doi/10.1007/s00500-019-04319-2&rft_dat=%3Cproquest_cross%3E2917976735%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c385t-89dcfa81c5899f1c442d7f813c0c4c064e09517ef9ddb40dfc16842941166d503%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2917976735&rft_id=info:pmid/&rfr_iscdi=true