scholarly journals ANFIS Based Optimal Routing using Group Teaching and Adaptive Equilibrium Optimization based Trust Aware Routing Protocol in MANET

2021 ◽  
Author(s):  
R. Hemalatha ◽  
R Umamaheswari ◽  
S Jothi
Keyword(s):  
Routing Protocol ◽  
Packet Transmission ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Route Selection ◽  
Optimal Route ◽  
Trust Evaluation ◽  
Route Maintenance ◽  
Multiple Routes ◽  
Maintenance Process

Abstract Recently, routing is considered the main problem in MANET due to its dynamic nature. The route discovery and the optimal route selection from the multiple routes are established for the efficient routing in MANET. The major objective of this research is to select the optimal route for packet transmission in MANET. In this paper, four stages namely trust evaluation, route discovery, optmal route selection and route maintanance are elucidated. Initially, the trust evaluation is made by using ANFIS where the primary trust values are evaluated. The next stage is the route discovery scheme, in which the routes are established by Group teaching optimization algorithm (GTA). From the route discovery scheme, multiple routes are found. The optimal route for the transmission is selected with the help of the Adaptive equilibrium optimizer (AO) algorithm. Finally, the route maintenance process is established; if any of the routes fails for the broadcast it immediately selects the alternate optimal route from the multi-zone routing table for efficient packet transmission. The proposed approach is evaluated by various performance measures like throughput, energy consumption, packet delivery ratio, end-to-end delay, packet loss rate, detection rate, and routing overhead. This result describes that the proposed approach outperforms other state-of-art approaches.

scholarly journals Optimal Route Maintenance based on Adaptive Equilibrium Optimization and GTA based Route Discovery Model in MANET

2021 ◽  
Author(s):  
R Hemalatha ◽  
R Umamaheswari ◽  
S Jothi
Keyword(s):  
Loss Rate ◽  
Packet Transmission ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Route Selection ◽  
Optimal Route ◽  
Trust Evaluation ◽  
Route Maintenance ◽  
Multiple Routes ◽  
Maintenance Process

Abstract Recently, routing is considered the main problem in MANET due to its dynamic nature. The route discovery and the optimal route selection from the multiple routes are established for the efficient routing in MANET. The major objective of this research is to select the optimal route for packet transmission in MANET. In this paper, four stages namely trust evaluation, route discovery, optmal route selection and route maintanance are elucidated. Initially, the trust evaluation is made by using ANFIS where the primary trust values are evaluated. The next stage is the route discovery scheme, in which the routes are established by Group teaching optimization algorithm (GTA). From the route discovery scheme, multiple routes are found. The optimal route for the transmission is selected with the help of the Adaptive equilibrium optimizer (AO) algorithm. Finally, the route maintenance process is established; if any of the routes fails for the broadcast it immediately selects the alternate optimal route from the multi-zone routing table for efficient packet transmission. The proposed approach is evaluated by various performance measures like throughput, energy consumption, packet delivery ratio, end-to-end delay, packet loss rate, detection rate, and routing overhead. This result describes that the proposed approach outperforms other state-of-art approaches.

scholarly journals Pengaruh Penerapan Algoritma Clustering COEEC Terhadap Kinerja Protokol Routing DSR di Jaringan MANET

2019 ◽  
Vol 1 (2) ◽  
Author(s):  
Lalu Ikhwan Rosadi ◽  
Andy Hidayat Jatmika ◽  
Sri Endang Anjarwani
Keyword(s):  
Routing Protocol ◽  
Source Node ◽  
Destination Node ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Alternative Communication ◽  
Neighboring Node ◽  
Route Maintenance ◽  
End To End Delay ◽  
Dynamic Source

MANET can be used as an alternative communication solution because it is mobile, meaning that it does not have a fixed infrastructure. MANET implementation can use routing protocols, one example of which is Dynamic Source Routing (DSR). DSR routing protocol works when there is a request for sending packets from the source node to the destination node using two main mechanisms namely, route discovery and route maintenance. Route discovery occurs when the process of sending data from the source node to the destination node by performing a flooding mechanism to the neighboring node. If there is an excessive flooding mechanism, it can cause an increase in routing overhead on the DSR routing protocol. So to overcome these problems clustering is done by utilizing the Overhead Energy Efficient Cluster (COEEC) algorithm on the DSR routing protocol. The results of the addition of clusters in the DSR routing protocol with the COEEC algorithm can increase throughput performance by 43% and 31%, then an increase in the average end to end delay of 0.005% and 0.01%, then the packet delivery ratio parameter increases

scholarly journals Metric Routing Protocol for Detecting Untrustworthy Nodes for Packet Transmission

2021 ◽  
Vol 3 (2) ◽  
pp. 67-76
Author(s):  
Smys S ◽  
Vijesh Joe
Keyword(s):  
Game Theory ◽  
Routing Protocol ◽  
Packet Transmission ◽  
Delivery Ratio ◽  
Trust Evaluation ◽  
Power Networks ◽  
Lossy Networks ◽  
Packet Delivery ◽  
Evolutionary Simulation ◽  
Simulation Results

IoT objects that have a resource constrained nature resulting in a number of attacks in the routing protocol for lossy networks and low-power networks. RPL is very vulnerable to selfish behaviours and internal attacks though they are built with encryption protection to secure messages. To address this vulnerability, in this paper, we propose a novel trustworthiness methodology based on metric for incorporating trust evaluation, enhancing the robustness of security mechanism. Simulation results indicate that the proposed work is efficient in terms of throughput, nodes’ rank changes, energy consumption and packet delivery ratio. Moreover, using mathematical modelling, it has been observed that this methodology meets the demands of loop-freeness, optimality and consistency. This shows that this metic has both monotonicity and isotonicity requirements to enable the routing protocol. Incorporating the concepts of game theory, we can use this technique as a strategy to iterate Prisoner’s Dilemma. Both evolutionary simulation and mathematical analysis indicate that the proposed metric-based routing protocol is an efficient technique in promoting evolution and stability of the IoT network.

scholarly journals Penerapan Algoritma Semut pada Protokol Routing AOMDV untuk Optimasi Pencarian Rute di Jaringan VANET

2020 ◽  
Vol 2 (2) ◽  
pp. 162-172
Author(s):  
Ni Desak Ketut Pujika Dewi ◽  
Andy Hidayat Jatmika ◽  
Ariyan Zubaidi
Keyword(s):  
Routing Protocol ◽  
Selection Process ◽  
Ant Algorithm ◽  
Delivery Ratio ◽  
Route Selection ◽  
Route Maintenance ◽  
Packet Delivery ◽  
End To End Delay ◽  
Route Search ◽  
Working Mechanisms

VANET is a wireless network that is a derivative of the MANET network. VANET network is one network that can be used to communicate between one vehicle and another vehicle. With the existence of the VANET network, it is expected to be able to improve the safety of drivers on the highway. One of the uses of the AOMDV routing protocol is that it can be used to help the performance of the VANET network, the AOMDV routing protocol. AOMDV routing protocol in conducting route search there are two working mechanisms namely route discovery and route maintenance. The route selection process in the AOMDV routing protocol is to consider the number of hops contained in the AOMDV routing protocol, so that the possibility of a broken link, therefore the need for the application of the method in conducting this research. The ant algorithm is one method that can optimize the process of finding a route in the AOMDV routing protocol. The ant algorithm in carrying out the route search is by calculating the distance between nodes. In the ant algorithm, the route selection is based on the most powerful pheromones, so the route chosen is no longer based on the number of hops. From the results of trials that have been carried out on the AOMDV routing protocol using the ant algorithm can improve the performance of the test throughput parameters of 9.7649 Kbps and the performance of the Packet Delivery Ratio of 11.2838%. Whereas the average end to end delay parameter can reduce the delay by 13.3093ms

scholarly journals Geographic-based Routing in Smart Grid’s Neighbor Area Networks

2014 ◽  
Vol 3 (3-4) ◽  
Author(s):  
Quang-Dung Ho ◽  
Gowdemy Rajalingham ◽  
Tho Le-Ngoc
Keyword(s):  
Demand Response ◽  
Routing Protocol ◽  
Information Exchange ◽  
Ieee 802.15.4 ◽  
Packet Transmission ◽  
Delivery Ratio ◽  
Area Network ◽  
Smart Meter ◽  
Smart Grid Communications ◽  
Wireless Mesh

Neighbor area network (NAN), also known as smart meter communication network, is one of the most important segments of smart grid communications network (SGCN). This paper studies the performance of greedy perimeter stateless routing (GPSR), a representative implementation of geographic-based routing class, in the NAN scenario and investigates the feasibility of this routing protocol in supporting SG applications. Specifically, packet transmission delay and reliability of GPSR in an IEEE 802.15.4-based wireless mesh NAN with practical system parameters are measured by simulations. The results show that, at the data rate required for conventional SG applications including smart metering, real-time pricing and demand response, the delay can always be maintained below 70 ms (in 95th-percentile perspective) while packet delivery ratio is higher than 90%. However, due to that fact that more advanced applications that require information exchange at higher rates and more stringent delays are emerging in SG, the performance of GPSR in NAN scenarios using radio technologies that can support higher loads and/or larger network scales needs to be studied.

scholarly journals PERFORMANCE COMPARISON WITH ACCESSIBILITY PREDICTION AND LINK BREAKAGE PREDICTION IN MANETS

2015 ◽  
pp. 48-54
Author(s):  
TEJAL ARVIND SONAWALE ◽  
SHIKHA NEMA
Keyword(s):  
Ad Hoc ◽  
Power Level ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Network Resources ◽  
Average Delay ◽  
Network Bandwidth ◽  
Multiple Routes ◽  
Hoc Networks

Ad Hoc Networks face a lot of problems due to issues like mobility, power level, load of the network, bandwidth constraints, dynamic topology which lead to link breaks, node break down and increase in overhead. As nodes are changing their position consistently, routes are rapidly being disturbed, thereby generating route errors and new route discoveries. The need for mobility awareness is widely proclaimed. In our dissertation we present a scheme AOMDV-APLP that makes AOMDV aware of accessibility of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and keep in their routing table. Based on this information route discovery is restricted to only “accessible” and “start” nodes. Further route with the strongest signal strength is selected from multiple routes using Link life value predicted by Link Breakage prediction technique. Simulation result shows that using accessibility and link life knowledge in route discovery process MAC overhead, routing overhead and average delay is reduced 3 times, and improve the Packet delivery ratio to a large extent than standard AOMDV which reflects effective use of network resources.

The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET

2013 ◽  
Vol 5 (2) ◽  
pp. 46-57
Author(s):  
Naseer Ali Husieen ◽  
Suhaidi Hassan ◽  
Osman Ghazali ◽  
Lelyzar Siregar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobility Model ◽  
Network Size ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Dynamic Source

This paper evaluates the performance of Reliable Multipath Dynamic Source Routing Protocol (RM-DSR) protocol with different network size compared to DSR protocol. RM-DSR developed in the mobile ad-hoc network to recover from the transient failure quickly and divert the data packets into a new route before the link is disconnected. The performance of RM-DSR protocol is tested in the Network Simulator (NS-2.34) under the random way point mobility model with varying number of mobile nodes. The network size parameter is used to investigate the robustness and the efficiency of RM-DSR protocol compared to DSR protocol. The network size affects the time of the route discovery process during the route establishment and the route maintenance process which could influence the overall performance of the routing protocol. The simulation results indicate that RM-DSR outperforms DSR in terms of the packet delivery ratio, routing overhead, end-to-end delay, normalized routing load and packet drop.

Adaptive Multi Path Routing Protocol for Heterogeneous Multi-Hop Wireless Sensor Network

2013 ◽  
Vol 291-294 ◽  
pp. 2532-2536
Author(s):  
Han Hua Yang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Minimum Cost ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Heterogeneous Wireless Sensor Network ◽  
Multiple Paths ◽  
Initial Route

Multi path routing protocol plays important part in the multi hop heterogeneous wireless sensor network. To get better performance, adaptive Wireless Senor Network Multi Path Routing Scheme (AMRH) is proposed, which is made up of three phrases: initial setup, route discovery and establishment, route maintenance. In the first phrase, every node gets the initial route table. In the second phrase, source node will find minimum-cost path among multiple paths. In the third phrase, route maintenance is conducted under adaptive mechanism. Simulation shows that AMRH scheme can prolong sensor network lifetime by 19.5%, increase data delivery ratio by 5.6%.

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.

Sign in / Sign up

Export Citation Format

Share Document