{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:05:41Z","timestamp":1758845141057,"version":"3.40.5"},"reference-count":16,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Key Research and Development Program","award":["2018YFC0808301"],"award-info":[{"award-number":["2018YFC0808301"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,9,9]]},"abstract":"<jats:p>Mobile and pervasive computing is one of the recent paradigms available in the area of information technology. The role of pervasive computing is foremost in the field where it provides the ability to distribute computational services to the surroundings where people work and leads to issues such as trust, privacy, and identity. To provide an optimal solution to these generic problems, the proposed research work aims to implement a deep learning-based pervasive computing architecture to address these problems. Long short-term memory architecture is used during the development of the proposed trusted model. The applicability of the proposed model is validated by comparing its performance with the generic back-propagation neural network. This model results with an accuracy rate of 93.87% for the LSTM-based model much better than 85.88% for the back-propagation-based deep model. The obtained results reflect the usefulness and applicability of such an approach and the competitiveness against other existing ones.<\/jats:p>","DOI":"10.1155\/2020\/4579495","type":"journal-article","created":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T23:31:08Z","timestamp":1599694268000},"page":"1-6","source":"Crossref","is-referenced-by-count":11,"title":["Developing an Efficient Deep Learning-Based Trusted Model for Pervasive Computing Using an LSTM-Based Classification Model"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1747-1795","authenticated-orcid":true,"given":"Yang","family":"He","sequence":"first","affiliation":[{"name":"School of Emergency Management and Safety Engineering, China University of Mining &Technology (Beijing), Beijing 100083, China"},{"name":"State Key Laboratory Coal Resource and Safe Mining, China University of Mining &Technology (Beijing), Beijing 100083, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0126-9944","authenticated-orcid":true,"given":"Shah","family":"Nazir","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Swabi, Ambar, Pakistan"}]},{"given":"Baisheng","family":"Nie","sequence":"additional","affiliation":[{"name":"School of Emergency Management and Safety Engineering, China University of Mining &Technology (Beijing), Beijing 100083, China"},{"name":"State Key Laboratory Coal Resource and Safe Mining, China University of Mining &Technology (Beijing), Beijing 100083, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2562-3477","authenticated-orcid":true,"given":"Sulaiman","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Swabi, Ambar, Pakistan"}]},{"given":"Jianhui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Postal Savings Bank of China, Beijing 100000, China"}]}],"member":"311","reference":[{"key":"1","first-page":"3","volume":"3","year":"1999","journal-title":"Mobile Computing and Communications Review"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2007.10.001"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2010.06.002"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2007.10.002"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.03.020"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2008.05.007"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2012.07.009"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2018.07.009"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.01.023"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/1373087"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/5843932"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/4621196"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/1671340"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/9428612"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1038\/323533a0"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4579495.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4579495.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4579495.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T23:31:11Z","timestamp":1599694271000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/4579495\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,9]]},"references-count":16,"alternative-id":["4579495","4579495"],"URL":"https:\/\/doi.org\/10.1155\/2020\/4579495","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,9,9]]}}}