复杂网络理论的防空反导系统网络特征

网络中心战是未来战争的主要作战样式,网络复杂性也是需要研究的重要问题之一.提出基于复杂网络的防空反导系统网络模型,并对网络模型的拓扑结构、统计特征和中心度进行了研究.针对防空反导体系结构问题,复杂网络理论是一种有效揭示网络内部特性的分析工具,对于网络模型的建立和优化具有很好的理论指导意义.     

基于复杂网络理论的指挥信息网络拓扑模型研究*

从网络科学的科学的观点出发对指挥信息系统拓扑模型进行研究,建立了指挥关系网络拓扑模型、通信网络拓扑模型,以及在两者基础上的指挥信息网络拓扑模型,分析了指挥信息网络的度分布特性,提出了描述指挥信息网络的特征参量,进行了针对指挥信息网络的体系破击仿真实验,得出了与战争实际相符的结论,为利用复杂网络知识研究信息化条件下的体系对抗进行了积极地尝试和探索。     

无线Ad Hoc网络中一种多信道协同MAC协议

多信道所带来的MCC(Multiple Channel Coordination)问题是影响多信道系统性能的重要因素。文章针对无线Ad Hoc网络,提出了一种多信道协同MAC(Media Access Control)协议。该协议扩展了协同通信的概念,邻节点不再转发发送节点的数据,而是帮助发送节点发现和避免多信道中的MCC问题。文章还对经典二维Markov模型进行了改进,加入了多信道和协同机制,对所提协议进行了建模,分析了协同机制对系统性能的影响,并推导出了吞吐量性能和时延性能的表达式。仿真结果表明,采用协同机制可以有效解决MCC问题,文章中所提协议相对传统多信道MAC协议可以大大提高吞吐量和时延性能。     

基于喷泉码的一跳无线广播协同协议

为了提升广播系统的吞吐量,提高广播系统的能量效率,简化传输协议,文章研究了基于喷泉码的广播通信协议,提出一种基于喷泉码的广播协同通信协议,令最先成功译码的目的节点作为协同节点进行编码转发,协助其他目的节点接收。从仿真结果可以看出,与直传广播协议相比,采用协同广播通信协议使系统的吞吐量大幅提升,中断概率显著降低,能量效率也有较大提高。     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Robust tower location for code division multiple access networks

Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Too little,too late: protecting American soft networks in COIN/CT

ABSTRACT

Assistance of local-national partners is necessary to the USA in order to protect its national security interests throughout the world. These partners, typically individuals who support USA diplomats, service members, and non-governmental organizations (NGOs) in non-combatant roles, form USA soft networks. Due to the nature of their work, many of these individuals associated with the policy and actions of the USA become vulnerable to violent threats from adversaries. In fact, adversaries have grasped that attacking USA soft networks is a logical approach for enemies fighting from positions of weakness. As a result, examination of other domains may yield best practices that build resiliency in USA soft networks, thereby cementing national security interests. Further, agency theory illuminates critical principles in the relationships between local-national partners and field practitioners, and informs policy development efforts as a result.