首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 218 毫秒
1.
OLSR(最优链路状态路由协议)是一种先应式路由协议,其MPR(多点中继)节点易受恶意攻击,严重时将导致路由协议崩溃.针对这一安全隐患,提出了一种MPR节点综合抗攻击方案:消息加密和消息频率检测技术.消息加密技术主要是对广播的HELLO消息进行加密,防止攻击节点冒充合法节点;频率检测是对HELLO消息发送频率进行检测,若频率过大则可以认为发送该HELLO消息的节点为恶意节点.仿真结果表明,该综合方案可以有效抵制对MPR节点的攻击,保证OLSR路由协议的安全.  相似文献   

2.
在认知无线网络协作频谱感知过程中,感知节点所处的恶劣信道环境会导致本地频谱检测结果发生偏差,有时一些故障节点或恶意节点发送的误导信息来干扰认证网络融合中心的全局判决.根据认知网络感知节点的历史感知信息,将感知节点分为可信节点、不可信节点和故障或恶意节点,提出了一种基于节点识别的协作频谱检测算法.在该算法中,融合中心舍弃故障或恶意节点,使其不得参与数据融合,同时也不考虑不可信节点当前发送的本地检测结果.这样,一方面消除了故障或恶意节点对全局频谱判决的影响,另一方面降低了融合中心计算复杂度.仿真结果表明,该算法能有效克服故障或恶意节点的干扰,提高认证网络协作频谱检测性能.  相似文献   

3.
大多数无线传感器网络(WSNs)部署在户外环境中,恶意节点对WSNs安全存在巨大威胁.信誉阈值模型在识别恶意节点这一领域有着不俗的表现,但随着攻击技术的升级,恶意节点变得更加隐秘而难以被发觉.经分析引入时序和相似度的概念对原有信誉阈值模型加以改进,由欧几里得度量和K-mediods算法可以有效地分辨这一类恶意节点.经仿真实验验证,对识别特征不明显的恶意节点改进后的算法效果十分显著.  相似文献   

4.
李英华  梁妍 《传感技术学报》2021,34(10):1385-1394
无线传感器网络的级联故障模型主要侧重于节点容量对网络性能的研究,忽略了链路容量的影响,从而导致流量指标无法正确反映无线传感器网络的汇聚特征.鉴于此,本文建立了一种受节点容量和链路容量限制的无线传感器网络级联故障模型.首先,根据新的流量指标"方向介数"重新定义了网络负载;其次,通过构建网络级联抗毁性模型,使故障节点可在一定时间延迟后从故障状态恢复.最后,提出了一种路由恢复机制,可以有效改善网络级联故障的抗毁性,并进行了仿真对比测试.结果表明:本文提出的方法可以帮助故障网络在较短时间内得到恢复,使网络状态更加稳定.  相似文献   

5.
WIA-PA是由中国工业无线联盟推出的具有自主知识产权的面向过程自动化应用的工业无线网络协议,为了提高WIA-PA网络的可靠性和稳定性,提出了一种工业无线网络节点故障诊断方法;在设计WIA-PA节点诊断架构的基础上,针对节点硬故障和软故障分别设计了备份路由询问和基于模糊推理的时间序列分析两种方法分别进行相应故障检测I通过在实验室构建的WIA-PA网络以及Malab仿真平台的实验证明,所设计备份路由询问能够及时地发现节点的通信故障,而模糊推理时间序列分析方法较传统的IF-THEN方法具有更低的误检率.  相似文献   

6.
基于链路故障的MANET本地修复技术   总被引:2,自引:1,他引:1       下载免费PDF全文
针对已有移动自组网本地修复技术的不足,以AODV路由协议的本地修复技术为基础,考虑网络节点状态的变化,提出一种基于链路故障的本地修复技术,对链路故障进行分类,对不同类型的故障采取不同的修复方法。仿真结果表明,改进的本地修复技术可以有效减少路由建立时间并控制分组开销,提高了网络性能。  相似文献   

7.
关于链路故障的分布式故障诊断   总被引:2,自引:0,他引:2  
一、引言 在分布式系统中,故障诊断应包括故障结点机的诊断和故障链路的诊断,故障链路的诊断在分布式系统级故障诊断中占有重要地位,它不仅是分布式乐统级故障诊断的目标,而且也是分布式系统级故障诊断的前提,因为一个系统的链路发生故障,则将会对故障结点机的诊断带来困难。在现有的诊断算法中,并不是所有的诊断算法都考虑了链路故障。 在分布式系统中,虽然任两个结点机之间都能进行通讯,也即都能进行互测,因而实际分布式系统的测试图的拓扑结构可以是任意结构的,但我们一般只在实际分布式系统的拓扑结构是分布式的或多总线的情形下才考虑链路故障。因为在单总线系统中,链路故障的出现将是致命的,会使整个系统的故障诊断成为不可能,因此一般不考虑链路故障。  相似文献   

8.
无线自组织网络的报文传输是依靠网络中的节点彼此多跳接力传输,当网络中有节点被俘获以后,就会成为内部攻击者,并在报文的传输过程中发起丢弃报文攻击,严重降低网络性能.现有网络协议栈中传输层和网络层协议难以检测和防范在网络层发起丢弃报文攻击的节点.文中提出一种在网络层抵抗内部节点丢弃报文攻击的通信模型,它包括通信链路状态实时分析协议和分布式的节点类型判定算法两个部分.通信链路状态实时分析协议利用节点对间逐段生成的路径环路,通过引入报文成组应答机制使得节点能实时地获取其邻居节点的报文转发状态;在通信链路状态实时分析协议基础之上,节点根据相关数学模型能有效地分析邻居节点行为是否异常,并对网络中的节点进行分类,最终将恶意节点从网络中隔离出去.仿真实验结果表明,文中算法在恶意节点的检测率和误检率方面性能表现良好,能有效地抵抗来自网络内部节点的丢弃报文攻击.  相似文献   

9.
李新国  周平炉  王斌 《测控技术》2016,35(12):93-97
移动自组网(MANETs,mobile Ad Hoc networks)中节点随机移动,且无固定基础设施、节点能量受限等诸多的因素影响了链路的稳定性,给路由协议提出了挑战.目前,研究人员对基于稳定链路的路由协议进行了深入的研究,并提出不同的基于稳定链路的路由协议.为此,首先对现有的基于稳定链路的路由协议进行分类,然后,分析了每类的经典协议的性能,最后,讨论基于稳定链路的路由协议的未来发展方向.  相似文献   

10.
本文利用链路和节点发送缓存的状态信息对DSR协议进行优化和改进,提出了一种Performance-DSR(PDSR)协议。文中对PDSR协议的路由更新和路由选择机制进行了介绍,并对PDSR协议和DSR协议在节点不同移动速度下的性能进行了分析比较,结果表明PDSR协议比DSR协议更能适应网络拓扑变化快的MANET网络。  相似文献   

11.
The Mobile Ad Hoc Network (MANET) has become more popular because the MANET is a self-organizing, self-configuring, and an instantly deployable multi-hop wireless network that responds to application needs without any fixed infrastructure. Moreover, the MANET is fault-tolerant and reliable. A mechanism is needed in the MANET that allows a set of nodes to agree on a common value. The distributed Byzantine Agreement (BA) problem is one of the most important issues in designing a fault-tolerant system. In many cases, reaching a common agreement among fault-free nodes in coping with the influence from faulty components is crucial in a fault-tolerant system. When a common agreement is achieved, all fault-free nodes in the system can produce stable results without any influence from the faulty components. In this study, the BA problem is visited in a MANET, in which the components are subject to a malicious fault. The proposed protocol can tolerate the maximum number of allowable faulty nodes using a minimum number of message exchange rounds. Each fault-free node can reach a common agreement value for the BA problem in a MANET. The text was submitted by the authors in English.  相似文献   

12.
Traditionally, the problems of Byzantine agreement, consensus, and interactive consistency are studied in a fully connected network with processors in malicious failure only. Such problems are reexamined with the assumption of malicious faults on both processors and links. The proposed protocols use the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement for the cases of processor failure, link failure, or processor and link failure  相似文献   

13.
In early stage, the Byzantine agreement (BA) problem was studied with single faults on processors in either a fully connected network or a nonfully connected network. Subsequently, the single fault assumption was extended to mixed faults (also referred to as hybrid fault model) on processors. For the case of both processor and link failures, the problem has been examined in a fully connected network with a single faulty type, namely an arbitrary fault. To release the limitations of a fully connected network and a single faulty type, the problem is reconsidered in a general network. The processors and links in such a network can both be subjected to different types of fault simultaneously. The proposed protocol uses the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach an agreement  相似文献   

14.
Networks are trending towards wireless systems that provide support for mobile computing. The Byzantine Agreement (BA) protocols used in static networks do not perform well in a dynamically changing mobile environment. Mobile commerce and related applications are necessary for wireless networks. There are numerous properties in a wireless network that play important roles. For example, the processors in a wireless network have highly mobile capabilities. Processors can immigrate into or move away from the network at any time. Although mobile technology has brought greater convenience, it is comparatively more dangerous. Wireless systems are susceptible to security flaws such as attacks by hackers. The number of allowable faulty components within the system is also decreased. To increase the number of allowable faulty components and ensure network security, a simple, secure and efficient protocol, BAM, is proposed to handle the BA problem. The fault symptoms include malicious and dormant faults. Furthermore, the proposed protocol uses the minimum number of message exchange rounds to make all healthy processors agree on a common value and can tolerate the maximum number of allowable faulty components. The proposed method will also ensure message security and increase the system's fault tolerant capability.  相似文献   

15.
In this paper, we address fault-diagnosis agreement (FDA) problems in distributed wireless networks (DWNs) with arbitrary fallible nodes and healthy access points. We propose a new algorithm to reach an agreement among fault-free members about the faulty ones. The algorithm is designed for fully connected DWN and can also be easily adapted to partially connected networks. Our contribution is to reduce the bit complexity of the Byzantine agreement process by detecting the same list of faulty units in all fault-free members. Therefore, the malicious units can be removed from other consensus processes. Also, each healthy unit detects a local list of malicious units, which results in lower packet transmissions in the network. Our proposed algorithm solves FDA problems in 2t+1 rounds of packet transmissions, and the bit complexity in each wireless node is O(nt+1).  相似文献   

16.
Recently, Siu et al. failed in their attempt to use the FDAMIX protocol to eliminate the fault diagnosis agreement (FDA) problem with mixed faults on the processors in a general network. Therefore, in this study, a new protocol, the FDAL protocol, is introduced to solve the FDA problem with mixed faults on the links. The FDAL is capable of detecting/locating faulty links to reconfigure the unreliable general network into a reliable network, and is able to increase the system performance and strengthen network integrity.  相似文献   

17.
以太网其庞大的网络系统在复杂的环境中存在网络链路延迟,节点时钟的漂移,同步能力差等问题。通过研究RTEthernet协议的起源和工作原理,考虑到影响实时以太网时间同步精密度的时钟拜占庭故障、网络传输延迟和漂移率等三个因素,建立了符合RTEthernet协议的通信模型。对FTA时钟同步算法在故障下时钟同步精密度损失率提升较少的问题进行了研究,引入了滑动窗口技术,提出了容错滑动窗口(Fault-Tolerant Sliding Window, FTSW)算法。容错滑动窗口算法能进一步提高分布式系统在进行时钟同步是对故障节点的容错能力。最后,使用CANoe仿真工具对FTSW算法进行仿真验证, FTSW算法的容错性优于FTA时钟同步算法算法,且在系统(七个节点)中存在两个拜占庭故障的情况下,同步后的精密度损失率降低了7.1%。  相似文献   

18.
A Wireless Sensor Network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensor nodes in a wide range of applications in various domains. In the future, WSNs are expected to be integrated into the “Internet of Things” (IoT), where sensor nodes join the Internet dynamically, and use them to collaborate and accomplish their tasks. Because of the communications of WSN will produce a broadcast storm, the Cluster-based Wireless Sensor Network (CWSN) was proposed to ameliorate the broadcast storm. However, the capability of the fault-tolerance and reliability of CWSNs must be carefully investigated and analyzed. To cope with the influence of faulty components, reaching a common agreement in the presence of faults before performing certain tasks is essential. Byzantine Agreement (BA) problem is a fundamental problem in fault-tolerant distributed systems. To enhance fault-tolerance and reliability of CWSN, the BA problem in CWSN is revisited in this paper. In this paper, a new BA protocol is proposed that adapts to the CWSN and derives its limit of allowable faulty components, while maintaining the minimum number of message exchanges.  相似文献   

19.
Traditionally, the Byzantine Agreement (BA) problem is studied either in a fully connected network or in a broadcast network. A generalized network model for BA is proposed in this paper. A fully-connected network or a broadcast network is a special case of the new network architecture. Under the new generalized network model, the BA problem is reexamined with the assumption of malicious faults on both processors and transmission medium (TM), as opposed to previous studies which consider malicious faults on processors only. The proposed algorithm uses the minimum number of message exchanges, and can tolerate the maximum number of allowable faulty components to make each healthy processor reach a common agreement for the cases of processor failures, TM failures, or processor/TM failures. The results can also be used to solve the interactive consistency problem and the consensus problem  相似文献   

20.
The reliability of the distributed system has always been an important topic of research. Byzantine Agreement (BA) protocol, which allows the fault-free processors to agree on a common value, is one of the most fundamental problems studied in a distributed system. In previous works, the problem was visited in a fully connected network or an unfully connected network with fallible processors. In this paper, the BA problem is reexamined in a group-oriented network, which has the feature of grouping, and the network topology does not have to be fully connected. We also enlarge the fault tolerant capability by allowing dormant faults and malicious faults (also called as the dual failure mode) to exist in a group-oriented network simultaneously. The proposed protocol is more efficient than the traditional BA protocols and can tolerate the maximum number of tolerable faulty processors.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号