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.

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.

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.

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.

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.

Optimized Tuning of LOADng Routing Protocol Parameters for IoT

Interconnected devices and intelligent applications have slashed human intervention in the Internet of Things(IoT),making it possible to accomplish tasks with less human interaction.However,it faces many problems,including lower capacity links,energy utilization,enhancement of resources and limited resources due to its openness,heterogeneity,limited resources and extensiveness.It is challenging to route packets in such a constrained environment.In an IoT network constrained by limited resources,minimal routing control overhead is required without packet loss.Such constrained environments can be improved through the optimal routing protocol.It is challenging to route packets in such a constrained environment.Thus,this work is motivated to present an efficient routing protocol for enhancing the lifetime of the IoT network.Lightweight On-demand Ad hoc Distance-vector Routing Protocol—Next Generation(LOADng)protocol is an extended version of the Ad Hoc On-Demand Distance Vector(AODV)protocol.Unlike AODV,LOADng is a lighter version that forbids the intermediate nodes on the route to send a route reply(RREP)for the route request(RREQ),which originated from the source.A resource-constrained IoT network demands minimal routing control overhead and faster packet delivery.So,in this paper,the parameters of the LOADng routing protocol are optimized using the black widow optimization(BWO)algorithm to reduce the control overhead and delay.Furthermore,the performance of the proposed model is analyzed with the default LOADng in terms of delay,delivery ratio and overhead.Obtained results show that the LOADng-BWO protocol outperforms the conventional LOADng protocol.

A Contention-Based MAC and Routing Protocol for Wireless Sensor Network

Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.

High efficiency AODV routing protocol based on link availability prediction in MANETs

To cope with the problem of low protocol efficiency of the standard ad hoc on-demand distance vector （AODV） routing protocol with the periodic Hello message broadcast mechanism, a new link availability prediction based strategy is introduced to reduce the amount of Hello messages. In this strategy, a novel wireless link availability prediction model under line-of-sight （LOS） propagation environments is proposed based on which the parameter of Hello Interval in AODV can be dynamically adjusted to achieve the goal of changing the frequency of Hello message broadcasts under different link stability degrees. Simulation results demonstrate that, compared with the standard AODV with the periodic Hello message broadcast mechanism, the proposed protocol effectively reduces unnecessary control message overhead and greatly improves the performance in terms of end-to-end delay and efficiency.

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

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.

Joint channel assignment and cross-layer routing protocol for multi-radio multi-channel Ad Hoc networks

To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.

G-MER： Green Mobility Estimation- Based Routing Protocol in Wireless Sensor Network

As a core technology of Intemet of Things （loT）, Wireless Sensor Network （WSN） has become a research hotspot recently. More and more WSNs are being deployed in highly mobile environments. The fast moving sensor nodes bring significant challenges for the routing decision. In this paper, we propose an efficient logical location method, and designe a mobility estimating metric and derive a novel Green Mobility Estirmtion- based Routing protocol （G-MER） for WSNs. We also set up a full framework to evaluate its per- formance. Simulation results illustrate that G-MER achieves a fairly better perforrmnce in terrm of broadcast times and link failures than AODV. What＇s more, it decreases the mean hops by about 0.25 and reduces energy consumption by about 10% during the whole experiment. All the results show that G-MER can be effectively used in fast- moving and limited resource scenarios.

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.

Blockchain Enabled Metaheuristic Cluster Based Routing Model for Wireless Networks

With recent advancements made in wireless communication techniques,wireless sensors have become an essential component in both data collection as well as tracking applications.Wireless Sensor Network(WSN)is an integral part of Internet of Things(IoT)and it encounters different kinds of security issues.Blockchain is designed as a game changer for highly secure and effective digital society.So,the current research paper focuses on the design of Metaheuristic-based Clustering with Routing Protocol for Blockchain-enabled WSN abbreviated as MCRP-BWSN.The proposed MCRP-BWSN technique aims at deriving a shared memory scheme using blockchain technology and determine the optimal paths to reach the destination in clustered WSN.In MCRP-BWSN technique,Chimp Optimization Algorithm(COA)-based clustering technique is designed to elect a proper set of Cluster Heads(CHs)and organize the selected clusters.In addition,Horse Optimization Algorithm(HOA)-based routing technique is also presented to optimally select the routes based onfitness function.Besides,HOA-based routing technique utilizes blockchain technology to avail the shared mem-ory among nodes in the network.Sensor nodes are treated as coins whereas the ownership handles the sensor nodes and Base Station(BS).In order to validate the enhanced performance of the proposed MCRP-BWSN technique,a wide range of simulations was conducted and the results were examined under different measures.Based on the performance exhibited in simulation outcomes,the pro-posed MCRP-BWSN technique has been established as a promising candidate over other existing techniques.

APPOW:An Advanced Routing Protocol Based on Parameters Optimization in the Weighted Mobile Social Network

Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can move freely and organize themselves arbitrarily.Routing in these environments is difficult for the reason of the rapid changes of the social relationship graph's topology.Meanwhile,the social ties among nodes change overtime.Therefore,an efficient data forwarding mechanism should be considered over the temporal weighted relationship graph.In this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging information.APPOW combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay node.The weights of the three metrics are derived by pair-wise learning algorithm.The result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average hops.Additionally,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.

Tree-Based Proactive Routing Protocol for Wireless Mesh Network

Wireless Mesh Network （WMN） is seen as an effective Intemet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing （TBR） protocol and Root Driven Routing （RDR） protocol are so centralized that they make the gateway becorre a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing （OTR） protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multipie Intemet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the perforrmnce of WMN is improved and OTR is more suitable for large scale WMN.

Distributed QoS multicast routing protocol in ad hoc networks

Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.

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.

Evaluation of Energy Consumption of Proactive, Reactive, and Hybrid Routing Protocols in Wireless Mesh Networks Using 802.11 Standards

This paper provides a deep evaluation of the energy consumption of routing protocols. The evaluation is done along with other metrics such as throughput and packet delivery ratio (PDR). We introduce two more metrics to capture the efficiency of the energy consumption: e-throughput and e-PDR. Both are ratios in relation to the energy. We consider the three low layers of the stack. Three types of routing protocols are used: proactive, reactive, and hybrid. At the MAC and PHY layer, three radio types are considered: 802.11a/b/g. Finally, the number of nodes is varying in random topologies, with nodes being static or mobile. Simulations are conducted using NS3. The parameters of a real network interface card are used. From the results in mobile position scenarios, no protocol is outperforming the others;even if OLSR has the lowest energy consumption, most of the time. However, in constant position scenarios, AODV consumed a lower energy, apart from the scenarios using the 802.11a standard where HWMP energy consumption is the lowest. Regarding the energy efficiency, AODV protocols provided the best e-throughput and OLSR the best e-PDR in overall configurations. A framework for selecting energy-efficient routing protocol depending on network characteristics is proposed at the end.