{"title":"Clustering-Aided Graph Signal Sampling and Reconstruction for Large-Scale Sensor Networks","authors":"Yuan Chen, Guobing Li, Bin He, Guomei Zhang","doi":"10.1109/iccc52777.2021.9580427","DOIUrl":null,"url":null,"abstract":"In this paper we develop a clustering-aided signal sampling and reconstruction method for data acquisition in large-scale sensor networks. Using the localization feature of a large network, we exploit the vertex-domain locality by the localized operator of each vertex on the graph, and develop a clustering method that sequentially selects cluster heads and their corresponding members by the use of the overlap factor of each vertex. On this basis, we apply greedy sampling set selection for each cluster in a distributed manner. By combining all local sampling sets, the global sampling set is selected and signals over the whole graph is then efficiently reconstructed. Simulation results over various large networks show that compared with existing sampling set selection methods, the proposed method can reduce the computational complexity while achieving acceptable reconstruction accuracy.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we develop a clustering-aided signal sampling and reconstruction method for data acquisition in large-scale sensor networks. Using the localization feature of a large network, we exploit the vertex-domain locality by the localized operator of each vertex on the graph, and develop a clustering method that sequentially selects cluster heads and their corresponding members by the use of the overlap factor of each vertex. On this basis, we apply greedy sampling set selection for each cluster in a distributed manner. By combining all local sampling sets, the global sampling set is selected and signals over the whole graph is then efficiently reconstructed. Simulation results over various large networks show that compared with existing sampling set selection methods, the proposed method can reduce the computational complexity while achieving acceptable reconstruction accuracy.