Wahyudwi, Jodi Prayoga (2018) Analisis Performansi Protokol Routing Epidemic Dan Spray And Wait Pada Dtn Berdasarkan Mobilitas Node. Sarjana thesis, Universitas Brawijaya.
Abstract
DTN atau Delay Tolerant Network adalah jaringan internet yang tidak mempermasalahkan waktu tunda. Pada penelitian ini, analisis routing DTN menggunakan Epidemic dan Spray And Wait berdasarkan mobilitas node. Pada routing DTN menggunakan aplikasi The One simulator untuk merancang jalur rute dengan kondisi kota yang sebenarnya. Dalam penilaian performa, digunakan tiga parameter uji yaitu Delivery Probability, Overhead Ratio, Average Latency. Pada skenario pertama, Delivery Probability tertinggi pada Mobilitas Open Shortest Path sebesar 0.9853 pesan, peringkat kedua Map Based Movement sebesar 0.9412 pesan, dan terakhir Map Route Movement sebesar 0.9265 pesan. Pada skenario kedua, Delivery Probability tertinggi pada Mobilitas Map Based Movement sebesar 1 pesan, peringkat kedua Open Shortest Path dan Map Route Movement sebesar dengan nilai yang sama yaitu sebesar 0.9796 pesan. Pada skenario ketiga Delivery Probability tertinggi pada Mobilitas Map Route Movement sebesar 0.9457 pesan, peringkat kedua Map Based Movement sebesar 0.9225 pesan, dan terakhir Open Shortest Path sebesar 0.8837 pesan. Pada Overhead Ratio, routing Epidemic pada semua mobilitas memiliki Overhead Ratio yang tinggi sebesar 6.0938, 6.0625, dan 6.9328 pesan dibandingkan dengan Overhead Ratio pada routing Spray And Wait pada semua Mobilitas sebesar 3.8408, 3.8129, dan 4.3099 pesan. Average Latency terendah didapatkan pada Mobilitas Open Shortest Path sebesar 72.9538 ms.
English Abstract
DTN or Delay Tolerant Network is an internet network that does not matter the time delay. In this study, DTN routing analysis using Epidemic and Spray And Wait based on node mobility. In DTN routing use The One simulator application to list route path with actual city condition. In the performance appraisal, three test parameters were used: Probability of Submission, Overhead Ratio, Average Latency. In the first scenario, the highest Delivery Probability on the Open Shortest Path Mobility is 0.9853 messages, the second ranked Map by Movement of 0.9412 messages, and the last Route Movement Map of 0.9265 messages. In the second scenario, High Possibility on Mobility of Movement Based Map by 1 message, second rank of Open Shortest Path and Movement Map Map with the same value is 0.9796 message. On the third map of the highest Delivery Probability on Mobility Route Map Movement for 0.9457 messages, the second ranked Map Based Movement of 0.9225 messages, and last Open Shortest Path of 0.8837 messages. In Overhead Ratio, routing Epidemics in all mobility have. Average Lowest Latency on Open Shortest Path Mobility based on 72.9538 ms.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/FTIK/2018/92/051801014 |
| Uncontrolled Keywords: | Delay Tolerant Network, Routing Epidemic, Routing Spray & Wait, The ONE simulator |
| Subjects: | 000 Computer science, information and general works > 004 Computer science > 004.6 Interfacing and communications > 004.67 Wide-area networks > 004.678 Internet |
| Divisions: | Fakultas Ilmu Komputer > Teknik Informatika |
| Depositing User: | Yusuf Dwi N. |
| Date Deposited: | 28 Jun 2018 06:34 |
| Last Modified: | 27 Oct 2021 05:54 |
| URI: | http://repository.ub.ac.id/id/eprint/11727 |
Preview |
Text
SKRIPSI-JODI PRAYOGA WAHYUDWI_125150207111048.pdf Download (3MB) | Preview |
Actions (login required)
 |
View Item |