Robust Defense Scheme Against Selective Drop Attack in Wireless Ad Hoc Networks

Abstract

Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to packet drop attacks. In selective drop attack, the neighboring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. In this paper, we present a resistive to selective drop attack (RSDA) scheme to provide effective security against selective drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular drop attack. The RSDA protocol can be integrated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the packet drop rate, jitter, and routing overhead at a different pause time are reduced to 9%, 0.11%, and 45%, respectively. The packet drop rate at varying mobility speed in the presence of one gray hole and two gray hole nodes are obtained as 13% and 14% in RSDA scheme. INDEX TERMS Wireless ad-hoc networks, resistive to selective drop attack, network security, elliptic curve digital signature algorithm.

An Improved AODV Routing Security Algorithm Based on Blockchain in Ad Hoc Network

“…8 shows how the data packet drop rate varies with node speed when all nodes in the network are normal nodes. It can be seen from the figure that the algorithm proposed in this paper performs worse than the algorithm in the literature [8] within a certain range of node moving speed. The reason may be that the two paths of AODV-MQS algorithm simultaneously broken in this interval, causing more data packets lost.…”

“…From the above Eq., this chapter concludes that only the greater the connectivity of the node and the smaller the hop number in EERQ, the closer the counter of the node is set to the max value, that is, the larger value the node timer could be got. (8) Judge whether the node is the destination node, if so, go to (10). Otherwise, go to (9).…”

“…At the same time, Because of the characteristics of the network, such as inherent defects of the wireless channel itself, the dynamic changes of the topology, the lack of a centralized control center to protect node information and so on, the routing security issues of mobile Ad Hoc networks need to be resolved urgently. At present, there have been many attack methods [5] [6] and defense schemes [7] [8] for the protocol vulnerabilities and routing security of Ad Hoc networks. A node of the network as an individual may be subjected to other malicious attacks, the attack points are not limited to a certain protocol layer, and even the attack can harm some layers of the protocol stack at the same time.…”

A Secure Data Dissemination in a DHT-Based Routing Paradigm for Wireless Ad Hoc Network

“…Poongodi et al [38] proposed an effective lightweight security mechanism named resistive to selective drop attack (RSDA). In a selective drop attack, the neighboring nodes are not reliable in message forwarding to the next node.…”

Novel Framework for Maximizing Security over Wireless Network

“…The study has presented a mechanism in order to resist the eavesdropping as well as it can also improvise the secret key generation. Poongodi et al [24] have presented solution against selective packet dropping intrusion in adhoc network. The study has constructed a lightweight protocol along with digital signature in order to identify the malicious nodes.…”