Abstract
Background: The World Health Organization (WHO) reported that Air pollution (AP) is prone to the highest environmental risk and has caused numerous deaths. Polluted air has many constituents where Particulate Matter (PM) is majorly reported as a global concern. Currently, the most crucial challenges faced by the globe are the identification and treatment of augmenting AP. The air pollution level was indicated by the Air Quality Index (AQI). It is affected by the concentrations of several pollutants in the air. Many pollutants in the air are harmful to human health. Thus, an efficient prediction system is required. Many security problems and lower classification accuracy are faced by them even though several prediction systems have been formed. A secure air quality prediction system (AQPS) centered upon the energy efficiency of smart sensing is proposed in this paper to overcome these issues. From disparate sensor nodes, the input data is initially amassed in the proposed work. The gathered data is stored in the temporary server. Next, the air-polluted data of the temporary server is offered to the AQPS, wherein preprocessing of the input data along with classification is executed.
Methods: Utilizing the Improved Spotted Hyena Optimization-based Deep Convolution Neural Network (ISHO-DCNN) algorithm, the classification is executed. Utilizing the Repetitive Data Coding Based Huffman Encoding (RDC-HE) method, the polluted data attained from the classified output is compressed and encrypted by employing the American Standard Code for Information Interchange based Elliptical Curve Cryptography (ASCII-ECC) method.
Results: Afterward, the encrypted and compressed data is saved in the Cloud Server (CS). Finally, for notifying about the AP, the decrypted and decompressed data is offered to the Base Stations (BS).
Conclusion: The proposed work is more effective when analogized to the prevailing methods as denoted by the experimental outcomes. Higher accuracy of 97.14% and precision of 91.44% were obtained by the proposed model. Further, lower Encryption Time (ET) and Decryption Time (DT) of 0.565584 sec and 0.005137 sec were obtained by the model.
Graphical Abstract
[http://dx.doi.org/10.1016/j.apr.2020.05.015]
[http://dx.doi.org/10.1016/j.scitotenv.2018.11.086] [PMID: 30841384]
[http://dx.doi.org/10.1016/j.jclepro.2020.121218]
[http://dx.doi.org/10.1007/978-3-030-11890-7_6]
[http://dx.doi.org/10.1007/s10098-019-01709-w] [PMID: 33907544]
[http://dx.doi.org/10.3390/app9091811]
[http://dx.doi.org/10.1109/ICEEST48626.2019.8981707]
[http://dx.doi.org/10.3390/s20040998] [PMID: 32069821]
[http://dx.doi.org/10.3390/s20071956] [PMID: 32244380]
[http://dx.doi.org/10.3390/app122010405]
[http://dx.doi.org/10.1007/s11869-019-00772-y]
[http://dx.doi.org/10.1016/j.micpro.2020.103172]
[http://dx.doi.org/10.3390/ijerph17062124] [PMID: 32210027]
[http://dx.doi.org/10.1007/s13762-022-04241-5] [PMID: 35603096]
[http://dx.doi.org/10.1109/MNET.2019.1800214]
[http://dx.doi.org/10.1007/s00521-019-04492-3]
[http://dx.doi.org/10.1016/j.jece.2019.103208]
[http://dx.doi.org/10.1109/ICCE.2019.8662050]
[http://dx.doi.org/10.1016/j.dcan.2019.03.003]
[http://dx.doi.org/10.1016/j.apr.2020.09.003]
[http://dx.doi.org/10.1016/j.scitotenv.2019.05.288] [PMID: 31154159]
[http://dx.doi.org/10.3390/su12062570]
[http://dx.doi.org/10.1007/978-981-13-1402-5_30]
[http://dx.doi.org/10.1007/s40747-021-00476-w] [PMID: 34777973]
[http://dx.doi.org/10.1109/ACCESS.2019.2908081]
[http://dx.doi.org/10.3390/app9091831]
[http://dx.doi.org/10.1007/s00500-019-04495-1]
[http://dx.doi.org/10.1016/j.jclepro.2019.02.179]
[http://dx.doi.org/10.1016/j.advengsoft.2017.05.014]
[http://dx.doi.org/10.1109/MLDS.2017.5]
[http://dx.doi.org/10.1016/j.future.2019.10.010]
[http://dx.doi.org/10.1109/ICAMMAET.2017.8186639]