Securing Service Discovery from Denial of Service Attack in Mobile Ad Hoc Network (MANET)
Autor: | Smitha Kurian, Loganathan Ramasamy |
---|---|
Rok vydání: | 2021 |
Předmět: |
Routing protocol
Computer Networks and Communications Network packet Computer science business.industry Node (networking) ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Service discovery Denial-of-service attack Mobile ad hoc network Computer Science Applications Flooding (computer networking) Ad hoc On-Demand Distance Vector Routing business Computer network |
Zdroj: | International Journal of Computer Networks and Applications. 8:619 |
ISSN: | 2395-0455 |
DOI: | 10.22247/ijcna/2021/209992 |
Popis: | Mobile Ad Hoc networks (MANET) are resource constrained and operate on the basis of mutual cooperation. As a result, service discovery is one of the essential services of MANET. Service discovery was integrated onto Ad Hoc on Demand Distance Vector (AODV) Routing protocol, since service discovery was best performed at the network layer with minimal control messages. But this integration echoes the security threats of AODV protocol onto the service discovery process. The security of AODV protocol has drawn ample attention and various studies and methodologies are proposed. But most of the proposed techniques either address the flooding attack or the black hole attack but addressing both these issues simultaneously has been a challenge. Since the nodes in the network are resource constrained achieving the security objective with minimal overhead is also a target that needs to be achieved. We propose a trust based methodology at the level of individual node, that avoids the denial of service attack by controlling both the packet dropping attack and the flooding attack of the service discovery extended AODV protocol. This scheme assists in the selection of a safe path between the consumer and the server by ensuring that a cooperative node with high trust is selected at every hop. The trust value of the non-cooperative or flooding nodes is decreased and is thus avoided from safe paths. With simulated experiments it is demonstrated that the proposed system has 4% lesser control message overhead, the service discovery ratio improved by 13% and the service discovery latency was also considerably reduced. |
Databáze: | OpenAIRE |
Externí odkaz: |