{"title":"空间-地面综合网络协同频谱监测的相似数据检测","authors":"Zhijuan Hu, Danyang Wang, Qifan Fu, Zan Li","doi":"10.1109/GCWkshps45667.2019.9024486","DOIUrl":null,"url":null,"abstract":"Space-ground aided cooperative spectrum monitoring, which combines the benefits of satellite components and terrestrial components for improving monitoring accuracy and enlarging monitoring area, has been becoming an emerging application of the space-ground integrated networks (SGIN). However, a short transmission window is usually provided for satellite components to connect with ground gateway, which means only a limited transmission time is allowed for the satellite component to upload the collected spectrum data. On the other hand, lots of redundancy may exist among the spectrum data collected by a single sensor during one collection period, which may further reduce the data uploading efficiency. In this paper, we investigate the similar data detection which is a matching problem for comparing two data, and it is important to the following data compression for improving data uploading efficiency. Firstly, the definition of the sharing fragment set is given. Then a metric method is presented to measure the redundancy of one data with respect to another data. We propose a Sharing Fragment Set (SFS) algorithm that can select a good sharing fragment set. Theoretical analysis proves that the proposed SFS algorithm is well suited to determine the redundancy between datas. In addition, we conduct an experiment based on the randomly produced synthetic dataset. Numerical results shows that the SFS algorithm performs better in selecting sharing fragment set compared with the Greedy-String-Tiling (GST) and simple greedy algorithm.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Similar Data Detection for Cooperative Spectrum Monitoring in Space-Ground Integrated Networks\",\"authors\":\"Zhijuan Hu, Danyang Wang, Qifan Fu, Zan Li\",\"doi\":\"10.1109/GCWkshps45667.2019.9024486\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Space-ground aided cooperative spectrum monitoring, which combines the benefits of satellite components and terrestrial components for improving monitoring accuracy and enlarging monitoring area, has been becoming an emerging application of the space-ground integrated networks (SGIN). However, a short transmission window is usually provided for satellite components to connect with ground gateway, which means only a limited transmission time is allowed for the satellite component to upload the collected spectrum data. On the other hand, lots of redundancy may exist among the spectrum data collected by a single sensor during one collection period, which may further reduce the data uploading efficiency. In this paper, we investigate the similar data detection which is a matching problem for comparing two data, and it is important to the following data compression for improving data uploading efficiency. Firstly, the definition of the sharing fragment set is given. Then a metric method is presented to measure the redundancy of one data with respect to another data. We propose a Sharing Fragment Set (SFS) algorithm that can select a good sharing fragment set. Theoretical analysis proves that the proposed SFS algorithm is well suited to determine the redundancy between datas. In addition, we conduct an experiment based on the randomly produced synthetic dataset. Numerical results shows that the SFS algorithm performs better in selecting sharing fragment set compared with the Greedy-String-Tiling (GST) and simple greedy algorithm.\",\"PeriodicalId\":210825,\"journal\":{\"name\":\"2019 IEEE Globecom Workshops (GC Wkshps)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Globecom Workshops (GC Wkshps)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCWkshps45667.2019.9024486\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCWkshps45667.2019.9024486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Similar Data Detection for Cooperative Spectrum Monitoring in Space-Ground Integrated Networks
Space-ground aided cooperative spectrum monitoring, which combines the benefits of satellite components and terrestrial components for improving monitoring accuracy and enlarging monitoring area, has been becoming an emerging application of the space-ground integrated networks (SGIN). However, a short transmission window is usually provided for satellite components to connect with ground gateway, which means only a limited transmission time is allowed for the satellite component to upload the collected spectrum data. On the other hand, lots of redundancy may exist among the spectrum data collected by a single sensor during one collection period, which may further reduce the data uploading efficiency. In this paper, we investigate the similar data detection which is a matching problem for comparing two data, and it is important to the following data compression for improving data uploading efficiency. Firstly, the definition of the sharing fragment set is given. Then a metric method is presented to measure the redundancy of one data with respect to another data. We propose a Sharing Fragment Set (SFS) algorithm that can select a good sharing fragment set. Theoretical analysis proves that the proposed SFS algorithm is well suited to determine the redundancy between datas. In addition, we conduct an experiment based on the randomly produced synthetic dataset. Numerical results shows that the SFS algorithm performs better in selecting sharing fragment set compared with the Greedy-String-Tiling (GST) and simple greedy algorithm.