Received Route Request Packets Research Articles

A COMPREHENSIVE SURVEY ON DETECTING BLACK HOLE ATTACK IN MOBILE AD-HOC NETWORK (MANET)

The infrastructure-less nature and mobility of nodes in mobile ad-hoc network (MANET) make it to be very susceptible to various attacks. Besides, owing to its flexibility and simplicity, there is no predefined time or permission set for nodes to leave or join the network and each node can act as a client or server. Nevertheless, securing communication between nodes has become a challenging problem than in other types of network. Attacks in MANET range into different categories. Black hole attack is one of the attacks that has been addressed by many researchers in the recent years. It does occur when a harmful mobile node called black hole becomes a part of the network and tries to use its malicious behaviors by sending fake route reply packets (RREP) for any received route request packets (RREQ). When these faked packets arrive to the source node, it does reply to them by sending data packet via the established route. Once the packets are received by the black hole, it drops them before reaching the destination. Hence, preventing the source node from reaching the intended destination. In this paper, we present an overview of a wide range of techniques suggested in the literature for detecting and preventing black hole attacks in mobile ad hoc network. Additionally, the effect of each approach on the network performance is also presented.

IJARCCE - Computer and Communication Engineering

2 Abstract: Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. (1 to 3). In this paper, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge.(4) We also define a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.

MANET 환경에서 노드 상태 제어 알고리즘

MANET(Mobile Ad-hoc Networks)에서 참여 노드 수가 증가할수록 경로탐색을 위해 브로드캐스팅되는 제어메시지가 폭발적으로 증가하게 되어 네트워크 성능을 감소시킨다. 본 논문에서는 이런 브로드캐스트 스톰 문제(broadcast storm problem)의 발생 확률을 낮춰 네트워크 성능을 높일 수 있는 노드 상태 제어 알고리즘을 제안한다. In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.

A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. In this paper, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. We also define a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.

A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), the network topology changes frequently and unpredictably due to the arbitrary mobility of nodes. This feature leads to frequent path failures and route reconstructions, which causes an increase in the routing control overhead. The overhead of a route discovery cannot be neglected. Thus, it is imperative to reduce the overhead of route discovery in the design of routing protocols of MANETs. One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good performance and less overhead. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. This paper focuses on a probabilistic rebroadcast protocol based on neighbor coverage to reduce the routing overhead in MANETs. Keywords - Mobile Ad Hoc Networks, Neighbor Coverage, and Network Connectivity, Probabilistic Rebroadcast, Routing Overhead, AODV.

A dynamic probabilistic route discovery for mobile ad hoc networks

Blind flooding has been extensively used in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus, excessive packet collisions in the network. Such a phenomenon induces what is known as the broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput.

Adjusted probabilistic route discovery in mobile ad hoc networks

Conventional on-demand route discovery methods in mobile ad hoc networks (MANET) employ simple flooding method, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This paper proposed two new probabilistic methods that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation analysis reveals that equipping AODV with an appropriate probabilistic route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput when compared with the traditional AODV.