Enhancing Network Design through Statistical Evaluation of MANET Routing Protocols

This paper contributes a sophisticated statistical method for the assessment of performance in routing protocols salient Mobile Ad Hoc Network(MANET)routing protocols:Destination Sequenced Distance Vector(DSDV),Ad hoc On-Demand Distance Vector(AODV),Dynamic Source Routing(DSR),and Zone Routing Protocol(ZRP).In this paper,the evaluation will be carried out using complete sets of statistical tests such as Kruskal-Wallis,Mann-Whitney,and Friedman.It articulates a systematic evaluation of how the performance of the previous protocols varies with the number of nodes and the mobility patterns.The study is premised upon the Quality of Service(QoS)metrics of throughput,packet delivery ratio,and end-to-end delay to gain an adequate understanding of the operational efficiency of each protocol under different network scenarios.The findings explained significant differences in the performance of different routing protocols;as a result,decisions for the selection and optimization of routing protocols can be taken effectively according to different network requirements.This paper is a step forward in the general understanding of the routing dynamics of MANETs and contributes significantly to the strategic deployment of robust and efficient network infrastructures.

Fast and scalable routing protocols for data center networks

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

Enhanced Metaheuristics with Trust Aware Route Selection for Wireless Sensor Networks

Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches.

Combined Linear Multi-Model for Reliable Route Recommender in Next Generation Network

Network analysis is a promisingfield in the area of network applications as different types of traffic grow enormously and exponentially.Reliable route prediction is a challenging task in the Large Scale Networks(LSN).Various non-self-learning and self-learning approaches have been adopted to predict reliable routing.Routing protocols decide how to send all the packets from source to the destination addresses across the network through their IP.In the current era,dynamic protocols are preferred as they network self-learning internally using an algorithm and may not entail being updated physically more than the static protocols.A novel method named Reliable Route Prediction Model(RRPM)is proposed tofind the best routes in the given hefty gage network to balance the load of the entire network to advance the network recital.The task is carried out in two phases.In thefirst phase,Network Embedding(NE)based node classification is carried out.The second phase involves the network analysis to predict the route of the LSN.The experiment is carried out for average data transmission and rerouting time is measured between RRPM and Routing Information Protocol(RIP)protocol models with before and after failure links.It was observed that average transmission time for RIP protocol has measured as 18.5 ms and RRPM protocol has measured as 18.2 ms.Hence the proposed RRPM model outperforms well than the traditional routefinding protocols such as RIP and Open Shortest Path First(OSPF).

Secure and Reliable Routing in the Internet of Vehicles Network:AODV-RL with BHA Attack Defense

Wireless technology is transforming the future of transportation through the development of the Internet of Vehicles(IoV).However,intricate security challenges are intertwinedwith technological progress:Vehicular ad hoc Networks(VANETs),a core component of IoV,face security issues,particularly the Black Hole Attack(BHA).This malicious attack disrupts the seamless flow of data and threatens the network’s overall reliability;also,BHA strategically disrupts communication pathways by dropping data packets from legitimate nodes altogether.Recognizing the importance of this challenge,we have introduced a new solution called ad hoc On-Demand Distance Vector-Reputation-based mechanism Local Outlier Factor(AODV-RL).The significance of AODVRL lies in its unique approach:it verifies and confirms the trustworthiness of network components,providing robust protection against BHA.An additional safety layer is established by implementing the Local Outlier Factor(LOF),which detects and addresses abnormal network behaviors.Rigorous testing of our solution has revealed its remarkable ability to enhance communication in VANETs.Specifically,Our experimental results achieve message delivery ratios of up to 94.25%andminimal packet loss ratios of just 0.297%.Based on our experimental results,the proposedmechanismsignificantly improves VANET communication reliability and security.These results promise a more secure and dependable future for IoV,capable of transforming transportation safety and efficiency.

Routing Protocols for Transmitting Large Databases or Multi databases Systems

Most knowledgeable people agree that networking and routing technologies have been around about 25 years. Routing is simultaneously the most complicated function of a network and the most important. It is of the same kind that more than 70% of computer application fields are MIS applications. So the challenge in building and using a MIS in the network is developing the means to find, access, and communicate large databases or multi databases systems. Because general databases are not time continuous, in fact, they can not be streaming, so we can't obtain reliable and secure quality of service by deleting some unimportant datagrams in the databases transmission. In this article, we will discuss which kind of routing protocol is the best type for large databases or multi databases systems transmission in the networks.

Component based ant routing protocols analysis over mobile ad hoc networks

To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.

Performance Comparison between Delay-Tolerant and Non-Delay-Tolerant Position-Based Routing Protocols in VANETs

Vehicular ad hoc networks (VANETs) are a new emerging recently developed advanced technology that allows a wide group of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). There are various routing protocol categories used in VANETs, like unicast, multicast, and broadcast protocols. In unicast position-based protocols, the routing decisions are based on the geographic position of the vehicles. This does not require establishment or maintenance of routes but needs location services to determine the position of the destination. Non-delay-tolerant network protocols (non-DTN), also identified as minimum delay protocols, are aimed at minimizing the delivery time of the information. Delay-tolerant protocols (DTN) are used in a variety of operating environments, including those that are subject to failures and interruptions and those with high delay, such as VANETs. This paper discusses the comparison between non-DTN and DTN routing protocols belonging to the unicast delay-tolerant position-based category. The comparison was conducted using the NS2 simulator, and the simulations of three non-DTN routing protocols and three DTN routing protocols were recorded. Simulation results show that the DTN routing protocols outperform in delivery ratio compared to the non-DTN routing protocols, but they lead to more average delay due to buffering, the processing algorithm, and priority calculation. In conclusion, non-DTN protocols are more suitable for the city environment since the distance between nodes is relatively smaller and the variations in the network topology are slower than they are on highways. On the other hand, DTN protocols are more suitable for highways due to the buffering of packets until a clear route to destination is available.

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

Mobile ad hoc networks （MANETs） have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model （n-SRBDM）. We analyze the performance of the network under the dynamic source routing protocol （DSR） which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.

Performance comparison of multicast routing protocols based on NS-2

The electronic system in a comprehensive shipboard has a extremely wide bandwidth. It supports synchronized and asynchronous data transmission, muhimedia correspondence, and videophone conferencing. In order to guarantee the security and correspondent real time of the communication, choosing a multicast routing protocol based on different applications is a key problem in terms of the complexity of the system. A simulation model was first designed for existing multicast routing protocols in NS-2 and analysis was performed on their corresponding application environments. The experiments proved that PIM-DM based on the shortest-path tree protocol is suitable for communication in the field of comprehensive shipboard. Further work that is necessary is also discussed.

Optimization of Route Repair in Mobile Ad-hoc Network

A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a random mobility model, this paper derives the probability equation of the relative distance (RDIS) between any two mobile hosts in an ad-hoc network. Consequently, combining with average equivalent hop distance (AEHD), a host can estimate the routing hops between itself and any destination host each time the RD/RR procedure is triggered, and reduce the flooding area of RD/RR messages. Simulation results show that this optimized route repair (ORR) algorithm can significantly decrease the communication overhead of RR process by about 35%.

AODV-RM:route maintenance against route flapping in Ad hoc network

Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes with the lightest traffic load,to avoid striving for hot nodes with other users,hence minishes the chance of collision.AODV-RM keeps all valid routes to the destination in its routing table as backups.When the link under usage breaks down,AODV-RM shifts to a valid route in its routing table instead of route repair or researching,which ensures the continuity of communication.AODV-RM chooses a route maintenance scheme by the network topology.If the origination has multi routes to the destination,only the origination maintains routes.Otherwise,middle nodes,instead of the origination,maintain sub-routes to the destination.By simulating the traditional AODV and AODV-RM,the results showed that AODV-RM has a lower drop rate and better performance against route flapping.

DECLARATIVE HYBRID ROUTING PROTOCOLS IN AD HOC NETWORKS

This paper presents adaptive hybrid protocols based on the declarative network and mainly discusses the principle and realization of the Bayesian-estimation based adaptive hybrid protocol in the declarative network, which is well adapted to the Mobile Ad hoc NETwork (MANET). The adaptive hybrid protocol is designed for ad hoc networks which have characteristics like self-organizing, no trusted party, flexibility, etc. The nodes that run the hybrid protocol can automatically select one routing protocol that is suitable for different network environment. The Bayesian-estimation based adaptive strategy, that improves the adaptability and stability of the protocol, succeeds in the Rapidnet, a declarative network engine. The result in the Rapidnet proves that the hybrid protocol and the adaptive strategy are feasible. The experiment on the ns-3 simulator, an emerging discrete-event network simulator, validates that this protocol performs well and reduces communication overheads.

Route maintenance of on-demand routing protocol in mobile ad hoc networks

In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of recovery and the overhead of maintenance, a new route maintenance mechanism in which the maintenance is confined to the vicinity of the broken link is proposed. This mechanism patches broken route through some other nodes in which only nodes near the broken link（s） may need to be substituted and the rest of nodes can be retained on the route. The broken link can be repaired without considering its relative position in the whole path, so the abihty of dealing with hnk failure is improved obviously. Simulation results show that the proposed strategy improves network performance significantly, such as in merits of control overhead and packet delay.

A Cooperative Forwarding Scheme for VANET Routing Protocols

Providing efficient packet delivery in vehicular ad hoc networks （VANETs） is particularly challenging due to the vehicle move- ment and lossy wireless channels. A data packet can be lost at a forwarding node even when a proper node is selected as the for- warding node. In this paper, we propose a loss-tolerant scheme for unicast routing protocols in VANETs. The proposed scheme employs multiple forwarding nodes to improve the packet reception ratio at the forwarding nodes. The scheme uses network coding to reduce the number of required transmissions, resulting in a significant improvement in end-to-end packet delivery ratio with low message overhead. The effectiveness of the proposed scheme is evaluated by using both theoretical analysis and computer sim-

A Novel Review on Security and Routing Protocols in MANET

The origin of Mobile ad hoc network (MANET) was started in 1970 as packet radio network (PRNET), later on different researches were made on it in different ages. MANET works under no fixed infrastructure in which every node works likes a router that stores and forwards packet to final destination. Due to its dynamic topology, MANET can be created anywhere, anytime. As there are limited resources in MANET so it faces many problems such as security, limited bandwidth, range and power constraints. Due to this, many new routing protocols are proposed. This article examines different techniques to manage congestion control, security issues, different layers attacks, routing protocols and challenges that are faced by MANET.

Coati Optimization-Based Energy Efficient Routing Protocol for Unmanned Aerial Vehicle Communication

With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous connectivity and foster agile communications.The difficulty stems from features other than mobile ad-hoc network(MANET),namely aerial mobility in three-dimensional space and often changing topology.In the UAV network,a single node serves as a forwarding,transmitting,and receiving node at the same time.Typically,the communication path is multi-hop,and routing significantly affects the network’s performance.A lot of effort should be invested in performance analysis for selecting the optimum routing system.With this motivation,this study modelled a new Coati Optimization Algorithm-based Energy-Efficient Routing Process for Unmanned Aerial Vehicle Communication(COAER-UAVC)technique.The presented COAER-UAVC technique establishes effective routes for communication between the UAVs.It is primarily based on the coati characteristics in nature:if attacking and hunting iguanas and escaping from predators.Besides,the presented COAER-UAVC technique concentrates on the design of fitness functions to minimize energy utilization and communication delay.A varied group of simulations was performed to depict the optimum performance of the COAER-UAVC system.The experimental results verified that the COAER-UAVC technique had assured improved performance over other approaches.

An Improved RPL Algorithm for Low-Power and Lossy Networks

The routing protocol for low-power and lossy networks(RPL),standardized by Internet Engineering Task Force(IETF),is mainly designed to use for Low-power and Lossy Networks(LLNs).To solve the problems of several important routing metrics are not evaluated,the optimal path may contain long single hop links,lack of scientific multi-routing metrics evaluation method and mechanism to balance the parent child number(especially the parent with one hop away from root),this paper proposes an improved RPL algorithm for LLN(I-RPL).First of all,we propose the evaluated routing metrics:child number of parent,candidate parent number,hop count,ETX and energy consumption index.Meanwhile,we improve the path ETX calculation method to avoid selecting optimal path containing long single hop links.Then we design a novel lexical method to synthetically evaluate candidate parents.Meanwhile,based on the evaluation results of candidate parents,we design a novel objective function and a new calculation node rank method which can also be used for selecting the optimal path.Finally,evaluation results show that I-RPL outperforms ETXOF and several other improvements in terms of packet delivery ratio,latency,etc.

Dynamic channel estimation-aware routing protocol in mobile cognitive radio networks for smart IIoT applications

Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.

LSTDA: Link Stability and Transmission Delay Aware Routing Mechanism for Flying Ad-Hoc Network (FANET)

The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face challenges in avoiding transmission loss and delay while ensuring stable communication.The proposed protocol introduces a novel link stability with network corridors priority node selection to check and ensure fair communication in the entire network.The protocol uses a Red-Black(R-B)tree to achieve maximum channel utilization and an advanced relay approach.The paper evaluates LSTDA in terms of End-to-End Delay(E2ED),Packet Delivery Ratio(PDR),Network Lifetime(NLT),and Transmission Loss(TL),and compares it with existing methods such as Link Stability Estimation-based Routing(LEPR),Distributed Priority Tree-based Routing(DPTR),and Delay and Link Stability Aware(DLSA)using MATLAB simulations.The results show that LSTDA outperforms the other protocols,with lower average delay,higher average PDR,longer average NLT,and comparable average TL.