scholarly journals Increased Routing Algorithm for Mobile AdHoc Networks

2019 ◽  
Vol 8 (9S3) ◽  
pp. 1606-1608
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Mobile Adhoc Networks ◽  
Adhoc Networks ◽  
Mobile Ad Hoc ◽  
End To End ◽  
Two Stages

A Mobile Ad-hoc Network (MANET) is an accumulation of portable hubs which impart over proportion. These systems have an essential preferred standpoint; they don't require any current foundation or focal organization. Portable specially appointed systems are appropriate for transitory correspondence joins. One of the significant issues in MANET is steering because of the versatility of the hubs. Directing means the demonstration of moving data over a web work from a source to a goal. The Enhanced Ant Routing Algorithm (EARA) depends on subterranean insect calculations. This calculation is enlivened from the insect states life. Forward bundles are utilized to gather data about the system and in reverse parcels are utilized to refresh the directing data in the hubs. EARA has two stages course disclosure and course support and furthermore utilities the idea of backtracking when the parcels are achieves goal hub. Re-enactment comes about accomplish better parcel conveyance proportion and lessen the normal end-to-end defer as contrast with its partner

scholarly journals Selfish Caching and Facsimile Allocation over a Mobile Ad Hoc Network

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1953-1958
Keyword(s):  
Mobile Devices ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Peer To Peer ◽  
Selfish Nodes ◽  
Replica Allocation ◽  
Adhoc Networks ◽  
Mobile Ad Hoc ◽  
Few Vertices

Mobile adhoc networks (MANETs) have drawn attention to multitudinous consideration because of the univerality of mobile devices as well as the developments in wireless era. MANET is a peer-to-peer multi hop cellular wireless era community which does not have both difficult and speedy infrastructure and a relevant server. Every vertex of a MANET performs like a router and communicates with every unique. There exist numerous information duplication strategies which were presented to reduce the execution squalor. All are concluded that everyone cell vertices cooperate completely from the perspective of sharing their memory vicinity. But, via a few methods few vertices might additionally behave selfishly and determine simplest to cooperate in part or never with different vertices. The selfish vertices ought to then lessen the overall information approachability within the network. From this work, we try to take a look at the influence of selfish vertices in a mobile ad hoc community in terms of reproduction issuance i.e Selfish nodes are dealt with in replica allocation.

scholarly journals DYNAMIC MANET ON DEMAND PROTOCOL PADA JARINGAN SENSOR NIRKABEL UNTUK SISTEM MONITORING LAHAN PERTANIAN

2017 ◽  
Vol 9 (2) ◽  
pp. 211-217
Author(s):  
Agus Halid ◽  
Leonardo O. J Takumansang ◽  
Mohammad Fajar
Keyword(s):  
Packet Loss ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
On Demand ◽  
Mobile Ad Hoc ◽  
End To End

Penelitian ini bertujuan untuk menerapkan dan mengevaluasi protokol Dynamic Mobile Ad-Hoc Network (DYMO) pada sistem monitoring lahan pertanian berbasis jaringan sensor nirkabel. Rancangan jaringan terdiri dari node sensor yang ditempatkan secara statik di lahan pertanian dan node router serta gateway sebagai node bergerak yang dibawa oleh petani/mobil pertanian. Hasil evaluasi menunjukkan bahwa protokol DYMO dapat digunakan pada jaringan sensor nirkabel untuk sistem monitoring lahan pertanian. Evaluasi rancangan dan skenario di atas lingkungan simulasi OPNET memperlihatkan kinerja jaringan menggunakan protokol DYMO dapat diterima. Salah satu pengujian memperlihatkan rata-rata delay pengiriman dan penerimaan data sebesar 10,812506/ms, minimal waktu delay end-to-end pengiriman dan penerimaan node sebesar 19,105028/ms, maksimal sebesar 19,643988/ms, dan rata-rata pengiriman dan penerimaan delay end-to-end yaitu 19,377766/ms, nilai rata-rata throughput sebesar 46.651 bits/sec. Selain itu, evaluasi awal prototip node sensor berbasis XBee pada jarak 120 meter menunjukkan kinerja jaringan seperti kehilangan paket (packet loss) dan kekuatan sinyal yang dapat diterima.

scholarly journals Pencarian Rute yang Handal Berbasis Energi Menggunakan Algoritma EA-SHORT pada Protokol Routing ZRP di Jaringan MANET

2021 ◽  
Vol 3 (1) ◽  
pp. 31-42
Author(s):  
Mila Rosiana ◽  
Andy Hidayat Jatmika ◽  
Ariyan Zubaidi
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Energy Aware ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

Mobile Ad-Hoc Network (MANET) adalah jaringan wireless dari kumpulan node yang tidak memiliki router tetap. Setiap node dalam jaringan bertindak sebagai router yang bertanggung jawab untuk menemukan dan menangani rute antar node. Dalam penelitian ini, konsep energy aware menggunakan algoritma EA-SHORT diterapkan pada kerangka kerja Zone Routing Protocol (ZRP). EA-SHORT mencoba mendistribusikan beban jaringan ke semua node yang ada dengan memanfaatkan variasi jumlah energi dengan memilih node yang memiliki cukup energi yang dapat berpartisipasi dalam rute dan menghindari node yang memiliki energi rendah. Kinerja ZRP akan dibandingkan dengan EA-SHORT ZRP yang telah dimodifikasi dengan EA-SHORT yang diukur dari nilai parameter yang ditentukan. Dari simulasi, hasilnya menunjukkan, pada node 50, throughput meningkat sebesar 12,374%. Untuk 100 node, peningkatan sebesar 44.597%. Pada rata-rata average end to end delay , dengan 50 node, nilai EA-SHORT ZRP menurun sebesar 20.063%, 100 node EA-SHORT ZRP menurun sebesar 8.375%. Hasil PDR pada EA-SHORT ZRP dengan 50 node meningkat 0,545%, dan untuk EA-SHORT ZRP 100 node meningkat sebesar 21,301%

Sign in / Sign up

Export Citation Format

Share Document