Showing papers on "Zone Routing Protocol published in 2022"
TL;DR: This research work presents an energy optimizing secure routing scheme for IoT application in heterogeneous WSNs using the multipath link routing protocol (MLRP) and shows an improvement in performance parameters such as throughput, energy efficiency, end-to-end delay, network lifetime and data storage capacity.
Abstract: Wireless sensor networks (WSNs) and the Internet of Things (IoT) are increasingly making an impact in a wide range of domain-specific applications. In IoT-integrated WSNs, nodes generally function with limited battery units and, hence, energy efficiency is considered as the main design challenge. For homogeneous WSNs, several routing techniques based on clusters are available, but only a few of them are focused on energy-efficient heterogeneous WSNs (HWSNs). However, security provisioning in end-to-end communication is the main design challenge in HWSNs. This research work presents an energy optimizing secure routing scheme for IoT application in heterogeneous WSNs. In our proposed scheme, secure routing is established for confidential data of the IoT through sensor nodes with heterogeneous energy using the multipath link routing protocol (MLRP). After establishing the secure routing, the energy and network lifetime is improved using the hybrid-based TEEN (H-TEEN) protocol, which also has load balancing capacity. Furthermore, the data storage capacity is improved using the ubiquitous data storage protocol (U-DSP). This routing protocol has been implemented and compared with two other existing routing protocols, and it shows an improvement in performance parameters such as throughput, energy efficiency, end-to-end delay, network lifetime and data storage capacity.
51 citations
TL;DR: In this article , an intersection-based V2X routing protocol that includes a learning routing strategy based on historical traffic flows via Q-learning and monitoring real-time network status is proposed.
Abstract: With the rapid development of the Internet of vehicles (IoV), routing in vehicular ad hoc networks (VANETs) has become a popular research topic. Due to the features of the dynamic network structure, constraints of road topology and variable states of vehicle nodes, VANET routing protocols face many challenges, including intermittent connectivity, large delay and high communication overhead. Location-based geographic routing is the most suitable method for VANETs, and such routing performs well on paths with an appropriate vehicle density and network load. We propose an intersection-based V2X routing protocol that includes a learning routing strategy based on historical traffic flows via Q-learning and monitoring real-time network status. The hierarchical routing protocol consists of two parts: a multidimensional Q-table, which is established to select the optimal road segments for packet forwarding at intersections; and an improved greedy strategy, which is implemented to select the optimal relays on paths. The monitoring models can detect network load and adjust routing decisions in a timely manner to prevent network congestion. This method minimizes the communication overhead and latency and ensures reliable transmission of packets. We compare our algorithm with three benchmark algorithms in an extensive simulation. The results show that our algorithm outperforms the existing methods in terms of network performance, including packet delivery ratio, end-to-end delay, and communication overhead.
17 citations
TL;DR: In this paper , a Hybrid Genetic Firefly Algorithm-based Routing Protocol (HGFA) is proposed for faster communication in VANETs for both sparse and dense network scenarios.
Abstract: Vehicular Adhoc Networks (VANETs) are used for efficient communication among the vehicles to vehicle (V2V) infrastructure. Currently, VANETs are facing node management, security, and routing problems in V2V communication. Intelligent transportation systems have raised the research opportunity in routing, security, and mobility management in VANETs. One of the major challenges in VANETs is the optimization of routing for desired traffic scenarios. Traditional protocols such as Adhoc On-demand Distance Vector (AODV), Optimized Link State Routing (OLSR), and Destination Sequence Distance Vector (DSDV) are perfect for generic mobile nodes but do not fit for VANET due to the high and dynamic nature of vehicle movement. Similarly, swarm intelligence routing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) routing techniques are partially successful for addressing optimized routing for sparse, dense, and realistic traffic network scenarios in VANET. Also, the majority of metaheuristics techniques suffer from premature convergence, being stuck in local optima, and poor convergence speed problems. Therefore, a Hybrid Genetic Firefly Algorithm-based Routing Protocol (HGFA) is proposed for faster communication in VANET. Features of the Genetic Algorithm (GA) are integrated with the Firefly algorithm and applied in VANET routing for both sparse and dense network scenarios. Extensive comparative analysis reveals that the proposed HGFA algorithm outperforms Firefly and PSO techniques with 0.77% and 0.55% of significance in dense network scenarios and 0.74% and 0.42% in sparse network scenarios, respectively.
16 citations
TL;DR: Simulation results indicate the proposed E-OLSR outperforms the existing OLSR and achieves supremacy over other protocols mentioned in this paper.
Abstract: The growing need for wireless communication has resulted in the widespread usage of unmanned aerial vehicles (UAVs) in a variety of applications. Designing a routing protocol for UAVs is paramount as well as challenging due to its dynamic attributes. The difficulty stems from features other than mobile ad hoc networks (MANET), such as aerial mobility in 3D space and frequently changing topology. This paper analyzes the performance of four topology-based routing protocols, dynamic source routing (DSR), ad hoc on-demand distance vector (AODV), geographic routing protocol (GRP), and optimized link state routing (OLSR), by using practical simulation software OPNET 14.5. Performance evaluation carries out various metrics such as throughput, delay, and data drop rate. Moreover, the performance of the OLSR routing protocol is enhanced and named “E-OLSR” by tuning parameters and reducing holding time. The optimized E-OLSR settings provide better performance than the conventional request for comments (RFC 3626) in the experiment, making it suitable for use in UAV ad hoc network (UANET) environments. Simulation results indicate the proposed E-OLSR outperforms the existing OLSR and achieves supremacy over other protocols mentioned in this paper.
12 citations
TL;DR: In this article , an energy-saving clustering protocol based on adaptive Voronoi dividing (ESCVAD) protocol is proposed to balance the energy consumption between cluster head nodes and cluster member nodes.
Abstract: An excellent routing protocol is important for wireless sensor network (WSN) construction and efficient data transmission. With the continuous expansion of the application scenarios and scopes of the Internet of Things, the existing WSN routing protocols are no longer suitable for the complex network structure and the huge demands of communications. Aiming at these issues of existing routing protocols, such as short network lifetime caused by high energy consumption and uneven distribution of surviving nodes, this article proposes an energy-saving clustering protocol based on adaptive Voronoi dividing, named energy-saving clustering by Voronoi adaptive dividing (ESCVAD) protocol. The innovation of ESCVAD protocol lies in the adaptive clustering algorithm based on Voronoi dividing and cluster head election optimization algorithm based on distance and energy comprehensive weighting. The advantage of proposed algorithms is effectively to balance the energy consumption between cluster head nodes and cluster member nodes. The simulation results show that, compared with the traditional routing protocols, such as low energy adaptive clustering hierarchy (LEACH) protocol and stable energy protocol (SEP), the proposed ESCVAD protocol can effectively reduce the clustering frequency and cluster head electing frequency, so as to reduce signaling interaction frequency, finally result in the energy consumption down and the network lifetime up. Among the six protocols for comparation, ESCVAD has the best network lifetime and energy efficiency.
10 citations
TL;DR: An Energy-Efficient Multipath Clustering with Load balancing routing protocol for WMSNs (EEMCL) was proposed to minimize the energy consumption and prolong the network lifetime.
10 citations
TL;DR: In this article , a traffic aware and link quality sensitive routing protocol (TLRP) is proposed for urban Internet of Vehicles (IoV) in which a novel routing metric, i.e., Link Transmission Quality (LTQ), is designed to account for the impact of the number, quality and relative positions of communication links along a routing path on the network performance.
Abstract: Considering the high mobility and uneven distribution of vehicles, an efficient routing protocol should avoid that the sent packets are forwarded within road segments with ultra-low density or serious data congestion in vehicular networks. To this end, in this paper, we propose a Traffic aware and Link Quality sensitive Routing Protocol (TLRP) for urban Internet of Vehicles (IoV). First, we design a novel routing metric, i.e., Link Transmission Quality (LTQ), to account for the impact of the number, quality and relative positions of communication links along a routing path on the network performance. Then, to adapt to the dynamic characteristics of IoV, a road weight evaluation scheme is presented to assess each road segment using the real-time traffic and link information quantified by the LTQ. Next, the path with the lowest aggregated weight is selected as the routing candidate. Extensive simulations demonstrate that our proposed protocol achieves significant performance improvements compared to the state-of-the-art protocol MM-GPSR, the typical junction-based scheme E-GyTAR, and the classic connectivity-based routing iCAR, in terms of packet delivery ratio and average transmission delay.
9 citations
9 citations
9 citations
TL;DR: In this article , AODV and Ant Colony Optimization (ACO) technique is applied and data is transmitted to establish path from source to destination using multicasting approach and also reduce the chances of congestion in the network.
8 citations
TL;DR: A survey of position-based routing protocols can be found in this article , where the main requirements of current general applications are also studied and the survey proposes a number of protocols for use in particular application areas.
Abstract: A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications. However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes. This article is a survey of almost 50 position-based routing protocols and it comes as an aid in the implementation of this type of routing in various applications which may need to consider the advantages and pitfalls of position-based routing. An emphasis is made on geographic routing, whose notion is clarified as a more restrictive and more efficient type of position-based routing. The protocols are therefore divided into geographic and non-geographic routing protocols and each is characterized according to a number of network design issues and presented in a comparative manner from multiple points of view. The main requirements of current general applications are also studied and, depending on these, the survey proposes a number of protocols for use in particular application areas. This aims to help both researchers and potential users assess and choose the protocol best suited to their interest.
TL;DR: This proposed CFTEERP uses the nearest secure node costs to increase the network lifetime without selecting the nearest nodes for routing the data, and provides 90% of PDR and a minimal energy consumption rate of 25% lesser than the existing systems against different malicious attacks.
Abstract: The open communication medium of the Internet of Things (IoT) is more vulnerable to security attacks. As the IoT environment consists of distributed power limited units, the routing protocol used for distributed routing should be light‐weighted compared to other centralized networks. In this situation, complex security algorithms and routing mechanisms affect the generic data communications in IoT platforms. To handle this problem, this proposed system develops a cooperative and feedback‐based trustable energy‐efficient routing protocol (CFTEERP). This protocol calculates local trust value (LTV) and global trust value (GTV) of each node using node attributes and K‐means‐based feedback evaluation procedures. The K‐means clustering algorithm leaves out the distorted node routing metrics and misbehaving node metrics for all channels. This proposed CFTEERP uses the nearest secure node costs to increase the network lifetime without selecting the nearest nodes for routing the data. In this work, secure routing is initiated using multipath routing strategy that analyses LTV, GTV, next trustable node, average throughput, energy consumption, average packet delivery ratio (PDR) and traffic various metrics of entire IoT communication. The technical aspects of proposed system are implemented to solve different existing techniques' limitations. In the comparative experiment, the proposed method provides 90% of PDR and a minimal energy consumption rate of 25% lesser than the existing systems against different malicious attacks.
TL;DR: MobiRPL as discussed by the authors is an adaptive, robust, and received signal strength indicator (RSSI)-based mobile routing scheme based on the RPL standard that focuses more on maintaining reliable routing topology than on minimizing energy consumption.
Abstract: This paper tackles the mobile routing issues in low-power and lossy networks (LLNs). The IPv6 standard routing protocol for LLNs, termed IPv6 routing protocol for low-power and lossy networks (RPL), has mostly been investigated in static LLNs and it has no explicit mechanism to support mobility. In addition, there is no mobile routing protocol that works well in mobile LLNs. Considering the importance of mobility support in many LLN applications, this work designs and implements MobiRPL, an adaptive, robust, and received signal strength indicator (RSSI)-based mobile routing scheme based on the RPL standard. To cope with network dynamics, the MobiRPL design focuses more on maintaining reliable routing topology than on minimizing energy consumption. This design choice significantly improves reliability while maintaining the acceptable energy consumption of mobile LLNs. We implement MobiRPL on Contiki OS, and evaluate its effectiveness extensively through Cooja simulation and testbed experiments. Our results from the testbed show that MobiRPL improves mobile nodes' packet delivery ratio by 11.3% compared to RPL and reduces the energy consumption of mobile nodes by 73.3% compared to the baseline scheme, i.e., the lightweight on-demand ad-hoc distance-vector routing protocol — next generation (LOADng).
TL;DR: This work proposes MPCN-RP, a general routing protocol for payment channel networks with multiple charges, which significantly outperforms the baseline algorithms in terms of time and fees.
Abstract: Blockchain-based cryptocurrencies are severely limited in transaction throughput and latency due to the need to seek consensus among all peers of the network. A promising solution to this issue is payment channels, which allow unlimited numbers of atomic and trust-free payments between two peers without exhausting the resources of the blockchain. A linked payment channel network enables payments between two peers without direct channels through a series of intermediate nodes that forward and charge for the transactions. However, the charging strategies of intermediate nodes vary with different payment channel networks. Existing works do not yet have a complete routing algorithm to provide the most economical path for users in a multi-charge payment channel network. In this work, we propose MPCN-RP, a general routing protocol for payment channel networks with multiple charges. Our extensive experimental results on both simulated and real payment channel networks show that MPCN-RP significantly outperforms the baseline algorithms in terms of time and fees.
TL;DR: The results show that the protocol based on the BFGO-C can be successfully applied to the clustering routing protocol and can effectively reduce energy consumption and enhance network performance.
Abstract: In wireless sensor networks (WSN), most sensor nodes are powered by batteries with limited power, meaning the quality of the network may deteriorate at any time. Therefore, to reduce the energy consumption of sensor nodes and extend the lifetime of the network, this study proposes a novel energy-efficient clustering mechanism of a routing protocol. First, a novel metaheuristic algorithm is proposed, based on differential equations of bamboo growth and the Gaussian mixture model, called the bamboo growth optimizer (BFGO). Second, based on the BFGO algorithm, a clustering mechanism of a routing protocol (BFGO-C) is proposed, in which the encoding method and fitness function are redesigned. It can maximize the energy efficiency and minimize the transmission distance. In addition, heterogeneous nodes are added to the WSN to distinguish tasks among nodes and extend the lifetime of the network. Finally, this paper compares the proposed BFGO-C with three classic clustering protocols. The results show that the protocol based on the BFGO-C can be successfully applied to the clustering routing protocol and can effectively reduce energy consumption and enhance network performance.
TL;DR: In this paper , a node location prediction based on the temporal and spatial characteristics with respect to its neighborhood is applied to estimate the probable locations using a hybrid model, and a multi path routing protocol based on estimated probability locations with path diversion at necessary places along path is proposed for improved routing performance without larger packet overhead.
TL;DR: In a new scenario called FB-DBR, clustering is performed, and fuzzy logic and bloom filter are used in each cluster’s new routing protocol in underwater wireless sensor networks, and better results are obtained and bloom filters areused in routing tables to compensate for the deceleration.
Abstract: Routing protocols for underwater wireless sensor networks (UWSN) and underwater Internet of Things (IoT_UWSN) networks have expanded significantly. DBR routing protocol is one of the most critical routing protocols in UWSNs. In this routing protocol, the energy consumption of the nodes, the rate of loss of sent packets, and the rate of drop of routing packets due to node shutdown have created significant challenges. For this purpose, in a new scenario called FB-DBR, clustering is performed, and fuzzy logic and bloom filter are used in each cluster’s new routing protocol in underwater wireless sensor networks. Due to the fuzzy nature of the parameters used in DBR, better results are obtained and bloom filters are used in routing tables to compensate for the deceleration. as the average number of accesses to routing table entries, dead nodes, Number of Packets Sent to Base Station (BS), Number of Packets Received at BS, Packet Dropped, and Remaining Energy has improved significantly.
TL;DR: In this paper , the authors used residual energy to analyze routing protocols' energy efficiency as a metric to analyze selected routing protocols; Destination Sequence Distance Vector (DSDV) and Ad-hoc On-demand Distance Vector(AODV) via simulation.
Abstract: Mobile Ad-hoc Network (MANET) is a wireless network that comes with a few routing protocols which have varied mechanisms. Studies show that routing operations consume energy while current research focuses more on MANET routing protocol operation and its performance evaluation, the required energy for successful routing operations equally demands quality attention of researchers. Hence, the need to expand the scope of study on MANET routing protocols to the neglected area of studies. To bridge the research gap between MANET routing protocols and energy consumption, this paper used residual energy to analyze routing protocols’ energy efficiency as a metric to analyze selected routing protocols; Destination Sequence Distance Vector (DSDV) and Ad-hoc On-demand Distance Vector (AODV) via simulation. It also compared the amount of energy required to transmit the data packets to their destinations in DSDV and AODV. Results, in terms of energy efficiency, indicated that AODV was better than DSDV because it consumed less energy for its successful routing operations
TL;DR: In this paper , a cluster based proactive routing protocol named as Distance and Energy Aware Stable Election Routing Protocol (DE-SEP) is proposed to ensure optimum energy conservation.
Abstract: Sensing technology has undergone a revolution as a result of technological advancements, where the wireless sensor network (WSN) is considered as a major research area in recent times. WSN is made up of battery-powered multiple sensor nodes with limited energy, which eventually encourage the researchers in designing an energy efficient routing protocol to prolong the network lifetime. Hierarchical routing protocols can play an important role to improve the network’s energy efficiency utilizing the threshold-based cluster head (CH) selection techniques. In this article, a cluster based proactive routing protocol named as Distance and Energy Aware Stable Election Routing Protocol (DE-SEP) is proposed to ensure optimum energy conservation. Here, both the energy and distance criteria are incorporated in CH selection to give priority for comparatively higher energy nodes and nearby nodes from base station (BS) to be selected as CH. Moreover, the proposed protocol imposes a limit on the number of CHs so that an optimum number of CHs can be utilized to avoid unnecessary cluster formation and reduce energy consumption. Simulation results show that DE-SEP outperforms the existing baseline protocols like P-SEP, M-SEP and SEP in terms of various performance matrices such as network lifetime, stability period, half lifetime, throughput, and normalized residual energy. In particular, the performance of DE-SEP protocol in terms of normalized residual energy is increased by a maximum of 5%, 41% and 41% in comparison to P-SEP, M-SEP and SEP respectively.
TL;DR: Results show that the proposed routing scheme outperforms two existing ones in terms of stability period, throughputs, residual energy, and the lifetime of the network.
Abstract: Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, and poorer data transmission to the Base station (BS) when it was deployed for a longer period of time. In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol (HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. All these strategies are aiming at reducing energy consumption and extend the life of the network. Results show that the proposed routing scheme outperforms two existing ones in terms of stability period, throughputs, residual energy, and the lifetime of the network.
TL;DR: In this article , an adaptive clustering routing protocol for underwater sensor networks based on multi-agent reinforcement learning is proposed, which enables nodes to autonomously decide whether they can act as cluster heads using routing and environment information.
Abstract: In underwater sensor networks, the limited energy of sensor nodes and the difficulty of replacing the power supply means that one faulty node will severely affect the lifetime of the entire network. The design of energy-saving and efficient routing protocols is the key to prolonging the network lifetime. This paper describes an adaptive clustering routing protocol for underwater sensor networks based on multi-agent reinforcement learning. The proposed protocol models the network as a multi-agent system, and allows the nodes to select the global optimal route collaboratively through reinforcement learning. To reduce the probability of hotspots generation, an adaptive cluster head selection algorithm that does not incur any additional communication overhead and does not require consensus from surrounding nodes is proposed, which enables nodes to autonomously decide whether they can act as cluster heads using routing and environment information. Additionally, a biased reward function is designed to feedback the effect of the adaptive cluster head selection algorithm on the routing performance and to encourage the nodes to select the cluster heads as relays. Simulation results show that the proposed adaptive clustering routing protocol achieves higher routing efficiency, lower energy consumption , and longer network lifetime than existing approaches.
TL;DR: This work describes and evaluates the energy consumption of routing protocols for WSN-based Smart Cities applications in LoRa-based mesh networks, then proposes a novel energy-saving radio power adjustment (RPA) routing protocol.
Abstract: In recent decades, expansion in urban areas has faced issues such as management of public waste, noise, mobility, and air quality, among others. In this scenario, Internet of Things (IoT) and Wireless Sensor Network (WSN) scenarios are being considered for Smart Cities solutions based on the deployment of wireless remote sensor nodes to monitor large urban areas. However, as the number of nodes increases, the amount of data to be routed increases significantly as well, meaning that the choice of the data routing process has great importance in terms of the energy consumption and lifetime of the network. In this work, we describe and evaluate the energy consumption of routing protocols for WSN-based Smart Cities applications in LoRa-based mesh networks, then propose a novel energy-saving radio power adjustment (RPA) routing protocol. The Cupcarbon network simulator was used to evaluate the performance of different routing protocols in terms of their data package delivery rate, average end-to-end delay, average jitter, throughput, and load consumption of battery charge. Additionally, a novel tool for determining the range of nodes based on the Egli propagation model was designed and integrated into Cupcarbon. The routing protocols used in this work are Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Distance Vector Routing (DVR). Our simulation results show that AODV presents the best overall performance, DSR achieves the best results for power consumption, and DVR is the best protocol in terms of latency. Finally, the proposed RPA routing protocol presents power savings of 11.32% compared to the original DSR protocol.
TL;DR: Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.
Abstract: The design and implementation of energy-efficient routing protocols for next-generation wireless sensor networks is always a challenge due to limited power resource capabilities. Hierarchical (clustering) routing protocols appeared to be a remarkable solution for extending the lifetime of wireless sensor networks, particularly in application-aware (threshold-sensitive) and heterogeneity-aware cluster-based routing protocols. In this article, we propose a protocol, namely, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol. It is a heterogeneity-aware and threshold-based protocol that provides a better solution to existing problems in next-generation wireless sensor networks. During execution, the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol splits the entire network area into several zones to manage network traffic efficiently. In the first step, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is designed for a homogeneous network where the initial energy of all the nodes is the same. Thereafter, we bring in heterogeneity in the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol execution environment to optimize its energy consumption. By investigating the performance of the various numbers of divisions, it is proved that the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol with 9 zonal divisions has higher stability and throughput. The performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is compared with those of Stable Election Protocol, Low-Energy Adaptive Clustering Hierarchy, Modified Low-Energy Adaptive Clustering Hierarchy, and Gateway-Based Energy-Efficient Routing Protocol through computer simulations. Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.
TL;DR: According to the results, the OLSR protocol provides the best performance over the RWP model in a low mobility environment, whereas the Nomadic mobility model is suitable for O LSR protocol in a high mobility environment.
Abstract: Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the Random Waypoint model (RWP), Random Direction model (RD), Nomadic Community model (NC), and the Reference Point Group Model (RPGM) with a low as well as high random range mobility of the nodes. Moreover, BonnMotion Software and Network simulator NS-3 used to implement the simulation scenarios. Further, the performance of the OLSR protocol analyzed and evaluated based on latency, routing overhead, and packet loss ratio metrics. According to the results, the OLSR protocol provides the best performance over the RWP model in a low mobility environment, whereas the Nomadic mobility model is suitable for OLSR protocol in a high mobility environment.
TL;DR: Interior gateway routing protocol (OSPF) and exterior gateway protocol (BGP) are being evaluated on their performance with a redundancy protocol (HSRP, GLBP and VRRP) to analyze which first hop redundancy protocol works best with which routing protocol.
Abstract: The year of 2019 and 2020, saw the world shifting from physical classes, meetings etc., to online mode due to the commence of worldwide pandemic called COVID-19. Due to this, new network infrastructures were required and among the networks, efficient protocols were required in order to ensure 100% uptime and availability. Among the network routing protocols used, it is prudent to find which routing protocol works best with which redundancy protocol, as they have different switching algorithms. Therefore, in this paper, interior gateway routing protocol (OSPF) and exterior gateway protocol (BGP) are being evaluated on their performance with a redundancy protocol (HSRP, GLBP and VRRP). The criterion of measuring the performance includes jitter, downtime, throughput and number of packets lost. The result will help to analyze which first hop redundancy protocol works best with which routing protocol. The result of this study indicates that OSPF has 4.52% better QoS values with HSRP and BGP has 5.12% better QoS values with GLBP.
TL;DR: An overview of analytical, network, and simulation model used in the design of routing mechanisms wherever possible is presented and the performance demands required of these protocols are highlighted to assist researcher in MANET resource conservation.
25 Jan 2022
TL;DR: In this article , a multi-path routing protocol is introduced to balance the data transmission by constructing multiple paths with efficient routing, which is addressed by Fruit Fly Algorithm (FFA) to find the optimal values/fitness function for objective parameter (i.e. energy).
Abstract: Mobile ad hoc network (MANET) performance is critically affected by the mobility and resource constraints of nodes. Node mobility will impact on connecting stability, and node resource limitations will result in congestion, so the development of a routing protocol that promotes quality of service (QoS) in MANET is quite difficult. In particular, frequent interrupting connection may degrade QoS performance in the high-speed node drive scenario, so it is required to build the MANET protocol routing which can be adapted for changes in the networking architecture to support QoS. Therefore, the best suited reactive routing protocol is called Dynamic Source Routing (DSR) protocol, but it suffers from high energy consumption. To minimize this issue, optimization is required and these techniques still degrades the network performance, because single path routing is only supported by DSR. In this research work, multi-path routing is introduced to balance the data transmission by constructing multiple paths with efficient routing. In addition, high energy consumption is addressed by Fruit Fly Algorithm (FFA) to find the optimal values/fitness function for objective parameter (i.e. energy). Each available path, the fitness value is identified and sorted in the best order based on the food finding nature of fruit fly in FFA-DSR. When compared with existing routing protocols, FFA based DSR achieved better performance and implemented by using NS-2 simulator. Nearly 20% of energy is minimized by the proposed DSR-FFA protocol, when compared with existing Ant Colony Optimization (ACO), which is proven by the experimental results.