{'fraction_non_alphanumeric': 0.03374233128834356, 'fraction_numerical': 0.0, 'mean_word_length': 5.941489361702128, '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}}
Efficient Scheduling in Space–Air–Ground-Integrated Localization Networks

High accuracy and seamless position information formulates the basis of many modern wireless applications, such as the Internet of Things (IoT) and intelligent transportation systems (ITSs). In this article, aiming at the ground user equipment (UE) those in the “blind spots,” where only limited navigation signals are provided, the temporary aerial-aided “anchors” such as the unmanned aerial vehicles (UAVs) are introduced as alternating solutions. We first give the general fundamental limits of the three-dimensional space–air–ground-integrated localization networks (SAGILNs) using both time and angle measurements. Unlike most existing investigations, we treat aerial nodes as “agents” whose positions are not known beforehand. We then try to formulate an efficient scheduling strategy, where proper network behaviors, including the resource optimization and UAV deployment, are provided. We find that the proposed scheduling problems could be formulated as standard semidefinite programming (SDP) problems and solved by off-the-shelf solvers. Numerical results are provided to validate our analysis. The proposed methods and analyses provide meaningful insights for performance benchmarks for the implementation of SAGILN.