{'fraction_non_alphanumeric': 0.013118062563067608, 'fraction_numerical': 0.004036326942482341, 'mean_word_length': 5.1234567901234565, '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}}
Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks

Network coding promises to bring significant performance improvements to sensor network protocols but algorithms need to be designed to cope with the often very constrained resources of sensor nodes. Growth codes proposed by Kamra et al. (Kamra, 2006) are one such example aimed at improving sensor network data persistence. The codes use simple coding operations and require comparatively little memory. However, growth codes are based on the assumption of an extremely dynamic network topology and do not perform well in more stable settings. In this paper we propose modifications to growth codes that are able to achieve good performance over a wider range of static and dynamic scenarios. In particular, we investigate changes of how many and which symbols the transmitted information is coded over and how the decoding is performed. These modifications are analyzed in detail by means of simulations.