Garuda - Garba Rujukan Digital

p-Index From 2020 - 2025

2.447

P-Index

This Author published in this journals

All Journal International Journal of Electrical and Computer Engineering Seminar Nasional Informatika (SEMNASIF) ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika JURNAL NASIONAL TEKNIK ELEKTRO Proceeding of the Electrical Engineering Computer Science and Informatics JOIN (Jurnal Online Informatika) Syntax Literate: Jurnal Ilmiah Indonesia APPROACH: Jurnal Teknologi Penerbangan TEKTRIKA - Jurnal Penelitian dan Pengembangan Telekomunikasi, Kendali, Komputer, Elektrik, dan Elektronika Journal of Informatics and Communication Technology (JICT) Prosiding Seminar Nasional Rekayasa Teknologi Industri dan Informasi ReTII eProceedings of Engineering Journal of Computer Engineering: Progress, Application and Technology Buletin Pos dan Telekomunikasi Journal of Informatics and Communication Technology (JICT)

Leanna Vidya Yovita

Universitas Telkom

Author-ID : 500836

Aerospace Engineering Humanities Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

Published : 42 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3 4 5

Analisis Performansi Algoritma Routing First Contact dengan Stationary Relay Node pada Delay Tolerant Network YOVITA, LEANNA VIDYA; RESTU, JODI NUGROHO
ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika Vol 4, No 2 (2016): ELKOMIKA
Publisher : Institut Teknologi Nasional, Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26760/elkomika.v4i2.123

ABSTRAKAlgoritma routing pada jaringan klasik dapat berjalan jika hubungan end-to-end selalu ada.Algoritma routing ini bekerja dengan menggunakan informasi mengenai seluruh jalur yang tersedia.Untuk itu, pada jaringan dengan kondisi ekstrim seperti ini diperlukan algoritma routing yang sesuai.Salah satu algoritma routing yang dapat dijalankan pada Delay Tolerant Network (DTN) adalah First Contact.Algoritma iniakanmelakukan penggandaan pesan yang dibawanyauntuk kemudian diberikan kepada node lainnya yang pertama kali ditemui.Dalam penelitian ini ditambahkan stationary relay node untuk meningkatkan delivery probability.Dengan penambahan stationary relay node diperoleh peningkatan delivery probability 2 hingga 6% dibandingkan dengan jaringan tanpa stationary relay node. Parameter overhead ratio meningkat sebesar 7-18% dibandingkan jaringan tanpa Stationary relay node. Algoritma First Contact dengan tambahan Stationary relay nodejuga memberikan tambahan average latency, 118 ? 171 detik.Nilaiini berbanding lurus dengan jumlah mobile node DTN yang ada pada area tersebut.Kata kunci: Delay Tolerant Network, first contact,Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency.ABSTRACTClassical routing algorithms only works if there is end to end connection.This algorithms uses the information about every available path, and then choose the best path related to spesific metric.. For the networks with the extreme condition, it is needed the suitable routing alorithms. One of the routing algorithms that is able to be applicated in Delay Tolerant Network (DTN) is First Contact. This algorithm will make a single copy message and then forward it to the first encountered node. In this research, the stationaryrelaynodes were added to improve delivery probability. The effect of adding stationary relay node is increasing the delivery probability about 2-6%, compared to networks without stationary relay node. The overhead ratio increased about 7-18% compared to networks without stationary relay node. First Contact algorithm with stationary relay node gives bigger average latency, 118 ? 171 second. This value is directly proportional to the number of mobile DTN nodes that exist in the area.Keywords: Delay Tolerant Network, first contact, Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency..

Analisis Performansi Modifikasi Binary Spray and Wait menggunakan Prophet pada DTN Adhiguna, Bima; Wibowo, Tody Ariefianto; Yovita, Leanna Vidya
JURNAL NASIONAL TEKNIK ELEKTRO Vol 6, No 3: November 2017
Publisher : Jurusan Teknik Elektro Universitas Andalas

Delay Tolerant Network (DTN) enabling communication in an environment where there may be no link end-to-end, communication opportunities come and go and the intervals can be extremely long and even previously unknown. There are some Routing Protocol on DTN, including Binary Spray and Wait is a development of Spray and Wait, and PROPHET.Â Research discuss about modification of Binary Spray and Wait in spray phase using delivery predictability in PROPHET. Simulation used ONE (Opportunistic Network Environtment) Simulator and analyze Delivery Probability, Overhead Ratio, Buffer Time, Average Latency and Average Remaining Energy in Shortest Path Map Based dan Random Way Point movement. Based on observation, the resulting modification of Binary Spray and Wait improve performance and buffer time average latency compared with Binary Spray and Wait, but slightly lower probability delivery and improving overhead ratio.Keywords : Delay Tolerant Network, Spray and Wait, PROPHET, Shortest Path Map Based, Random Way Point.AbstrakDelay Tolerant Network (DTN) memungkinkan komunikasi dalam lingkungan di mana mungkin tidak ada jalur end-to-end, peluang komunikasi datang dan pergi dan intervalnya bisa sangat panjang dan bahkan tidak diketahui sebelumnya. Ada beberapa Routing Protocol pada DTN, diantaranya Binary Spray and Wait yang merupakan pengembangan dari Spray and Wait, dan PROPHET. Penelitian ini membahas tentang modifikasi Binary Spray and Wait pada tahap spray menggunakan teknik delivery predictability yang ada di PROPHET. Simulasi menggunakan ONE (Opportunistic Network Environtment) Simulator dan menganalisa Delivery Probability, Overhead Ratio, Buffer Time, Average Latency dan Average Remaining Energy pada pergerakan node Shortest Path Map Based dan Random Way Point. Berdasarkan pengamatan, dihasilkan Modifikasi Binary Spray and Wait meningkatkan performansi average latency dan buffer time dibanding dengan Binary Spray and Wait, namun menurunkan sedikit delivery probability dan memperbesar overhead ratio.Kata Kunci : Delay Tolerant Network, Spray and Wait, PROPHET, Shortest Path Map Based, Random Way Point.

Caching on Named Data Network: a Survey and Future Research Leanna Vidya Yovita; Nana Rachmana Syambas
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 6: December 2018
Publisher : Institute of Advanced Engineering and Science

The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.

MULTIMEDIA E-LEARNING UNTUK MENUNJANG PEMBELAJARAN MATA KULIAH JARINGAN KOMPUTER DAN DATA DI UNIVERSITAS TELKOM Indrarini Dyah Irawati; Leanna Vidya Yovita
Seminar Nasional Informatika (SEMNASIF) Vol 1, No 1 (2014): Business Intelligence
Publisher : Jurusan Teknik Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar

Computer and Data Networks is one of subject in Faculty of Electrical Engineering, Telkom University, that is still using the learning method by face-to-face between lecturer and students. The student’s problem is difficult to understand how computers and other communication devices can communicate each other, and in fact it is lack of visual aid. This paper presents multimedia e-learning that support for studying about Communication Protocol and IPv4 modules. E-learning multimedia content created in the form of video tutorials and animation using flash. In modules are also equipped with exercises to explore student’s understanding. Analysis shows that the e-learning modules provide added value to the students to increase their knowledge and improve the number of graduation.

Analisis Performansi Modifikasi Binary Spray and Wait menggunakan Prophet pada DTN Bima Adhiguna; Tody Ariefianto Wibowo; Leanna Vidya Yovita
JURNAL NASIONAL TEKNIK ELEKTRO Vol 6, No 3: November 2017
Publisher : Jurusan Teknik Elektro Universitas Andalas

Delay Tolerant Network (DTN) enabling communication in an environment where there may be no link end-to-end, communication opportunities come and go and the intervals can be extremely long and even previously unknown. There are some Routing Protocol on DTN, including Binary Spray and Wait is a development of Spray and Wait, and PROPHET. Research discuss about modification of Binary Spray and Wait in spray phase using delivery predictability in PROPHET. Simulation used ONE (Opportunistic Network Environtment) Simulator and analyze Delivery Probability, Overhead Ratio, Buffer Time, Average Latency and Average Remaining Energy in Shortest Path Map Based dan Random Way Point movement. Based on observation, the resulting modification of Binary Spray and Wait improve performance and buffer time average latency compared with Binary Spray and Wait, but slightly lower probability delivery and improving overhead ratio.Keywords : Delay Tolerant Network, Spray and Wait, PROPHET, Shortest Path Map Based, Random Way Point.AbstrakDelay Tolerant Network (DTN) memungkinkan komunikasi dalam lingkungan di mana mungkin tidak ada jalur end-to-end, peluang komunikasi datang dan pergi dan intervalnya bisa sangat panjang dan bahkan tidak diketahui sebelumnya. Ada beberapa Routing Protocol pada DTN, diantaranya Binary Spray and Wait yang merupakan pengembangan dari Spray and Wait, dan PROPHET. Penelitian ini membahas tentang modifikasi Binary Spray and Wait pada tahap spray menggunakan teknik delivery predictability yang ada di PROPHET. Simulasi menggunakan ONE (Opportunistic Network Environtment) Simulator dan menganalisa Delivery Probability, Overhead Ratio, Buffer Time, Average Latency dan Average Remaining Energy pada pergerakan node Shortest Path Map Based dan Random Way Point. Berdasarkan pengamatan, dihasilkan Modifikasi Binary Spray and Wait meningkatkan performansi average latency dan buffer time dibanding dengan Binary Spray and Wait, namun menurunkan sedikit delivery probability dan memperbesar overhead ratio.Kata Kunci : Delay Tolerant Network, Spray and Wait, PROPHET, Shortest Path Map Based, Random Way Point.

Performance Analysis of CSI:T Routing in a Delay Tolerant Networks Hardika Kusuma Putri; Leanna Vidya Yovita; Ridha Muldina Negara
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Delay Tolerant Network (DTN) is a network that allows nodes to move dynamically and doesn’t always provide for end-to-end connection. The dynamically of nodes make the movement of the nodes becomes important. The movement model of nodes will record their behavior and this could be utilized to develop a new routing protocol in DTN. One of the DTN routing protocol that utilize it is CSI: T routing. CSI: T routing viewed a node based on their behavioral profile which is represent the mobility preference. Our study is measure the performance of CSI: T in terms of delivery probability, overhead ratio, and average latency by changing the buffer capacity, packet lifetime, and number of nodes. We used Opportunistic Network Environment (ONE) Simulator for the simulate the real-life scenario of a college-routines.

Analisis Performansi Protokol Routing SeeR Pada Teknologi Delay-Tolerant Networks Berbasis Kendaraan Sendy Achdika Maulana; Leanna Vidya Yovita; Tody Ariefianto Wibowo
Approach : Jurnal Teknologi Penerbangan Vol. 2 No. 1 (2018): April 2018
Publisher : Politeknik Penerbangan Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (444.91 KB)

Vehicular networks merupakan jaringan dengan node berbasis kendaraan yang dinamis, sehingga memiliki konektivitas yang tidak dapat diperkirakan jalurnya. Bahkan dalam kondisi tertentu, jalur dari sumber ke tujuan belum terbentuk dengan sempurna menyebabkan delay yang beragam. Arsitektur Delay-Tolerant Networks (DTNs) diciptakan untuk menghadapi keterbatasan konektivitas seperti ini. Penelitian ini berdasarkan hasil simulasi teknologi DTNs menggunakan kendaraan sebagai node utama yang melintasi jalur pada peta yang ditentukan. Analisis protokol routing Simulated Annealing-based (SeeR) dilakukan dengan memperhatikan peningkatan jumlah kendaraan, penggunaan relay node serta model pergerakannya terhadap nilai rata-rata delay dan rasio pengiriman. Hasil uji terbaik, SeeR mampu menekan hingga 50% lebih nilai rata-rata delay dengan rasio pengiriman mencapai 98%.

SIMULASI DAN ANALISIS PERFORMANSI DARI PROTOKOL ROUTING BERBASIS POSISI GPRS DAN GyTAR UNTUK VEHICLE COMMUNICATION PADA VEHICULAR AD HOC NETWORK (VANET) Irma Nurlita Dewi; Rendy Munadi; Leanna Vidya Y.
TEKTRIKA Vol 1 No 1 (2016)
Publisher : Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/tektrika.v1i1.243

Vehicular Ad hoc Network (VANET) merupakan konsep subset dari Mobile Ad hoc Networks (MANET)Â sebagai teknologi yang memungkinkan komunikasi Inter Vehicle Communication (IVC) dan Roadside-toVehicle (RVC).VANET dikarakteristikkan dengan membangun jaringan ad hoc yang dibentuk dariÂ nodenode berupa kendaraan bermobilitas tinggi yang dibatasi dengan aturan lalu lintas sehinggaÂ pergerakannya disesuaikan dengan pola tertentu, tidak seperti MANET yang pergerakannya bisa randomÂ tanpa ada batasan. Dengan demikian, protokol routing konvensional berbasis topologi pada MANET dinilaiÂ tidak cocok untuk VANET. Protokol routing berbasis posisi sepeti GPSR dan GyTAR dinilai cocok untukÂ VANET. Hal ini tak lain karena aspek dinamika topologi pada VANET yang dapat berdampak nyata padaÂ analisis protokolÂ routing. Dari hasil simulasi diperoleh bahwa GyTAR unggul pada skenario lingkunganÂ perkotaan dilihat dari seluruh parameter end-to-end delay,Â packet delivery ratio, packet loss dan normalizedÂ routing overhead yang lebih baik dari GPSR dengan rata-rata nilai masing-masing, yakni 2,294 ms, 0,958,Â 4,19%, dan 0,482. Sementara pada skenario lingkungan jalan tol GPSR lebih unggul dibandingkan GyTARÂ dengan rata-rata nilai end-to-end delay,Â packet delivery ratio, dan packet loss sebesar 2,639 ms, 0,920, danÂ 7,923%; namun dengan perolehan NRO yang lebih kecil oleh GyTAR, yakni sebesar 1,725.Kata Kunci: VANET, MANET , GPSR, GyTAR, IVC, SUMO

Performance Analysis of Cache Replacement Algorithm using Virtual Named Data Network Nodes Leanna Vidya Yovita; Tody Ariefianto Wibowo; Ade Aditya Ramadha; Gregorius Pradana Satriawan; Sevierda Raniprima
JOIN (Jurnal Online Informatika) Vol 7 No 2 (2022)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v7i2.875

As a future internet candidate, named Data Network (NDN) provides more efficient communication than TCP/IP network. Unlike TCP/IP, consumer requests in NDN are sent based on content, not the address. The previous study evaluated the NDN performance using a simulator. In this research, we modeled the system using virtual NDN nodes, making the model more relevant to the real NDN. As an essential component in every NDN router, the content store (CS) has a function to keep the data. We use First In First Out (FIFO) and Least Recetly Used (LRU) in our nodes as cache replacement algorithms. The in-depth exploration is done using various scenarios. The result shows that the cache hit ratio (CHR) increases if the size of the CS, the number of interests, and the number of consumers increases. CHR decreases as the number of producers and the number of prefixes increase. As CHR increases, round trip time (RTT) decreases. LRU provides better performance for all cases: higher CHR of 5-15% and lower RTT of 1-10% than FIFO.

Analisis Performansi ProPHETv2 Routing Berbasis Vehicular Delay-Tolerant Network pada Daerah Rural Gumilar Hadi Prabowo; Rendy Munadi; Leanna Vidya Yovita
Retii Prosiding Seminar Nasional ReTII ke-11 2016
Publisher : Institut Teknologi Nasional Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Internet dan kemajuan teknologi komunikasi telah mengubah secara drastis cara orang bekerja dengan komputer. Pada implementasinya, internet menggunakan sebuah protokol yaitu Transmission Control Protocol/Internet Protocol (TCP/IP), dimana protokol ini tidak dapat bekerja bila terjadi delay yang cukup lama seperti yang terjadi pada daerah rural. Vehicular Delay-Tolerant Network (VDTN) berusaha untuk memperbaiki masalah tersebut dengan cara menyimpan paket (Store) bila belum memungkinkan terjadinya penerusan paket (Packet Forwarding). VDTN menganggap bahwa kendaraan sebagai sebuah node dan menggunakan paradigma store-carry-forward untuk proses komunikasinya, serta secara simultan memberikan informasi kepada node lain. ProPHETv2 merupakan salah satu algoritma routing di VDTN yang mengguanakan informasi tersebut dan menambahkan parameter contact duration untuk menilai probabilitas pengiriman dalam membuat keputusan Forwarding Packet. Dengan menggunakan ONE (Opportunistic Network Environment) Simulator 1.5.0 RC2 akan dianalisis performa algoritma ProPHETv2 dengan menggunakan beberapa parameter yaitu Delivery Probability, Overhead Ratio, dan Average Latency, serta menggunakan OpenJUMP 1.8.0 untuk map processing. Hasil simulasi yang diperoleh bahwa nilai maksimum delivery probability adalah sebesar 0.9618 untuk perubahan ukuran buffer dan 0.9541 untuk perubahan kecepatan node. Nilai maksimum overhead ratio sebesar 63.4736 untuk perubahan ukuran buffer dan 59.6612 untuk perubahan kecepatan node. Dan nilai maksimum average latency sebesar 1011.958 untuk perubahan ukuran buffer dan 1848.503 untuk perubahan kecepatan node.Kata Kunci: delay, ProPHETv2, rural, VDTN.

Co-Authors Ade Aditya Ramadha Adhiguna, Bima Adhitya Bagus Putra Erlangga Anggita Yaumil Istiana Asty Valentina Hutauruk Aulia, Ahmad Arif Bambang Hidayat Baswara, Muhammad Raihan Bima Adhiguna Doan Perdana Emeraldo Faris Aufar Fachrur Rozi Fahry Adnantya Fanny Tarida Tampubolon Filipi Filipi Galih Putro Dwi Setyo Gregorius Pradana Satriawan Gumilar Hadi Prabowo Hardika Kusuma Putri I Made Wahyuda Permana Ilmi Aulia Assyifatunisa Indah Ratu Aulia Indrarini Dyah Irawati Inung Wijayanto Irma Nurlita Dewi Istikmal Jafar Alim Habibi JODI NUGROHO RESTU, JODI NUGROHO Kevin Prathama Nugraha Kusuma Putri, Hardika Lesmana, Muhammad Reyhan Fitrandi Lia Hafiza Malldi Saesar Mohamad Samudra Muhammad Aditya Taufik Muhammad Daffa Muhammad Geo Unggul Putra Kusuma Utomo Nana Rachmana Syambas Naufal Dzulfiqar Anwar Nur Andini Poerwantoro , Redaffa Ath Thaariq Prasta, Tigar Isya Putra, Agam Vino Syah Radian Priambodo Ramdhan Nugraha Ratna Mayasari Rendy Munadi Ridha Muldina Negara Rizasyah, Radian Malik Satriawan, Gregorius Pradana Sendy Achdika Maulana Sevierda Raniprima Sofia Nafila Putri Sofia Naning Hertiana Syafaat Deha Syifa Aulia Sakira Nur Rahman Tody Ariefianto Wibowo Yasir Ahmad Abdillah

Title

Found 42 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 42 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 42 Documents
Search