{'fraction_non_alphanumeric': 0.015064562410329985, 'fraction_numerical': 0.0, 'mean_word_length': 5.038961038961039, '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}}
Solving Target Coverage Problem in Wireless Sensor Networks using Greedy Approach

Network life time is one of the important aspects of Wireless Sensor Networks. For monitoring the environment, a large number of sensor nodes are deployed in Wireless Sensor Networks for collecting information from surrounding. Then the collected information was moved to the base station. The process of information gathering, forwarding consume more energy, more efficient scheduling algorithm can be followed to enhance the lifetime of the network. Deterministic placement of sensors is not suitable for monitoring different targets. In such cases random deployment can be used. Information about position of sensor in region may be lost in randomized deployment. In randomized deployment, deployment density of sensors can be enhanced. In this paper we discuss about an algorithm to increase the network lifetime of WSNs. This can be achieved by putting the sensors in multiple different set covers. At a particular instant, sensors were in active or sleep state. Only in active mode, sensors can monitor the targets. These types of problems are called Maximum Set Covers Problem which is a optimization problem. In order to obtain a suboptimal solution, in this paper a greedy based heuristic is proposed for deploying and scheduling the sensors in order to increase or enhance the network lifetime of WSN.