Resisting flooding attacks in ad hoc networks

被引:0
作者
Yi, P [1 ]
Dai, ZL [1 ]
Zhong, YP [1 ]
Zhang, SY [1 ]
机构
[1] Fudan Univ, Dept Comp & Informat Technol, Shanghai 200433, Peoples R China
来源
ITCC 2005: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2 | 2005年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The 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 Ad Hoc Flooding Attack, can result in denial of service when used against on-demand routing protocols for mobile ad hoc networks, such as AODV, DSR. The intruder broadcasts mass Route Request packets or sends a lot of attacking DATA packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed Ad Hoc Flooding Attack, we develop Flooding Attack Prevention (FAP), a generic defense against the Ad Hoc Flooding Attack in mobile ad hoc networks. The FAP is composed of neighbor suppression and path cutoff When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder observe a high rate of Route Request and then they lower the corresponding priority according to the rate of incoming queries. Moreover, not serviced low priority queries are eventually discarded. When the intruder sends many attacking DATA packets to the victim node, the node may cut off the path and does not set up a path with the intruder any more. Mobile ad hoc networks can prevent the Ad Hoc Flooding Attack by FAP with little overhead.
引用
收藏
页码:657 / 662
页数:6
相关论文
共 20 条
[1]  
[Anonymous], 2003, 3561 RFC
[2]  
[Anonymous], 2003, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
[3]  
[Anonymous], 2002, P ACM WORKSH WIR SEC
[4]  
Aura T., 1997, ICICS, V1334, P87
[5]   Self-organized public-key management for mobile ad hoc networks [J].
Capkun, S ;
Buttyán, L ;
Hubaux, JP .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2003, 2 (01) :52-64
[6]  
*CIAC, 1996, INF B
[7]  
Corson S., 1999, RFC 2501. Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations
[8]  
Ferguson P., 1998, 2267 RFC
[9]   SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks [J].
Hu, YC ;
Johnson, DB ;
Perrig, A .
FOURTH IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2002, :3-13
[10]  
HU YC, 2002, P MOBICOM 2002 SEPT