{'fraction_non_alphanumeric': 0.01788617886178862, 'fraction_numerical': 0.0, 'mean_word_length': 5.217171717171717, '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}}
Effective Obstacle Avoidance Path Planning and Maximized Network Lifetime Algorithm for Wireless Sensor Networks

The developments in embedded systems, Very Large Scale Integration, wireless communication continue to produce tiny wireless sensors. Thousands of wireless nodes are deployed in many applications to observe, to track and to control the quantities. These are Wireless Sensor Networks (WSNs). These nodes possess limited sensing, processing and communication. WSNs are subjected to various challenges and constraints. Accurate location information is needed for various applications. Global Positioning System is a good location detecting system. But it is not possible in WSN because of its cost and coverage in indoor applications. Few nodes may be fitted with a Global Positioning System called as anchor. All the nodes perform localization using anchors. The anchor travels to give complete coverage and the path length must be lesser. The important aspect of the paper is the proposed V curve path which provides lesser path length. The proposed algorithm handles the obstacle in a proper way. Also the mobile anchor provides wireless charging for the static nodes. Therefore, this increases the network lifetime.