Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
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.

Black hole attack adalah serangan di mana sebuah node, merespon RREQ dari node sumber dengan informasi dan nilai hop palsu. Black hole node tidak merespon kerjasama terdistrbusi dalam protokol routing untuk menyerap semua paket. Hasilnya, kinerja jaringan akan turun. Penelitian – penelitian sebelumnya berfokus kepada deteksi anomali melalui mekanisme kepercayaan dinamis dari node tetangga. Kami menemukan bahwa perbandingan internal cukup memakan waktu. Kerugian ini dapat dipersingkat dengan mengubah mekanisme routing. Kami mengusulkan peningkatan protokol AODV, bernama EAODV, yang mampu mencegah black hole attack. EAODV dapat menemukan jalur terpendek pada routing menggunakan algoritma pencarian A*. Nilai-nilai hop dan perkiraan waktu untuk mencapai node tujuan digunakan sebagai input dalam persamaan heuristik dan fungsi hash satu arah digunakan untuk membuat nilai yang aman dan kemudian di-casting ke semua node tetangga. Percobaan dilakukan pada NS2 untuk mensimulasikan EAODV dengan running time berbeda dengan dan tanpa black hole node. Pada penelitian ini dapat dilihat bahwa kinerja EAODV lebih baik dalam hal Packet loss dan Average End-to-end delay.

Abstrak :
In post-disaster rehabilitation efforts, the availability of telecommunication facilities takes important role. However, the process to improve telecommunication facilities in disaster area is risky if it is done by humans. Therefore, a network method that can work efficiently, effectively, and capable to reach the widest possible area is needed. This research introduces a cluster-based routing protocol named Adaptive Cluster Based Routing Protocol (ACBRP) equipped by Ant Colony Optimization method, and its implementation in a simulator developed by author. After data analysis and statistical tests, it can be concluded that routing protocol ACBRP performs better than AODV and DSR routing protocol.

Pada upaya rehabilitasi pascabencana, ketersediaan fasilitas telekomunikasi memiliki peranan yang sangat penting. Namun, proses untuk memperbaiki fasilitas telekomunikasi di daerah bencana memiliki resiko jika dilakukan oleh manusia. Oleh karena itu, metode jaringan yang dapat bekerja secara efisien, efektif, dan mampu mencapai area seluas mungkin diperlukan. Penelitian ini memperkenalkan sebuah protokol routing berbasis klaster bernama Adaptive Cluster Based Routing Protocol (ACBRP), yang dilengkapi dengan metode Ant Colony Optimization, dan diimplementasikan pada simulator yang dikembangkan penulis. Setelah data dianalisis dan dilakukan uji statistik, disimpulkan bahwa protokol routing ACBRP beroperasi lebih baik daripada protokol routing AODV maupun DSR.

Abstrak :
ABSTRAK
Sulitnya komunikasi akibat rusaknya infrastruktur merupakan salah satu kendala terbesar dalam proses evakuasi bencana. Jaringan mobile ad hoc (MANET) membentuk hubungan langsung antar perangkat dalam jaringan tanpa bergantung pada infrastruktur, sehingga cocok digunakan dalam komunikasi evakuasi bencana. Namun tingginya mobilitas perangkat dan keterbatasan energi perangkat membuat MANET berbasis IP kurang efisien. Named-Data Networking (NDN) merupakan arsitektur Internet baru yang memisahkan identifikasi suatu konten dengan lokasinya, sehingga lebih cocok untuk diterapkan pada MANET dalam evakuasi bencana. Skripsi ini membahas penerapan ND-MANET untuk skenario evakuasi bencana beserta performanya. Suatu mekanisme supresi retransmisi yang dinamis mengikuti kondisi jaringan dikembangkan untuk meningkatkan performa. Pengujian dilakukan dalam simulasi dengan NdnSIM menggunakan protokol ASF dan implementasi menggunakan protokol Wi-Fi Direct. Hasil pengujian menunjukkan adanya hubungan erat antara kondisi mobilitas dengan performa jaringan, bahwa kondisi mobilitas yang buruk akan memberikan performa yang cenderung buruk. Hasil pada kondisi mobilitas baik dengan kedua mekanisme memberikan performa yang tidak berbeda secara signifikan, karena kondisi mobilitas yang sudah baik. Sementara, pada kondisi mobilitas buruk, mekanisme supresi retransmisi dinamis memberikan hasil delay dan tingkat retransmisi 1.12 kali lebih baik dibandingkan mekanisme supresi retransmisi statis, dengan throughput dan rasio packet loss yang tidak jauh berbeda yakni 16.8 paket/detik dan 77%.

---

ABSTRACT
Communication difficulties due to damaged infrastructure is one of the biggest holdbacks in disaster evacuation process. Ad hoc mobile networks (MANET) form a direct connection between devices in the network without relying on infrastructure, making it suitable for communications in a disaster evacuation. However, high mobility and limited energy of the devices make an IP-based MANET less efficient for use. Named-Data Networking (NDN) is a new Internet architecture that separates the identification of content with its location, making it more suitable to be applied to MANET in disaster evacuation. This thesis discusses the application of ND-MANET for disaster evacuation scenarios and their performance. A mechanism for suppressing retransmissions that dynamically follows network condition is developed to improve the performance. Tests were carried out in simulations with NdnSIM using the ASF protocol and implementation using the Wi-Fi Direct protocol. The test results show that there is a close relationship between mobility conditions and network performance, in which poor mobility conditions will give poor performance. Results on good mobility conditions with both retransmission suppression mechanisms provide performance that is not significantly different, due to the condition of good mobility. Meanwhile, in conditions of poor mobility, the dynamic retransmission suppression mechanism results in 1.12 times better delay and retransmission rate than the static retransmission suppression mechanism, with throughput and packet loss ratio that are not much different, that is 16.8 packets/second and 77%.

Abstrak :
This book reports on a novel concept of mechanism transitions for the design of highly scalable and adaptive publish/subscribe systems. First, it introduces relevant mechanisms for location-based filtering and locality-aware dissemination of events based on a thorough review of the state-of-the-art. This is followed by a detailed description of the design of a transition-enabled publish/subscribe system that enables seamless switching between mechanisms during runtime. Lastly, the proposed concepts are evaluated within the challenging context of location-based mobile applications. The book assesses in depth the performance and cost of transition execution, highlighting the impact of the proposed state transfer mechanism and the potential of coexisting transition-enabled mechanisms.