共查询到20条相似文献,搜索用时 62 毫秒
1.
星载无线数据网络可以解除航天器内错综复杂的线缆网的束缚,是航天器轻小型化的重要技术储备。旨在替代航天器内现有的点对点三线制的LVDS线缆,提出了一种基于脉冲超宽带(IR-UWB)技术的星载高速无线数据网络的设计方案,并重点介绍了高速无线网络协议的设计和实现。网络协议设计参考了美国军用数据总线标准MIL-STD-1553B 协议,采用时分制指令响应机制,分别对其物理层、链路层、网络层和应用层进行设计,以适应星载高速率无线数据传输的要求,具有灵活性高、可靠性高、扩展性高的特点。网络协议的IP核经过地面演示系统进行验证,实验测得应用层数据传输的误码率小于10-10。 相似文献
2.
3.
装甲车辆自动配电系统MilCAN总线通信设计 总被引:1,自引:0,他引:1
针对CAN总线实时性不能有效保证这一问题,提出了利用MilCAN总线作为装甲车辆自动配电系统网络总线;在CAN总线模块基础上实现了MilCAN高层协议,分析和设计了系统应用层通信协议。试验结果表明:在CAN模块上实现的MilCAN高层协议性能可靠,能够很好地满足自动配电管理系统数据传输要求。 相似文献
4.
无线传感器网络中如何节能是一个关键问题。对经典的LEACH协议做研究与改进,并提出了一种新型的动态网络转换机制。该算法通过综合考虑候选节点的地理位置、剩余能量等参数来进行网络协议的选择,从而有效地降低了低能量与位置不佳的节点被选为簇首的可能性,进一步保证网络内节点能量负载的均衡性。仿真结果表明,新型的动态网络协议机制能够有效平衡节点的能量消耗分布,延长节点与网络的寿命。 相似文献
5.
无线局域网是一种高速的无线数据传输系统,调制技术的选择对它来说非常关键,OFDM作为一种高速调制技术很适合应用于无线局域网中。本文简要介绍了OFDM技术,并对OFDM技术在新一代宽带无线局域网无线接入系统中的应用进行了分析研究。 相似文献
6.
7.
8.
分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网(电路交换网、分组交换网)、数字化部队单工无线电数据网互联的关键技术。 相似文献
9.
基于16位SPCE061A单片机与无线射频PTR8000通信模块构建了无线射频通信系统,对系统硬件电路组成和通信软件设计进行了分析。为实现单片机之间通信提供了一种新的方法,实现了低价位、低功耗、可替代电缆的无线数据传输。 相似文献
10.
基于蓝牙技术的无线网络协议研究 总被引:1,自引:0,他引:1
刘鹏 《武警工程学院学报》2002,18(2):79-82
针对传统IP协议的不足 ,设计提出了BLUEPAC区域的概念和BLUEPACIP概念协议。BLUEPACIP(BLUEtoothPublicACcessIP)意为蓝牙公众接入网络协议 ,它以IP为基础融合移动IP和峰窝IP之长 ,支持IP地址分配、路径选择和网间切换 相似文献
11.
12.
13.
提出了基于网络图论模型的威胁态势分析方法;定义了图中邻接点的攻击代价;给出了计算其效用值的公式,以及计算最大威胁路径、节点的方法。针对某局域网,分析了目标节点的威胁程度及威胁路径。结果表明:不同路径对目标节点的攻击代价各不相同;存在最大和最小威胁路径。 相似文献
14.
An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic. 相似文献
15.
针对现有的软件定义卫星网络中流表占用的三态内容寻址存储器空间不断增加,复杂的流表项查找、匹配过程导致路由转发效率降低,无法满足多样化应用需求的问题,提出基于神经网络的软件定义卫星网络智能路由架构。控制器通过训练神经网络获取数据流的传输模式,并用训练后的神经网络代替流表,在此基础上提出基于Chebyshev神经网络的智能路由策略,交换机根据数据流的业务类型预测其转发路径,以满足卫星网络应用的服务质量要求。仿真结果表明:所提路由策略显著减少了占用的三态内容寻址存储器存储空间,提高了路由效率。 相似文献
16.
针对目前网络性能评价中多元指标之间权重难以确定的问题,将信息熵理论应用于网络性能评价中.提出采用熵权方法确定指标权重,进而对网络性能进行评价的方法.为了获取反映不同网络状态的性能数据,采用网络仿真方法获得计算熵权所需的样本.实例表明,信息熵能够客观地反映各指标贡献信息量的大小,基于信息熵的熵权能够客观反映各指标的相对重要程度. 相似文献
17.
R. D. Wollmer 《海军后勤学研究》1970,17(2):207-216
This paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another. The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available. 相似文献
18.
NDIS技术在网络监测中的实现 总被引:1,自引:0,他引:1
王发坤 《海军工程大学学报》2002,14(5):63-66
阐述了利用NDIS进行网络包的监测和分析的基本原理,在此基础上实现了对网络适配器在数据链路层网络包的监测,并通过数据报文结构的分析,再现了应用层协议的实现过程. 相似文献
19.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献
20.
神经网络模型具有强大的问题建模能力,但是传统的反向传播算法只能进行批量监督学习,并且训练开销很大。针对传统算法的不足,提出全新的增量式神经网络模型及其聚类算法。该模型基于生物神经学实验证据,引入新的神经元激励函数和突触调节函数,赋予模型以坚实的统计理论基础。在此基础上,提出一种自适应的增量式神经网络聚类算法。算法中引入"胜者得全"式竞争等学习机制,在增量聚类过程中成功避免了"遗忘灾难"问题。在经典数据集上的实验结果表明:该聚类算法与K-means等传统聚类算法效果相当,特别是在增量学习任务的时空开销方面具有较大优势。 相似文献