一个自组网中基于局部状态位置已知的分布式QoS路由算法

在分析自组网的单播QoS路由问题的基础上，提出了一种位置信息已知的利用局部状态信息进行路由选择的的分布式QoS路由算法——LILAGR算法。LILAGR路由算法的基本思想是逐段优化费用和尽快到达目的节点，即在决定节点之间是选择带宽约束费用最小的路径而各个决定节点则是按照贪婪地尽快到达目的节点的原则进行选择。仿真结果表明：LILAGR算法能够以适度的路由消息开销取得较高的路由成功率。此外，LILAGR算法具有可扩展性，可以应用于较大规模的自组网中。     

基于最短路径的无人机自组网改进路由算法

无人机自组网(UAV Ad Hoc Network, UANET)是一种新型的移动自组织网络形式,具有3D空间中高移动性、拓扑结构频繁变化、带宽资源有限等特点,其中路由协议是UANET中一个重要且关键的部分。由于UANET中无人机节点的移动性,不断变化的拓扑结构使得寻找适合应用在UANET中的路由协议的过程比较复杂,网络中的链路中断和无人机节点失效也会导致网络资源的损失,降低了网络的可靠性和稳定性;因此,寻找源节点和目的节点之间的传输路由协议十分必要。结合上述问题,提出了适用于无人机自组网的基于最短路径的改进路由算法,该算法可以实现多路径传输,并且从丢包率、端到端时延和抖动三个方面来评估该算法的性能。仿真结果表明,改进的路由算法在无人机随机分布的高流量场景下,获得了比已有算法更好的性能。     

Ad hoc网络中基于能量的AODV双径路由算法研究

在Ad hoc网络中AODV路由的健壮性、路由开销、网络的生存时间以及分组报文传送率等都是评价该算法优良的指标。为了提高该路由算法的各项指标本文提出了改进的路由算法协议,在Ad hoc网络中避免使用的低于能量阈值的节点作为路由节点以提高整体网络的生存时间,提供主次路径使报文的到达率、网络的健壮性得以提高,同时也减少了链路的修复,减少了路由开销。     

基于动态邻接信任模型的安全路由算法研究

对现有路由节点信任相关问题进行了研究,综合路由节点的状态和行为因素提出了一种路由节点动态邻接信任模型。在此模型基础上提出了一种基于动态邻接信任熵的安全路由算法,并在现有OSPF路由协议中对该路由算法进行了验证。仿真结果表明提出的动态邻接信任模型能够准确地反映路由节点状态改变和恶意攻击,具有良好的动态响应能力,提出的安全路由算法能有效地保证路由节点的行为及状态可信并且具有良好的抗攻击性能。     

基于组合指标的无线传感器网络安全路由算法

针对无线传感器网络路由安全与可靠性的问题,提出了一种基于组合指标的安全路由算法.评估节点通过观测被评估节点的数据包转发行为,计算直接信任值,然后与第三节点推荐的信任值进行加权求和,得到一个综合信任值.为了提高信任的准确性,避免出现合谋攻击,对第三方推荐的信任值进行了信任相似度检测.通过对期望传输次数和信任值进行加权组合,形成一个用于选择下一跳节点的组合路由指标.最后,对所提出的算法进行了仿真验证.结果表明,所提出的算法能够有效地避免恶意节点的攻击,在传递率和总的传输次数方面明显优于其他算法.     

基于最小费用最大流的无线多媒体传感网多路径路由算法

为了解决多媒体数据的实时传输和网络生存时间优化问题,提出基于最小费用最大流的无线多媒体传感网多路径路由算法(MRAMCMF).MRAMCMF分析了数据传输能耗、节点剩余能量和最小数据传输时延,提出了新的权值函数,并利用最小费用最大流算法构建多路径的数据路由方案.所有多媒体传感节点沿着多个传输路径将数据传输到sink节点.仿真结果表明,该算法能延长网络生存时间,降低和平衡节点能耗,降低数据传输时延,在一定的条件下,比Ratio_w算法和TPGF算法更优.     

云环境下基于改进蚁群算法的网络路由优化

针对云计算多元化复杂的网络结构环境,提出一种旨在改善网络路由的蚁群优化算法.新算法在原有蚁群算法智能寻优的基础上,加入网络节点在网审查机制,实时判断网络节点是否在网,选择最优解路径.仿真实验表明,改进算法能有效的改善因为网络节点在网情况的多变性而造成的部分路径失效的情况,进而缓解网络拥塞.     

无线自组网路由协议仿真与实现

性能良好的路由算法可以降低传输延时、提高包到达率、合理处理网络拥塞,总而言之,有效提高网络的传输性能。然而在无线自组网中,没有最优的算法,网络规模、节点特性的不同,都会使路由算法的表现千差万别。着力研究了无线自组网中常用的几种路由算法,建立不同的网络场景,使用NS2进行仿真,分析数据包的行为,比较两类路由协议的性能差异和优缺点,以仿真结果给架设无线自组网时路由协议的选择给出了指导性的意见,并在嵌入式路由器上实现了路由算法行为,     

基于AODV且考虑拓扑信息的节能路由算法

提出了一种基于AODV的节能路由算法EBF-AODV.该算法在路由发现过程中,源节点设置一个阈值,中间节点根据本节点拓扑变化情况决定如何处理路由请求分组,目的节点综合考虑路径上的可用能量和路由跳数,选择最佳路径.通过仿真证明了该算法的有效性.     

基于国网规范的无线自组网路由算法改进

微功率无线自组网的研究主要专注于网络层的路由算法,目的是维护传输路径的连通性,保证节点间的高效通信,实现网络的快速组建。提出基于簇的多路径动态路由算法,可改善现国网规范中自组网路由构建缺陷,实现路由开销最小化,适应节点数量大、密度高的网络。     

Trust routing algorithm based on multiple decision factor theory in OSPF protocol

This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first （OSPF） protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.     

Hybrid MANET–DTN and a New Algorithm for Relay Nodes Selection

In this paper, a new way to a selection of the secure relay nodes in hybrid MANET–DTN networks based on the cooperation between routing, trust and game theory mechanisms is introduced. The hybrid MANET–DTN enables delivering the data or messages in the situation when communication paths are disconnected or broken and also in the emergency situations. We focus on the situations when MANET routing protocol cannot establish the end-to-end connection between source and destination nodes. In this situation, it is necessary to select relay nodes, that will be able to transport data or messages between isolated islands of mobile terminals with limited connectivity to other terminals. The proposed algorithm enables to select the relay nodes, that will come into contact with other mobile nodes located in different network areas with regards to trust and game theory. The parameter trust is computed for all mobile nodes and relies on a parameter obtained during routing and data transport processes. The game theory provides a powerful tool to select one candidate from a number of possible nodes with respect to confidence and security. Moreover, we propose a new mechanism to compute and select the trusted node, that can be used for transportation of the secure data in this hostile and disconnected environment. In order to verify the functionalities of this mechanism, we implement this mechanism into the OPNET modeler simulation environment and introduce performance analysis.     

物联网分布式路由中基于Beta函数的抗攻击信任管理模型

With the rapid development of Internet of Things (IoT), the issue of trust in distributed routing systems has attracted more research attention. The existing trust management frameworks, however, suffer from some possible attacks in hostile environments, such as false accusation, collusion, on-off, and conflicting behavior. Therefore, more comprehensive models should be proposed to predict the trust level of nodes on potential routes more precisely, and to defeat several kinds of possible attacks. This paper makes an attempt to design an attack-resistant trust management model based on beta function for distributed routing strategy in IoT. Our model can evaluate and propagate reputation in distributed routing systems. We first describe possible attacks on existing systems. Our model is then proposed to establish reliable trust relations between self-organized nodes and defeat possible attacks in distributed routing systems. We also propose a theoretical basis and skeleton of our model. Finally, some performance evaluations and security analyses are provided to show the effectiveness and robustness of our model compared with the existing systems.     

Towards a novel trust-based opportunistic routing protocol for wireless networks

Opportunistic routing is a promising research area in the context of wireless network communications. Security and trustworthy of routing in this field, however, needs to be considerably researched. In this paper, a novel trust establishment algorithm is proposed, designed, and implemented specifically for opportunistic routing protocols which benefits from direct interactions between wireless nodes. The proposed trust model benefits from a novel watchdog mechanism considering not only forwarding behaviour of nodes but also the quality of links between them. Furthermore, three different metrics for next hop selection is introduced enabling nodes to select their next hop forwarders more sophisticatedly using quality of links, geographical location of nodes, and their trust level. Extensive simulation results represent that proposed model can significantly improve the performance of network communications when malicious nodes try to collapse the system.     

无线网状网中基于D-S证据理论的可信路由

结合Dempster-Shafer(D-S)证据理论,提出了一个信任评估模型;同时,在AODV的基础上,给出了一个可信的路由协议T-AODV,该路由协议根据节点的信任值选择可信的路由进行数据传输。仿真结果表明,所提机制能够有效地监测和隔离恶意节点,抵御攻击,能够提高网络的可靠性、顽健性以及安全性。     

A Cognitive Energy Efficient and Trusted Routing Model for the Security of Wireless Sensor Networks: CEMT

There are many smart applications evolved in the area of the wireless sensor networks. The applications of WSNs are exponentially increasing every year which creates a lot of security challenges that need to be addressed to safeguard the devices in WSN. Due to the dynamic characteristics of these resource constrained devices in WSN, there must be high level security requirements to be considered to create a high secure environments. This paper presents an efficient multi attribute based routing algorithm to provide secure routing of information for WSNs. The work proposed in this paper can decrease the energy and enhances the performance of the network than the currently available routing algorithm such as multi-attribute pheromone ant secure routing algorithm based on reputation value and ant-colony optimization algorithm. The proposed work secures the network environment with the improved detection techniques based on nodes’ higher coincidence rates to find the malicious behavior using trust calculation algorithm. This algorithm uses some QoS parameters such as reliability rate, elapsed time to detect impersonation attacks, and stability rate for trust related attacks, to perform an efficient trust calculation of the nodes in communication. The outcome of the simulation show that the proposed method enhances the performance of the network with the improved detection rate and secure routing service.

     

基于频率域多目标MANETs可信路由决策研究

移动Ad-hoc网络(MANETs)具有开放的媒质,动态的拓扑结构,分布式的合作和受限的网络能力等基本特点。网络中移动节点具有匿名性和高度自治的特点,网络通讯依靠在通信路径上的中间节点转发数据包,实现无线传输范围外节点间的正常通信。该文提出了一种独特的MANETs中基于频率下多目标可信路由决策算法,它和现在大多数路由算法都是在时间域下使用单一约束参数选择路由的方式截然不同。利用概率理论分析安全和可信路由,基于概率密度函数的时频相互转化,减小计算复杂度,解决MEANTs中节点间缺乏物理安全以及在低信任水平和节点相互勾结扰乱网络操作情况下,发现可信安全路由难的问题。实例分析证明了此算法的可行性。     

A trust mechanism-based channel assignment and routing scheme in cognitive wireless mesh networks with intrusion detection

Cognitive Wireless Mesh Networks (CWMN) is a novel wireless network which combines the advantage of Cognitive Radio (CR) and wireless mesh networks. CWMN can realize seamless integration of heterogeneous wireless networks and achieve better radio resource utilization. However, it is particularly vulnerable due to its features of open medium, dynamic spectrum, dynamic topology, and multi-top routing, etc.. Being a dynamic positive security strategy, intrusion detection can provide powerful safeguard to CWMN. In this paper, we introduce trust mechanism into CWMN with intrusion detection and present a trust establishment model based on intrusion detection. Node trust degree and the trust degree of data transmission channels between nodes are defined and an algorithm of calculating trust degree is given based on distributed detection of attack to networks. A channel assignment and routing scheme is proposed, in which selects the trusted nodes and allocates data channel with high trust degree for the transmission between neighbor nodes to establish a trusted route. Simulation results indicate that the scheme can vary channel allocation and routing dynamically according to network security state so as to avoid suspect nodes and unsafe channels, and improve the packet safe delivery fraction effectively.