Energy Efficient Location Aided Routing Protocol for Wireless MANETs

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423, http://sites.google.com/site/ijcsis

Implementasi Metode Clustering berdasarkan Node Degree pada Ad-hoc On Demand Distance Vector (AODV) di Lingkungan VANETs

Teknologi internet saat ini dapat digunakan sebagai suatu pemecahan suatu masalah. Contoh perkembangannya adalah jaringan nirkabel ad-hoc. Seperti contohnya proses penentuan rute perjalanan berhubungan dengan rute pengiriman data informasi dalam jaringan internet. Untuk melakukan pemcecahan permasalahan hal tersebut dapat memanfaatkan teknologi jaringan Ad-Hoc yang mana mendasari pembuatan Vehicular Ad-Hoc Networks (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 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), sedangkan route maintenance digunakan untuk mengetahui informasi adanya kesalahan pada rute. Pada fase ini terdapat proses pengiriman Route Error (RERR). Pada kinerja AODV, pemilihan rute yang stabil saat proses pencarian rute diperlukan untuk memperpanjang waktu penggunaan node. Seperti contohnya ketika tiap node melakukan broadcast paket RREQ, hal tersebut membutuhkan delay yang lama dan resource yang banyak saat pengiriman. Hal tersebut berpengaruh pada tingkat kestabilan rute dan rentan terputus yang mengakibatkan paket yang dikirim berkurang. Pada Tugas Akhir ini mengimplementasikan suatu algoritma clustering yang bernama AODV based on Node Degree Clustering untuk mengontrol mekanisme flooding saat membangun suatu rute baru di protokol AODV. Di dalam algoritma ini, dilakukan pemilihan Cluster Head yang didapatkan berdasarkan tingkat derajat node tetangganya. Lalu tiap node akan di klasifikasikan sesuai Clusternya. Maka saat melakukan Rebroadcast RREQ, tidak perlu mengirim ke semua node, melainkan hanya melalui node Cluster Head dan node gateway untuk menghubungkan antar Cluster. Dari hasil uji coba, AODV yang dimodifikasi pada skenario grid berhasil meningkatkan nilai rata-rata Packet Delivery Ratio (PDR) hingga 13,41%, menurunkan Routing Overhead hingga 17,85% dan penurunan nilai rata-rata Forwarded Route Request (RREQ F) hingga 16,36%. Sedangkan pada skenario real berhasil meningkatkan nilai rata-rata Packet Delivery Ratio (PDR) hingga 13,03%, menurunkan Routing Overhead hingga 11,52% dan penurunan nilai rata-rata Forwarded Route Request (RREQ F) hingga 10,39%. ============================================================ In this era, Internet technology can be used as problem solving. An example of its development is ad-hoc wireless networks. For example, the process of determining the route of travel is related to sending data information on the internet network. To do this problem solver can use Ad-Hoc network technology which underlies the creation of Ad-Hoc Vehicle Networks (VANETs). Ad hoc Network Vehicle (VANET) is the development of an Ad hoc Mobile Network (MANET) where nodes have characteristics with very high mobility and are limited to their movement patterns. There are many routing protocols that can be implemented on VANET, one of which is Ad hoc On demand Distance Vector (AODV).VANETs are an improvement of MANET which have high mobility node characteristic and limited movement pattern. There are many routing protocols that can be implemented on VANETs and one of them is AODV. AODV is an example of reactive routing protocol classification, a protocol that will only create a route when the source node needs it. AODV have two phase which are route discovery and route maintenance. Route discovery is used for requesting and forwarding a route information that consist of Route Request (RREQ) and Route Reply (RREP), meanwhile route maintenance that consist of Route Error (RERR) is used for finding out an error information in route. In normal AODV performance, stable route selection is needed in route search process to extend the lifetime of a node. For example, when each node broadcasts a RREQ packet, it requires a long delay and a lot of resources when sending. This affects the level of stability of the route and is susceptible to interruption which results in the package being sent reduced. In this Final Project implement a clustering algorithm called AODV based on Node Degree Clustering to control the flooding mechanism when building a new route in the AODV protocol. In this algorithm, Cluster Head selection is obtained based on the degree of neighboring node level. Then each node will be classified according to the cluster. So when doing Rebroadcast RREQ, there is no need to send to all nodes, but only through Cluster Head nodes and gateway nodes to connect between Clusters. From the test results, modified AODV in the grid scenario has increased the average value of the Packet Delivery Ratio (PDR) by 13,41%, decreased Routing Overhead value by 17,85%, and the value of Forwarded Route Request (RREQ F) has decreased by 16,36%. While in the real scenario the average value of the Packet Delivery Ratio (PDR) has increased by 13,03% , decreased Routing Overhead value by 11,52%, and the value of Forwarded Route Request (RREQ F) has decreased by 10,39%

A probabilistic approach to reduce the route establishment overhead in AODV algorithm for manet

Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any infrastructure support. The nodes in MANET can act as either router or source and the control of the network is distributed among nodes. The nodes in MANETS are highly mobile and it maintains dynamic interconnection between those mobile nodes. MANTEs have been considered as isolated stand-alone network. This can turn the dream of networking "at any time and at any where" into reality. The main purpose of this paper is to study the issues in route discovery process in AODV protocol for MANET. Flooding of route request message imposes major concern in route establishment. This paper suggests a new approach to reduce the routing overhead during the route discovery phase. By considering the previous behaviour of the network, the new protocol reduces the unwanted searches during route establishment processComment: International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.2, March 201