{'fraction_non_alphanumeric': 0.011164274322169059, 'fraction_numerical': 0.0, 'mean_word_length': 5.306532663316583, '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}}
Active Sensor Network Deployment and Coverage Enhancement using Circle Packings

This paper presents a novel algorithm for autonomous deployment of active sensor networks. The algorithm aims to enhance the sensing coverage based on an initial placement of sensor nodes. The sensing regions are modeled as circular discs of variable sensing range limits. The problem of placing these circular discs to cover a field is intuitively transformed to the circle packing problem: given the specified combinatorics of tangency patterns of n circles, find the label R denoting the radii of these circles. Base on the fact that a unique circle packing exists satisfying any given set of combinatorics and boundary conditions of a sensor network, we can always find the minimum sensing range required for every interior nodes to fulfill such packing conditions. Though an extension from tangency packing to overlap packing, the interstices among triples (which represent coverage holes) can be eliminated. Based on a number of numerical simulations, we have verified that the proposed algorithm always yields sensor deployments of wide coverage and minimize the sensing ranges required for every interior sensing node to satisfy the packing and boundary conditions.