军用无线传感器网络体系结构研究

无线传感器网络作为一种全新的监测系统被广泛认为是军用侦查探测系统的发展方向,已经成为国际军事领域研究热点。在总结了几种无线传感器网络体系结构的基础上,针对军用领域特定的性能需求,对这些体系结构进行了比较。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

流编程模型下的存储一致性模型

在流编程模型下建立了一个新的存储一致性模型--流一致性模型,它比传统的释放一致性模型更加松弛.讨论了流一致性模型对程序设计和系统设计的要求,给出了一个正确的系统实现,并且指出流一致性模型的编程和实现并不比现有的一致性模型复杂.     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

稳定自组织网络结构中单点突变对网络稳定性影响

从战场恶劣环境通信设备无法正常通信的条件下,介绍了一种自组织网络稳定度的模型。通过比较自组织网络结构中微结构和巨结构的优缺点,动态地描述了结构间的聚合和裂解。基于结构分析,考虑单点突变对网络稳定性的影响,从时间因素策略方面,提出了一个基于预测最稳定链路生存时间的一种分布式成群策略。通过合理建模以及优化路由算法,尽可能地维护网络结构的稳定。     

基于复杂网络的作战描述模型研究

针对传统作战模型重点关注兵力的毁伤,不能充分地反映信息时代作战的特点,提出了一个基于复杂网络的作战描述模型,把作战单元抽象成节点,把各单元之间的相互作用抽象成有向边,将战场描述为一个由传感器、决策器、影响器、目标四类节点组成的有向网络图。定义了网络模型的若干特征参数,把作战环看成是反映作战能力的指标,并区别分析了标准作战环和广义作战环,能更好地反映信息时代作战的特点。最后实例研究了传统作战条件下决策器连通程度的变化给作战能力带来的影响。     

基于神经网络的舰船目标识别研究

为了实现对水下目标的识别,在现有特征提取方法的基础上,提出了一种从DEMON谱线谱和DEMON谱连续谱提取的特征方法,并设计了一个基于BP神经网络和多神经网络分类识别器的舰船目标识别系统。通过对实际舰船噪声目标进行识别,识别效果比较满意。这对舰船目标识别的发展具有一定的参考价值。     

Revisiting inspection game and inspector leadership through reaction networks

The inspection game is a two-player noncooperative game that models a situation where an inspector verifies whether the inspectee complies with the rules (on the assumption that the inspectee has the tendency to violate at least one of the rules). The usual approach in the analysis of this game seeks to find an optimal strategic inspection scheme for each of the two players yielding favorable payoffs. Recently, there have been some developments in the study of such games that use a mathematical structure known as reaction network involving a set of molecular species and the existing reactions among these species. In this paper, we use a reaction network to analyze the inspection game giving an alternative way of modeling the social situation. The molecular species play the role of the players' decision moves and their resulting gain or loss, while the reactions are the encounters of the decisions of the players which, as expected, yield payoffs. We reexamine the dynamics of the inspection game through the lens of reaction network theory and consider various situations that call for more detailed analyses such as equal or unequal reaction rates and inspection leadership. Conditions concerning reaction rates, initial population of decision species, benefits, and costs are determined in order to identify strategies that yield better payoffs both for the inspector and inspectee. These results illustrate practical insights rooted from the formulated simple game models.     

基于遗传算法的无线传感器网络路由研究

无线传感器网络路由算法面临着节省能量、延长网络寿命、提高可靠性等方面的挑战。提出了一种基于遗传的无线传感器网络路由算法。对算法中的算子编码、适应度函数设计、编码方式及参数选取进行了细致研究。仿真结果表明,本算法减少了能耗、延长了网络生存时间并提高了网络的可靠性。     

一种面向大规模HLA仿真的并行区域匹配算法

HLA仿真中,数据分发管理实现基于值的过滤,可以有效减少盟员接收冗余数据的可能性和网络中的数据流量。大规模HLA仿真系统在仿真推进中需要大量的区域匹配计算以维护数据分发管理的正确性。现有的区域匹配算法大多需要对所有区域进行匹配计算,造成了大量计算资源的浪费;同时,主要基于串行匹配思想,难以充分发挥多核平台的并行计算优势。针对现有区域匹配算法的局限性,提出了一种面向大规模HLA仿真的并行区域匹配算法,该算法能够实现对一次仿真推进中多个改变区域的并行匹配计算,同时在匹配计算中采用基于移动相交的基本思想,利用区域范围移动前后的历史信息,将匹配限定在移动区间之内,减少了大量的无关计算。理论分析与实验结果表明该算法尤其适合基于多核计算平台构建大规模分布式仿真的应用需求。