{'fraction_non_alphanumeric': 0.02155504234026174, 'fraction_numerical': 0.0007698229407236335, 'mean_word_length': 5.018518518518518, '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}}
An efficient mobile sink path selection approach for WSN's

With the quick advancement of the Internet, wireless communications have gotten remarkable consideration. Wireless sensor systems are outfitted with minor, essential batteries and along these lines it is important to plan vitality effective calculations to draw out the system lifetime. In remote sensor systems (WSNs), the sink versatility along an obliged mode can enhance the vitality proficiency. Sink mobility is an imperative method to enhance sensor system execution including vitality utilization, end-to-end delay and lifetime. To manage the above issues researches introduced a Rendezvous design technique, where some sensor nodes are selected as an RP's and the nodes which are not RP's will forward data to the nearest RP's. The major issue in this design is to find the set of RP's and determine the tour that visits these RP's. To overcome this issue in this paper we proposed an algorithm called as an " Weighted Rendezvous Planning(WRP)", where each node is provided with some weight based on the number of packets that it sends and the nearest hop distance. The simulation is performed using NS2 simulator and we compared the WRP with the existing approach with the energy consumption and network lifetime of sensor nodes.