移动自组网的安全路由协议

移动自组网（MANET）是自治的无基础设施的网络,它通过IP路由支持多跳无线通信,它被用于没有基础设施存在的动态变化的场景。多数自组网路由协议利用节点之间固有特性即相邻节点的信赖关系进行协作转发数据包。这种信赖模型使得恶意节点利用插入错误的路由更新、重放过时的路由信息、改变路由更新、或广播不正确的路由信息来瘫痪自组网。针对自组网的缺陷提出了一种认证路由策略来解决这些问题,同时也列举了仿真实验结果。     

基于无线自组织网络的TCP Freeze-Probing改进协议

传统的TCP协议在有线网络中能够良好地工作,但用于无线自组织网络时则性能有所下降.其原因在于,传统的TCP协议无法分辨网络丢包原因,如网络拥塞、链路断开、信道错误或者链路改变.为了提高TCP协议在无线自组织网络中的性能,提出了一种TCP协议的改进方案TCP Freeze-Probing.该方案是一种端到端方法,不需要网络中间节点的反馈合作同时,提出了一种基于TCP Freeze-Probing的吞吐量模型并利用仿真对模型进行了验证.分析和仿真结果表明,该方案能够有效地改进TCP在无线自组织网络的性能.     

Using particle swam optimization for QoS in ad-hoc multicast

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Multicasting plays a very important role in the application of ad hoc networks. As the number of participants increases, scalability of the multicast protocol becomes an important issue. When considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the existing multicast routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a multicast routing protocol which tries its best to meet the variation of behavior of network topology and satisfy QoS requirements of specific multimedia traffic using particle swam optimization (PSO) in the volatile environments of a MANET. Meanwhile, a priority scheduler with PSO is also proposed to make scheduling decisions so that the packet loss rate can be further reduced. The results of a series of simulations exhibit the practicability and feasibility of our protocol.     

Prevention of Black Hole Attack in Multicast Routing Protocols for Mobile Ad-Hoc Networks Using a Self-Organized Public Key Infrastructure

ABSTRACT

A mobile ad-hoc network (MANET) is an autonomous system of mobile nodes connected by wireless links in which nodes cooperate by forwarding packets for each other thereby enabling communication beyond direct wireless transmission range. Example applications include battlefield communication, disaster recovery operations, and mobile conferencing. The dynamic nature of ad-hoc networks makes them more vulnerable to security attacks compared with fixed networks. Providing security in mobile ad-hoc networks has been a major issue in recent years. Most of the secure routing protocols proposed by researchers need a centralized authority or a trusted third party to provide authentication. This destroys the self-organizing nature of ad-hoc networks. Black Hole attack is one of the routing attacks that occur in MANETs. In this attack, a malicious node uses the routing protocol to advertise itself as having the shortest path to the node whose packets it wants to intercept. In this article, we propose an enhanced certificate based authentication mechanism, where nodes authenticate each other by issuing certificates to neighboring nodes and generating public key without the need of any online centralized authority. The proposed scheme uses Multicast Ad-hoc On Demand Distance Vector Routing (MAODV) protocol as a support for certification. The effectiveness of our mechanism is illustrated by simulations conducted using network simulator ns-2.     

Ad Hoc网络链路质量QoS多路径按需路由协议

传统的MANET路由协议是基于最小跳数的路由,没有考虑链路质量,不能适应网络拓扑的动态变化。针对这一问题,提出了一种Ad Hoc网络链路质量QoS多路径按需路由协议（QMORP）。QMORP采用移动预测来计算链路的生存时间,应用能量模型获得链路的剩余能量,综合链路生存时间和剩余能量两种因素来计算链路质量。选择链路质量大的路径转发分组。仿真实验表明,相比AOMDV协议,QMORP协议提高了网络的生命周期,降低了网络的平均端对端延迟、提高了网络的发包率和吞吐率。     

Securing Cooperative Ad-Hoc Networks Under Noise and Imperfect Monitoring: Strategies and Game Theoretic Analysis

In cooperative ad-hoc networks, nodes belong to the same authority and pursue the common goals, and will usually unconditionally help each other. Consequently, without necessary countermeasures, such networks are extremely vulnerable to insider attacks, especially under noise and imperfect monitoring. In this paper, we present a game theoretic analysis of securing cooperative ad-hoc networks against insider attacks in the presence of noise and imperfect monitoring. By focusing on the most basic networking function, namely routing and packet forwarding, we model the interactions between good nodes and insider attackers as secure routing and packet forwarding games. The worst case scenarios are studied where initially good nodes do not know who the attackers are while insider attackers know who are good. The optimal defense strategies have been devised in the sense that no other strategies can further increase the good nodes' payoff under attacks. Meanwhile, the optimal attacking strategies and the maximum possible damage that can be caused by attackers have been discussed. Extensive simulation studies have also been conducted to evaluate the effectiveness of the proposed strategies     

使用模糊线性回归的自组网有效洪泛

简单地描述了自组网的特点,对相关工作进行了比较;说明了大多数预测方法不适合自组网应用;为了保持拓扑稳定,文中采取了一个模糊线性回归模型用于预测长寿命链路;提出了一个路径可靠性和路径寿命的分析建模架构.分析结果表明,基于长寿命路径选路的路由协议可靠性更好,寿命更长.仿真结果也表明,和AODV路由协议相比,该协议有高的分组递交率和低的控制开销.     

MANET中一种基于移动预测的unicast路由协议

MANET是由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。它没有固定基站,也没有作为控制管理中心的节点主机。由于其拓扑的动态性,其路由协议不同于其它网络。为更有效支持MANET的应用,文章提出了一种基于移动预测下的Unicast路由。该协议采用GPS定位机制,通过预测路径有效连接时间来实现。模拟结果表明这种方案能获得较好的网络性能和较低的控制开销。     

基于最近社交圈的社交时延容忍网络路由策略

无稳定拓扑使时延容忍网络(delay tolerant networks,DTN)路由协议主要通过增加冗余数据包副本提高路由性能.社交网络是DTN的一种典型应用场景,但由于其网络规模相对较大,当网络负载高时,通常的DTN路由不能有效控制数据包副本的数量,从而产生大量丢包导致性能下降.借鉴MANET网络中利用分簇结构控制网络冗余路由数据包的思想,通过分析社交网络中节点的移动模型,定义了在社交关系的约束下,聚合移动规律相近的节点构成最近社交圈的节点簇组成策略.提出了一种基于该分簇结构的分为簇外喷射、簇间转发和簇内传染3个阶段的社交时延网络路由协议.实验证明,这种基于最近社交圈分簇结构的路由能有效地控制冗余数据包副本的产生,并在高网络负载的情况下仍然能够达到较好的性能.     

无线移动自组织网路由协议性能研究

路由是无线移动自组织网的关键技术之一。目前已经提出的MANET路由协议有很多种，因此如何针对一定应用场景选择一个最佳的路由协议，是人们十分关心的一个问题。该文对已经通过IETF认可的三种MANET路由协议：DSR、AODV和OLSR进行了仿真对比分析。设计了大量的场景，通过对路由协议的分组传送率、端到端时延和所选路径长度等指标的比较，得出了在不同的网络环境下MANET最佳路由协议选择方案。仿真中发现同是采用按需的路由发现策略的DSR和AODV在高移动、高负荷的网络环境下的性能存在较大差异，对此原因进行了深入分析，并根据分析对DSR提出了改进方案。     

基于机器学习的移动自组织网络入侵检测方法

移动自组织网络是由无线移动节点组成的复杂分布式通信系统。研究了移动自组织网络的入侵检测问题,采用了一种新型的基于机器学习算法的异常入侵检测方法。该方法获取正常事件的内部特征的相互关系模式,并将该模式作为轮廓检测异常事件。在Ad hoc 按需距离向量协议上实现了该方法,并在网络仿真软件QualNet中对其进行了评估。     

Routing with adaptive path and limited flooding for mobile ad hoc networks

In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this packet until it reaches the destination. It will have large flooding overhead, poor network performance and undesirable battery power consumption. To improve network performance, we design a novel routing protocol called RAPLF (Routing with Adaptive Path and Limited Flooding) for mobile ad hoc networks. Simulation results show that our protocol has better performance especially in packet delivery rate and flooding overhead when compared to similar protocols.     

Genetic-based Fuzzy IDS for Feature Set Reduction and Worm Hole Attack Detection

The wireless ad-hoc networks are decentralized networks with a dynamic topology that allows for end-to-end communications via multi-hop routing operations with several nodes collaborating themselves, when the destination and source nodes are not in range of coverage. Because of its wireless type, it has lot of security concerns than an infrastructure networks. Wormhole attacks are one of the most serious security vulnerabilities in the network layers. It is simple to launch, even if there is no prior network experience. Signatures are the sole thing that preventive measures rely on. Intrusion detection systems (IDS) and other reactive measures detect all types of threats. The majority of IDS employ features from various network layers. One issue is calculating a huge layered features set from an ad-hoc network. This research implements genetic algorithm (GA)-based feature reduction intrusion detection approaches to minimize the quantity of wireless feature sets required to identify worm hole attacks. For attack detection, the reduced feature set was put to a fuzzy logic system (FLS). The performance of proposed model was compared with principal component analysis (PCA) and statistical parametric mapping (SPM). Network performance analysis like delay, packet dropping ratio, normalized overhead, packet delivery ratio, average energy consumption, throughput, and control overhead are evaluated and the IDS performance parameters like detection ratio, accuracy, and false alarm rate are evaluated for validation of the proposed model. The proposed model achieves 95.5% in detection ratio with 96.8% accuracy and produces very less false alarm rate (FAR) of 14% when compared with existing techniques.     

DSR协议下数据包攻击及防御机制

移动Ad—hoc网络又称移动自组网、多跳网络,是一种特殊的、在不借助中心管理的情况下,在有限的范围内实现多个移动终端临时互联的网络。由于Adhoc网络自身的特殊性,其路由协议的设计与传统固定网络有很大不同,而且种类繁多,DSR协议便是其中一种。DSR协议也被称做动态源路由协议,它作为Ad—hoc网络的路由协议之一,最大特点是在发送的每个数据包中放入一个完整的、按序排列的路由信息,并且在传递数据包的过程中依赖着这些路由信息去完成工作。文章主要介绍了Ad—hoc网络中的DSR协议的工作方式,针对其安全性提出一种新的攻击模型——数据包攻击,并通过模拟实验,给出了数据包攻击的检测方法和防御策略,能够成功地发现并有效地阻碍数据包攻击。     

一种基于邻居信任评估的虫洞防御机制

移动adhoc网是一种新型无线移动网络,具有无中心、自组织、拓扑结构变化频繁以及开放式通讯信道等特性,因此adhoc网络下的路由协议所面临的安全问题比有线网环境中更为严重。虫洞攻击就是其中的一种,能够对adhoc网络产生致命的影响。在这种攻击下,网络的路由机制将会紊乱,特别是那些依赖通过接收对方的广播报文进行邻居探测的路由协议。本文首先从虫洞形成的根源上入手,重新定义了邻居的概念,强调了邻居作为节点信息转发第一站的功能。然后根据邻居定义,引入简化的Marsh信任模型,将邻居的以往表现作为信任评估的经验来源,再通过具体公式对邻居关系做出判定。在具体的路由过程中,节点根据信任评估值选取高可信度的邻居作为下一跳的转发节点,从而避免虫洞攻击的危害。为了验证方法的可行性,本文将模型应用于OLSR路由协议中并在NS2中进行了仿真。     

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.     

Video transmission enhancement in presence of misbehaving nodes in MANETs

Mobile Ad-hoc NETworks (MANET) are infrastructureless networks where self-configuring mobile nodes are connected by wireless links. Because of its decentralized operation, these nodes rely on each other to store and forward packets. Video transmission over MANETs is more challenging than over conventional wireless networks due to rapid topology changes and lack of central administration. Most of the proposed MANET protocols assume that all nodes are working within a cooperative and friendly network context. However, misbehaving nodes that exhibit abnormal behaviors can disrupt the network operation and affect the network availability by refusing to cooperate to route packets due to their selfish or malicious behavior. In this paper, we examine the effect of packet dropping attacks on video transmission over MANETs. We also study the effects of mitigation using intrusion detection systems to MANET in presence of video traffic. To the best of our knowledge, this is the first attempt to study multimedia over such environments. We propose a novel intrusion detection system, which is an adaptive acknowledgment scheme (AACK) with the ability to detect misbehaved nodes and avoid them in other transmissions. The aim of AACK scheme is to overcome watchdog weaknesses due to collisions and limited transmission power and also to improve TWOACK scheme. To demonstrate the performance of our proposed scheme, simulation experiments are performed. The results of our experiments show that MPEG4 is more suitable for our simulation environment than H264 video traffic. The simulation results show that AACK scheme provides better network performance with less overhead than other schemes; it also shows that AACK outperforms both TWOACK and watchdog in video transmission applications in the presence of misbehaving nodes.     

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

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

Modeling delay and packet drop in Networked Control Systems using network simulator NS2

Wireless Networked Control Systems (WNCS) are used to implement a control mechanism over a wireless network that is capable of carrying real-time traffic. This field has drawn enormous attention from current researchers because of its flexibility and robustness. However, designing efficient WNCS over Mobile Ad Hoc Networks (MANET) is still a challenging topic because of its less-predictable aspects, such as inconsistent delay, packet drop probability, and dynamic topology. This paper presents design guidelines for WNCS over MANET using the Network Simulator version 2, NS2 software. It investigates the impact of packet delay and packet drop under the AODV and DSR routing protocols. The simulation results have been compared to MATLAB results for validation.     

Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks

Several approaches have been proposed for designing multihop routing protocols in mobile ad hoc networks (MANET). Many of them adopt a method, called flooding, to discover a routing path. Due to the time-varying nature of the route in MANET, the discovered route needs to be dynamically maintained for optimality in terms of traffic load, hop-distance, and resource usage. It is easy to see that flooding incurs significant overhead and hence is inappropriate for the dynamic route maintenance. In this paper we propose a randomized, dynamic route maintenance scheme for adaptive routing in MANET. The scheme makes use of a nomadic control packet (NCP) which travels through the network based on a random walk, and collects its stopovers as a traversal record. The NCP uses the traversal record to probabilistically provide the nodes with clue for routing path updates. From the clue, the nodes can find the routing path update information that is up-to-date and optimal (less-loaded and shorter), thereby adapting to the dynamic network topology and traffic load conditions. We present an analytical model for measuring the effectiveness of NCP in terms of its frequency of visits and probability of finding the clue from the NCP traversal record. The proposed randomized scheme serves as a routing protocol supporting layer and can be easily applied with minimum modifications to the existing on-demand routing protocols such as AODV and DSR. In our experimental study, we modified the AODV protocol to maintain routing paths using NCPs’ traversal record. Simulation results show that NCPs help the routing protocol to notably reduce average end-to-end packet delay with increased route optimality and better control on traffic congestion.