{'fraction_non_alphanumeric': 0.017341040462427744, 'fraction_numerical': 0.0, 'mean_word_length': 4.872881355932203, '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}}
A competing algorithm for gradient based routing protocol in wireless sensor networks

The energy consumption is a key design criterion for the routing protocol in wireless sensor networks. Some routing protocols deliver the message by point to point like wire networks, which may not be optimal to maximise the lifetime of the network. In this paper, a competing algorithm for GBR in wireless sensor networks is proposed. This algorithm is referred to as GBR-C. Furthermore auto-adaptable GBR-C routing protocol is proposed. The proposed schemes are compared with the GBR protocol. Simulation results show that the proposed schemes give better results than GBR in terms of energy efficiency.