{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:14:15Z","timestamp":1766733255073,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61731006","61971310"],"award-info":[{"award-number":["61731006","61971310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is undeniable that there are a large number of redundant nodes in a wireless sensor network. These redundant nodes cause a colossal waste of resources and seriously threaten the life of the sensor network. In this paper, we provide a sensor nodes optimization selection algorithm based on a graph for a large-scale wireless sensor network. Firstly, we propose a representation-clustering joint algorithm based on Graph Neural Network to partition the large-scale graph into several subgraphs. Then, we use Singular-Value-QR Decomposition for the node selection of each subgraph and achieve the optimal deployment for a large-scale wireless sensor network. We conduct the experiments on the CIMIS dataset. The results show that the mean square error between the reconstructed network and the original network is as low as 0.02433. Meanwhile, we also compare our algorithm with the classical optimization algorithm. The results imply that the mean square error of the proposed algorithm is lower and the distribution is more uniform. Further, we verify the scalability of the algorithm for the optimal deployment of the large-scale wireless sensor network.<\/jats:p>","DOI":"10.1186\/s13634-023-00995-3","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T20:11:04Z","timestamp":1679861464000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal deployment of large-scale wireless sensor networks based on graph clustering and matrix factorization"],"prefix":"10.1186","volume":"2023","author":[{"given":"Hefei","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianwen","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9032-4401","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"issue":"1","key":"995_CR1","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11277-021-08925-y","volume":"122","author":"V Patil","year":"2022","unstructured":"V. Patil, S. Deshpande, Design of fpga soft core based wsn node using customization paradigm. Wireless Pers. Commun. 122(1), 783\u2013805 (2022). https:\/\/doi.org\/10.1007\/s11277-021-08925-y","journal-title":"Wireless Pers. Commun."},{"issue":"11453372224","key":"995_CR2","first-page":"3380898","volume":"10","author":"Y Sangar","year":"2020","unstructured":"Y. Sangar, B. Krishnaswamy, WiChronos: energy-efficient modulation for long-range, large-scale wireless networks. Assoc. Comput. Machinery 10(11453372224), 3380898 (2020)","journal-title":"Assoc. Comput. Machinery"},{"key":"995_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2021.102448","volume":"115","author":"OA Khashan","year":"2021","unstructured":"O.A. Khashan, R. Ahmad, N.M. Khafajah, An automated lightweight encryption scheme for secure and energy-efficient communication in wireless sensor networks. Ad Hoc. Netw. 115, 102448 (2021). https:\/\/doi.org\/10.1016\/j.adhoc.2021.102448","journal-title":"Ad Hoc. Netw."},{"key":"995_CR4","doi-asserted-by":"publisher","first-page":"157859","DOI":"10.1109\/ACCESS.2021.3128353","volume":"9","author":"G Sahar","year":"2021","unstructured":"G. Sahar, K.B.A. Bakar, F.T. Zuhra, S. Rahim, T. Bibi, S.H.H. Madni, Data redundancy reduction for energy-efficiency in wireless sensor networks: a comprehensive review. IEEE Access 9, 157859\u2013157888 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3128353","journal-title":"IEEE Access"},{"issue":"4","key":"995_CR5","doi-asserted-by":"publisher","first-page":"2835","DOI":"10.1007\/s11277-020-07823-z","volume":"116","author":"SS Mohar","year":"2021","unstructured":"S.S. Mohar, S. Goyal, R. Kaur, Optimized sensor nodes deployment in wireless sensor network using bat algorithm. Wireless Pers. Commun. 116(4), 2835\u20132853 (2021). https:\/\/doi.org\/10.1007\/s11277-020-07823-z","journal-title":"Wireless Pers. Commun."},{"issue":"3","key":"995_CR6","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2298\/CSIS180103023W","volume":"79","author":"M Toloueiashtian","year":"2022","unstructured":"M. Toloueiashtian, M. Golsorkhtabaramiri, S.Y.B. Rad, An improved whale optimization algorithm solving the point coverage problem in wireless sensor networks. Telecommun. Syst. 79(3), 417\u2013436 (2022). https:\/\/doi.org\/10.2298\/CSIS180103023W","journal-title":"Telecommun. Syst."},{"issue":"8","key":"995_CR7","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.3390\/s19081817","volume":"19","author":"X Deng","year":"2019","unstructured":"X. Deng, Z. Yu, R. Tang, X. Qian, K. Yuan, S. Liu, An optimized node deployment solution based on a virtual spring force algorithm for wireless sensor network applications. Sensors 19(8), 1817 (2019). https:\/\/doi.org\/10.3390\/s19081817","journal-title":"Sensors"},{"key":"995_CR8","doi-asserted-by":"publisher","DOI":"10.30919\/es8d717","author":"K Hegde","year":"2022","unstructured":"K. Hegde, R. Dilli, Wireless sensor networks: network life time enhancement using an improved grey wolf optimization algorithm. Eng. Sci. (2022). https:\/\/doi.org\/10.30919\/es8d717","journal-title":"Eng. Sci."},{"issue":"2","key":"995_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.12133\/j.smartag.2019.1.2.201812-SA024","volume":"1","author":"Z Xiaohan","year":"2019","unstructured":"Z. Xiaohan, Y. Changchuan, W. Huarui, Energy optimization strategy for wireless sensor networks in large-scale farmland habitat monitoring. Smart Agricul. 1(2), 55 (2019). https:\/\/doi.org\/10.12133\/j.smartag.2019.1.2.201812-SA024","journal-title":"Smart Agricul."},{"issue":"2","key":"995_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.15961\/j.jsuese.201601189","volume":"49","author":"P Jiang","year":"2017","unstructured":"P. Jiang, Y. Li, F. Wu, S. Yu, H. Xu, Research on energy consumption and eliminate of large data redundancy method for large scale wireless sensor networks based on mean filter. Adv. Eng. Sci. 49(2), 145\u2013151 (2017). https:\/\/doi.org\/10.15961\/j.jsuese.201601189","journal-title":"Adv. Eng. Sci."},{"issue":"4","key":"995_CR11","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TNSE.2020.3008381","volume":"7","author":"B Cao","year":"2020","unstructured":"B. Cao, Q. Wei, Z. Lv, J. Zhao, A.K. Singh, Many-objective deployment optimization of edge devices for 5G networks. IEEE Trans. Net. Sci. Eng. 7(4), 2117\u20132125 (2020). https:\/\/doi.org\/10.1109\/TNSE.2020.3008381","journal-title":"IEEE Trans. Net. Sci. Eng."},{"issue":"10","key":"995_CR12","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1109\/TSP.2019.2908129","volume":"67","author":"A Sakiyama","year":"2019","unstructured":"A. Sakiyama, Y. Tanaka, T. Tanaka, A. Ortega, Eigendecomposition-free sampling set selection for graph signals. IEEE Trans. Signal Process. 67(10), 2679\u20132692 (2019). https:\/\/doi.org\/10.1109\/TSP.2019.2908129","journal-title":"IEEE Trans. Signal Process."},{"key":"995_CR13","doi-asserted-by":"publisher","unstructured":"H. Xu, G. Li, G. Zhang (2019) Energy-aware sampling set selection for signal reconstruction in internet of things. In: 2019 IEEE 5th international conference on computer and communications (ICCC), pp. 2146\u20132151. https:\/\/doi.org\/10.1109\/ICCC47050.2019.9064079. IEEE","DOI":"10.1109\/ICCC47050.2019.9064079"},{"issue":"13","key":"995_CR14","doi-asserted-by":"publisher","first-page":"3584","DOI":"10.1109\/TSP.2018.2835384","volume":"66","author":"P Di Lorenzo","year":"2018","unstructured":"P. Di Lorenzo, P. Banelli, E. Isufi, S. Barbarossa, G. Leus, Adaptive graph signal processing: Algorithms and optimal sampling strategies. IEEE Trans. Signal Process. 66(13), 3584\u20133598 (2018). https:\/\/doi.org\/10.1109\/TSP.2018.2835384","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"995_CR15","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TSIPN.2018.2869354","volume":"5","author":"D Valsesia","year":"2018","unstructured":"D. Valsesia, G. Fracastoro, E. Magli, Sampling of graph signals via randomized local aggregations. IEEE Trans. Signal Inform. Proc. Over Net. 5(2), 348\u2013359 (2018). https:\/\/doi.org\/10.1109\/TSIPN.2018.2869354","journal-title":"IEEE Trans. Signal Inform. Proc. Over Net."},{"key":"995_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","volume":"414","author":"G Zhao","year":"2020","unstructured":"G. Zhao, P. Jia, A. Zhou, B. Zhang, Infgcn: identifying influential nodes in complex networks with graph convolutional networks. Neurocomputing 414, 18\u201326 (2020). https:\/\/doi.org\/10.1016\/j.neucom.2020.07.028","journal-title":"Neurocomputing"},{"key":"995_CR17","doi-asserted-by":"publisher","unstructured":"M. Ma, X. Wang, Y. Li, Q. Zhang, C. Wang. Critical node identification based on attention flow networks. in: 2021 International conference on machine learning and intelligent systems engineering (MLISE), pp. 96\u2013102 (2021). https:\/\/doi.org\/10.1109\/MLISE54096.2021.00025. IEEE","DOI":"10.1109\/MLISE54096.2021.00025"},{"issue":"1","key":"995_CR18","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/TKDE.2021.3090866","volume":"35","author":"X Liu","year":"2021","unstructured":"X. Liu, F. Zhang, Z. Hou, L. Mian, Z. Wang, J. Zhang, J. Tang, Self-supervised learning: generative or contrastive. IEEE Trans. Knowl. Data Eng. 35(1), 857\u2013876 (2021). https:\/\/doi.org\/10.1109\/TKDE.2021.3090866","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"995_CR19","doi-asserted-by":"publisher","unstructured":"S. Shekkizhar, A. Ortega. Graph construction from data by non-negative kernel regression. In: ICASSP 2020-2020 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp. 3892\u20133896 (2020). https:\/\/doi.org\/10.1109\/ICASSP40776.2020.9054425. IEEE","DOI":"10.1109\/ICASSP40776.2020.9054425"},{"key":"995_CR20","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.neucom.2018.05.084","volume":"312","author":"L Qiao","year":"2018","unstructured":"L. Qiao, L. Zhang, S. Chen, D. Shen, Data-driven graph construction and graph learning: a review. Neurocomputing 312, 336\u2013351 (2018). https:\/\/doi.org\/10.1016\/j.neucom.2018.05.084","journal-title":"Neurocomputing"},{"key":"995_CR21","unstructured":"J. Xie, R. Girshick, A. Farhadi. Unsupervised deep embedding for clustering analysis. In: international conference on machine learning, pp. 478\u2013487 (2016). PMLR"},{"issue":"18","key":"995_CR22","doi-asserted-by":"publisher","first-page":"4845","DOI":"10.1109\/TSP.2016.2573748","volume":"64","author":"M Tsitsvero","year":"2016","unstructured":"M. Tsitsvero, S. Barbarossa, P. Di Lorenzo, Signals on graphs: uncertainty principle and sampling. IEEE Trans. Signal Process. 64(18), 4845\u20134860 (2016). https:\/\/doi.org\/10.1109\/TSP.2016.2573748","journal-title":"IEEE Trans. Signal Process."},{"issue":"24","key":"995_CR23","doi-asserted-by":"publisher","first-page":"6510","DOI":"10.1109\/TSP.2015.2469645","volume":"63","author":"S Chen","year":"2015","unstructured":"S. Chen, R. Varma, A. Sandryhaila, J. Kova\u010devi\u0107, Discrete signal processing on graphs: sampling theory. IEEE Trans. Signal Process. 63(24), 6510\u20136523 (2015). https:\/\/doi.org\/10.1109\/TSP.2015.2469645","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"995_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/02664768700000020","volume":"14","author":"MC Shewry","year":"1987","unstructured":"M.C. Shewry, H.P. Wynn, Maximum entropy sampling. J. Appl. Stat. 14(2), 165\u2013170 (1987). https:\/\/doi.org\/10.1080\/02664768700000020","journal-title":"J. Appl. Stat."},{"key":"995_CR25","doi-asserted-by":"publisher","unstructured":"A. Krause, A. Singh, C. Guestrin. Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. J. Machine Learn. Res. 9(2) (2008). https:\/\/doi.org\/10.1145\/1390681.1390689","DOI":"10.1145\/1390681.1390689"}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-023-00995-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-023-00995-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-023-00995-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T20:15:42Z","timestamp":1679861742000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-023-00995-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["995"],"URL":"https:\/\/doi.org\/10.1186\/s13634-023-00995-3","relation":{},"ISSN":["1687-6180"],"issn-type":[{"type":"electronic","value":"1687-6180"}],"subject":[],"published":{"date-parts":[[2023,3,8]]},"assertion":[{"value":"2 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal ethics"}},{"value":"There is the consent of all authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no confict of interest.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conmpeting\u00a0 interests"}}],"article-number":"33"}}