Single-Adversary Relaying Attack Defense Mechanism in Wireless Ad Hoc Networks

被引:1
|
作者
Yun, Ji-Hoon [1 ]
Park, Min-Ho [2 ]
机构
[1] Seoul Natl Univ Sci & Technol, Dept Elect & Informat Engn, Seoul 139743, South Korea
[2] Soongsil Univ, Sch Elect Engn, Seoul, South Korea
关键词
Wireless ad hoc network; Wormhole attack; Relaying attack; WORMHOLE ATTACKS;
D O I
10.1007/s11277-013-1163-3
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
There have been many security protocols to provide authenticity and confidentiality in wireless ad hoc networks. However, they fail to defend networks against relaying attack in which attacker nodes simply broadcast received packets without compromising any legitimate nodes. Wormhole attack is a representative example of relaying attack, in which a pair of attacker nodes relay received packets to each other and selectively drop them. The wormhole attack is known to ruin routing and communication of a network considerably, however, is not very straightforward to be accomplished due to the pairwise nature. In this paper, we introduce two new types of relaying attack, called teleport and filtering attacks that require a single attacker node only for accomplishment. We describe their accomplishment conditions and impacts on the network performance in a formal manner. We then propose a countermeasure framework against these attacks called Single-Adversary Relaying Attack defense Mechanism (SARAM), which is composed of a bandwidth-efficient neighbor discovery customized for multi-hop environments and neighbor list management combined into an on-demand ad hoc routing protocol. SARAM does not require any special hardware such as location-aware equipments and tight synchronized clocks, thus is cost-efficient as well. We show via ns-2 simulation that the new relaying attacks deteriorate the network performance significantly and SARAM is effective and efficient in defending a network against these attacks.
引用
收藏
页码:2519 / 2532
页数:14
相关论文
共 50 条
  • [21] Incentive Mechanism for Multiuser Cooperative Relaying in Wireless Ad Hoc Networks: A Resource-Exchange Based Approach
    Guopeng Zhang
    Kun Yang
    Peng Liu
    Xiaolong Feng
    Wireless Personal Communications, 2013, 73 : 697 - 715
  • [22] Severity Analysis and Countermeasure for the Wormhole Attack in Wireless Ad Hoc Networks
    Khabbazian, Majid
    Mercier, Hugues
    Bhargava, Vijay K.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (02) : 736 - 745
  • [23] Defending Method Against Jamming Attack in Wireless Ad Hoc Networks
    Ben-Othman, Jalel
    Hamieh, Ali
    2009 IEEE 34TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2009), 2009, : 758 - 762
  • [24] A new kind of Transport Layer attack in Wireless Ad Hoc Networks
    Mnnit, Vishnu K.
    2010 IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND INFORMATION SECURITY (WCNIS), VOL 1, 2010, : 198 - 201
  • [25] A study of on-off attack models for wireless ad hoc networks
    Perrone, L. Felipe
    Nelson, Samuel C.
    2006 1ST WORKSHOP ON OPERATOR-ASSISTED (WIRELESS MESH) COMMUNITY NETWORKS, 2006, : 58 - 67
  • [26] Solution to prevent rushing attack in wireless mobile ad hoc networks
    Tarnilselvan, Latha
    Sankaranarayanan, V.
    2006 INTERNATIONAL SYMPOSIUM ON AD HOC AND UBIQUITOUS COMPUTING, 2007, : 40 - +
  • [27] Prevention of cooperative black hole attack in wireless ad hoc networks
    Ramaswamy, S
    Fu, HR
    Sreekantaradhya, M
    Dixon, J
    Nygard, K
    ICWN'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS, 2003, : 570 - 575
  • [28] A New Defense Scheme against DDoS Attack in Mobile Ad Hoc Networks
    Arunmozhi, S. A.
    Venkataramani, Y.
    ADVANCED COMPUTING, PT III, 2011, 133 : 210 - 216
  • [29] Wireless Ad Hoc Networks
    Misra, Sudip
    Chen, Hsiao-Hwa
    Guizani, Mohsen
    Bhargava, Bharat K.
    IET COMMUNICATIONS, 2009, 3 (05) : 685 - 688
  • [30] DELAR: Device/energy/load aware relaying in heterogenous wireless ad hoc networks
    Liu, W
    Zhang, YC
    Lou, WJ
    Fang, YG
    MILCOM 2004 - 2004 IEEE MILITARY COMMUNICATIONS CONFERENCE, VOLS 1- 3, 2004, : 1303 - 1309