{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:52:51Z","timestamp":1756993971938,"version":"3.40.5"},"reference-count":36,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,7,3]]},"abstract":"<jats:p>Based on the traditional propagation model, this paper innovatively divides nodes into high- and low-energy states through introducing Low-energy (<jats:italic>L<\/jats:italic>) state and presents a whole new propagation model which is more suitable for WSNs (wireless sensor networks) against malicious programs, namely, SILRD (Susceptible, Infected, Low-energy, Recovered, Dead) model. In this paper, nodes are divided into five states according to the residual energy and infection level, and the differential equations are constructed to describe the evolution of nodes. At the same time, aiming at the exhaustion of WSNs\u2019 energy, this paper introduces charging as a method to supplement the energy. Furthermore, we regard the confrontation between WSNs and malicious programs as a kind of game and find the optimal strategies by using the Pontryagin Maximum Principle. It is found that charging as a defense mechanism can inhibit the spread of malicious programs and reduce overall costs. Meanwhile, the superiority of bang-bang control on the SILRD model is highlighted by comparing with square control.<\/jats:p>","DOI":"10.1155\/2020\/5686413","type":"journal-article","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:38:59Z","timestamp":1593819539000},"page":"1-13","source":"Crossref","is-referenced-by-count":7,"title":["Differential Games of Rechargeable Wireless Sensor Networks against Malicious Programs Based on SILRD Propagation Model"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4830-8878","authenticated-orcid":true,"given":"Guiyun","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1280-1951","authenticated-orcid":true,"given":"Baihao","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7467-031X","authenticated-orcid":true,"given":"Xiaojing","family":"Zhong","sequence":"additional","affiliation":[{"name":"School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0938-9879","authenticated-orcid":true,"given":"Xuejing","family":"Lan","sequence":"additional","affiliation":[{"name":"School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.04.002"},{"issue":"772","key":"2","first-page":"700","volume":"115","year":"1927","journal-title":"Proceedings of the Royal Society"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/129598"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1080\/00207217.2019.1570563"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2011.09.058"},{"issue":"6","key":"6","doi-asserted-by":"crossref","first-page":"4103","DOI":"10.1016\/j.apm.2012.09.025","volume":"37","year":"2013","journal-title":"Applied Mathematical Modelling"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/923692"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4988-3"},{"issue":"12","key":"9","doi-asserted-by":"crossref","first-page":"2854","DOI":"10.1109\/TIFS.2016.2594130","volume":"11","year":"2016","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2014.09.011"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.12.077"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9190-9"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s10776-011-0147-z"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2927220"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.3390\/s17010139"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2016.06.008"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2014.08.006"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2011.2150350"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2012.2183642"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.12.084"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.04.027"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2019.06.044"},{"volume":"365","journal-title":"Applied Mathematics and Computation","year":"2020","key":"26"},{"issue":"3","key":"27","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1007\/s11277-018-5892-1","volume":"103","year":"2018","journal-title":"Wireless Personal Communications"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-010-0251-5"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-013-1018-y"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04180-2"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2019.2905715"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2017.2680602"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-014-2065-8"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/s40565-017-0364-2"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-016-3316-7"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2019.2918837"},{"year":"1965","key":"38"},{"year":"1994","key":"39"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/s00032-011-0163-6"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/5686413.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/5686413.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/5686413.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:39:06Z","timestamp":1593819546000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/5686413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,3]]},"references-count":36,"alternative-id":["5686413","5686413"],"URL":"https:\/\/doi.org\/10.1155\/2020\/5686413","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,7,3]]}}}