Cooperative Watchdog in Wireless Ad-Hoc Networks Norihiro SOTA and Hiroaki HIGAKI *

Similar documents
Secure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

Performance Analysis of Aodv Protocol under Black Hole Attack

ComparisonofPacketDeliveryforblackholeattackinadhocnetwork. Comparison of Packet Delivery for Black Hole Attack in ad hoc Network

Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network

Investigation on OLSR Routing Protocol Efficiency

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

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

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV

A DHCPv6 Based IPv6 Autoconfiguration Mechanism for Subordinate MANET

Defending MANET against Blackhole Attackusing Modified AODV

Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS

STUDY AND COMPARISION OF PROACTIVE AND REACTIVE ROUTING PROTOCOL FOR MULTICHANNEL WIRELESS AD-HOC NETWORK

Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS

Performance Evaluation of Active Route Time-Out parameter in Ad-hoc On Demand Distance Vector (AODV)

Routing Protocols in MANET: Comparative Study

Expanding Ring Search for Route Discovery in LOADng Routing Protocol

PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH

An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks

Ms A.Naveena Electronics and Telematics department, GNITS, Hyderabad, India.

Peer to Peer Cooperation for Caching in Wireless Networks

COMPARATIVE STUDY AND ANALYSIS OF AODTPRR WITH DSR, DSDV AND AODV FOR MOBILE AD HOC NETWORK

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols

Detecting Malicious Nodes For Secure Routing in MANETS Using Reputation Based Mechanism Santhosh Krishna B.V, Mrs.Vallikannu A.L

Recent Researches in Communications, Information Science and Education

Specification-based Intrusion Detection. Michael May CIS-700 Fall 2004

Improving Performance in Ad hoc Networks through Location based Multi Hop Forwarding

Impact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET

CAODV Free Blackhole Attack in Ad Hoc Networks

CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING

Security Enhancement of AODV Protocol for Mobile Ad hoc Network

Power aware Multi-path Routing Protocol for MANETS

An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks

An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks

Prevention of Black Hole Attack in AODV Routing Algorithm of MANET Using Trust Based Computing

A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks

Local Recovery of Routes for Reliability using Backup Nodes in MANETs

Performance Analysis of MANET Routing Protocols OLSR and AODV

Performance Analysis of AODV Routing Protocol with and without Malicious Attack in Mobile Adhoc Networks

Variable Length and Dynamic Addressing for Mobile Ad Hoc Networks

Computation of Multiple Node Disjoint Paths

(INTERFERENCE AND CONGESTION AWARE ROUTING PROTOCOL)

Impact of Hello Interval on Performance of AODV Protocol

Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1

Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network

Cooperative Caching in Wireless P2P Networks. Aseel Nadhum Kadhum The Islamic University College

Figure 1: Ad-Hoc routing protocols.

Modified Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network

Cooperative Reputation Index Based Selfish Node Detection and Prevention System for Mobile Ad hoc Networks

3. Evaluation of Selected Tree and Mesh based Routing Protocols

Gateway Forwarding Strategies in Ad hoc Networks

Secure and Efficient Routing Mechanism in Mobile Ad-Hoc Networks

Gateway Forwarding Strategies for Ad hoc Networks

Beacon Update for Greedy Perimeter Stateless Routing Protocol in MANETs

DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET

CASER Protocol Using DCFN Mechanism in Wireless Sensor Network

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model

Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV

AODV-PA: AODV with Path Accumulation

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1

A Novel Hybrid Routing Protocol for Mobile Adhoc Network

Detection and Removal of Black Hole Attack in Mobile Ad hoc Network

Research Paper GNANAMANOHARAN ET AL., INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGY E-ISSN

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks

CSMA based Medium Access Control for Wireless Sensor Network

Review on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks

Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks

Link Stability with Energy Aware Ad Hoc on Demand Multipath Routing Protocol in Mobile Ad Hoc Networks

A Study on Issues Associated with Mobile Network

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario

On Demand secure routing protocol resilient to Byzantine failures

Measure of Impact of Node Misbehavior in Ad Hoc Routing: A Comparative Approach

Improved Performance of Mobile Adhoc Network through Efficient Broadcasting Technique

An Efficient Proactive Routing Method for Mobile Ad Hoc Networks using Peer-to-Peer and Cellular Communication System

Performance of New Broadcast Forwarding Criteria in MANET

Performance Comparison of AODV, DSDV and DSR Protocols in Mobile Networks using NS-2

DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL

Glasgow eprints Service

Performance Analysis of DSR Routing Protocol With and Without the Presence of Various Attacks in MANET

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

A NOVEL APPROACH OF AODV FOR STABILITY AND ENERGY EFFICIENT ROUTING FOR MANET USING IPV6

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET

Analysis of Multiple Trees on Path Discovery for Beacon-Based Routing Protocols

A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network

A Multipath AODV Reliable Data Transmission Routing Algorithm Based on LQI

A Simple Sink Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks

Comparison of Various Routing Protocols & Brief of MANET

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

Reducing Routing Overhead For Multimedia Traffic in Manet Using Rebroadcast Probability

Considerable Detection of Black Hole Attack and Analyzing its Performance on AODV Routing Protocol in MANET (Mobile Ad Hoc Network)

Aanchal Walia #1, Pushparaj Pal *2

Maharishi Markandeshwar University

COMPARISON OF DSR PROTOCOL IN MOBILE AD-HOC NETWORK SIMULATED WITH OPNET 14.5 BY VARYING INTERNODE DISTANCE

Transcription:

2017 2nd International Conference on Computer, Network Security and Communication Engineering (CNSCE 2017) ISBN: 978-1-60595-439-4 Cooperative Watchdog in Wireless Ad-Hoc Networks Norihiro SOTA and Hiroaki HIGAKI * Department of Robotics and Mechatronics Tokyo Denki University 5 Senju-Asahimachi, Adachi-ku, Tokyo, Japan *Corresponding author Keywords: Ad-Hoc networks, Fault-Tolerant wireless networks, Byzantine failure, Cooperative watchdog, Protocol, Ad-Hoc routing. Abstract. For fault-tolerant wireless ad-hoc networks, detection and notification of failure of intermediate wireless nodes are critical. Until now, various failure detection and notification methods for recovery such as timeout and watchdog have been proposed for stop failure and Byzantine failure restricted to different data message transmissions. In order to avoid desperate cases such that correctly working wireless intermediate nodes are inappropriately taken away from the wireless multihop transmission routes due to malicious failure notification, this paper proposes a novel cooperative watchdog method. Here, not only the previous-hop intermediate wireless nodes as in the conventional watchdog method but also another neighbor wireless node observe transmissions of both data messages and control messages such as failure notification to detect failure of an intermediate wireless node. This paper also proposes an ad-hoc routing protocol to determine both a sequence of intermediate wireless nodes and additional observing wireless nodes for the cooperative watchdog. Introduction In mobile wireless ad-hoc networks (MANETs) and wireless sensor networks, data messages are transmitted according to wireless multihop transmissions where each intermediate wireless nodes along the wireless multihop transmission route forwards them from the source wireless node to the destination one. Such wireless multihop networks consist of numbers of wireless nodes. Hence, it is impossible to operate such wireless multihop networks continuously without failure detection, notification and recovery mechanisms. That is, higher resilient wireless multihop networks are required. Until now, various techniques for fault-tolerant distributed systems such as distributed failure detection, notification and recovery algorithms and systems have been proposed [1]. For wireless multihop networks, only a naive watchdog method and its slight extensions have been proposed. Here, almost only the stop failure model in which failed wireless nodes become silent and never transmit any data and control messages is supported. Even though some methods support the Byzantine failure model, desirable behavior such as only erroneous data messages are transmitted is assumed. As discussed in this paper, erroneous and/or malicious data message transmissions deviated from the application protocols and erroneous and/or malicious failure detection and notification transmissions are required to be supported. This paper proposes a novel cooperative watchdog method and designs a data message transmission protocol with an extension of the Byzantine failure detection and notification and a routing protocol for detection of watchdoggable wireless multihop transmission routes based on flooding based ad-hoc routing protocols such as AODV [3]. Related Works Suppose a wireless multihop transmission route s d R N 0 N N n N : = ( = )... ( = ) from a source wireless node N s to a destination one N d in a wireless multihop network such as a mobile wireless ad-hoc network and a wireless sensor network. If one of the intermediate wireless nodes Nf (0 < 118

f < n) is detected to be failed by one of its neighbor wireless nodes, a failure notification message is transmitted to the source node N s and another wireless transmission route R' without N f is searched and detected. Then, data messages are transmitted through not R but R '. The Byzantine failed intermediate wireless nodes in a wireless multihop transmission route might transmits different data messages from those they have received to their next-hop wireless nodes and might transmits data messages to their next- hop wireless nodes even though they have not yet received any messages from their previous-hop wireless nodes. For such problems, some watchdog methods by the previous-hop nodes have been proposed [2]. If the wireless transmissions are based on the disk model, the transmitted data message from an intermediate node Ni to its next-hop wireless node Ni+1 is overheard by its previous-hop node Ni 1. If Ni transmits a different data message m' to Ni+1 from m that Ni has received from Ni 1, Ni 1 detects the failure of Ni by receipt of m' different from m. That is, the Byzan- tine failure in Ni is detected by Ni 1 by the comparison of data messages received and transmitted by Ni. On detect the failure of an intermediate wireless node Ni, a wireless multihop transmission of a failure notification message F not to the source node N s is initiated by Ni-1, On receipt of the F not, N s searches a wireless multihop transmission route R' to the destination wireless node N d without the failed intermediate wireless node Ni. Until now, the failure detection is assumed to be correctly done in any intermediate wireless node. However, the failed intermediate wireless node Ni 1 might erroneously detect a failure of its neighbor wireless node especially its next-hop intermediate wireless node Ni and initiate the transmission of the failure notification control message by transmission of a failure notification message F not of Ni to its previous-hop wireless node Ni 2 even though Ni does not fail. Since it is impossible for Ni 2 to find the F not is transmitted by Ni 1 erroneously, Ni 2 and the other intermediate wireless nodes forward the message to their previous-hop wireless nodes along R. Here, the source node is notified for re-quirement of rerouting due to failure not in Ni 1 but in Ni. Hence, newly detected wireless multihop transmission route surely excludes not Ni 1 but Ni, which is a serious problem to be solved. The failure notification control message F not of Ni transmitted by Ni 1 is also received by Ni. Hence, it can detect the erroneous or malicious transmission of F not. In order to notify the failure of Ni 1 to N s, an additional wireless transmission route from Ni to N s without Ni 1 is required. In addition, since N s receives two different failure notification messages from Ni and Ni 1, N s is required to select one of them for recovery. Proposal In order to solve the problem discussed in the previous subsection, that is, under the 1-simultaneous Byzantine failure assumption, one of the intermediate wireless nodes along a wireless multihop transmission route might erroneously or maliciously transmits a failure notification control message, this paper proposes a cooperative watchdog method with the help of a neighbor wireless node Oi of Ni 1 and Ni as shown in Figure 1. Here, a neighbor watchdog wireless node Oi is within the wireless transmission ranges of both Ni 1 and Ni. Hence, Oi overhears the data messages transmitted both from Ni 1 to Ni and from Ni to Ni+1. Hence, same as Ni 1, Oi also detects the failure of Ni by comparison of data messages transmitted from Ni 1 to Ni and from Ni to Ni+1. Therefore, even if Ni 1 erroneously or maliciously transmits a failure notification message F not of Ni to Ni 2, Oi detects that the F not message of Ni is erroneously or maliciously transmitted while Ni correctly works. 119

Figure 1. Cooperative Watchdog Neighbor Wireless Nodes. In cases that Oi detects the erroneous transmission of the F not message, Oi should prevent the wireless multihop transmission of F not of Ni to N s and initiate the wireless multihop transmission of F not of Ni 1 since Oi has detected the failure of Ni 1. Hence, a control message F not for notification of failure of Ni 1 is transmitted from Oi to N s through Ni 2. However, Ni 2 is not always a neighbor wireless node of Oi and the F not message is required to be transmitted not through the failed intermediate wireless node Ni 1. In order to realize the later discussed lower overhead route detection based only on the neighbor node information in each wireless node, Oi and Ni 2 are required to be 1-hop neighbor or 2-hop neighbor through an intermediator wireless nodeii. The role of Ii is only forwarding the F not message from Oi to Ni 2. Now, we discuss the procedure in wireless nodes Ni 1, Ni, Oi and Ii for detection and notification of the 1-simultaneous Byzantine failure of one of these nodes to Ni 2. In the following discussion, the F not message from Oi is transmitted to Ni 2 through Ii; however, almost the same procedure is possible to be applied without the intermediator node Ii. First, in the cases free from the Byzantine failures of all the intermediate, the neighbor watchdog and the intermediator wireless nodes, a data message m is transmitted through the wireless transmission route R according to the forward of m by the intermediate wireless nodes Ni. There are no additional control message is required to be transmitted. In cases that the intermediate wireless node Ni fails according to the Byzantine failure model, the data message m forwarded from Ni 1 to Ni is not transmitted from Ni to Ni+1, a different data message m' from m is transmitted from Ni to Ni+1 or a data message m'' is transmitted from Ni to Ni+1 even though no data message is transmitted from Ni 1 to Ni. Anyway, as shown in Figure 2, both Ni 1 and the neighbor watchdog wireless node Oi detect the difference of data messages transmitted through the wireless links from Ni 1 to Ni and from Ni to Ni+1. At this time, the same failure notification control messages F not for the failure of Ni are transmitted from Ni 1 to Ni 2 and from Oi to Ni 2 through Ii. Thus, Ni 2 receives these two F not messages. Figure 2. Detection of Failure in Ni. 120

In cases that Ni 1 transmits a failure notification message F not for Ni to Ni 2 though Ni works correctly, Ni 1 fails according to the Byzantine failure model as shown in Figure 3. Due to the 1-simultaneous Byzantine failure assumption, Ni does not fail. Oi detects that Ni 1 transmits the F not message for Ni to Ni 2 though Ni does not fail by overhearing the transmitted data and control messages. Thus, Oi transmits a failure notification message F not for Ni 1 to Ni 2 through Ii. Figure 3. Detection of Failure in Ni 1. Same as the previous cases, even though Ni does not fail and works correctly, Oi erroneously detects the failure of Ni and notifies it to Ni 2 through Ii as shown in Figure 4. Due to the 1- simultaneous Byzantine failure assumption, Ni 1 does not fail. Ni 1 detects that Oi transmits a failure notification control message F not for Ni though Ni does not fail by overhearing the transmitted data and control messages. Then, Ni 1 transmits a failure notification message F not for Oi to Ni 2. Thus, Ni 2 receives two different failure notification messages F not for Ni from Oi and for Oi from Ni 1. Finally, in cases that Ni does not fail and one of Oi and Ni 1 fails according to the Byzantine failure model and transmits a failure notification control message F not for the other to Ni 2. Here, the correct wireless node detects the erroneous or malicious transmission of the failure notification control message F not from the failed one. Thus, it transmits another failure notification control message F not to Ni 2. Hence, Ni 2 receives two different F not messages for Ni 1 and Oi. Figure 4. Detection of Failure in Watchdog Neighbor Wireless Nodes. The following Table 1 summarizes the above discussion. If one of the wireless nodes Ni 1, Ni and Oi fails, two failure notification control message F not from Oi and Ni 1 are transmitted to Ni 2. Thus, when Ni 2 receives one F not message for one of the wireless nodes Ni 1, Ni and Oi from Ii or Ni 1, it waits for receiving another F not message. Then, Ni 2 determines the really failed wireless node in accordance with Table 1 and transmits a composite failure notification control message to Ni 3, which is transmitted to N s along R for re-routing for the removal of the failed wireless node. 121

Table 1. Failure Node Determination in Ni 2. Failure Node in Fnot from Ni 1 Failure Node in Fnot from Oi Failure Node Ni Ni Ni Ni Ni 1 Ni 1 Oi Ni Oi Oi Ni 1 Ni 1 or Oi Evaluation In this section, we evaluate the effect on the route detection ratio by the restriction on the wireless communication links in the proposed method in simulation experiments. Additionally 1,000 20,000 wireless nodes are randomly distributed in the 600m 600m simulation area whose wireless transmission ranges are 10m. Figure 5 shows the simulation results. The x-axis represents the numbers of wireless nodes, y- axis represents the distance from the source wireless node to the destination one, and z-axis represents the successful route detection ratio. For comparison, the route detection ratio in AODV is also evaluated. In both method, the route detection ratio monotonically increases according to the number of wireless nodes and is almost independent of the distance from the source wireless node to the destination one. In highly dense and sparse distribution of wireless nodes environment, the route detection ratio is almost constant. In the middle range, the route detection ratio steeply changed. In AODV, the threshold of high route detection ratio is 8,000 and the threshold of low route detection ratio is 6,000. On the other hand, in the proposed method, the threshold of high route detection ratio is 11,000 and the threshold of low route detection is 6,000. Thus, in the range 8,000 11,000, the proposed method reduces the route detection ratio, which is almost only the disadvantage of the proposed method. The detection, notification and recovery of the Byzantine failed wireless nodes are critical technique for achieving the fault-tolerant wireless multihop networks and the merits of the proposed method surpass the disadvantage for reliable wireless multihop transmission requirements. Figure 5. Route Detection Ratio (Simulation Results). Concluding Remarks This paper has proposed a novel communication protocols, i.e., for wireless transmission route detection and for data message transmissions in wireless multihop networks with failure detection, notification and recovery. The proposed method supports the Byzantine failure where failed wireless nodes does not become silent and continues to communicate with the others out of their application protocols, i.e., erroneous and malicious data messages are transmitted independently of the application protocols. 122

The simulation experiments show that the proposed method has a little disadvantage on the successful route detection ratio. However, in the usual density of wireless node to assure the wireless multihop connectivity, almost no reduction in route detection ratio is expected. References [1] Fokkink, W., Distributed Algorithms: An Intuitive Approach, The MIT Press (2013). [2] Pandit, V., Jung, H. and Agrawal, D.P, Inherent Security Benefits of Analog Network Coding for the Detection of Byzantine Attacks in Multi-Hop Wireless Networks, Proceedings of the 8th International Conference on Mobile Adhoc and Sensor Systems, pp. 697 702 (2011). [3] Perkins, C., Belding-Royer, E. and Das, S., Ad Hoc On-Demand Distance Vector (AODV) Routing, RFC 3561 (2003). 123