Secure Video Transmission Against Black Hole Attack in MANETs

Secure Video Transmission Against Black Hole Attack in MANETs

M. Umaparvathi, Dharmishtan K. Varughese
DOI: 10.4018/jbdcn.2011100101
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Mobile Adhoc Networks (MANETs) are open to a wide range of attacks due to their unique characteristics like dynamic topology, shared medium, absence of infrastructure, and resource constraints. Data packets sent by a source node may reach destination through a number of intermediate nodes. In the absence of security mechanism, it is easy for an intermediate node to intercept or modify the messages, thus attacking the normal operation of MANET. One such attack is Black hole attack, in which, a malicious node called Black hole node attracts all the traffic of the network towards itself, and discards all the packets without forwarding them to the intended recipients. This paper evaluates the performance of Adhoc on-demand Distance Vector (AODV) and its multi-path variant Adhoc On-demand Multi-path Distance Vector (AOMDV) routing protocols under black hole attack. Non-cryptographic solutions Secure Blackhole AODV (SBAODV) and Secure Blackhole AOMDV (SBAOMDV) have been proposed to mitigate the effect of black hole attack. Through NS-2 simulations, the performance of the proposed protocols with video streaming is analyzed. The results show that the proposed solutions provide better performance than the conventional AODV and AOMDV.
Article Preview
Top

1. Introduction

A Mobile Ad Hoc Network (MANET) is an autonomous system of mobile nodes connected by wireless links to form a communication network. The challenge in the design of protocol architectures for MANETs is to provide a certain level of Quality of Service (QoS) in information transfer using the limited network resources. This design goal is further constrained by the unreliable physical channel, the mobility of the nodes, and the lack of infrastructure for network coordination. To meet the QoS requirements for real-time data communication, some coordination of the channel is needed, but centralized coordination is not feasible in MANETs. Furthermore, since a MANET is a dynamic and distributed entity, the optimal control of MANET should also be dynamic and adaptive.

In a MANET, there are no basic network devices, such as routers or access points. Data transfer among nodes is realized by means of multiple hops. Every node in MANET is not only serving as a single terminal but also acts as a router to establish a route. When a source node intends to transfer data to a destination node, packets are transferred through the intermediate nodes. Thus, searching for and quickly establishing a route from a source to a destination node is an important issue for MANETs. The currently available routing protocols are mainly categorized into proactive routing protocols and reactive routing protocols.

In a proactive routing protocol, every node proactively searches for routes to other nodes. The nodes, periodically, exchange routing messages, in order to ensure the correctness and freshness of the information in the routing table. DSDV (Destination Sequence Distance Vector) and OLSR (Optimized Link State Routing Protocol) are two popular proactive routing protocols for MANETs. Each node in a MANET is limited to a certain power and bandwidth, thus, continuous transmission of routing messages would lead to congestion of the network.

In a reactive routing protocol, a route is searched and established only when two nodes intend to transfer data; and therefore, it is also called an on-demand routing protocol, such as Ad hoc On-Demand Distance Vector (AODV) (Perkins et al., 2003) or Dynamic Source Routing(DSR) (Johnson et al., 2004). A source node generally broadcasts a route request message to the entire network by means of flooding, in order to search for and establish a route to the destination node. The multi-path extension to the well-defined single path routing protocol AODV is referred as Ad hoc On-demand Multi-path Distance Vector (AOMDV). This protocol computes multiple loop-free and link-disjoint paths. Loop freedom is guaranteed by using a notion of “advertised hop-count” in AOMDV.

Most of these routing protocols rely on cooperation between nodes due to the lack of a centralized administration and assume that all nodes are trustworthy and well-behaved. However, in a hostile environment, a malicious node can launch routing attacks to disrupt routing operations. Thus, MANETs often suffer from security attacks because of their specification such as open medium, dynamic topology, lack of central monitoring and management, cooperative algorithms and no clear defense mechanism.

One such active Interruption attack in MANET on-demand routing protocol is the black hole attack, in which, the malicious node waits for the neighbors to initiate a Route Request (RREQ) packet. As the node receives the RREQ packet, it will immediately send a false Route Reply (RREP) packet with a modified higher sequence number. So, the source node assumes that the malicious node is having the fresh route towards the destination. The source node ignores the RREP packet received from other nodes and begins to send the data packets through the malicious node. Thus, the malicious node takes all the routes towards itself. It does not allow forwarding any packet anywhere. This attack is called a black hole as it swallows all data packets (Dokurer, 2006).

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2025): Forthcoming, Available for Pre-Order
Volume 19: 1 Issue (2024)
Volume 18: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 17: 2 Issues (2021)
Volume 16: 2 Issues (2020)
Volume 15: 2 Issues (2019)
Volume 14: 2 Issues (2018)
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing