Mobile ad hoc networks are particularly vulnerable to denial of service （DOS） attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. T...Mobile ad hoc networks are particularly vulnerable to denial of service （DOS） attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called AA hoc Flooding Attack（AHFA）, is that intruder broadcasts mass Route Request packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed AM hoc Flooding Attack, we develop Flooding Attack Prevention （FAP）, a genetic defense against the AM hoc Flooding Attack. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder record the rate of Route Request. Once the threshold is exceeded, nodes deny any future request packets from the intruder. The results of our implementation show FAP can prevent the AM hoe Flooding attack efficiently.展开更多
A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structure...A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.展开更多
Ad Hoc网络是由一组移动节点在没有任何现存网络基础设施或是集中管理的情况下形成的动态网络。论文利用NS2网络仿真软件,在不同的网络负载、移动性和网络规模等条件下,分析比较AdHoc网络的四种路由协议DSR、AODV、DSDV和洪泛协议的性...Ad Hoc网络是由一组移动节点在没有任何现存网络基础设施或是集中管理的情况下形成的动态网络。论文利用NS2网络仿真软件,在不同的网络负载、移动性和网络规模等条件下,分析比较AdHoc网络的四种路由协议DSR、AODV、DSDV和洪泛协议的性能。仿真结果表明由于各协议适用范围不同,因此可根据具体情况自适应地进行协议选择。展开更多
移动Adhoc网络路由质量受到很多因素的影响.目前,多数移动Adhoc网络路由协议利用单一跳数或其他基准作为路由产生的判据,使得协议整体性能的改善比较困难.提出一种考虑节点能量、通信干扰、丢失率和移动性(energy,interference,communic...移动Adhoc网络路由质量受到很多因素的影响.目前,多数移动Adhoc网络路由协议利用单一跳数或其他基准作为路由产生的判据,使得协议整体性能的改善比较困难.提出一种考虑节点能量、通信干扰、丢失率和移动性(energy,interference,communication drop rate and mobility,简称EIDM)的综合选路基准.使用自适应权重,该基准能够根据网络状态调节各因子的作用.模拟实验结果显示,EIDM很好地减缓了热点效应.展开更多
传统的基于位置信息的路由算法往往采用分布式预测机制,可靠性不高,特别当源节点不知道目的节点位置时只能采用洪泛策略,增大了通信开销。本文提出一种基于位置信息的自适应路由机制LAAR(Location-based A-daptive Ad hoc Routing)。LAA...传统的基于位置信息的路由算法往往采用分布式预测机制,可靠性不高,特别当源节点不知道目的节点位置时只能采用洪泛策略,增大了通信开销。本文提出一种基于位置信息的自适应路由机制LAAR(Location-based A-daptive Ad hoc Routing)。LAAR采用分层的体系结构获得全网一致的拓扑视图,消除分布式预测带来的不确定性,通过路由前的位置查询避免洪泛。LAAR综合利用多种位置更新机制,在限制网络开销的同时保障位置信息的准确性。LAAR的自适应调节机制将节点的运动状态与路由发现过程结合,实现对目的节点的动态跟踪,提高路由性能。仿真结果表明,随着节点移动速度的增加,LAAR能够获得比LAR更小的控制开销;同时在节点密度较大情况下,LAAR能获得更高的分组投递率。展开更多
基金This project was supported by the National"863"High Technology Development Programof China (2003AA148010) Key Technologies R&D Programof China (2002DA103A03 -07)
文摘Mobile ad hoc networks are particularly vulnerable to denial of service （DOS） attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called AA hoc Flooding Attack（AHFA）, is that intruder broadcasts mass Route Request packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed AM hoc Flooding Attack, we develop Flooding Attack Prevention （FAP）, a genetic defense against the AM hoc Flooding Attack. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder record the rate of Route Request. Once the threshold is exceeded, nodes deny any future request packets from the intruder. The results of our implementation show FAP can prevent the AM hoe Flooding attack efficiently.
文摘A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.
基金Supported by the National Natural Science Foundation of China under Grant No.60673171the National Basic Research Program of China under Grant No.2006CB303006~~
文摘移动Adhoc网络路由质量受到很多因素的影响.目前,多数移动Adhoc网络路由协议利用单一跳数或其他基准作为路由产生的判据,使得协议整体性能的改善比较困难.提出一种考虑节点能量、通信干扰、丢失率和移动性(energy,interference,communication drop rate and mobility,简称EIDM)的综合选路基准.使用自适应权重,该基准能够根据网络状态调节各因子的作用.模拟实验结果显示,EIDM很好地减缓了热点效应.
文摘传统的基于位置信息的路由算法往往采用分布式预测机制,可靠性不高,特别当源节点不知道目的节点位置时只能采用洪泛策略,增大了通信开销。本文提出一种基于位置信息的自适应路由机制LAAR(Location-based A-daptive Ad hoc Routing)。LAAR采用分层的体系结构获得全网一致的拓扑视图,消除分布式预测带来的不确定性,通过路由前的位置查询避免洪泛。LAAR综合利用多种位置更新机制,在限制网络开销的同时保障位置信息的准确性。LAAR的自适应调节机制将节点的运动状态与路由发现过程结合,实现对目的节点的动态跟踪,提高路由性能。仿真结果表明,随着节点移动速度的增加,LAAR能够获得比LAR更小的控制开销;同时在节点密度较大情况下,LAAR能获得更高的分组投递率。
