Radityo Anggoro

Performance Evaluation of AODV and AOMDV with Probabilistic Relay in VANET Environments

Vehicular ad hoc networks (VANETs) are the specific class of Mobile ad hoc networks (MANETs). Since vehicles tend to move in a high speed, the network topology is rapidly changed. Thus vehicles connectivity problem is one of the interesting issues in VANETs. Ad hoc on-demand multipath distance vector (AOMDV) is the extended version of ad hoc on-demand distance vector (AODV). AOMDV is designed to overcome a connectivity problem due to highly dynamic network topology. It provides multipath for data packets delivery from the source to the destination. Although AOMDV outperforms AODV in packet delivery ratio, AOMDVs multipath establishment and maintenance generate more control packets than AODVs unipath. However increasing the vehicle speed will degrade their performance. Thus in this paper, we added probabilistic relay, which enables adjacent vehicles to probabilistically relay unsuccessful data packet transmission, into IEEE 802.11 as a MAC standard model and combined AODV with probabilistic relay (AODV-PR) and AOMDV with probabilistic relay (AOMDV-PR). Based on our simulation result, the addition of probabilistic relay clearly helps those protocols to improve their performances especially in packet delivery ratio even under a high speed. Moreover, probabilistic relay adds beacons, but no additional routing overhead. Probabilistic relay, clearly solved connectivity problem in highly dynamic topology of VANETs. We evaluate those protocol performances based on packet delivery ratio, routing overhead, and average delivery delay under variation of vehicle speed.

PERFORMANCE EVALUATION OF PROBABILISTIC RELAY IN AD HOC ON-DEMAND DISTANCE VECTOR AND AD HOC ON-DEMAND MULTIPATH DISTANCE VECTOR UNDER HIGHLY DYNAMIC ENVIRONMENTS

Vehicular Ad hoc Networks (VANETs) are a specific class of Mobile Ad hoc Networks (MANETs). Since vehicles tend to move in a high speed, the network topology is rapidly changed. Thus vehicle’s connectivity problem is one of the interesting issues in VANETs. Ad hoc On-demand Multipath Distance Vector (AOMDV) is an extended version of ad hoc on-demand distance vector (AODV). AOMDV is designed to overcome a connectivity problem due to highly dynamic network topology. It provides multipath for data packets delivery from the source to the destination. However, AOMDV’s multipath establishment and maintenance generate more control packets than those of AODV’s unipath. Meanwhile, both protocols degrade their performance when the vehicle speed is increasing. Thus in this study, we added probabilistic relay, which enables adjacent vehicles to probabilistically relay unsuccessful data packet transmission into IEEE 802.11 as a MAC standard model and proposed AODV with Probabilistic Relay (AODV-PR) and AOMDV with Probabilistic Relay (AOMDV-PR). Based on our simulation results, the addition of probabilistic relay clearly helps those protocols to improve their performances especially in packet delivery ratio under highly dynamic environments. Probabilistic relay adds the number of generated beacon messages, but does not produce any additional routing messages. We evaluate those protocol performances based on several metrics such as packet delivery ratio, routing overhead, average delivery delay, hop count and number of relays under variation of vehicle speed and beacon interval. We show that beacon interval has a huge influence in the performance of AODV-PR and AOMDV-PR especially for their routing overhead.

Modifikasi Route Discovery pada Ad-hoc On Demand Distance Vector (AODV) Berdasarkan Level Konektivitas One-Hop Node di VANETs

Vehicular Ad hoc Networks (VANETs) merupakan pengembangan dari Mobile Ad hoc Network (MANET) dimana node memiliki karakteristik dengan mobilitas yang sangat tinggi dan terbatas pada pola pergerakannya. Ada banyak routing protocol yang dapat diimplementasikan pada VANETs, salah satunya adalah Ad hoc On demand Distance Vector (AODV). AODV merupakan salah satu routing protocol yang termasuk dalam klasifikasi reactive routing protocol, sebuah protokol yang hanya akan membuat rute ketika node sumber membutuhkannya. AODV memiliki dua fase, yaitu route discovery dan route maintenance. Route discovery digunakan untuk meminta dan meneruskan informasi rute yang terdiri dari proses pengiriman Route Request (RREQ) dan Route Reply (RREP). Modifikasi pada Tugas Akhir ini akan dilakukan pada proses route discovery berdasarkan level konektivitas one-hop node, yaitu dengan cara mengeliminasi jumlah forwarding node yang bertugas untuk mengirim ulang (re-broadcast) RREQ. Hal ini dilakukan agar dapat meningkatkan kinerja protokol AODV untuk mencari rute yang stabil dengan cara memodifikasi beberapa bagian dari mekanisme pengiriman paket RREQ. Dari hasil uji coba, AODV yang dimodifikasi berhasil meningkatkan nilai Packet Delivery Ratio (PDR) hingga 9,19%, penurunan nilai Routing Overhead (RO) hingga 2,17%, dan penurunan nilai Forwarded Route Request (RREQ F) hingga 31,62%.

A Mobile Crowdsensing Framework for Integrating Smartphone and IoT Devices to Cloud Computing Services

The proliferations of mobile crowdsensing (MCS) services using smartphones with various embedded sensors have enabled people to involve in public sensing activities for various applications. Nevertheless for more complex applications such as smart cities, traffic monitoring, disaster prevention more variety of sensors are required. Hence combination of smartphone and Internet of Things (IoT) devices to form crowdsensing cluster will give great advantages. This paper proposes design and implementation of mobile crowdsensing framework to support integration of smartphones and IoT devices as a mobile crowdsensing cluster. The prototype of the proposed framework has been successfully implemented and tested using real devices and infrastructure with promising results.

MODIFIKASI PROTOKOL AODV-BR MENGGUNAKAN LINK EXPIRATION TIME (LET) UNTUK MENINGKATKAN STABILITAS LINK DI LINGKUNGAN MOBILE Ad-Hoc NETWORK (MANET)

AODV protocol is a protocol that is fairly mature in mobile Ad-Hoc network. But the traditional AODV protocol in some ways it seems less satisfying, especially on the stability of data transmission. Development continues, one of which AODV-Backup Routing which became known AODV-BR, were present to address the stability issues of data delivery by providing a backup route, however, AODV-BR still use traditional routing paths that are vulnerable to termination due to the formation of these calculations are based on minimum hop. This study proposes a modified AODV-BR with reliability be the ability to build main route and to choose the route up to the value of the highest stability was then called AODV-Stable bacukp Routing (AODV-SBR). Armed algorithms Link Expiration Time with node movement calculation technique, so the AODV-SBR is able to calculate the value of the minimum and maximum connectivity nodes in a route as the main reference in establishing a delivery route data more stable. The results test of the both protocols in Packet Delivery Ratio (PDR), Throughput, End-to-En Delay and Routing Overhead shows that performance of AODV-SBR better than AODV-BR

Clustering of SSH brute-force attack logs using k-clique percolation

The brute-force attacks to SSH service still persist in the server environments. The existing methods have not applied graph theory to analyze authentication log that records this attack. Therefore, we model the log as a graph and propose k-clique percolation to cluster auth.log file to assist the system administrators to inspect this incident. The k-clique percolation has proven in clustering of biological networks and we will deploy it to this problem. We then provide the mechanism for edge removal to separate the generated clusters and make clear the clustering outputs. The experimental results show that this approach is appropriate to cluster raw logs of SSH brute-force attacks.

SURVEI TEKNIK CLUSTERING ROUTING BERDASARKAN MOBILITAS PADA WIRELESS AD-HOC NETWORK

Wireless ad-hoc merupakan sebuah skema jaringan yang didesain supaya mampu beroperasi tanpa membutuhkan infrastruktur tetap serta bersifat otonom. Teknik flooding pada proses path discovery dalam kasus wireless ad-hoc network dapat menimbulkan masalah beban jaringan yang berlebihan. Oleh karena itu, sebuah skema clustering diusulkan untuk mengurangi adanya flooding paket yang berlebihan dengan membagi node-node dalam jaringan menjadi beberapa bagian berdasarkan parameter tertentu. Teknik ini efektifuntuk mengurangi paket yang harus dilewatkan dalam jaringan. Namun masalah muncul ketika sebuah jaringan wireless ad-hoc harus membentuk sebuah cluster dengan mempertimbangkan beberapa parameter khusus. Parameter tersebut harus disesuaikan dengan kasus yang dihadapi. Pada tulisan ini akan dibahas secara khusus mengenai penerapan skema clustering dalam lingkungan wireless ad-hoc network, baik pada MANETdan penyesuaian skema clustering yang harus dilakukan pada VANET berdasarkan mobilitasnya.

SURVEI PENANGANAN BROADCAST STORM PROBLEM PADA PROTOKOL ROUTING AODV DI MANET

Komunikasi multi-hop pada lingkungan MANET dapat melibatkan broadcast paket dalam proses route discovery. Protokol routing pada MANET akan melakukan broadcast paket RREQ dan menjalarkannya ke node tujuan secepat dan seefisien mungkin, dimana paket RREQ dari rute yang optimal adalah paket RREQ yang terlebih dahulu sampai ke tujuan. Aktifitas broadcast yang tidak terkontrol dapat menyebabkan suatu kondisi yang disebut broadcast storm problem. Broadcast storm problem dapat berdampak pada terganggunya kinerja dari protokol routing akibat adanya packet redundancy, contention, dan collision. Broadcast storm problem dapat ditangani dengan membatasi jumlah node yang dapat melakukan broadcast. Tujuan utama dari pembuatan makalah ini adalah merangkum beberapa mekanisme terbaru yang telah diakukan oleh para peneliti untuk menangani broadcast storm problem. Kami juga menyajikan perbandingan dari mekanisme tersebut berdasarkan karakteristik dari mekanisme ditinjau dari kesesuaian dengan beberapa skema penanganan broadcast storm problem yang diajukan oleh peneliti sebelumnya, kebutuhan informasi tertentu antar node, lingkungan uji coba dan apakah mekanisme ini dapat diterapkan pada protokol routing lainnya.