共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
该文针对多种作战模式对基于空空导弹的航空自组网进行研究,对其中关键技术进行详细分析,并使用链路有效性作为路由路径选取的指标,对传统自组网路由协议进行改进.仿真结果表明,改进后的路由协议显著提高网络吞吐量,减小端到端时延,适用于网络拓扑快变的空空导弹作战环境. 相似文献
3.
4.
5.
Ad Hoc网络目前的主要应用领域仍然是军事方面.文中针对战场环境中装甲部队这一特殊移动自组网的运动特性及移动终端配置等特点,参考目前较为完善的AODV、DSR路由协议,提出了适用于装甲车自组网的路由协议MMAR(military mobile ad hoc network routing protocol),通过OPNET仿真表明:相对于军用移动环境,该协议比AODV、DSR能更有效地减少路由负载,并能显著提高端到端时延、相对路由开销和平均投递率等性能. 相似文献
6.
航空自组网是自组网在航空领域的典型应用.航空自组网的关键技术在于路由协议的选取和设计.基于场景用NS2软件仿真研究了3种适用于航空自组网的路由协议及其网络性能,并定义了4个性能评估准则.仿真结果表明,单跳距离一定时,3种路由协议的网络性能随着节点密度的增加而总体变差.同等条件下,AODV路由协议路由开销高于DSVD和GRID路由协议,端到端平均延时低于DSVD和GRID路由协议,而GRID协议分组投递率和平均跳数保持最高. 相似文献
7.
8.
QoS设计是一个复杂的问题,IETF针对有线网络提出实现QoS的2种标准模型;然而在无线自组网中,由于隐终端、显终端问题的存在和带宽限制问题,有线网络使用的QoS模型略显繁琐并使实现无线QoS较为困难。通过对TDMA方式自组网的分析,使用跨层合并方法设计一个QoS路由协议,并得到集成服务模型在无线自组网络的一个实现。通过仿真,验证此路由协议设计的正确性,同时分析此协议性能,结果表明该路由协议高效可行。 相似文献
9.
针对小型无人机集群组网中节点高速移动、网络拓扑变化剧烈导致的网络性能下降问题,在无线自组网按需平面距离向量(AODV)协议基础上,提出一种具有链路稳定度意识的无人机自组网路由协议(LN-AODV)。首先,通过加权计算链路维持时间和邻居节点变化度,从而选择稳定路径,解决拓扑结构动态变化条件下数据传输延迟和数据成功投递率下降的难题;然后,结合Q-learning算法自适应调整Hello消息的发送周期,使协议能够通过感知拓扑变化程度调整路由控制开销和拓扑感知灵敏度。仿真结果表明,相比于AODV,所提方法在端到端延迟、分组投递率、路由开销和数据吞吐量4个网络性能指标上分别提升7.56%,2.58%,17.39%,2.62%,可适应于节点高速运动的无人机自组网,对于无线自组网理论研究及拓展应用具有重要的借鉴意义。 相似文献
10.
11.
12.
针对无线传感器网络中基于位置的路由算法中存在的重复搜索和冗余计算问题,提出一种基于表面自适应的定向贪婪路由算法(DGAFR)。该算法充分发挥贪婪转发、表面路由转发和定向选路的优势,依据局部区域节点的状态信息进行整个网络的路由选择。理论上分析证明DGAFR算法具备渐近最优性;仿真结果表明,相比于GPSR和GOAFR,该算法降低了大量额外的通信和计算开销,更适于大型的传感器网络。 相似文献
13.
As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead. 相似文献
14.
15.
16.
ASON路由技术及其进展 总被引:2,自引:0,他引:2
文章对国际上各个标准组织,如ITU-T、IETF和OIF,在自动交换光网络(ASON)路由技术方面的进展情况进行了介绍,包括标准制订工作流程和互通演示测试等方面;对传送网的分层结构和ASON的分级路由之同的关系进行了讨论,认为ASON应该支持多级路由方式,允许运营商根据需要组织网络结构,这对于ASON网络的规划和建设具有一定的参考意义。 相似文献
17.
18.
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime. 相似文献
19.
边界网关协议(border gateway protocol,BGP)是支撑互联网50年来快速发展的核心协议,因早期设计考虑不足一直存在路由劫持、路由泄露等路由安全威胁漏洞。随着互联网应用日益深入,BGP 路由安全问题逐渐引起业界重视,边界网络安全防护意义重大。提出了一种BGP路由安全检测架构,通过推理构建全球BGP路由知识库实现互联网全局路由可视性,并基于此实现路由劫持、路由泄露等路由安全事件的准实时检测。通过在杭州交换中心部署实践,证明本系统可构造较完整的互联网全局路由知识库、实现较准确和实时的BGP路由安全事件检测。 相似文献
20.
Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献