{'fraction_non_alphanumeric': 0.009401709401709401, 'fraction_numerical': 0.0, 'mean_word_length': 4.523584905660377, '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}}
Bottleneck around Base Station in Wireless Sensor Network and its Solution

The sensor nodes in a network are connected to the outer world via a base station. Base stations (BS) have some back up power and it is not suppose to fail due to shortage of battery power. The nodes which are away from the base station communicate to it via the nodes which are in proximity of BS. So, the nodes which are nearer to BS have additional communication responsibilities of forwarding data of distant nodes. Thus the nodes which are in proximity of BS will run out of battery power very soon and create bottleneck for communication. In this paper we have proposed that if the density of sensor nodes increases as we move towards base station this effect can be minimized. We found the required exact density of the sensor nodes at a particular distance from BS to avoid bottleneck phenomenon around it. We have considered the real life scenario where the nodes generate data only when there is an event of interest with a given probability of occurrence. The main contribution of this paper with our proposed strategy is lifetime offered per unit cost of deployment is almost double