Implementasi K-Means Clustering dalam Adhoc On-Demand Distance Vector dengan Ant Colony Optimization untuk Meningkatkan Performa Mobile Node pada Wireless Adhoc Network

Simanjuntak, Alcredo (2020) Implementasi K-Means Clustering dalam Adhoc On-Demand Distance Vector dengan Ant Colony Optimization untuk Meningkatkan Performa Mobile Node pada Wireless Adhoc Network. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 05111640000045-Undergraduate_Thesis.pdf Download (1MB)

Abstract

Adhoc On-Demand Distance Vector(AODV) adalah salah satu proses routing yang dapat diimplementasikan pada mobile adhoc network(MANET). AODV memiliki dua fase, yaitu route discovery dan route maintenance. Dimana route discovery akan dimulai ketika suatu node akan mengirimkan suatu paket, fase ini terdiri dari proses pengiriman Route Request(RREQ) dan Route Reply(RREP). Route maintenance digunakan untuk melakukan pemeliharaan route dengan mengetahui adanya masalah didalam suatu route, didalam fase ini terdapat proses pengiriman Route Error(RERR). Pada AODV, route yang dipilih adalah route dengan jumlah hop terkecil tanpa memperhatikan faktor-faktor esensial lainnya yang mungkin bisa sangat mempengaruhi dalam pemilihan suatu route. Ada beberapa faktor lain yang bisa mempengaruhi pemilihan route selain jumlah hop antara lain seperti posisi, energi, kepadatan, dan kekuatan sinyal. Penggunaan faktor-faktor tambahan tersebut akan meningkatkan akurasi didalam pemilihan route. Pada Tugas Akhir ini diusulkan suatu algoritma routing sebagai modifikasi dari AODV yaitu dinamakan KMeans-AODV-ACO. Algoritma ini akan membagi node-node kedalam beberapa cluster dan kemudian akan dilakukan pemilihan cluster head, dimana route discovery dilakukan hanya oleh node yang bertindak sebagai cluster head. Didalam proses route discovery juga akan dilakukan perhitungan faktor-faktor lain yaitu Received Signal Strength Metric(RSSM), Congestion Metric(CM), Residual Energy Metric(REM), dan Hop-Count Metric(HCM) yang akan menjadi pertimbangan didalam pemilihan route.
==================================================================================================================================
Adhoc On-Demand Distance Vector is one of the routing process which can be implemented in mobile adhoc network(MANET). AODV has two phases, namely route discovery and route maintenance. Route discovery will started when a node will send a packet, this phase consist of sending of route request(RREQ) and route reply(RREP). Route maintenance used for doing route maintenance by knowing there is a problem within a route, in this phase, there is a process for sending route error(RRER). In AODV, elected route is a route with the smallest number of hop without considering other essential factor which might be impactful in a route election. There are some other factors which might be impactful route election besides hop count such as energy, congestion, and signal strength. The using of that additional factors will enhance accuracy in route election. Consequently, In this thesis, routing algorithm as a modification of AODV called K-Means-AODV-ACO is proposed. This algorithm will group nodes into some clusters and the cluster head selection will be made, where route discovery will be made by cluster head only. In this route discovery other factors will also be calculated namely Received Signal Strength Metric(RSSM), Congestion Metric(CM), Residual Energy Metric(REM), and Hop-Count Metric(HCM) which will be the considerations in route election.

Item Type:	Thesis (Other)
Additional Information:	RSIf 004.62 Sim i-1 2020
Uncontrolled Keywords:	MANETs, AODV, K-Means Clustering, Ant Colony Optimization.
Subjects:	T Technology > T Technology (General) > T57.62 Simulation
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User:	Alcredo Simanjuntak
Date Deposited:	11 Mar 2025 02:52
Last Modified:	11 Mar 2025 02:52
URI:	http://repository.its.ac.id/id/eprint/73259

Actions (login required)

View Item