首页> 外文会议>Signal and Data Processing of Small Targets 2005 >Dynamic Sensor Management for Distributed Tracking
【24h】

Dynamic Sensor Management for Distributed Tracking

机译:分布式跟踪的动态传感器管理

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we consider the general problem of dynamic assignment of sensors to local fusion centers (LFCs) in a distributed tracking framework. As a result of recent technological advances, a large number of sensors can be deployed and used for tracking purposes. However, only a certain of number of sensors can be used by each local fusion center due to physical limitations. In addition, the number of available frequency channels is also limited. We can expect that the transmission power of the future sensors will be software controllable within certain lower and upper limits. Thus, the frequency reusability and the sensor reachability can be improved. Then, the problem is to select the sensor subsets that should be used by each LFC and to find their transmission frequencies and powers, in order to maximize the tracking accuracies as well as to minimize the total power consumption. This is an NP-hard multi-objective mixed-integer optimization problem. In the literature, sensors are clustered based on target or geographic location, and then sensor subsets are selected from those clusters. However, if the total number of LFCs is fixed and the total number of targets varies or a sensor can detect multiple targets, target based clustering is not desirable. Similarly, if targets occupy a small part of the surveillance region, location based clustering is also not optimal. In addition, the frequency channel limitation and the advantage of the variable transmitting power are not discussed well in the literature. In this paper, we give the mathematical formulation of the above problem. Then, we present an algorithm to find a near optimal solution to the above problem in real time. Simulation results illustrating the performance of the sensor array manager are also presented.
机译:在本文中,我们考虑了在分布式跟踪框架中将传感器动态分配给本地融合中心(LFC)的一般问题。由于最近的技术进步,可以部署大量传感器并将其用于跟踪目的。但是,由于物理限制,每个本地融合中心只能使用一定数量的传感器。另外,可用频道的数量也受到限制。我们可以预期,将来的传感器的传输功率将在一定的上下限内通过软件控制。因此,可以提高频率可复用性和传感器可达性。然后,问题是选择每个LFC应该使用的传感器子集,并找到它们的传输频率和功率,以便最大化跟踪精度并最小化总功耗。这是一个NP硬多目标混合整数优化问题。在文献中,基于目标或地理位置对传感器进行聚类,然后从这些聚类中选择传感器子集。但是,如果LFC的总数是固定的,而目标的总数却有所变化,或者传感器可以检测到多个目标,则基于目标的聚类是不可取的。同样,如果目标占据监视区域的一小部分,则基于位置的聚类也不是最佳选择。另外,在文献中没有很好地讨论频道限制和可变发射功率的优点。在本文中,我们给出了上述问题的数学公式。然后,我们提出了一种算法,可以实时找到上述问题的最佳解决方案。还提供了说明传感器阵列管理器性能的仿真结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号