Cooperative spectrum monitoring with multiple sensors has been deemed as an efficient mechanism for improving the monitoring accuracy and enlarging the monitoring area in wireless sensor networks.However,there exists ...Cooperative spectrum monitoring with multiple sensors has been deemed as an efficient mechanism for improving the monitoring accuracy and enlarging the monitoring area in wireless sensor networks.However,there exists redundancy among the spectrum data collected by a sensor node within a data collection period,which may reduce the data uploading efficiency.In this paper,we investigate the inter-data commonality detection which describes how much two data have in common.We define common segment set and divide it into six categories firstly,then a method to measure a common segment set is conducted by extracting commonality between two files.Moreover,the existing algorithms fail in finding a good common segment set,so Common Data Measurement(CDM)algorithm that can identify a good common segment set based on inter-data commonality detection is proposed.Theoretical analysis proves that CDM algorithm achieves a good measurement for the commonality between two strings.In addition,we conduct an synthetic dataset which are produced randomly.Numerical results shows that CDM algorithm can get better performance in measuring commonality between two binary files compared with Greedy-String-Tiling(GST)algorithm and simple greedy algorithm.展开更多
基金supported in part by the National Natural Science Foundation of China(No.61901328)the China Postdoctoral Science Foundation (No. 2019M653558)+1 种基金the Fundamental Research Funds for the Central Universities (No. CJT150101)the Key project of National Natural Science Foundation of China (No. 61631015)
文摘Cooperative spectrum monitoring with multiple sensors has been deemed as an efficient mechanism for improving the monitoring accuracy and enlarging the monitoring area in wireless sensor networks.However,there exists redundancy among the spectrum data collected by a sensor node within a data collection period,which may reduce the data uploading efficiency.In this paper,we investigate the inter-data commonality detection which describes how much two data have in common.We define common segment set and divide it into six categories firstly,then a method to measure a common segment set is conducted by extracting commonality between two files.Moreover,the existing algorithms fail in finding a good common segment set,so Common Data Measurement(CDM)algorithm that can identify a good common segment set based on inter-data commonality detection is proposed.Theoretical analysis proves that CDM algorithm achieves a good measurement for the commonality between two strings.In addition,we conduct an synthetic dataset which are produced randomly.Numerical results shows that CDM algorithm can get better performance in measuring commonality between two binary files compared with Greedy-String-Tiling(GST)algorithm and simple greedy algorithm.