{'fraction_non_alphanumeric': 0.013563501849568433, 'fraction_numerical': 0.0, 'mean_word_length': 5.393700787401575, '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}}
Reactive ID assignment for sensor networks

Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, locally unique IDs are still necessary for nodes to implement unicast communications to save power consumption. Several solutions have been proposed for locally unique ID assignment in sensor networks. However, they bring much communication overhead, which is not desirable due to the limited power supply in a sensor node. Combined with a directed diffusion communication paradigm, a reactive ID assignment scheme with security mechanisms is proposed in this paper. It defers ID conflict resolution until data communications are initiated and thus saves communication overhead