{'fraction_non_alphanumeric': 0.014669926650366748, 'fraction_numerical': 0.0, 'mean_word_length': 5.448818897637795, '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}}
Positive virtual based geographic routing for wireless sensor networks

Communications void in geographical routing protocols effects the performance of these routing protocols. A geographic routing protocol usually uses a greedy forwarding scheme with a recovery policy to solve the void problem. In this paper, we propose a new positive virtual position (PViP) scheme, for solving the local minimum problem. Positive virtual position of nodes are considered when selecting the next optimum neighbor node. Positive virtual position of a node is the average positions of node's itself position and all single-hop neighbor nodes that are closer to the sink than itself. Simulation results demonstrate that proposed scheme increases the success delivery rate compared with other schemes without any significant overhead.