Distributed computation in linear networks: closed-form solutions

A linear network of communicating processors is analyzed. The processors in the network may or may not be equipped with front-end processors. The processing load originates either at the boundary or at the interior of the network. Closed-form solutions and computational techniques are presented for the above situations, to obtain time optimal distribution of processing loads on the processors. Some important results are proved analytically using the closed-form expressions     

Distributed state estimation for heterogeneous mobile sensor networks with stochastic observation loss

The problem of distributed fusion and random observation loss for mobile sensor networks is investigated herein. In view of the fact that the measured values, sampling frequency and noise of various sensors are different, the observation model of a heterogeneous network is constructed. A binary random variable is introduced to describe the drop of observation component and the topology switching problem caused by complete observation loss is also considered. A cubature information filtering algo...     

Distributed computation for a tree network with communicationdelays

Tree networks of communicating processors are examined with the objective of solving a computational problem in a minimal amount of time. The processors in the networks may be equipped either with or without front-end processors for communicating of loading. The determination of the optimal division of processing load is discussed for the network with and the network without front-end processors. The inclusion of solution time, the time taken for sensors to report the solution back to originator, is discussed     

Distributed sensor data fusion with binary decision trees

A distributed sensor object recognition scheme that uses object features collected by several sensors is presented. Recognition is performed by a binary decision tree generated from a training set. The scheme does not assume the availability of any probability density functions, thus it is practical for nonparametric object recognition. Simulations have been performed for Gaussian feature objects, and some of the results are presented     

具有通信约束的分布式SOR多智能体轨迹估计算法

针对传统多智能体轨迹估计算法信息交换量大,计算量随群规模指数增长,可扩展性差等诸多不足,提出了一种基于超松弛迭代（SOR）的分布式多智能体轨迹估计算法,通过将最大似然（ML）准则下的轨迹估计转化为两级线性优化问题,并综合利用分布式超松弛迭代（Distributed SOR）和标记初始化方法,加快求解速度并简化信息交换流程,最终实现了多智能体位姿轨迹优化和协作定位。实验表明,所提的分布式方法能达到集中式算法的精度水平,在49个智能体规模条件下,位置估计误差小于0.15 m,姿态估计误差小于0.03°,且数据交换量仅到现有主流分布式方法DDF-SAM的0.06%,能很好用于大规模集群的场景。     

Overview of multiple satellite communication networks

Recently interest in packet communications has stimulated an interest in constellations of low altitude satellites. Such a configuration would have less propagation delay and be cheaper to launch than satellites at higher or geosynchronous altitude. However, many more satellites are necessary at low altitude to achieve reasonable coverage of the earth and insure availability of the resource. Further, the geometry of such a constellation would be dynamic with communication links of short duration as the satellites speed past each other or a ground site. The most difficult design issue in these systems is a stable method of routing messages that will sustain a reasonable level of traffic. This paper explores the problems of routing and switching messages through a constellation of low altitude satellites and examines some of the related demands on technology. The dynamic nature of crosslinks, uplinks, and downlinks requires a very agile antenna system, and the volume of information for routing of traffic is overwhelming. Use of some type of facetted phased array antenna is advocated to solve the former problem, but the latter problem is more subtle. Since the volume of ephemeris and constellation data as well as the rate of update is unmanageable, schemes relying on some form of broadcast or random access may be considered. It is concluded that none of the known or examined approaches to routing and switching is completely satisfactory     

Distributed cooperative guidance for multiple missiles with fixed and switching communication topologies

This study investigates cooperative guidance problems for multiple missiles with fixed and switching directed communication topologies.A two-step guidance strategy is proposed to realize the simultaneous attack.In the first step,a distributed cooperative guidance law is designed using local neighboring information for multiple missiles to achieve consensus on range-to-go and leading angle.The second step begins when the consensus of multiple missiles is realized.During the second step,multiple missiles disconnect from each other and hit the target using the proportional navigation guidance law.First,based on the local neighboring communications,a sufficient condition for multiple missiles to realize simultaneous attack with a fixed communication topology is presented,where the topology is only required to have a directed spanning tree.Then,the results are extended to the case of switching communication topologies.Finally,numerical simulations are provided to validate the theoretical results.     

Further comments on “Optimal sensor selection strategy fordiscrete-time estimators” [and reply]

The fundamental TPBVP usually underlying true “optimal sensor selection strategy” is revisited to obtain practical real-time mechanizations as a solution to an exclusively initial value problem     

Performance limits of track-to-track fusion versus centralized estimation: theory and application [sensor fusion]

Track-to-track fusion is an important part in distributed multisensor-multitarget tracking. The centralized and distributed tracking configurations were studied in (H.Chen et al., Proc. of SPIE Conf. on Signal and Data Processing of Small Targets, vol. 4048, 2000) using simulated air-to-air scenarios, and in (K.C. Chang, et al, IEEE Transact. on Aerospace and Electronic Systems, vol. 33, no. 4, pp. 1271-1276, 1997) with analytical results based on /spl alpha/-/spl beta/ filters. The current work generalizes the results in the latter to the cases with more than 2 sensors. As the number of sensors increases, the performance of the distributed tracker is shown to degrade compared with the centralized estimation even when the optimal track-to-track fusion is used. An approximate track-to-track fusion is presented and compared with the optimal track-to-track fusion with performance curves for various numbers of sensors. These performance curves can be used in designing a fusion system where certain trade-offs need to be considered. Finally, these results are compared with simulation results for a realistic air-to-air encounter scenario.     

无线传感器网络节点的研究与设计

无线传感器网络节点的设计,对于构成一个实际的无线传感器网络应用系统具有重要意义。本文在对ZigBee协议和无线传感器网络体系结构进行论述的基础上,设计了一种基于ZigBee协议和PIC18F4620单片机的无线传感器网络节点。该节点采用了一款符合IEEE802.15.4标准的ZigBee无线网络芯片CC2420,通过PIC18F4620单片机的SPI接口实现单片机和ZigBee芯片的通讯。文中对该节点开发设计过程中的主要问题进行了较详细的论述,对传感器网络设计与应用具有参考价值。     

Event-triggered cooperative target tracking in wireless sensor networks

Since the issues of low communication bandwidth supply and limited battery capacity are very crucial for wireless sensor networks, this paper focuses on the problem of event-triggered cooperative target tracking based on set-membership information filtering. We study some fundamental properties of the set-membership information filter with multiple sensor measure-ments. First, a sufficient condition is derived for the set-membership information filter, under which the boundedness of the outer ellipsoidal approximation set of the estimation means is guaranteed. Second, the equivalence property between the parallel and sequential versions of the set-membership information filter is presented. Finally, the results are applied to a 1D event-triggered target tracking scenario in which the negative information is exploited in the sense that the measurements that do not satisfy the triggering conditions are modelled as set-membership mea-surements. The tracking performance of the proposed method is validated with extensive Monte Carlo simulations.     

基于最小跳数的无线传感器网络跨层设计

传统的严格分层参考模型无法实现对无线传感器网络资源的有效管理和运用,跨层设计是提高网络整体性能的一种有效方法。针对无线传感器网络能量、计算资源、存储资源和带宽资源有限的特点,提出一种基于最小跳数的路由层和MAC层的跨层协议设计方案。MAC层和路由层通过共享sensor节点到sink节点的最小跳数信息,在MAC层建立时间梯度,解决多个节点共享无线信道的问题;并在路由层建立路由表,解决路由选择问题。仿真结果表明,该方案在降低网络能耗的同时,在降低传输延迟,提高数据投递率方面也取得了良好的性能。     

基于贝叶斯网络的空中交通延误传播分析

从机场网络的角度研究延误传播问题.贝叶斯网络是一种分析传播问题的有效方法,基于贝叶斯网络的延误模型,构造出延误传播的机场网络模型.通过计算网络中条件概率,最终得到联合概率,用于分析机场之间延误传播的影响.实验数据表明,当某一机场产生离场延误时,这一延误不会消失,而是经过时间的推移传播到其他机场,造成其他机场的延误.     

Centralized and distributed multisensor integration withuncertainties in communication networks

Algorithms in which each sensor is represented in a local coordinate system and the communication networks between sensors have uncertainties are considered. The algorithms are general and can be applied to various integration tasks. The effects of the communication network uncertainties are minimized in the local estimation and central fusion processes. In the centralized multisensor integration, the local measurements and local measurement models are transferred to the central coordinate system and the optimal integration is obtained at the central process. In contrast, the local measurements, together with the previous central estimate transmitted from the communication network, are locally processed in the distributed multisensor integration algorithm. Because the distributed algorithm uses the communication networks twice, more errors are introduced, so that when the uncertainties are large, the centralized algorithm is preferred. Although the algorithms are developed in the three-dimensional coordinate system, with straightforward extension they can be applied to N-dimensional coordinate systems     

Wireless sensor networks: scheduling for measurement and data reporting

An optimal load allocation approach is presented for measurement and data reporting in wireless sensor networks with a single level tree network topology. The measurement problem investigated involves a measurement space, part of which can be sampled by each sensor. We seek to optimally assign sensors part of the measurement space to minimize reporting time and energy usage. Three representative measurement and reporting strategies are studied. This work is novel as it considers, for the first time, the measurement capacity of processors and assumes negligible computation time which is radically different from the traditional divisible load scheduling research to date. Aerospace applications include satellite remote sensing and monitoring and sensor networks deployed and monitored from the air.