分组无线网缠绕多路径数据路由协议仿真

在分组无线网的路由协议中,传统路由协议在恶意节点数目较多时网络吞吐量较低,因此提出一种分组无线网缠绕多路径数据路由协议,利用获取的源节点数量信息与位置信息进行路由发现;根据路由发现结果建立从汇聚节点至源节点之间的路径,从而建立缠绕多径路由;对缠绕多径路由进行建簇与重构;进行支路径数优化,从而实现分组无线网缠绕多路径数据路由协议的构建。为了验证上述路由协议的网络吞吐量,将路由协议与基于链路状态的主动式多路径路由协议、基于动态源的按需式多路径路由协议、基于距离矢量的混合式多路径路由协议进行对比,上述四种路由协议在恶意节点数目为30时的网络吞吐量分别为69.5%、33.5%、23.6%、4.2%,通过比较可知,新提出的路由协议的网络吞吐量最高,证明了新路由协议的性能。     

AODV路由协议的改进

在新建路由时,AODV选择具有最短跳数的路由,未考虑节点的负载,所选的路径可能造成网络拥塞,且在节点移动较快时,性能下降非常厉害。针对这种情况,对其路由发现和维护阶段进行改进,在路由发现时根据节点负载选择节点并且在拓扑改变时动态对路由进行优化,减少网络拓扑变化对路由的影响。仿真结果证明,改进后的协议在减少网络拥塞、降低丢包率等方面较AODV协议均有了改进。     

Active route-maintenance protocol for signal-based communication path in ad hoc networks

Ad hoc wireless networks consist of mobile hosts in a network without base stations, and are characterized by a highly dynamic network topology. The network topology changes frequently due to host migration, signal interference and power outages, making routing maintenance a challenging consideration in designing routing protocols. This study presents an active route-maintenance protocol to prevent the current route from disconnecting. Monitoring the signal strength and stability of individual hosts allows the active node, which causes the route to have a weak connection, to issue actively a route-reestablishment instruction for selecting one of its neighbors as a candidate of active node. An enhanced active route-maintenance protocol is also proposed to reduce the probability of route breakage and enhance the route's efficiency. Performance simulation reveals that the proposed route maintenance protocol effectively reduces both the overhead and route maintenance, and alleviates route-breakage.     

移动Ad hoc网络中基于模糊逻辑的信任预测模型

为了增强Ad Hoc网络的安全性,提出了一种动态信任预测模型。该模型综合考虑了影响信任的两个因素：节点的历史行为和节点提供服务的能力,引入了时间衰减函数来精确地估计节点的直接信任值,并通过模糊逻辑规则预测方法来评估节点的当前信任值。最后,为了验证该模型的有效性,将该模型应用于AODV路由协议中,定义为FTAODV路由协议,并利用NS-2仿真软件对两种协议进行比较。仿真结果表明：FTAODV路由协议能够有效地监测恶意节点,从而提高了分组投递率,降低了平均端到端时延和路由包开销。     

面向无线传感器网络的分层路由信任模型

针对无线传感器网络内部不能有效地检测出恶意节点攻击所引发的安全问题,提出一种面向无线传感器网络分层路由的信任模型。该模型能发现来自网络内部攻击的恶意节点并将其排除,提高了无线传感器网络的安全性能。实验结果表明,与TLEACH协议相比,在恶意节点攻击时,该模型的敏感性提高了5%,信任值幅度增加了10%。     

基于邻居缓存的AODV路由协议

在移动自组网（MANET）中,传统的洪泛和扩展环路由发现方法路由开销较大。针对这一问题,提出一种基于邻居缓存的路由发现算法。该算法从网络中的各种数据分组中提取单跳邻居信息,建立邻居信息缓存表。在此基础上,将路由搜索分解为两个步骤：1）寻找刚刚和目标节点接触过的节点;2）找到后以它为中心展开新的扩展环搜索。使搜索限定在目标节点最可能出现的区域,减少了路由发现的盲目性,从而降低路由开销。仿真结果表明,与洪泛和传统扩展环算法相比,该方法节省了路由开销,提高了网络性能。     

自组网环境下基于模糊控制的自适应动态源路由协议

自组网是由一组带有无线收发装置的移动节点组成的一个能够支持多跳的临时性的计算机通信网络，大多数节点是由有限寿命的电池来提供的，因此能量保护策略成为设计该类网络路由协议的一个重要依据．同时，拓扑的动态变化是该类网络的另一主要特征，它将影响路由的稳定性．通过对节点当前剩余电池能量和邻居节点之间链路稳定性的观察，并使用模糊逻辑控制策略，文中提出了一种基于动态源路由的自适应路由协议，仿真表明该协议有效地延长了网络的生存时间，并提高了报文提交率．     

Trust-based minimum cost opportunistic routing for Ad hoc networks

Recently, opportunistic routing has received much attention as a new design direction. It can exploit the wireless broadcast and more highly reliable opportunistic forwarding, so as to substantially increase the throughput of network. Due to dynamic topology, distributed collaboration, limited bandwidth and computing ability, the absence of enough physical protection in Ad hoc networks, opportunistic routing is vulnerable to attacks by malicious nodes. In order to alleviate the malicious behaviors, we incorporate the concept of trust to Ad hoc networks, build a simple trust model to evaluate neighbors’ forwarding behavior and apply this model to opportunistic routing for Ad hoc networks. A new trusted opportunistic forwarding model is proposed by choosing the trusted and highest priority candidate forwarder, then a trusted minimum cost routing algorithm (MCOR) is formally formulated, the correctness and effectiveness of this algorithm from theoretical analysis are also approved. Finally, MCOR algorithm is verified by simulation using nsclick software and compared its performance with the classic protocols: ExOR, TAODV and Watchdog-DSR. The simulation results show that MCOR scheme can detect and mitigate node misbehaviors. Furthermore, MCOR scheme outperforms the other protocols in terms of: throughput, delay, Expected ETX, security-gains and cost of routing.     

IRPL: An energy efficient routing protocol for wireless sensor networks

This study aims to overcome the disadvantages of the original RPL (IPv6 Routing Protocol for Low power and Lossy networks) routing protocol (RPL including problems with energy consumption and energy load balance). We developed a relatively balanced RPL – the improved protocol (IRPL). This protocol is based on an efficient clustering algorithm and an effective topology control model of the loop domain communication route. The clustering algorithm can be used to calculate the optimal number of cluster heads by assumption of the network model. Combined with the clustering probability model and the node competition mechanism, the cluster head node in the wireless sensor network was used to complete the clustering process. In the topology control model, the wireless sensor network was divided into concentric rings with equal areas. Nodes determined the best network route, depending on different levels of ring domain and the optimal forwarding communication area defined in this study. Simulation results indicate that the IRPL routing protocol can reduce overall network energy consumption, balance network energy consumption, and prolong network lifetime.     

WSN中基于链路质量和节点能量的AODV路由算法研究

为了满足无线传感网络能量的高效使用以及数据传输的稳定性的要求,需要对无线传感网络路由层协议进行改进。本文提出一种基于节点之间链路质量和节点能量状态的LE-AODV路由协议,LE-AODV路由协议采用跨层设计,路由发现过程中通过MAC层和物理层获取链路质量信息和节点能量信息来选取最优路径,并通过节点能量状态更新机制避免网络中热点的产生。本文使用Castalia仿真器对LE-AODV路由协议进行仿真,仿真结果表明,LE-AODV路由协议可以有效的提高分组投递率和网络生存时间。     

移动自组网中安全多径DSR路由协议

Ad hoc网络的自组织、动态拓扑和无线接入等特点使得路由的安全问题日益突出。提出了一种在保证安全前提下允许中间节点返回路由应答报文的安全DSR路由协议。该协议对原有的信任机制进行了改进。仿真结果表明该协议可以有效防止路由信息伪装、篡改、路由重放以及黑洞攻击,可以缓解因恶意节点和自私节点拒绝网络服务或者网络环境变化造成的路由再发现问题。     

AHHR:一种新的移动ad hoc网络混合路由协议

Adhoc网络是一种特殊的自组织无线网络,路由协议对网络性能起着决定性的作用。论文提出了一种新的混合式路由协议。该协议利用了DSR的路由发现机制,并通过边权值管理和路由公告来获得网络拓扑。该协议可以在先应式和反应式路由之间进行自适应切换。仿真结果显示该路由协议在平均分组递交率和路由协议开销等方面要优于传统路由协议。     

Automating the security analysis process of secure ad hoc routing protocols

Conventional security property evaluation approaches for ad hoc network routing protocols do not provide an automated or exhaustive capability. This paper provides an automated process to evaluate security properties in the route discovery phase for on-demand source routing protocols. For a given network topology, model checking is used to exhaustively evaluate protocol abstractions against an attacker attempting to corrupt the route discovery process. Additionally, topology reduction techniques are developed to reduce computational requirements while maintaining exhaustive analysis results.     

Black Hole Attack Detection and Performance Improvement in Mobile Ad-Hoc Network

ABSTRACT

Security is an essential service for mobile network communications. Routing plays an important role in the security of mobile ad-hoc networks (MANETs). A wide variety of attacks targets the weakness of MANETs. By attacking the routing protocols, attackers can absorb network traffic, injecting themselves into the path between the source and destination. The black hole attack is one of the routing attacks where a malicious node advertise itself as having the shortest path to all nodes in the network by sending fake route reply. In this paper, a defense scheme for detecting black hole node is proposed. The detection is based on the timing information and destination sequence numbers maintained in the Neighborhood Route Monitoring Table. The table maintains the record of time of Reply. A black hole node will send a route reply message without checking the routing table as the legitimate node normally does. This reduced reply time is used to detect the black hole node. To improve the security further, the destination sequence number is checked with the threshold value, which is dynamically updated. The simulation results demonstrate that the protocol not only detects black hole attack but also improves the overall performance.     

基于Q学习的蚁群优化水声网络协议

针对水声通信中数据传输延时高且动态适应性弱的问题, 提出了一种基于Q学习优化的蚁群智能水声网络路由协议(Q-learning ant colony optimization, QACO). 协议包括路由行为和智能决策部分, 在路发现和维护阶段, 依靠网络智能蚂蚁进行网络拓扑环境的构建和节点之间的信息交换以及网络的维护. 在Q学习阶段, 通过定量化节点能量和深度以及网络传输延时学习特征作为折扣因子和学习率, 以延长网络的生命周期, 降低系统能耗和延时. 最后通过水声网络环境进行仿真, 实验结果表明QACO在能耗、延迟和网络生命周期方面都优于基于Q学习辅助的蚁群算法(Q-learning aided ant colony routing protocol, QLACO)和基于 Q-learning 的节能和生命周期感知路由协议(Q-learning-based energy-efficient and lifetime-aware routing protocol, QELAR)和基于深度路由协议 (depth-based routing, DBR)算法.     

A secure alternate path routing in sensor networks

This paper presents a secure alternate path routing in sensor networks. Our alternate path scheme makes the routing protocol resilient in the presence of malicious nodes that launch selective forwarding attacks. SeRINS (a Secure alternate path Routing IN Sensor networks) detects and isolates the compromised nodes, which try to inject inconsistent routing information, from the network by neighbor report system. In neighbor report system, a node’s route advertisement is verified by its surrounding neighbor nodes so that the suspect node is reported to the base station and is excluded from the network. Simulation experiments show that SeRINS is resilient in the presence of several compromised nodes which launch selective forwarding attacks, and robust by excluding the compromised nodes which inject inconsistent routing information from the network.     

MANET网络中一种节约能量的负载平衡路由

节约能量的负载平衡路由(PELBR)协议是针对无线Adhoc网络提出的一种路由协议。PELBR定义了一种称为节点活动度的标准,节点活动度定义了节点的通信负载。在PELBR中,路由发现过程中目标节点从候选路径中寻找负载最小,即路径上活动度之和最小的路径;而节点在传送数据时适当调节能量以保证网络拓扑结构的连接性,同时节约电池能量从而延长节点的工作时间。     

IPv6网络中一种基于路由协议的PMTU发现机制

提出了一种IPv6网络中基于路由协议的PMTU发现机制。通过对路由协议的扩展,在原有的路由信息中携带路由的MTU值,使路由的MTU在网络中传递,执行PMTU探测的主机最多只需要向其第一跳路由器发送一次探测包。使用ns2仿真工具模拟测试和在实际设备上进行拓扑及业务测试的实验结果表明,该机制可行,与传统PMTU机制相比,在探测次数及探测带来的连接时延上有极大的改进。     

一种快速而高效的MANET路由协议

MANET是一种由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。由于其拓扑的动态性,其路由协议与其它传统网络有着很大的区别。传统的MANET路由协议都在路由破裂后由源节点重新建路,存在较大建路延时,极大阻碍了信息的实时传送。为此,该文提出了一种支持实时传送的路由协议,该协议通过在路由破裂处用最快方法重新建路来实现数据的实时传输。模拟结果表明这种协议具有较好的网络性能。     

IE2M: Design of intellectual energy efficient multicast routing protocol for ad-hoc network

In this paper, an intellectual energy efficient multicast routing protocol is proposed. It achieves enhanced performance over On-Demand Multicast Routing Protocol (ODMRP). The proposed protocol finds energy efficient multicast routes from source node to a group of receivers. Multicast mesh creation involves two phases: a Join Query (J-Q) phase and a Join Reply (J-R) phase. The J-Q phase initiates a route discovery process to find routes of the multicast group. In J-R phase, different routes of the multicast groups are set up. In the proposed protocol, we modify ODMRP and introduce fuzzy inference system to deal with imprecise and partial information during the route discovery phase. The decision maker uses two fuzzy variables such as energy and distance for evaluating reward as an output parameter of each multicast route. This output parameter helps to distinguish different multicast route and it also helps to reduce the effect of mutual interference between routes. The proposed protocol is simulated using the NS-2 simulator. The performance of the proposed protocol is compared with existing multicast routing protocols, and results outperform existing protocols in terms of several network metrics.