A new dynamic hierarchical reputation evaluation scheme for hybrid wireless mesh networks

A hybrid wireless mesh network has the advantage of a flexible infrastructure but is vulnerable to attacks. Traditional reputation schemes are common approaches to address security, but they are not suitable for direct application to hybrid wireless mesh networks because the node cooperation and hierarchical construction are not considered. In this paper, we propose a new dynamic hierarchical reputation evaluation scheme (DHRES) to provide security for hybrid wireless mesh networks. In this scheme, the virtual cluster structure is built to introduce the reputation relation, including the related nodes’ roles and functions. Moreover, the reputation evaluation mechanism is based on the correlation between nodes such that the reputation information of the nodes is updated according to their different roles. Simulation results show that, compared with traditional reputation models, the proposed scheme can more accurately reflect the security status of nodes, particularly in cases where the malicious nodes are mesh clients.     

A secure routing scheme based on social network analysis in wireless mesh networks无线网状网中一种基于社会网络分析的安全路由机制

As an extension of wireless ad hoc and sensor networks, wireless mesh networks (WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guarantees, WMNs are susceptible to various kinds of attack. In this paper, we focus on node social selfish attack, which decreases network performance significantly. Since this type of attack is not obvious to detect, we propose a security routing scheme based on social network and reputation evaluation to solve this attack issue. First, we present a dynamic reputation model to evaluate a node’s routing behavior, from which we can identify selfish attacks and selfish nodes. Furthermore, a social characteristic evaluation model is studied to evaluate the social relationship among nodes. Groups are built based on the similarity of node social status and we can get a secure routing based on these social groups of nodes. In addition, in our scheme, nodes are encouraged to enter into multiple groups and friend nodes are recommended to join into groups to reduce the possibility of isolated nodes. Simulation results demonstrate that our scheme is able to reflect node security status, and routings are chosen and adjusted according to security status timely and accurately so that the safety and reliability of routing are improved.     

基于信誉系统对GRID网格Leader选择协议的安全性研究

针对GRID路由协议中的网格Leader选择协议,首先运用基于有限状态机的形式化分析方法对它的安全性进行了分析,之后基于现有信誉系统,提出一种基于信誉度的信誉模型。模型包括信誉度计算、信誉管理和信誉决策,依据节点信誉度的变化以及设置的信誉度阈值识别并处理内部恶意节点,保证网络通信的安全可靠。仿真实验表明,该模型能够有效识别出恶意节点,显著提高网络分组投递率,但节点间传输平均时延有所延长,需进一步优化。     

支持时延-带宽约束的动态层次组播路由

层次网络及层次路由成为解决大规模网络QoS路由可扩展性问题的一个主要手段.文中对PNNI层次网络模型下的时延-带宽多QoS约束的动态组播路由问题进行了全面研究:在已提出支持时延-带宽约束的拓扑聚集算法(Stair)的基础上,进一步对组播树节点需维护的组播树状态信息及其聚集问题进行研究,并提出"伪树上边界节点"模式的域内组播树状态信息的聚集方法,最后设计了基于聚集拓扑信息和组播树状态信息的动态层次组播路由算法.仿真结果显示,该路由不仅大量压缩了存储和扩散的拓扑信息和组播树状态信息,同时还保持了与平面网络近似的路由效率,实现了大规模网络情况下组播路由的扩展.     

基于AS联盟与信誉机制的域间安全路由协议

基于信誉机制的边界网关协议存在信誉值计算不合理和数据存储不安全等问题。为此,提出一种新的域间安全路由协议TBGP。从网络节点、链路和路径3个方面计算信誉值,以提高路由的安全性,并引入可信计算,利用自治系统联盟管理保证信誉值数据的完整性和存储的安全性。理论分析及仿真结果表明,该协议可较好地抑制不可信路由的传播,实现最优路径选择。     

结构化对等网络中基于信誉的乐观路由决策

提出一种结构化P2P网络环境下的路由决策方法.该方法利用Beta评估机制对P2P节点路由行为进行信任度量,并针对P2P节点的短期在线行为,通过引入置信度避免了短期在线节点产生不可靠的信誉值;在基于Chord协议的P2P网络路由决策过程中,提出了乐观路由的思想;采用贪婪决策与信誉决策相结合的方式,实现了合理的多路径路由.该路由方法兼顾了效率和可靠性两方面因素.仿真结果表明,该方法在减少路由跳数和提高路由成功率方面都取得了较好的效果.     

RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks

We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes’ accumulated reputation, the nodes should cooperate. Finally, based on nodes’ reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes’ reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol.     

一种基于移动Ad hoc网络的安全路由策略

移动Adhoc网是一种新兴的无线移动自组织网络,其路由安全机制与传统网络的路由安全机制有很大差异。在分析Adhoc网络的特点和局限性的基础上,从各网络节点易受攻击、俘获,各网络节点之间不可信赖的角度出发,引入了可信任第三方的信任分散策略,提出了一种新的移动Adhoc网络的安全路由策略,解决了节点之间身份的分布式认证,为节点之间的通信提供了极为安全的路由策略。     

无线传感器网络簇内优化的最小跳数路由算法

对无线传感器路由协议的发展过程进行了简要的概述,结合无线传感器节点能量有限的特点,在已有的分层网络模式下,通过对最小跳数路由算法的优化,将其应用于分层网络中的簇内路由,使传感器节点仅需记忆自己唯一的转发节点就可将数据转发至簇头节点,同时引入能量水平这一参数,对低能量节点进行了有效的保护。实验结果表明,此方法能够有效地达到节省节点能量和延长网络寿命的目标。     

Secure Routing Protocol based on Multi-objective Ant-colony-optimization for wireless sensor networks

To solve the problem of achieving the maximum network security goal with lower energy consumption in wireless sensor networks, this paper proposes a Secure Routing Protocol based on Multi-objective Ant-colony-optimization (SRPMA) for wireless sensor networks. The ant colony algorithm is improved to be a multi-objective routing algorithm with considering the residual energy of nodes and the trust value of a rout path as two optimization objectives, in which a rout path is produced through the multi pheromone information and the multi heuristic information consisting of two objective functions. The node trust evaluation model is established by using an improved D-S evidence theory with confliction preprocessing to evaluate nodes trust degree. The multi-objective routing result is obtained by using the Pareto optimal solution mechanism by using the external archive method with a crowding distance criterion. The simulation results conducted with NS2 show that the proposed algorithm can achieve desired performance against the black hole attack in WSN routing.     

An energy efficiency semi-static routing algorithm for WSNs based on HAC clustering method

In Wireless Sensor Networks (WSNs), energy efficiency is one of the most important factors influencing the networks’ performance. Through a well designed routing algorithm, WSNs’ energy efficiency can be improved evidently. Among various routing algorithms, hierarchical routing algorithms have advantages in improving nets’ robustness and flexibility, and it is more appropriate for large scale of networks. In this paper, some typical hierarchical routing algorithms are introduced, and their advantages and defects are analyzed. Based on these analyses, a new hierarchical routing algorithm with high energy efficiency named EESSC is proposed which is based on the improved HAC clustering approach. In EESSC, the sensor nodes’ residual energy would be taken into account in clustering operation, and a special packet head is defined to help update nodes’ energy information when transmitting message among the nodes. When the clusters have been formed, the nodes in cluster would be arrayed in a list and cluster head would be rotated automatically by the order of list. And a re-cluster mechanism is designed to dynamic adjust the result of clustering to make sensor nodes organization more reasonable. At last, EESSC is compared to other typical hierarchical routing algorithms in a series of experiments, and the experiments’ result which proves that EESSC has obviously improved the WSNs’ energy efficiency has been analyzed.     

多QoS约束的层次多播路由算法框架

为了解决网络路由的扩展性问题。大型网络通常被划分成若干个不同的域。拓扑聚集是对这些域的拓扑状态信息进行汇总的过程。在拓扑聚集的基础上，QoS层次多播路由算法用来构造满足QoS要求的域闻多播树。现有的QoS层次多播路由算法在其拓扑聚集和路径计算的过程中都只考虑了存在两个QoS特征值的情况。本文提出了一种具有多QoS约束的层次多播路由算法框架HMRMQ（Hierarchical Multicast Routing with Multiple QoS constraints），此算法框架不仅为基于多QoS特征值的拓扑状态聚集和状态信息表示提供了新的方法，而且提出了一种适应于多QoS约束的层次多播路由新算法。我们提出的状态信息表示法和拓扑聚集算法都具有很好的扩展性，分布式的路由算法也便于某些安全性策略的实施。理论分析和实验结果不仅证明了HMRMQ的正确性和有效性，同时也表明了HMRMQ在网络路由的扩展性、路由成功率、网络代价以及报文负载等方面都具有良好的性能。     

基于模糊信任的无线传感器网络可信路由

由于无线传感器网络（WSNs）经常部署在苛刻环境下,节点易被物理俘获或损坏,无线多跳通信的方式也使得网络容易遭受各种信号干扰和攻击,路由安全显得尤为重要。在分簇路由协议的基础上,引入了节点可信度作为路由选择的度量,提出了基于模糊信任的无线传感器网络可信路由模型。该模型中,每个节点的信任值由剩余能量、包转发率、路由信息篡改以及声明诚实度等4个属性采用变权模糊综合评判算法得到。仿真结果表明：在变权模糊综合评判算法中,通过提高具有过低值的属性的权值,可以突出节点的缺陷,使得具备过低剩余能量或是过低包转发率,路由信息篡改信任,或过低诚实度任意一个缺陷的节点都不能够得到较高的信任值从而被选为簇头节点,避免行为恶意的节点破坏网络路由。     

一种适用于无线自组织网络的安全路由优化算法

大规模无线自组织网络存在的自私节点或者恶意节点引起网络性能的降低,甚至导致网络不能正常工作,在网络层数据包路由过程中避免这些节点,对自私节点或者恶意节点进行隔离能够有效提高网络的安全性。本文提出一种安全感知的无线自组织网络路由优化算法SARO,SARO算法是一种改进的蚁群算法,该算法基于节点信任度统计参数建立安全感知的启发因子方程以及信息素更新方程,使数据包在路由过程中选择安全性较高的路径进行数据的路由转发,可对自私节点和恶意节点进行隔离,从而增强网络安全性,提高网络服务质量。仿真实验结果表明,SARO算法能够明显提高网络吞吐量,降低传输延迟,降低不良侦听率,具有较高的实用价值。     

Ad hoc网络的基于债务关系的合作激励机制

合作的激励机制对拓展Ad hoc网络的应用具有决定性作用,然而在资源有限的网络条件下实施激励机制对协议开销控制的要求很高。依托文件共享应用,提出了基于债务关系的文件共享激励机制SDE。由于只涉及直接交互信息,避免了针对全局声誉方案的欺骗与攻击行为及虚拟货币方案所存在的货币造假问题,易于分布式实现。通过引入节点间的重复博弈,节点自发维护债务的有效性。提出了债务网络上的路由算法M-PGA,该算法采用局部路由思想,可以匹配债务网络动态性,而基于最优路径的路由选择可提高路由的成功率。     

可证明安全的节点不相交多路径源路由协议

多路径路由实现是移动ad hoc网络可靠运行的有效保证.针对多路径路由协议的安全性分析,建立了基于UC(universally composable)框架的可证明安全路由协议的新方法.基于攻陷的网络拓扑模型,扩展了可模糊路由概念,提出了多路径可模糊路由集合概念,用于描述攻陷网络拓扑结构的移动ad hoc网络多路径路由;基于UC安全模型,提出了基于UC-RP(universally composable security framework for ad hoc networks routing protocol)框架的路由协议形式化安全定义;针对MNDP(multiple node-disjoint paths)协议存在的安全问题,提出了新的移动ad hoc网络节点不相交多路径动态源路由协议(简记为SMNDP(security multiple node-disjoint paths)协议).将基于UC-RP框架的可证明安全路由协议的新方法应用于SMNDP协议的安全分析.SMNDP协议的可证明安全性可以归约为消息认证码和签名机制的安全性.SMNDP协议实现了路由发现协议的正确性、节点身份的认证性和路由消息的完整性.     

可证明安全的节点不相交多路径源路由协议

多路径路由实现是移动ad hoc网络可靠运行的有效保证.针对多路径路由协议的安全性分析,建立了基于UC(universally composable)框架的可证明安全路由协议的新方法.基于攻陷的网络拓扑模型,扩展了可模糊路由概念,提出了多路径可模糊路由集合概念,用于描述攻陷网络拓扑结构的移动ad hoc网络多路径路由;基于UC安全模型,提出了基于UC-RP(universally composable security framework for ad hoc networks routing protocol)框架的路由协议形式化安全定义;针对MNDP(multiple node-disjoint paths)协议存在的安全问题,提出了新的移动ad hoc网络节点不相交多路径动态源路由协议(简记为SMNDP(security multiple node-disjoint paths)协议).将基于UC-RP框架的可证明安全路由协议的新方法应用于SMNDP协议的安全分析.SMNDP协议的可证明安全性可以归约为消息认证码和签名机制的安全性.SMNDP协议实现了路由发现协议的正确性、节点身份的认证性和路由消息的完整性.     

Modeling and analyzing the performance of adaptive hierarchical networks

As networks become larger, scalability and QoS-awareness become important issues that have to be resolved. A large network can be effectively formed as a hierarchical structure, such as the inter/intra-domain routing hierarchy in the Internet and the Private Network-to-Network Interface (PNNI) standard, to resolve these critical issues. Methods of modeling and analyzing the performance of QoS-capable hierarchical networks become an open issue. Although the reduced load approximation technique has been extensively applied to flat networks, the feasibility of applying it to the hierarchical network model has seldom been investigated. Furthermore, most of the research in this area has focused on the performance evaluation with fixed routing. This work proposes an analytical model for evaluating the performance of adaptive hierarchical networks with multiple classes of traffic. We first study the reduced load approximation model for multirate loss networks, and then propose a novel performance evaluation model for networks with hierarchical routing. This model is based on a decomposition of a hierarchical route into several analytic hierarchical segments; therefore the blocking probability of the hierarchical path can be determined from the blocking probabilities of these segments. Numerical results demonstrate that the proposed model for adaptive hierarchical routing yields accurate blocking probabilities. We also investigate the convergence of the analysis model in both the originating-destination (O-D) pair and the alternative hierarchical path. Finally, the blocking probability of the adaptive hierarchical O-D pair is demonstrated to depend on the blocking of all hierarchical paths but not on the order of the hierarchical path of the same O-D pair.     

P2P网络激励兼容的声誉评价及服务分配

由自私节点组成的P2P网络常常采用基于声誉的机制激励节点间的合作。当前已经提出了一类基于声誉的方案,但其中大部分方案都忽视了方案的分布式实现中惩罚的激励兼容性问题。在社会学或生态学领域,该问题常被称为二阶搭便车问题:拒绝低声誉节点的服务请求会降低惩罚者自身的声誉,因此对于自私节点而言,这种惩罚并不总是有利的选择。以P2P文件共享为例对该问题进行了分析,提出了一种连续型二阶声誉评价模型及两种服务分配规则,即概率分配规则和比例分配规则,实验表明只有概率分配规则是激励兼容的。     

基于分层代理的P2P网络信誉管理模型

针对大多数信誉管理机制忽略节点的匿名性和其中的信息洪泛现象,构造一种基于分层信誉代理的P2P网络信誉管理模型HARMM。该模型采用多个公,私钥组合使用和洋葱路由等方法,通过理论分析及仿真实验证明该模型能较好地保证节点匿名性和数据可信性,有效抵抗一些典型的安全攻击。