PERBANDINGAN KINERJA PROTOKOL MULTIPATH AOMDV DAN S-AMDV YANG DIPENGARUHI NILAI PAUSE TIME DAN KECEPATAN PERGERAKAN
DOI:
https://doi.org/10.25047/jii.v13i1.67Abstract
Protokol routing AOMDV merupakan protokol routing yang memiliki multipath di setiap proses pencarian rutenya. Rute yang diketahui dijadikan rute utama dan rute cadangan berdasarkan nilai minimal hopnya. Sedangkan S-AOMDV merupakan pengembangan dari AOMDV berdasarkan stabilitas rute yang dimiliki.
Bergerakan node pada penelitian ini menggunakan model random waypoint, dimana setiap mode bergerak akan berhenti sejenak senilai pause time tertentu untuk kemudian bergerak kembali ke arah yang berbeda. Kecepatan pergerakan node dan nilai pause time pada AOMDV dan S-AOMDV serta beban jaringan dengan menggunakan traffik CBR mempengaruhi kinerja routing protocol tersebut. Dalam penelitian ini membandingkan kinerja dari kedua routing protocol dengan berbagai nilai pause time dan kecepatan pergerakan node dengan menggunakan simulator jaringan NS 2.35. Dari hasil perbandingan didapatkan nilai pause time akan memberikan waktu yang lebih untuk pemilihan rute yang lebih baik pada kedua protokol multipath
Downloads
References
Balakrishna, R., Rao, U. R., & Geethanjali, N. (2010). Performance issues on AODV and AOMDV for MANETS. International Journal of Computer Science and Information Technologies (IJCSIT), (hal. 38-43).
Camp, T., Boleng, J., & Davies, V. (2002). A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communication & Mobile Computing (WCMC) , 483-502.
Close, D. B., Robbins, A. D., Rubin, P. H., Stallman, R., & Oostrum, v. P. (1995). The AWK Manual. Free Software Foundation, Inc.
Cordeiro, C. d., & Agrawal, D. P. (1999). Mobile Ad Hoc Network. OBR Research Centre for Distributed and Mobile Computing ECECS .
Dana, A., Zadeh, A. K., & Noori, S. A. (2008). Backup Path Set Selection in Mobile Ad Hoc Wireless Network using Link Expiration Time . Compters and Electrical Engineering (hal. 503-519). Elsevier Ltd.
H.D. Trung, W. B. (2007). Performance evaluation and comparison of different ad hoc routing protocol. Department of Electrical Engineering, Chulalongkorn University, Bangkok Thailand .
Marina, M. K., & Das, S. R. (2006). Ad hoc On-demand Multipath Distance Vector Routing. Wireless Communication Mobile Computing (hal. 969-988). Wiley InterScience.
Nurfiana. (2012). Perbaikan Protokol Routing Ad Hoc On-Demand Multipath Distance Vector (AOMDV) Untuk Mendapatkan Rute Yang Stabil Menggunakan Link Expiration Time (LET). Surabaya: Institute Teknologi Sepuluh Nopember.
Perkins, C. E., Belding-Royer, E., & Das, S. (2003). Ad Hoc On Demand Distance Vektor Routing. RFC 3561 Addison Wesley .
Roy, R. R. (2010). HandBook of Mobile Ad Hoc Networks For Mobility Models. Springer.
Sarkar, S. K., Basavaraju, T., & Puttamadappa, C. (2007). Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications. Auerbach Publications.
Su, W., Lee, S.-J., & Gerla, M. (2000). Mobility Prediction in Wireless Networks. EEE Military Communications Conference , (hal. 491-495).
Downloads
Published
How to Cite
Issue
Section
License
Copyright Notice
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).