Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks

Mobile nodes in ad hoc networks move freely and run out of battery power so quickly, which leads to frequent network partitioning. Network partitioning considerably reduces service availability when the server node is not in the same partition as the client nodes. In order to provide a continuous service availability for all mobile nodes, we propose a self-stabilizing algorithm that can tolerate multiple concurrent topological changes and can incur a cost of one server per long-lived connected component. By using (1) the time interval-based computations concept that distinguishes between disjoint and concurrent computations, and (2) Markov chain model, the proposed algorithm can within a finite time converge to a legitimate state even if topological changes occur during the convergence time. Our simulation results show that the algorithm can ensure very high service availability, and each node has a strong path to the server of its network component over 98% of the time.     

A Numerical Study of Diagonally Split Runge–Kutta Methods for PDEs with Discontinuities

Diagonally split Runge–Kutta (DSRK) time discretization methods are a class of implicit time-stepping schemes which offer both high-order convergence and a form of nonlinear stability known as unconditional contractivity. This combination is not possible within the classes of Runge–Kutta or linear multistep methods and therefore appears promising for the strong stability preserving (SSP) time-stepping community which is generally concerned with computing oscillation-free numerical solutions of PDEs. Using a variety of numerical test problems, we show that although second- and third-order unconditionally contractive DSRK methods do preserve the strong stability property for all time step-sizes, they suffer from order reduction at large step-sizes. Indeed, for time-steps larger than those typically chosen for explicit methods, these DSRK methods behave like first-order implicit methods. This is unfortunate, because it is precisely to allow a large time-step that we choose to use implicit methods. These results suggest that unconditionally contractive DSRK methods are limited in usefulness as they are unable to compete with either the first-order backward Euler method for large step-sizes or with Crank–Nicolson or high-order explicit SSP Runge–Kutta methods for smaller step-sizes. We also present stage order conditions for DSRK methods and show that the observed order reduction is associated with the necessarily low stage order of the unconditionally contractive DSRK methods. The work of C.B. Macdonald was partially supported by an NSERC Canada PGS-D scholarship, a grant from NSERC Canada, and a scholarship from the Pacific Institute for the Mathematical Sciences (PIMS). The work of S. Gottlieb was supported by AFOSR grant number FA9550-06-1-0255. The work of S.J. Ruuth was partially supported by a grant from NSERC Canada.     

On Nirenberg-type conditions for higher-order systems on time scales

We study the existence of periodic solutions for a nonlinear system of nth-order differential equations on time scales. Assuming a suitable Nirenberg-type condition, we prove the existence of at least one solution of the problem using Mawhin’s coincidence degree.     

基于动态滑模的无死锁时间管理算法

基于新一代仿真体系结构HLA的IEEE1516新标准中的最大有效逻辑时间关键值,讨论最大有效逻辑时间在HLA时间管理中的重要意义,分析其在常规时间推进算法中的实现及死锁的产生,研究并证明HLA时间推进中的4个产生死锁的充分条件,即互斥条件、请求保持条件、不剥夺条件和环路等待条件,提出动态滑模的概念,设计了基于动态滑模的无死锁时间管理算法,对Lookahead的合理设置进行了分析。     

基于DSP的数字化机载通话系统

依据机载设备数字化要求,设计一种基于RS485总线的DSP嵌入式机载通话系统,采用数据总线分时复用方法,提高系统的可靠性和实时性,该系统完成了机载通话系统由模拟向数字制式的过渡。分析系统的硬件与软件设计方案,实现机内人员、地勤人员以及与地面塔台之间的多方实时通信,完成对各种控制、警告信号的监听和空中通话记录功能。     

低复杂度的时域同步OFDM信号检测算法

构造一种在所有正交频分复用(OFDM)符号中使用同一PN序列作为保护间隔的时域同步OFDM信号格式,提出一种基于快速傅里叶变换的PN码干扰消除和信号检测算法,该算法不使用FIR均衡技术,复杂度低,仅与常规CP-OFDM信号检测算法的复杂度相当,但由于引入了部分保护间隔内的噪声,因此BER性能不如CP-OFDM系统。仿真结果表明,在典型的双径短波信道中,两者的BER性能差距小于0.1 dB,在信道时域扩展较大的四径短波信道中,两者的BER性能差距小于1 dB。     

计算机辅助大规模人群疏散平台

针对现有疏散策略的不足,构建一个计算机辅助大规模人群疏散平台,为政府相关部门在城市建设和防灾规划中提供科学决策支持。该平台集成了疏散仿真模型和基于时变动态流问题的路网优化模型,引入组件式GIS技术,采用模块化多层体系结构建立了一个准确、实时的疏散引导系统。     

基于效能的时间敏感目标打击策略问题研究

针对时间敏感目标打击问题,分析了目标时间敏感特性与目标对抗策略,描述了精确制导武器打击时间敏感目标的过程,并以此为基础提出了基于效能的打击策略优化模型.将打击策略等效为复杂环境条件下的路径规划问题,设计了基于效能的时间敏感目标打击策略优化算法.算例检验了模型与算法的有效性,计算结果表明,目标的时效性是影响打击效果的重要因素,通过提高相对打击能力可提高精确制导武器对时间敏感目标的打击效果.     

基于信任和时间约束的访问控制模型TTRBAC

在分析基于信任的访问控制模型TrustBAC及模型中信任级计算方法的基础上,提出在信任级计算中引入了时间因素后的TTRBAC模型,给出了时间因素影响信任级的计算方法.新模型把用户在线时长作为影响用户信任级的重要因素,提高了模型的描述能力.