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 Towards Developing Enhanced Cluster-Based QoS-Aware Routing in MANET

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Kebebew Ababu Yitayih ◽  
Mulugeta Libsie
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Link State ◽  
End To End Delay ◽  
Clustering Approach ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Creating dynamic communication infrastructures between mobile devices and satisfying the desires for time-sensitive multimedia applications have introduced new challenges in the design of protocols for mobile ad hoc networks. In this paper, to stream time-sensitive applications using mobile ad hoc network (MANET), we have selected the Optimal Link State Routing (OLSR) protocol. However, the protocol has high overhead because each node selects a set of multipoint relay (MPR) nodes. Therefore, we have proposed quality of service (QoS) supporting the MPR selection approach and a new lower maintenance clustering approach for minimizing the overhead of the network. As a result, the proposed approach showed a better result in the average end-to-end delay, packet delivery ratio, routing load, and throughput.

FractWhale-DSR: Fractional Whale Optimization Based Secure Dynamic Source Routing Algorithm for Mobile Ad-hoc Network

2020 ◽  
Vol 13 (5) ◽  
pp. 942-956
Author(s):  
Putra Suma ◽  
Mohammed Ali Hussain
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
High Energy ◽  
Separation Distance ◽  
Delivery Ratio ◽  
Dynamic Nature ◽  
Whale Optimization ◽  
Mobile Ad Hoc ◽  
Secured Routing

Background: Nodes in the mobile Ad-hoc network (MANET) have the dynamic nature due to their vast separation distance. The dynamic nature of the MANET nodes changes the routing path established for the communication. The dynamic secured routing (DSR) has gained popularity since they provide the routing path based on the demand provided by the source and destination nodes. Various literature works have discussed the DSR strategy for routing path establishment, but faces challenges since it consumes high energy during the route discovery phase. Objective: To overcome the challenges in the existing works, a DSR strategy based on the Fractional Whale optimization algorithm (FWOA) is introduced in this work. Methods: The proposed algorithm uses the C 2 TE based selection criteria which depend on the connectivity, congestion, trust, and energy for selecting the suitable nodes for the communication. The proposed FractWhale-DSR algorithm finds the secured routing path in three phases. Results: The parameters, such as throughput, delay, Packet Delivery Ratio (PDR), and the energy define the performance of the proposed model. From the simulation results, the proposed FractWhale- DSR algorithm has an overall better performance with the values of 0.57265, 0.005118, 0.786325, and 75.88636% for throughput, delay, PDR, and energy respectively at the round of 25 for the MANET with 100 nodes. Conclusion: The proposed DSR strategy has the advantage of adaptability and scalability. Also, the router selects the alternate paths, when there is a link failure in the current network.

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 Se-Eaodv to Detect and Prevent Black Hole Attack in Manets

2020 ◽  
Vol 9 (8) ◽  
pp. 513-517
Keyword(s):  
Black Hole ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Route Request

The security of the data which is transferred from source to destination is of prime importance in the mobile ad hoc network (MANET) or any kind of network to be very precise. If the data gets lost then the entire purpose of deploying and creating the network fails. Mobile ad hoc networks suffer from various attacks out of which black hole attack is considered the most dangerous one because in this attack the venomous node release all the packets received by it. The authors in EAODV has used the concept of fake route request packets to identify the black hole nodes in the grid. The proposed technique detects the malicious black hole node using the sequence numbers. The performance of the network has been examined based on end to end delay, packet delivery ratio, detection time, throughput and remaining energy. These parameters have shown improvement over the existing scheme.

scholarly journals Improving Performance of Mobile Ad Hoc Network Using Clustering Schemes

2017 ◽  
Vol 6 (2) ◽  
pp. 69
Author(s):  
Mohamed Er-Rouidi ◽  
Houda Moudni ◽  
Hassan Faouzi ◽  
Hicham Mouncif ◽  
Abdelkrim Merbouha
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Low Cost ◽  
Dominating Set ◽  
Virtual Group ◽  
Clustering Approach ◽  
Mobile Ad Hoc ◽  
Energy Efficient Clustering ◽  
Total Network

Mobile ad hoc network become nowadays more and more used in different domains, due to its flexibility and low cost of deployment. However, this kind of network still suffering from several problems as the lack of resources. Many solutions are proposed to face these problems, among these solutions there is the clustering approach. This approach tries to partition the network into a virtual group. It is considered as a primordial solution that aims to enhance the performance of the total network, and makes it possible to guarantee basic levels of system performance. In this paper, we study some schemes of clustering such as Dominating-Set-based clustering, Energy-efficient clustering, Low-maintenance clustering, Load-balancing clustering, and Combined-metrics based clustering.

scholarly journals Design of data confidential and reliable bee clustering routing protocol in MANET (Vol 2)

2018 ◽  
Vol 7 (2.8) ◽  
pp. 661
Author(s):  
Sajyth RB ◽  
Sujatha G
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Data Privacy ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Forwarding ◽  
Data Reliability ◽  
Data Confidentiality ◽  
Clustering Approach ◽  
Mobile Ad Hoc

Mobile ad hoc network (MANET) requires extraneous energy effectualness and legion intelligence for which a best clustered based approach is pertained called the “Bee-Ad Hoc-C”. In MANET the mechanism of multi-hop routing is imperative but may leads to a challenging issue like lack of data privacy during communication. ECC (Elliptical Curve Cryptography) is integrated with the Bee clustering approach to provide an energy efficient and secure data delivery system. Even though it ensures data confidentiality, data reliability is still disputable such as data dropping attack, Black hole attack (Attacker router drops the data without forwarding to destination). In such cases the technique of overhearing is utilized by the neighbor routers and the packet forwarding statistics are measured based on the ratio between the received and forwarded packets. The presence of attack is detected if the packet forwarding ratio is poor in the network which paves a way to the alternate path identification for a reliable data transmission. The proposed work is an integration of SC-AODV along with ECC in Bee clustering approach with an extra added overhearing technique which n on the whole ensures data confidentiality, data reliability and energy efficiency.

scholarly journals Prediction Algorithm for Mobile Ad Hoc Network Connection Breaks

2020 ◽  
Vol 12 (6) ◽  
pp. 49-63
Author(s):  
Yasir Mohammed ◽  
Maha Abdelhaq ◽  
Raed Alsaqour
Keyword(s):  
Ad Hoc Network ◽  
Link Prediction ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Node ◽  
Prediction Algorithm ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Ad Hoc

A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.

scholarly journals Improving the selection of MPRs in OLSR protocol: a survey of methods and techniques

2020 ◽  
Vol 10 (1) ◽  
pp. 288
Author(s):  
Omar Barki ◽  
Zouhair Guennoun ◽  
Adnane Addaim
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Link State ◽  
Execution Environment ◽  
Mobile Ad Hoc ◽  
Optimized Link State Routing ◽  
Selection Of

Multi Point Relays (MPRs) are those nodes that are calculated and determined by the Optimized Link State Routing protocol (OLSR) in order to minimize and avoid overload inside the Mobile Ad hoc Network (MANET). In this paper, we will present a synthetic study of many techniques and methods for calculating and selecting the MPR nodes using a set of criteria namely energy, mobility, bandwidth, the quality of links, etc. The result of this study shows that most techniques consider a limited number of metrics for selecting the MPR nodes and therefore they are insufficient to allow the OLSR protocol to be quite complete and efficient because several metrics can occur at the same time in the real execution environment.

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