Distributed computation with communication delay [distributedintelligent sensor networks]

A linear network of communicating processors is examined. The objective is to solve 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 communication off-loading. The cases of equal division of processing load and optimal division of processing load are discussed for both the network with front-end processors and the network without front end processors. An example of the inclusion of solution time, the time taken for processors to report the solution back to the problem originator, is also presented     

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     

Optimal divisible job load sharing for bus networks

Optimal load allocation for load sharing a divisible job over N processors interconnected in bus-oriented network is considered. The processors are equipped with front-end processors. It is analytically proved, for the first time, that a minimal solution time is achieved when the computation by each processor finishes at the same time. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are also obtained     

Processor equivalence for daisy chain load sharing processors

A linear daisy chain of processors in which processor load is divisible and shared among the processors is examined. It is shown that two or more processors can be collapsed into a single equivalent processor. This equivalence allows a characterization of the nature of the minimal time solution, a simple method to determine when to distribute load for linear daisy chain networks of processors without front end communication subprocessors and closed form expressions for the equivalent processing speed of infinitely large daisy chains of processors     

A parallel computer architecture for continuous simulation

A parallel computer specifically designed for the solution of ordinary differential equations is described. The first version of the machine contains thirty-two processors, running in an asynchronous multiple-instruction/multiple-data mode, communicating with high-speed parallel busses. Synchronization is accomplished by a microprogrammable communication controller. A number of processors have been designed and built for the machine. The processor types offer a wide variation in solution speed and accuracy. To permit easy comparisons with analog and hybrid systems, performance is measured by finding the highest frequency sine wave which can be integrated in real time with an accuracy of 0.1% or higher. Using this performance measure the performance limit of the current machine is 2000 Hz. The structure is capable of solving systems described by differential equations up to order sixty-four at these performance limits     

Optimal load distribution for tree network processors

A tree network consisting of communicating processors is considered. The objective is to minimize the processing time by distributing the processing load to other nodes. The effect of the order of load distribution on the processing time is addressed. An algorithm which optimally determines the order of load distribution is developed. It is shown that the order depends only on the channel capacity between nodes but not on the computing capability of each node     

Neural network modeling of flight control system

Modeling of angle tracking systems in the presence of actuator non-linearity such as angle, position and rate limits is a very significant and difficult task in the design and implementation of aircraft, target-tracking, and missile guided systems. A new recurrent neural network with time-delayed inputs and output feedback is used for the modeling of angle tracking systems, with emphasis on the neural network architecture, principles and algorithms. The neural network controller with modeling units for angle tracking is designed by using TMS320C25 processors. For time and size requirements, limited precision technology and look-up table technology are used in the design of the hardware and software systems. Given a set of input commands, the network is trained to control the system within the constraints imposed by actuators. The results show that the proposed networks are able to model the angle tracking system through learning without separate consideration of the non-linearity of actuators     

Performance limits for processor networks with divisible jobs

Ultimate performance limits to the aggregate processing speed of networks of processors that are processing a divisible job are described. These take the form of either closed-form expressions or numerical procedures to calculate the equivalent processing speed of an infinite number of processors. These processors are interconnected in either a linear daisy chain with load origination from the network interior or a tree topology. The tree topology is particularly general as a natural way to perform load distribution in a professor network topology with cycles (e.g., hypercube, toroidal network) is to use an embedded spanning tree. Such limits on performance are important as they provide an ideal baseline against which to compare the performance of finite configurations of processors.     

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.     

PARALLEL COMPUTATION OF SUPER-SONIC BLUNT BODY VISCOUS FLOWFIELDS IN PVM

ＰＡＲＡＬＬＥＬＣＯＭＰＵＴＡＴＩＯＮＯＦＳＵＰＥＲ┐ＳＯＮＩＣＢＬＵＮＴＢＯＤＹＶＩＳＣＯＵＳＦＬＯＷＦＩＥＬＤＳＩＮＰＶＭＹａｎｇＸｉａｏｈｕｉ，ＷａｎｇＺｈｅｎｇｈｕａ，ＷａｎｇＣｈｅｎｇｙａｏ（Ｄｅｐｔ．１，ＮａｔｉｏｎａｌＵｎｉｖｅｒｓｉｔ...     

Design and Performance Comparison of Distributed Detection Networks

Optimization of a distributed detection network using theminimum global cost criterion results in local processors thatindividually form the likelihood ratio when the input observationvectors are statistically independent. In addition, the localthresholds and the network performance can be expressed as afunction of the receiver operating characteristics (ROCs) of the localprocessors. The performance of rive distributed networks arecompared numerically using local ROCs from the conic ROCfamily.     

Task allocation and reallocation for fault tolerance inmulticomputer systems

The goal of task allocation in a set of interconnected processors (computers) is to maximize the efficient use of resources and thus reduce the job turnaround time. Proposed is a simple yet effective method to allocate the tasks in multicomputer systems for minimizing the interprocessor communication cost subject to resource limitations defined by the system and designer. The limitations can be viewed as results from the load balancing since the execution time of each task, the number of available processors, processor speed, and memory capacity are known to the system or designer. As the number of processors increases, the probability of a failure existing somewhere in the systems at any time also increases. Very few established task allocation models have considered the reliability property. In multicomputer systems, we define system reliability as the probability that the system can run the tasks successfully. After the (nonredundant) task scheduling strategy is defined, tasks are then reallocated to processors statically and redundantly. This is a form of time redundancy, in which if some processors fail during the execution, all tasks can be completed on the remaining processors (but at a longer time). Due to static preallocation of tasks this method is simpler and thus more practical than well-known dynamic reconfiguration and rollback recovery techniques in multicomputer systems. We demonstrate the effectiveness of the task allocation and reallocation for hardware fault tolerance by illustrations of applying the methods to different examples and practical communications network multiprocessor system     

基于可靠性分析的立方星网络维护架构优化

立方星编队或星座构成分布式空间传感器网络，可提高立方星执行复杂空间任务的能力。然而立方星易发生故障，其故障时间不确定性也导致了传感器网络性能的不稳定，这凸显了对立方星网络进行在轨维护的重要性。考虑立方星传感器网络的功能维持问题，描述了一种网络维护架构，通过定期发射、在轨备份立方星以及时更换故障立方星，从而提高网络对单星随机失效事件的快速响应与恢复能力。建立了该架构的运行成本模型，包括固定成本、储存成本和短缺成本。收集整理了真实的立方星寿命数据，并使用最大化拟合优度参数估计方法得到最优立方星寿命的随机模型。采用基于蒙特卡罗仿真的遗传算法优化备用立方星的补给时刻和补给数量，在备份成本与系统性能下降所带来的损失之间进行权衡，使得系统的综合收益最优。     

Divisible load scheduling on single-level tree networks with buffer constraints

Scheduling a divisible load on a heterogeneous single-level tree network with processors having finite-size buffers is addressed. We first present the closed-form solutions for the case when the available buffer size at each site is assumed to be infinite. Then we analyze the case when these buffer sizes are of finite size. For the first time in the domain of DLT (divisible load theory) literature, the problem of scheduling with finite-size buffers is addressed. For this case, we present a novel algorithm, referred to as incremental balancing strategy, to obtain an optimal load distribution. Algorithm IBS adopts a strategy to feed the divisible load in a step-by-step incremental balancing fashion by taking advantage of the available closed-form solutions of the optimal scheduling for the case without buffer size constraints. Based on the rigorous mathematical analysis, a number of interesting and useful properties exhibited by the algorithm are proven. We present a very useful discussion on the implications of this problem on the effect of sequencing discussed in the literature. Also, the impact of Rule A, a rule that obtains a reduced optimal network to achieve optimal processing time by eliminating a redundant set of processor-link pairs, is also discussed. Numerical examples are presented.     

基于身份的空间网络安全研究

空间网络安全的研究是天地一体化网络研究的重要组成部分,日益受到研究人员的重视。本文根据空间网络面临的安全威胁,分析需要采用的安全机制,构建了空间网络的安全体系结构。深入分析基于身份的密码体制（IBC）,在空间网络中应用IBC提供安全服务框架,以此为基础,提出了一种密钥交换协议,并详细描述了安全通信的建立过程。分析表明,同传统的基于公钥基础设施（PKI）体制的安全解决方案相比,IBC具有较低的存储、通信和计算开销,是适合空间网络的有效安全方案。     

Analysis and design optimization of monopulse receivers forsecondary surveillance radar

The sensitivity to calibration and component errors of the receiver configurations used for monopulse processing of secondary surveillance radar (SSR) replies is analyzed. The effects of video gain error in amplitude processors and large Gaussian perturbations in phase processors are discussed. Phase processors are shown to be robust to variations in antenna difference pattern null depth. A half-angle phase processor that yields the benefits of phase processing without the sensitivity to system errors associated with conventional implementations is described     

基于GSM/GPRS的无线监控系统设计

介绍了以嵌入式监控终端、用户手机和远程监控中心计算机构建的无线监控系统的设计.着重论述了无线模块在嵌入式系统中的应用方法.介绍了通过无线模块发送和接收短消息以实现对现场设备的监控方法;分析了如何依靠无线模块经过GPRS网络与接入Internet的固定IP计算机建立连接并进行通讯.结果表明,在现有的移动通讯网络覆盖的区域,利用本系统可以完成对现场设备的在线数据采集、远程无线数据传输与监控.在露天场所、野外、移动作业环境或有线网络无法接入的地点建立数据采集与监控系统时,基于GSM/GPRS网络的嵌入式远程无线监控解决方案具有突出的优势.     

附加双差模糊度网解约束的GNSS相位延迟估计

针对现有相位延迟估计方法未利用双差模糊度网解约束的特点,提出了一种附加双差模糊度网解约束的相位延迟估计方法。首先以整周双差模糊度网解为真值更新精密单点定位(PPP)估计的非差浮点模糊度,再通过网平差法估计未校正相位延迟(UPD)。实验结果表明,PPP双差模糊度与双差模糊度网解一致性好,其宽、窄巷中误差分别为0.07周和0.11周,误差大于1周的PPP双差模糊度主要出现在卫星初升阶段。约束改变了非差浮点模糊度,从而改变了参与UPD网平差的测站,使14%新升起卫星的窄巷UPD在短时间内较无约束有大于0.2周的差异。附加约束/无约束的全天星间单差UPD差异在大于99.9%的置信水平下满足零均值假设,表明整周双差模糊度网解约束方法与无约束方法估计UPD相关产品具有等效性。研究结果可为参考网非差模糊度解算和PPP与网络实时动态定位(RTK)的融合工作提供参考。     

An innovative approach for integrated airline network and aircraft family optimization

The determination of optimal aerial transport networks and their associated flight frequencies is crucial for the strategic planning of airlines, as well as for carrying out market research, to establish target markets, and for aircraft and crew rostering. In addition, optimum airplane types for the selected networks are crucial to improve revenue and to provide reduced operating costs. The present study proposes an innovative approach to determine the optimal aerial transport network simultaneously with the determination of the optimum fleet for that network, composed of three types of airplanes (network and vehicle integrated design). The network profit is maximized. The passenger’s demands between the airports are determined via a gravitational model. An embedded linear programming solution is responsible for obtaining potential optimal network configurations. The optimum fleet combination is determined from a database of candidate aircraft designs via genetic algorithm. A truly realistic airplane representation is made possible thanks to accurate surrogate models for engine and aerodynamics is adopted. An accurate engine deck encompassing a compression map and an innovative engine weight calculation besides an aerodynamical artificial neural network module enable a high degree of accuracy for the mission analysis. The proposed methodology is applied to obtain the optimum network comprised of twenty main Brazilian airports and corresponding fleet.     

时间触发以太网同步及调度机制的研究

说明并分析时间触发以太网（1TrE,Time—Triggered—Ethernet）的时间同步机制,对于采用时间触发机制调度的周期性任务,提出生成周期调度时刻表的方法,利用方法可以根据离线生成的调度时刻表进行调度,也可以动态地将通信任务加入或撤出调度时刻表,调度时刻袁的设计避免时间触发的数据包争用物理链路。构造相应的网络通信场景,通过生成调度时刻表的算例与仿真结果进行了验证。