{'fraction_non_alphanumeric': 0.020134228187919462, 'fraction_numerical': 0.0, 'mean_word_length': 5.327272727272727, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Improved Sparsest Random Scheduling for Compressive Data Gathering under Unreliable Link in Wireless Sensor Networks

Compressive sensing (CS) is a promising data acquisition and compression technology that can be used to reduce and balance the transmission cost in wireless sensor networks (WSNs). However, the transmission links are unreliable frequently and data loss is very common in wireless sensor networks. What's more, the reconstruction accuracy is reduced greatly due to unreliable links and data loss. In order to address this problem, a data gathering and reconstruction algorithm is proposed, which is based on improved sparsest random measurement matrix and collection tree protocol (CTP). It needs less necessary number of measurements than state-of-the-art methods to reach high reconstruction accuracy, and has the ability to resist the negative impact of data loss on the recovery accuracy. The real sensory data from Intel Indoor project are used in simulation and the results show that the proposed algorithm is effective.