{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:25:01Z","timestamp":1766067901086,"version":"build-2065373602"},"reference-count":47,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T00:00:00Z","timestamp":1704412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Polish Ministry of Education and Science"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Machine learning-based classification algorithms allow communication and computing (2C) task offloading from the end devices to the edge computing network servers. In this paper, we consider task classification based on the hybrid k-means and k\u2032-nearest neighbors algorithms. Moreover, we examine the poisoning attacks on such ML algorithms, namely noise-like jamming and targeted data feature falsification, and their impact on the effectiveness of 2C task allocation. Then, we also present two anomaly detection methods using noise training and the silhouette score test to detect the poisoned samples and mitigate their impact. Our simulation results show that these attacks have a fatal effect on classification in feature areas where the decision boundary is unclear. They also demonstrate the effectiveness of our countermeasures against the considered attacks.<\/jats:p>","DOI":"10.3390\/s24020338","type":"journal-article","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T05:21:38Z","timestamp":1704691298000},"page":"338","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Poisoning Attacks against Communication and Computing Task Classification and Detection Techniques"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9181-7475","authenticated-orcid":false,"given":"Younes","family":"Salmi","sequence":"first","affiliation":[{"name":"Institute of Radiocommunications, Poznan University of Technology, 61-131 Poznan, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1709-4862","authenticated-orcid":false,"given":"Hanna","family":"Bogucka","sequence":"additional","affiliation":[{"name":"Institute of Radiocommunications, Poznan University of Technology, 61-131 Poznan, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"key":"ref_1","unstructured":"(2023, November 07). The Ericsson Mobility Report. Available online: https:\/\/www.ericsson.com\/49dd9d\/assets\/local\/reports-papers\/mobility-report\/documents\/2023\/ericsson-mobility-report-june-2023.pdf."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Huang, L., Joseph, A., Nelson, B., Rubinstein, B., and Tygar, J. (2011, January 21). Adversarial machine learning. Proceedings of the 4th ACM Workshop on Security and Artificial Intelligence, Chicago, IL, USA.","DOI":"10.1145\/2046684.2046692"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1108\/K-10-2019-0666","article-title":"Task scheduling mechanisms in fog computing: Review, trends, and perspectives","volume":"50","author":"Yang","year":"2020","journal-title":"Kybernetes"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TETCI.2020.3007905","article-title":"A review on computational intelligence techniques in cloud and edge computing","volume":"4","author":"Asim","year":"2020","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1109\/COMST.2021.3106401","article-title":"Resource scheduling in edge computing: A survey","volume":"23","author":"Luo","year":"2021","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_6","first-page":"3571","article-title":"Offloading in mobile edge computing: Task allocation and computational frequency scaling","volume":"65","author":"Dinh","year":"2017","journal-title":"IEEE Trans. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"8229","DOI":"10.1109\/TCOMM.2022.3216645","article-title":"Task allocation for energy optimization in fog computing networks with latency constraints","volume":"70","author":"Kopras","year":"2022","journal-title":"IEEE Trans. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Kopras, B., Idzikowski, F., Bossy, B., Kryszkiewicz, P., and Bogucka, H. (2023). Communication and Computing Task Allocation for Energy-Efficient Fog Networks. Sensors, 23.","DOI":"10.3390\/s23020997"},{"key":"ref_9","unstructured":"Greene, D., Cunningham, P., and Mayer, R. (2008). Machine Learning Techniques for Multimedia: Case Studies on Organization and Retrieval, Springer Science & Business Media."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of clustering algorithms","volume":"16","author":"Xu","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Chander, S., and Vijaya, P. (2021). Artificial Intelligence in Data Mining, Academic Press.","DOI":"10.1017\/9781108919234.008"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"5933","DOI":"10.1109\/TIP.2016.2616302","article-title":"Real-time superpixel segmentation by DBSCAN clustering algorithm","volume":"25","author":"Shen","year":"2016","journal-title":"IEEE Trans. Image Process."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Deng, D. (2020, January 25\u201327). DBSCAN clustering algorithm based on density. Proceedings of the 2020 7th International Forum on Electrical Engineering and Automation (IFEEA), Hefei, China.","DOI":"10.1109\/IFEEA51475.2020.00199"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1109\/TIP.2016.2559803","article-title":"DSets-DBSCAN: A parameter-free clustering algorithm","volume":"25","author":"Hou","year":"2016","journal-title":"IEEE Trans. Image Process."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.chemolab.2012.11.006","article-title":"Revised DBSCAN algorithm to cluster data with dense adjacent clusters","volume":"120","author":"Tran","year":"2013","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Ruiz, C., Spiliopoulou, M., and Menasalvas, E. (2007, January 14\u201316). C-dbscan: Density-based clustering with constraints. Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing: 11th International Conference, RSFDGrC 2007, Toronto, ON, Canada. Proceedings 11.","DOI":"10.1007\/978-3-540-72530-5_25"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Nazari, Z., Kang, D., Asharif, M., Sung, Y., and Ogawa, S. (2015, January 28\u201330). A new hierarchical clustering algorithm. Proceedings of the 2015 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS), Okinawa, Japan.","DOI":"10.1109\/ICIIBMS.2015.7439517"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Heller, K., and Ghahramani, Z. (2005, January 7\u201311). Bayesian hierarchical clustering. Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany.","DOI":"10.1145\/1102351.1102389"},{"key":"ref_19","unstructured":"Karypis, G., Han, E., and Kumar, V. (2023, December 13). A Hierarchical Clustering Algorithm Using Dynamic Modeling. Available online: https:\/\/hdl.handle.net\/11299\/215363."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1016\/j.patrec.2008.04.003","article-title":"A hierarchical clustering algorithm based on the Hungarian method","volume":"29","author":"Goldberger","year":"2008","journal-title":"Pattern Recognit. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Schikuta, E. (1996, January 25\u201329). Grid-clustering: An efficient hierarchical clustering method for very large data sets. Proceedings of the 13th International Conference on Pattern Recognition, Vienna, Austria.","DOI":"10.1109\/ICPR.1996.546732"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1007\/s11277-020-07343-w","article-title":"Task classification and scheduling based on K-means clustering for edge computing","volume":"113","author":"Ullah","year":"2020","journal-title":"Wirel. Pers. Commun."},{"key":"ref_24","unstructured":"Sen, P., Hajra, M., and Ghosh, M. (2020). Emerging Technology in Modelling and Graphics: Proceedings of IEM Graph 2018, Springer."},{"key":"ref_25","first-page":"3","article-title":"Supervised machine learning: A review of classification techniques","volume":"160","author":"Kotsiantis","year":"2007","journal-title":"Emerg. Artif. Intell. Appl. Comput. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.4249\/scholarpedia.1883","article-title":"K-nearest neighbor","volume":"4","author":"Peterson","year":"2009","journal-title":"Scholarpedia"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Truong, L., Jones, C., Hutchinson, B., August, A., Praggastis, B., Jasper, R., Nichols, N., and Tuor, A. (2020, January 14\u201319). Systematic evaluation of backdoor data poisoning attacks on image classifiers. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition Workshops, Seattle, WA, USA.","DOI":"10.1109\/CVPRW50498.2020.00402"},{"key":"ref_28","unstructured":"Radiya-Dixit, E., Hong, S., Carlini, N., and Tram\u00e8r, F. (2021). Data poisoning won\u2019t save you from facial recognition. arXiv."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"29457","DOI":"10.1007\/s11042-023-14695-5","article-title":"Poisoning attacks on face authentication systems by using the generative deformation model","volume":"82","author":"Chan","year":"2023","journal-title":"Multimed. Tools Appl."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Wallace, E., Zhao, T., Feng, S., and Singh, S. (2020). Concealed data poisoning attacks on NLP models. arXiv.","DOI":"10.18653\/v1\/2021.naacl-main.13"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"3570","DOI":"10.1016\/j.procs.2021.09.130","article-title":"Exploring data and model poisoning attacks to deep learning-based NLP systems","volume":"192","author":"Marulli","year":"2021","journal-title":"Procedia Comput. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Yang, W., Li, L., Zhang, Z., Ren, X., Sun, X., and He, B. (2021). Be careful about poisoned word embeddings: Exploring the vulnerability of the embedding layers in nlp models. arXiv.","DOI":"10.18653\/v1\/2021.naacl-main.165"},{"key":"ref_33","unstructured":"Gunasekaran, M. (2023, January 13\u201314). Breaking classification Algorithms: A Black-Box Adversarial Attack for Data Poisoning. Proceedings of the 2023 International Conference on Innovations in Engineering and Technology (ICIET), Muvattupuzha, India."},{"key":"ref_34","unstructured":"Xu, H., Liu, X., Wan, Y., and Tang, J. (2022). Towards Fair Classification against Poisoning Attacks. arXiv."},{"key":"ref_35","unstructured":"Salmi, Y., and Bogucka, H. (2023, November 17). Security Threats Against Communication and Computing Task Classification for Edge Computing. International Conference on Military Communication and Information Systems 2023 (ICMIS). Meeting Proceedings RDP 2023. Available online: https:\/\/www.sto.nato.int\/publications\/STO%20Meeting%20Proceedings\/STO-MP-IST-200\/MP-IST-200-05.pdf."},{"key":"ref_36","unstructured":"Wang, L., Xu, S., Wang, X., and Zhu, Q. (2019). Eavesdrop the composition proportion of training labels in federated learning. arXiv."},{"key":"ref_37","unstructured":"Sagduyu, Y., Erpek, T., and Shi, Y. (2021). Game Theory and Machine Learning for Cyber Security, John Wiley & Sons, Inc."},{"key":"ref_38","unstructured":"Adesina, D., Hsieh, C., Sagduyu, Y., and Qian, L. (2020). Adversarial machine learning in wireless communications using RF data: A review. arXiv."},{"key":"ref_39","unstructured":"Paudice, A., Mu\u00f1oz-Gonz\u00e1lez, L., Gyorgy, A., and Lupu, E. (2018). Detection of adversarial training examples in poisoning attacks through anomaly detection. arXiv."},{"key":"ref_40","unstructured":"Geiping, J., Fowl, L., Somepalli, G., Goldblum, M., Moeller, M., and Goldstein, T. (2021). What Doesn\u2019t Kill You Makes You Robust (er): How to Adversarially Train against Data Poisoning. arXiv."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1177\/19467567221101637","article-title":"Scenarios from artificial narrow intelligence to artificial general intelligence\u2014Reviewing the results of the international work\/technology 2050 study","volume":"14","author":"Kuusi","year":"2022","journal-title":"World Futures Rev."},{"key":"ref_42","unstructured":"(2023, November 07). Mitre Atlas. Available online: https:\/\/atlas.mitre.org."},{"key":"ref_43","first-page":"827","article-title":"Gaussian mixture models","volume":"741","author":"Reynolds","year":"2009","journal-title":"Encycl. Biom."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Kramer, O., and Kramer, O. (2016). Machine Learning for Evolution Strategies, Springer.","DOI":"10.1007\/978-3-319-33383-0"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Shahapure, K., and Nicholas, C. (2020, January 6\u20139). Cluster quality analysis using silhouette score. Proceedings of the 2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA), Sydney, Australia.","DOI":"10.1109\/DSAA49011.2020.00096"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"2404","DOI":"10.1016\/j.csda.2012.01.026","article-title":"On quantile quantile plots for generalized linear models","volume":"56","author":"Augustin","year":"2012","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/49.103550","article-title":"Round-robin scheduling for max-min fairness in data networks","volume":"9","author":"Hahne","year":"1991","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/24\/2\/338\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:41:06Z","timestamp":1760103666000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/24\/2\/338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,5]]},"references-count":47,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["s24020338"],"URL":"https:\/\/doi.org\/10.3390\/s24020338","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2024,1,5]]}}}