Melola Discovery

← Melola Discovery

Jurnal SINTA 2

EAODV: A*-BASED ENHANCEMENT AD-HOC ON DEMAND VECTOR PROTOCOL TO PREVENT BLACK HOLE ATTACKS

Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 6 No. 2 (2013) · pp. 45–51

DOI
10.21609/jiki.v6i2.222
ISSN
2502-9274, 2088-7051
Published
2013-11-28
Publisher
Faculty of Computer Science - Universitas Indonesia
Language
eng

Abstract

Black hole attack is an attack where a node that responds to RREQ from the source node by replying a fake freshness information and false hop count. The black hole nodes do not respond to distributed co-operation in routing protocol to absorb all the packets, as a result, the network performance will drop. Most previous works are focused on anomaly detection through dynamic trusted of the neighbouring nodes. We find out that the internal comparisons take a long time. This loss can be shortened by changing the routing mechanism. We propose an enhancement of AODV protocol, named EAODV, that is able to prevent black hole attacks. The EAODV can find a shortest path of routing discovery using A* heuristic search algorithm. Values of hop count and estimate time to reach the destination node are used as input in the heuristic equation and one-way hash function is used to make a secure value and then to casting it to all neighbouring nodes. Experiments were conducted in NS2 to simulate EAODV in different running time with and without black hole nodes. The EAODV performance results are indicated better in terms Packet loss and Average End-to-End delay.

Keywords

Collaboration network of the authors

17 authors · 33 co-authorship links · 22 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Al Baha University
  • Universiti Utara Malaysia
  • Universiti Malaysia Pahang Al-Sultan Abdullah
  • Indonesia Defense University
  • Tun Hussein Onn University of Malaysia
  • Universitas Ahmad Dahlan
  • Universitas Sumatera Utara
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Moh’D Suliman ShakkahAffiliation unknown2
Khaled AlaqeelAffiliation unknown2
Ali AlfageehAffiliation unknown2
Yanif Dwi KuntjoroIndonesia Defense University1
Tole SutiknoUniversitas Ahmad Dahlan1
Mohd Faaizie DarmawanUniversiti Malaysia Pahang Al-Sultan Abdullah1
Ahmad Firdaus Zainal AbidinUniversiti Malaysia Pahang Al-Sultan Abdullah1
Shahreen binti KasimTun Hussein Onn University of Malaysia1
Ismat A. AldmourAl Baha University1
Thair Al-Dala’inAl Baha University1
Lelyzar SiregarUniversitas Sumatera Utara1
Deris StiawanSriwijaya University1
Yaya Sudarya TrianaMercu Buana University1
Mohd Azam OsmanUniversiti Sains Malaysia1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EAODV: A*-BASED ENHANCEMENT AD-HOC ON DEMAND VECTOR PROTOCOL TO PREVENT BLACK HOLE ATTACKS</dc:title>
	<dc:creator>Ghathwan, Khalil I</dc:creator>
	<dc:creator>Yaakub, Abdul Razak</dc:creator>
	<dc:creator>Budiarto, Rahmat</dc:creator>
	<dc:subject xml:lang="en-US">Mobile ad hoc network (MANET)</dc:subject>
	<dc:subject xml:lang="en-US">Black hole</dc:subject>
	<dc:subject xml:lang="en-US">Packet dropping</dc:subject>
	<dc:subject xml:lang="en-US">Malicious node</dc:subject>
	<dc:subject xml:lang="en-US">Routing.</dc:subject>
	<dc:description xml:lang="en-US">Black hole attack is an attack where a node that responds to RREQ from the source node by replying a fake freshness information and false hop count. The black hole nodes do not respond to distributed co-operation in routing protocol to absorb all the packets, as a result, the network performance will drop. Most previous works are focused on anomaly detection through dynamic trusted of the neighbouring nodes. We find out that the internal comparisons take a long time. This loss can be shortened by changing the routing mechanism. We propose an enhancement of AODV protocol, named EAODV, that is able to prevent black hole attacks. The EAODV can find a shortest path of routing discovery using A* heuristic search algorithm. Values of hop count and estimate time to reach the destination node are used as input in the heuristic equation and one-way hash function is used to make a secure value and then to casting it to all neighbouring nodes. Experiments were conducted in NS2 to simulate EAODV in different running time with and without black hole nodes. The EAODV performance results are indicated better in terms Packet loss and Average End-to-End delay.</dc:description>
	<dc:publisher xml:lang="en-US">Faculty of Computer Science  - Universitas Indonesia</dc:publisher>
	<dc:date>2013-11-28</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/222</dc:identifier>
	<dc:identifier>10.21609/jiki.v6i2.222</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 6 No. 2 (2013): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 45-51</dc:source>
	<dc:source>2502-9274</dc:source>
	<dc:source>2088-7051</dc:source>
	<dc:source>10.21609/jiki.v6i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/222/302</dc:relation>
</oai_dc:dc>