共查询到20条相似文献，搜索用时 62 毫秒
1.
针对机会路由的候选转发集中存在恶意节点导致网络性能下降问题,提出一种计算节点信任度的评估模型。使用贝叶斯公式计算节点的直接信任度,根据节点的代数连通度得到间接信任度,利用信息熵的概念得到综合信任度。为高效辨别出候选转发集中的恶意节点,预先设定信任度阈值[β]。提出一种基于节点信任度的机会路由算法TBOR。TBOR利用信任模型初始化候选集中每个节点的综合信任度,再利用信任度阈值判断潜在的恶意节点,并将信任度大于信任度阈值的节点添加到候选转发集。实验结果表明,TBOR能高效识别并剔除候选转发集中的恶意节点,具有较高的检测率,保证了数据可靠传输。 相似文献
2.
无线Mesh网(wireless mesh networks,WMNs)是一种新兴的无线网络技术,支持节点多跳路由和转发功能。节点合作与否是实现通信的关键。在缺少预先约定的信任关系时,判断节点合作性的安全机制是解决恶意节点破坏网络通信的有效手段。在对WMNs中AODV协议安全分析的基础上,提出了一种基于局部声誉值的安全路由解决方案。 相似文献
3.
针对机会网络的路由算法基本上是考虑完全合作情况下进行设计的.本文对节点的合作性进行了分析,在机会网络环境ONE平台上,通过不同的转发概率对传染路由算法Epidemic的合作性进行了测试和分析.仿真结果表明,节点之间的合作性对路由算法的性能有着不同程度的影响. 相似文献
4.
薛峰 《安徽技术师范学院学报》2014,(6):52-56
传统的DTN（Delay Tolerate Network）缓存调度策略,是根据报文的生命周期或者报文进入缓存的时间来决定报文的优先级别,并没有考虑信源节点本身的特性。针对这一问题,提出节点转发率的概念,用以表明信源节点对网络递交率的贡献。在考虑报文生命周期的同时,根据报文源节点的转发率来进行缓存调度：优先转发源节点转发率高的报文,优先丢弃源节点转发率低的报文。仿真实验表明,将该算法应用于蔓延路由,在显著改善递交率的同时,还能有效减少网络的开销。 相似文献
5.
高性能IP路由器使用复杂的转发表查找算法优化查找时间、存储空间和更新时间.在对ORTC压缩算法及信息熵理论研究的基础上,提出了一种基于多位特里算法,通过消除信息冗余的方式实现对FIB的压缩方法.该方法具有不改变路由语义和外部路由器行为特征,在典型的路由器应用环境下,可以节省约50％的存储空间,路由查找效率可提高25％. 相似文献
6.
INTRODUCTION Video packets are transmitted over the Internet using a best-effort service. Therefore, a large number of simultaneous video streams or cross traffic arriving at a network node (e.g. a multimedia gateway) may sometimes exceed the node’s forwarding capacity, i.e., the incoming data rate may exceed the outgoing data rate at the node. In this paper, we consider a scenario where M streaming videos and N conversa- tional videos pass through a network node with lim- ited forwardi… 相似文献
7.
Network coding is a technique to increase the amount of information flow in a network by making the key observation that information
flow is fundamentally different from commodity flow. Whereas, under traditional methods of operation of data networks, intermediate
nodes are restricted to simply forwarding their incoming message symbols downstream, network coding achieves vast performance
gains by permitting intermediate nodes to carry out algebraic operations on the incoming data. In this article we present
a tutorial introduction to network coding as well as an application to the efficient operation of distributed data-storage
networks. 相似文献
8.
9.
针对Adhoc网络中移动节点能量受限的问题,考虑节点剩余能量和节点能量消耗速率两方面因素,对AODV协议,在选路机制,hello机制几个方面作了改进,改进后的路由协议能够有效均衡负载,保护低能量节点,延长网络生存时间。 相似文献
10.
无线传感器网络的DV-HOp定位算法是通过计算未知节点和锚节点的最小跳数,估算平均每跳的距离,并使用跳段距离代替实际距离来计算未知节点坐标。当节点规模变大、连通度过高时,该算法定位精度大大降低。根据DV-Hop算法的定位过程,考虑到节点位置的相对稳定,在DV-Hop的定位中应用ATR-CKN睡眠调度算法,让部分锚节点和已经定位的盲节点进入睡眠,从而降低节点规模和冗余定位信息,保证了节点低能耗下的精确定位。仿真结果表明,采用ATR-CKN睡眠调度算法的网络节点能量消耗大大降低,DV-Hop算法的定位精度也有提高。 相似文献
11.
无线传感器网络中节点的位置信息非常重要,目前通用的定位算法不适合恶劣环境;路由算法的设计直接影响到系统的能量消耗。在此提出一种基于测距的节点定位方案,并构建基于睡眠机制、最小成本路径的节能路由算法,通过理论分析和仿真实验,证明该算法具有较高的节能性,能提高网络的整体性能。 相似文献
12.
针对移动Ad hoc网络,在AODV路由算法的基础上研究了一种MCR路由算法,MCR对AODV中的路由搜索和路由维护机制进行了扩展,用来解决多径路由问题。通过NS—2平台的仿真结果表明MCR在增加少量网络开销的情况下,提高了数据包的转发率,降低了丢包率,并减少了时延,从而有效地减少了网络拥塞。 相似文献
13.
无线ad hoc网络最小均方负载均衡路由算法 总被引：1，自引：0，他引：1
Routing algorithm is a challenge for a mobile ad hoc network (MANET), but current routing protocols for MANETsconsider the path with minimum number of hops as the optimal path to a given destination. This strategy does not balancethe traffic load over a MANET, and may result in some disadvantages such as creating congested area, depleting power fasterand enlarging time delay in the nodes with heavy duties. In this paper, we propose a routing scheme that balances the loadover the network by selecting a path based on its mean load-square, the proposed routing metric can reflect not only the loadof the path, but also the load distribution along the path. Simulation results show effectiveness of this routing scheme onbalancing the load over all nodes in the network. 相似文献
14.
在移动自组织网络中,还没有实现多信道多接口的功能。通过修改NS2中移动节点结构引入多信道多接口,使得路由协议能够灵活调用多信道多接口功能。对于新增加的信道需要进行合理分配,基于路由协议AODVPlus的实现机制,提出一种多信道多接口的信道分配策略,并通过仿真模拟与单信道进行比较分析。多信道多接口在一定程度上改善了网络互通的性能,但有效的多信道分配策略显得尤为重要。 相似文献
15.
方冬云 《常熟理工学院学报》2012,26(2):28-31
路由器工作在网络层,依靠转发网络层数据包来实现网络互联,路由器工作的目的就是选择最佳路径,把数据传递到目的地.而以前路由器工作中的链路状态路由算法用的是Dijkstra算法来选择传播信息的最佳路径,现在运用图论中的线性规划法来解决源路由器到所有目的路由器传播信息的最佳路径问题. 相似文献
16.
In this paper we introduce a novel energy-aware routing protocol REPU （reliable, efficient with path update）, which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the received signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the way-points. One distinct advantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two way-point nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simultaneous packet forwarding. 相似文献
17.
Seyed Javad Mirabedini Mohammad Teshnehlab M. H. Shenasa Ali Movaghar Amir Masoud Rahmani 《浙江大学学报(A卷英文版)》2008,9(12):1666-1675
We propose a novel approach called adaptive fuzzy ant-based routing （AFAR）, where a group of intelligent agents （or ants） builds paths between a pair of nodes, exploring the network concurrently and exchanging obtained information to update the routing tables. Routing decisions can be made by the fuzzy logic technique based on local information about the current network state and the knowledge constructed by a previous set of behaviors of other agents. The fuzzy logic technique allows multiple constraints such as path delay and path utilization to be considered in a simple and intuitive way. Simulation tests show that AFAR outperforms OSPF, AntNet and ASR, three of the currently most important state-of-the-art algorithms, in terms of end-to-end delay, packet delivery, and packet drop ratio. AFAR is a promising alternative for routing of data in next generation networks. 相似文献
18.
Cross-layer design of energy-saving AODV routing protocol 总被引：1，自引：0，他引：1
Since most ad hoc mobile devices today operate on batteries, the power consumption becomes an important issue. This paper proposes a cross-layer
design of energy-aware ad hoc on-demand distance vector (CEAODV) routing protocol which adopts cross-layer mechanism and energy-aware metric to improve
AODV routing protocol to reduce the energy consumption and then prolong the life of the whole network. In CEAODV, the link
layer and the routing layer work together to choose the optimized transmission power for nodes and the route for packets.
The link layer provides the energy consumption information for the routing layer and the routing layer chooses route accordingly
and conversely controls the link layer to adjust the transmission power. The simulation result shows that CEAODV can outperform
AODV to save more energy. It can reduce the consumed energy by about 8% over traditional energy-aware algorithm. And the performance
is better when the traffic load is higher in the network. 相似文献
19.
20.
Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions including computation capability and battery capacity. Topology control is an important issue for achieving a balanced placement of sensor nodes. The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops. The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks. In this paper we propose an optimal algorithm with cluster balance taken into consideration, and compare it with three well known and widely used approaches, i.e., LEACH, MEER, and VAP-E, in performance evaluation. Experimental results show that the proposed approach increases the overall network lifetime, indicating that the amount of energy required for communication to the base station will be reduced for locating an optimal cluster. 相似文献