Balancing Area Coverage in Partitioned Wireless Sensor Networks
This paper deals with a resource sharing problem in Wireless Sensor Networks (WSNs). The problem calls for identifying k data collection trees that can be managed by independent users to run applications requiring area coverage. The formalized problem, called k-Balanced Area Coverage Slices (k-BACS), calls for identifying an ensemble of k trees that share the sink node only (and no other node) in a given WSN. To avoid nodal congestion, each tree is required to satisfy constraints on the maximum degree of its nodes. The objective is to maximize the minimum total area covered by any tree in the ensemble.