{'fraction_non_alphanumeric': 0.023770491803278688, 'fraction_numerical': 0.0, 'mean_word_length': 5.426315789473684, '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}}
Dynamic bandwidth allocation for target tracking in wireless sensor networks

In this paper, we study the dynamic bandwidth allocation problem for target tracking based on quantized sensor data in wireless sensor networks. At each time step, the fusion center distributes the available bandwidth among the sensors in such a way that the posterior Cramér-Rao lower bound (PCRLB) on the mean squared error (MSE) is minimized. Since the optimal solution requires a combinatorial search, we seek computationally efficient suboptimal methods for dynamic bandwidth allocation. In order to minimize the estimation error, our objective is to maximize the determinant of the Fisher information matrix (FIM) subject to the total rate constraint. To maximize the determinant of the FIM, we formulate an approximate dynamic programming (A-DP) algorithm and compare its performance with other suboptimal methods, including the generalized Breiman, Friedman, Olshen, and Stone (GBFOS) algorithm and the greedy search. A-DP is computationally more efficient than the GBFOS and simulation results show that A-DP and GBFOS algorithms yield similar tracking performance in terms of the mean squared error and outperform the greedy search.