{'fraction_non_alphanumeric': 0.020087336244541485, 'fraction_numerical': 0.0, 'mean_word_length': 4.96875, '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}}
Priority based Distributed Scheduling for Congestion and Collision Avoidance in WSN

In wireless sensor network (WSN), data scheduling, is impeded by congestion and packet collision. In order to overcome these issues, in this paper, a Priority based Distributed Scheduling for Congestion and Collision Avoidance in WSN has been proposed. In this technique, the system in which data packets generated by sensor nodes are categorized into high and low priority based on the importance of the data and time stamp. To prevent collision, a receiver backed or initiated MAC protocol is applied. Further, the congestion status of the network is checked cluster wise and node with the least congestion level is selected as the head of cluster group (CH). If the congestion status is high, then distributed storage maintenance (DSM) mechanism is applied. According to DSM, some gateway nodes which are nearer to the CH are chosen and the high priority packets are sent to those nodes for storing using the packet exchange policy. With the help of simulation it has been proved that this approach minimizes the congestion and the intra cluster collisions.