{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:23:27Z","timestamp":1780410207598,"version":"3.54.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.future.2026.108580","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T06:49:55Z","timestamp":1778309395000},"page":"108580","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["GraphMatch: A graph-based trust-aware framework for secure multi-objective task scheduling in heterogeneous edge computing"],"prefix":"10.1016","volume":"183","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3833-2794","authenticated-orcid":false,"given":"Wenjuan","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qifei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8156-3926","authenticated-orcid":false,"given":"Dingyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengjie","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuiguang","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.future.2026.108580_b1","series-title":"Cisco Annual Internet Report (2018\u20132023) White Paper","author":"Cisco","year":"2020"},{"key":"10.1016\/j.future.2026.108580_b2","series-title":"Worldwide Global DataSphere IoT Device and Data Forecast","first-page":"2019","author":"IDC","year":"2019"},{"key":"10.1016\/j.future.2026.108580_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.cose.2020.101898","article-title":"Towards multiple-mix-attack detection via consensus-based trust management in IoT networks","volume":"96","author":"Ma","year":"2020","journal-title":"Comput. Secur."},{"key":"10.1016\/j.future.2026.108580_b4","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1186\/s13638-019-1524-z","article-title":"Trust evaluation model with entropy-based weight assignment for malicious node\u2019s detection in wireless sensor networks","author":"Yin","year":"2019","journal-title":"EURASIP J. Wirel. Commun. Netw. 2019"},{"key":"10.1016\/j.future.2026.108580_b5","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1109\/JPROC.2019.2918437","article-title":"Edge computing security: State of the art and challenges","volume":"107","author":"Xiao","year":"2019","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.future.2026.108580_b6","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1016\/j.comnet.2012.12.018","article-title":"On the features and challenges of security and privacy in distributed internet of things","volume":"57","author":"Roman","year":"2013","journal-title":"Comput. Netw."},{"key":"10.1016\/j.future.2026.108580_b7","doi-asserted-by":"crossref","first-page":"4004","DOI":"10.1109\/JIOT.2020.3015432","article-title":"A survey on security and privacy issues in edge-computing-assisted internet of things","volume":"8","author":"Alwarafy","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.future.2026.108580_b8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/JIOT.2016.2579198","article-title":"Edge computing: Vision and challenges","volume":"3","author":"Shi","year":"2016","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.future.2026.108580_b9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/71.993206","article-title":"Performance-effective and low-complexity task scheduling for heterogeneous computing","volume":"13","author":"Topcuoglu","year":"2002","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.future.2026.108580_b10","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","article-title":"A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems","volume":"61","author":"Braun","year":"2001","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.future.2026.108580_b11","article-title":"DDTMOA: A deadline-aware double-trust multi-objective optimization algorithm for IoT services in edge computing","volume":"114","author":"Tong","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.future.2026.108580_b12","article-title":"BD-TTS: Blockchain-based dual-trust task scheduling for mobile edge computing","volume":"241","author":"Wang","year":"2024","journal-title":"Comput. Netw."},{"key":"10.1016\/j.future.2026.108580_b13","first-page":"170","article-title":"SecDS: Secure DAG-based scheduling for security-critical tasks in edge computing","volume":"152","author":"Long","year":"2024","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2026.108580_b14","first-page":"129","article-title":"DRL-MEC: Deep reinforcement learning for task offloading in mobile edge computing","volume":"169","author":"Chen","year":"2021","journal-title":"Comput. Commun."},{"key":"10.1016\/j.future.2026.108580_b15","doi-asserted-by":"crossref","unstructured":"H. Mao, M. Schwarzkopf, S. Venkatakrishnan, et al., Learning scheduling algorithms for data processing clusters, in: Proceedings of the ACM Special Interest Group on Data Communication, SIGCOMM, 2019, pp. 270\u2013288.","DOI":"10.1145\/3341302.3342080"},{"key":"10.1016\/j.future.2026.108580_b16","doi-asserted-by":"crossref","first-page":"3521","DOI":"10.1109\/JSAC.2024.3459035","article-title":"Multi-agent cooperation for computing power scheduling in UAVs empowered aerial computing systems","volume":"42","author":"Tao","year":"2024","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.future.2026.108580_b17","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1109\/TGCN.2024.3514578","article-title":"EMDTORA: Energy-aware multi-user dependent task offloading and resource allocation in MEC using graph-enabled DRL","volume":"9","author":"Khan","year":"2025","journal-title":"IEEE Trans. Green Commun. Netw."},{"key":"10.1016\/j.future.2026.108580_b18","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.dss.2005.05.019","article-title":"A survey of trust and reputation systems for online service provision","volume":"43","author":"J\u00f8sang","year":"2007","journal-title":"Decis. Support Syst."},{"key":"10.1016\/j.future.2026.108580_b19","doi-asserted-by":"crossref","unstructured":"S. Kamvar, M. Schlosser, H. Garcia-Molina, The EigenTrust algorithm for reputation management in P2P networks, in: Proceedings of the 12th International Conference on World Wide Web, WWW, 2003, pp. 640\u2013651.","DOI":"10.1145\/775240.775242"},{"key":"10.1016\/j.future.2026.108580_b20","series-title":"Proceedings of the 2012 International Workshop on Self-Aware Internet of Things","first-page":"1","article-title":"Dynamic trust management for internet of things applications","author":"Bao","year":"2012"},{"key":"10.1016\/j.future.2026.108580_b21","unstructured":"T. Kipf, M. Welling, Semi-supervised classification with graph convolutional networks, confbook, in: Proceedings of the 5th International Conference on Learning Representations, ICLR, 2017."},{"key":"10.1016\/j.future.2026.108580_b22","unstructured":"W. Hamilton, Z. Ying, J. Leskovec, Inductive representation learning on large graphs, in: Advances in Neural Information Processing Systems, NeurIPS, 2017, pp. 1024\u20131034."},{"key":"10.1016\/j.future.2026.108580_b23","doi-asserted-by":"crossref","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","article-title":"Learning to schedule job-shop problems: Representation and policy learning using graph neural network and reinforcement learning","volume":"59","author":"Park","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.future.2026.108580_b24","doi-asserted-by":"crossref","first-page":"29176","DOI":"10.1109\/JIOT.2025.3543521","article-title":"Graph-convolutional-network-enabled task offloading for industrial image recognition in digital twin edge networks","volume":"12","author":"Liao","year":"2025","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.future.2026.108580_b25","doi-asserted-by":"crossref","first-page":"37670","DOI":"10.1109\/JIOT.2025.3584653","article-title":"TrustAware-GNN: Graph neural network-based trust management for IoT anomaly detection","volume":"12","author":"Awan","year":"2025","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.future.2026.108580_b26","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.future.2026.108580_b27","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints","volume":"18","author":"Deb","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.future.2026.108580_b28","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.future.2026.108580_b29","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:48:03Z","timestamp":1780408083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X26002141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":29,"alternative-id":["S0167739X26002141"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2026.108580","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GraphMatch: A graph-based trust-aware framework for secure multi-objective task scheduling in heterogeneous edge computing","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2026.108580","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108580"}}