Realization of Route Reconstructing Scheme for Mobile Ad hoc Network

2011 ◽  
pp. 62-79 ◽  
Author(s):  
Qin Danyang ◽  
Ma Lin ◽  
Sha Xuejun ◽  
Xu Yubin
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Heavy Traffic ◽  
Route Maintenance ◽  
End To End Delay ◽  
Communication Links ◽  
Mobile Ad Hoc ◽  
End To End ◽  
The Stability

Mobile Ad Hoc Network (MANET) is a centerless packet radio network without fixed infrastructure. In recent years tremendous attentions have been received because of capabilities of self-configuration and self-maintenance. However, attenuation and interference caused by node mobility and wireless channels sharing weaken the stability of communication links especially in ubiquitous MANET. A mathematical exploring model for next-hop node has been established. The negative impact of wireless routes discontinuity on pervasive communication is alleviated by a novel route reconstructed scheme proposed in this paper based on restricting the route requirement zone into a pie slice region on intermediate nodes according the solution of the exploring equation. The scheme is an effective approach to increase survivability and reduce average end-to-end delay during route maintenance as well as allowing continuous packet forwarding for fault resilience so as to support mobile multimedia communication. The ns-2 based simulation results show remarkable packets successful delivery rate and end-to-end delay improvements of source-initiated routing protocol with route reconstructing scheme, and especially in the case of high dynamic environments with heavy traffic loads, more robust and scalable performance will be obtained.

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%

Securing Energy Routing Protocol against Black Hole Attacks in Mobile Ad-Hoc Network

2020 ◽  
Vol 13 ◽  
Author(s):  
Rajendra Prasad P ◽  
Shiva Shankar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Packet Delivery ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

Introduction: The aim of the securing energy routing protocol, is to provide the countermeasures to the attacks par-ticularly to the black hole in mobile ad-hoc network, and enhancing the network performance metric throughput al-so reducing the end-to-end delay between the nodes in the network.To build the protocol that enhances the perfor-mance of the network by modifying the existing DSR protocol by introducing new route discovery mechanism in the proposed protocol. Method: The proposed protocol implementation has two phases, route request/reply phase and route confirm phas-es. During the route discovery process, the route discovery from the source to destination process are described by sending the RREQ packet from the source hub as shown in Fig. 1(a), when it does not have one accessible and crav-ings a route to a destination. The source node transmits the RREQ to its associate nodes and the destination node re-ply with RREP. When the source receives reply message, the source node respond with reverse path with a confirm RCON message and providing security to the nodes in the network. Results: To verify the performance of the proposed protocol against the existing DSR protocol are compared with respect to various network metrics like end-to-end delay and packet delivery ratio and validated the result by com-paring both routing algorithm using Network Simulator 2. Conclusion: The results of the proposed SERP strongly safeguard against the attacks in the network and the packet delivery ratio is increased compared with the DSR also the end-to-end delay is reduced in the proposed protocol. Discussion: Mobile ad-hoc networks are being dynamic in nature, it associates with issues relating to secure routing, energy and are generally vulnerable to several types of attacks. The DSR is one of the widely used reactive proto-cols available for the mobile ad-hoc network and the proposed work enhancing the security of the network in the existing pro

scholarly journals Efficient Heuristic Based on Clustering Approach for OLSR

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ali Choukri ◽  
Ahmed Habbani ◽  
Mohamed El Koutbi
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Dynamic Nature ◽  
End To End Delay ◽  
Delay Control ◽  
Clustering Approach ◽  
Mobile Ad Hoc

Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present papercomeswithin the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to beimplemented inOLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss.

scholarly journals Comparative Study of Routing Protocols in MANET

2017 ◽  
Vol 10 (1) ◽  
pp. 174-179 ◽  
Author(s):  
Sachin Lalar ◽  
Arun Yadav
Keyword(s):  
Comparative Study ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Route Selection ◽  
Route Maintenance ◽  
Routing Table ◽  
Mobile Ad Hoc

Routing protocol is the essential and vital performance factor in the Mobile Ad-hoc Network. The routing protocols in MANET are accomplished to handle a lot number of nodes with restricted resources. There is a variety of routing protocol exist in MANET. The routing protocol which is chosen may have an effect on the performance of network. In this paper, We perform a comparative study of DSDV, CSGR, WRP, AODV, OLSR, DSR, TORA, ZRP, ZHLS, DYMO routing protocol with respect to Routing Approaches, Routing structure, Route selection, Route, Routing table, Route maintenance, Operation of protocols, Strength, Weakness.

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 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

A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks

2010 ◽  
Vol 2 (1) ◽  
pp. 12-26 ◽  
Author(s):  
Natarajan Meghanathan ◽  
Meena Sugumar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Data Packet ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End ◽  
Index Value ◽  
Minimum Interference

The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay per data packet. During route discovery, each node inserts its identification and location information before broadcasting the Route-Request (RREQ) message in its neighborhood. The weight of a link, called the interference index, is the number of interfering links surrounding it. Two links are said to interfere with each other, if the distance between the mid points of the two links is within the interference range. The interference index of a path is the sum of the interference index values of the constituent links. The destination selects the path with the minimum interference index value and notifies the source through the Route-Reply packet. Simulation results demonstrate that MIF incurs a significant reduction in the end-to-end delay per data packet vis-à-vis the interference-aware load balancing routing protocol.

Comparative Assessment and Performance Analysis of Numerous Mobile Ad-Hoc Network Routing Protocols

2019 ◽  
Vol 16 (9) ◽  
pp. 3906-3911
Author(s):  
Karan Singh ◽  
Rajeev Gupta
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Mobile Ad Hoc ◽  
And Performance

Recent progression in the field of information and communication cause increase of packet count over the World Wide Web network. These communicated packets should deliver on time from origin node to destination node using a reliable and shortest route. In this way routing plays an important part in dispatching the packets to destination form the source. This routing becomes more crucial when packets delivery is done in independent mobile nodes which dynamically form a temporary network. This network named as Mobile Ad-Hoc Network and therefore it is said to be particular reason-specific, self-ruling and dynamic. In this paper we analyzed 3 protocols and for a quality of service (i.e., Packet Delivery Ratio) and achieved comparative study of various protocols of routing with respect to Operation of protocols, Route maintenance, Routing table, Route, Route selection, Routing structure, Routing Approaches, Protocol types, Merits and Demerits.

Sign in / Sign up

Export Citation Format

Share Document