• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Li Zhetao, Zang Lang, Tian Shujuan, Li Renfa. Data Collection Method in Clustering Network Based on Hybrid Compressive Sensing[J]. Journal of Computer Research and Development, 2017, 54(3): 493-501. DOI: 10.7544/issn1000-1239.2017.20150885
Citation: Li Zhetao, Zang Lang, Tian Shujuan, Li Renfa. Data Collection Method in Clustering Network Based on Hybrid Compressive Sensing[J]. Journal of Computer Research and Development, 2017, 54(3): 493-501. DOI: 10.7544/issn1000-1239.2017.20150885

Data Collection Method in Clustering Network Based on Hybrid Compressive Sensing

More Information
  • Published Date: February 28, 2017
  • In order to reduce the number of transmissions and balance the network load in wireless sensor network, this paper presents a data collection method by using hybrid compressive sensing (cs) in clustering network. Firstly we choose some nodes that are close to the temporary cluster-centroid as the candidate cluster head(CH), secondly determine the CH nodes on the basis of the distance of the candidate nodes to determined CH orderly. Then the common sensor nodes join their nearest cluster. Lastly we build a data transmission tree root of sink node that connects to all CHs greedy. When the number of data transmissions is higher than the threshold, nodes transmit data by using CS. On scenarios of compressive ratio equals 10,the simulation results demonstrate that the number of transmissions for the proposed method is 75% and 65% less than that of Clustering without CS and SPT without CS, 35% and 20% less than that of SPT with Hybrid CS and Clustering with Hybrid CS; The standard deviation of nodes transmissions for the proposed method is 62% and 81% less than that of Clustering without CS and SPT without CS, 41% and 19% less than that of SPT with Hybrid CS and Clustering with Hybrid CS.
  • Related Articles

    [1]Feng Yuhong, Wu Kunhan, Huang Zhihong, Feng Yangzhou, Chen Huanhuan, Bai Jiancong, Ming Zhong. A Set Similarity Self-Join Algorithm with FP-tree and MapReduce[J]. Journal of Computer Research and Development, 2023, 60(12): 2890-2906. DOI: 10.7544/issn1000-1239.202111239
    [2]Xu Yini, Ouyang Dantong, Liu Meng, Zhang Liming, Zhang Yonggang. Algorithm of Computing Minimal Conflict Sets Based on the Structural Feature of Fault Output[J]. Journal of Computer Research and Development, 2018, 55(11): 2386-2394. DOI: 10.7544/issn1000-1239.2018.20170381
    [3]Wang Rongquan, Ouyang Dantong, Wang Yiyuan, Liu Siguang, Zhang Liming. Solving Minimal Hitting Sets Method with SAT Based on DOEC Minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273-1281. DOI: 10.7544/issn1000-1239.2018.20160809
    [4]Ouyang Dantong, Zhi Huayun, Liu Bowen, Zhang Liming, Zhang Yonggang. A Method of Computing Minimal Diagnoses Based on Pseudo-Failure-Degree to Create New Enumeration Tree[J]. Journal of Computer Research and Development, 2018, 55(4): 782-790. DOI: 10.7544/issn1000-1239.2018.20170016
    [5]Liu Siguang, Ouyang Dantong, Wang Yiyuan, Jia Fengyu, Zhang Liming. Algorithm of Computing Minimal Hitting Set Based on the Structural Feature of SE-Tree[J]. Journal of Computer Research and Development, 2016, 53(11): 2556-2566. DOI: 10.7544/issn1000-1239.2016.20150396
    [6]Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
    [7]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [8]Hong Yi, Wang Zhaoqi, Zhu Dengming, Qiu Xianjie. Generation of Fire Animation Based on Level-Set[J]. Journal of Computer Research and Development, 2010, 47(11): 1849-1856.
    [9]Ren Jinping and Lü Shuwang. Enumerations and Counting of Orthomorphic Permutations[J]. Journal of Computer Research and Development, 2006, 43(6): 1071-1075.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.

Catalog

    Article views (1379) PDF downloads (569) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return