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.

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.

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.

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.

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.

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.

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.

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-

Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks

Low Energy Adaptive Clustering Hierarchy(LEACH)is a routing algorithm in agricultural wireless multimedia sensor networks(WMSNs)that includes two kinds of improved protocol,LEACH_D and LEACH_E.In this study,obstacles were overcome in widely used protocols.An improved algorithm was proposed to solve existing problems,such as energy source restriction,communication distance,and energy of the nodes.The optimal number of clusters was calculated by the first-order radio model of the improved algorithm to determine the percentage of the cluster heads in the network.High energy and the near sink nodes were chosen as cluster heads based on the residual energy of the nodes and the distance between the nodes to the sink node.At the same time,the K-means clustering analysis method was used for equally assigning the nodes to several clusters in the network.Both simulation and the verification results showed that the survival number of the proposed algorithm LEACH-ED increased by 66%.Moreover,the network load was high and network lifetime was longer.The mathematical model between the average voltage of nodes(y)and the running time(x)was concluded in the equation y=−0.0643x+4.3694,and the correlation coefficient was R2=0.9977.The research results can provide a foundation and method for the design and simulation of the routing algorithm in agricultural WMSNs.

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.

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.

ECO-BAT: A New Routing Protocol for Energy Consumption Optimization Based on BAT Algorithm in WSN

Wireless sensor network (WSN) has been widely used due to its vastrange of applications. The energy problem is one of the important problems influencingthe complete application. Sensor nodes use very small batteries as a powersource and replacing them is not an easy task. With this restriction, the sensornodes must conserve their energy and extend the network lifetime as long as possible.Also, these limits motivate much of the research to suggest solutions in alllayers of the protocol stack to save energy. So, energy management efficiencybecomes a key requirement in WSN design. The efficiency of these networks ishighly dependent on routing protocols directly affecting the network lifetime.Clustering is one of the most popular techniques preferred in routing operations.In this work we propose a novel energy-efficient protocol for WSN based on a batalgorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithmfor WSN) to prolong the network lifetime. We use an objective function thatgenerates an optimal number of sensor clusters with cluster heads (CH) to minimizeenergy consumption. The performance of the proposed approach is comparedwith Low-Energy Adaptive Clustering Hierarchy (LEACH) and EnergyEfficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interestingin terms of energy-saving and prolongation of the network lifetime.

LINK PERDURABILITY BASED ROUTING FOR MOBILE AD HOC NETWORKS

Ad Hoc networks are prone to link failures due to mobility. In this letter, a link perdurability based routing scheme is proposed to try dealing with this problem. This scheme uses signal strength measurements to estimate the route life time and hence chooses a stable route, and is implemented in two typical ad hoc routing protocols to evaluate its performance. The simulation results have shown that this scheme can improve these protocols' packet delivery ratio in cases where there are frequent link failures.

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

Recently,Opportunistic Networks(OppNets)are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices.OppNets are characterized by a rough and dynamic topology as well as unpredictable contacts and contact times.Data is forwarded and stored in intermediate nodes until the next opportunity occurs.Therefore,achieving a high delivery ratio in OppNets is a challenging issue.It is imperative that any routing protocol use network resources,as far as they are available,in order to achieve higher network performance.In this article,we introduce the Resource-Aware Routing(ReAR)protocol which dynamically controls the buffer usage with the aim of balancing the load in resource-constrained,stateless and non-social OppNets.The ReAR protocol invokes our recently introduced mutual informationbased weighting approach to estimate the impact of the buffer size on the network performance and ultimately to regulate the buffer consumption in real time.The proposed routing protocol is proofed conceptually and simulated using the Opportunistic Network Environment simulator.Experiments show that the ReAR protocol outperforms a set of well-known routing protocols such as EBR,Epidemic MaxProp,energy-aware Spray and Wait and energy-aware PRoPHETin terms of message delivery ratio and overhead ratio.

ML-Fresh: Novel Routing Protocol in Opportunistic Networks Using Machine Learning

Opportunistic Networks(OppNets)is gaining popularity day-by-day due to their various applications in the real-life world.The two major reasons for its popularity are its suitability to be established without any requirement of additional infrastructure and the ability to tolerate long delays during data communication.Opportunistic Network is also considered as a descendant of Mobile Ad hoc Networks(Manets)and Wireless Sensor Networks(WSNs),therefore,it inherits most of the traits from both mentioned networking techniques.Apart from its popularity,Opportunistic Networks are also starting to face challenges nowadays to comply with the emerging issues of the large size of data to be communicated and blind forwarding of data among participating nodes in the network.These issues lower the overall performance of the network.Keeping this thing in mind,ML-Fresh-a novel framework has been proposed in this paper which focuses to overcome the issue of blind forwarding of data by maintaining an optimum path between any pair of participating nodes available in the OppNet using machine learning techniques viz.pattern prediction,decision tree prediction,adamic-adar method for complex networks.Apart from this,ML-Fresh also uses the history of successful encounters between a pair of communicating nodes for route prediction in the background.Simulation results prove that the ML-Fresh outperforms the existing framework of Opportunistic Networks on the grounds of standard Quality-of-Service(QoS)parameters.

A Secure Multi-Routing Platform for Ad Hoc Network

In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribution. Therefore, it is desirable to have nodes run multiple routing protocols simultaneously so that more than one protocols can be chosen to work jointly. For this purpose, a multiple routing platform for Ad hoc networks is proposed on a higher level of current routing protocols. In order to ensure the security of the platform, a security mechanism and its formal analysis by BAN logic is given. The simulation results of the network performance demonstrate that the proposed multi-routing platform is practicable in some complex applications.

Cooperative Layer-2 Based Routing Approach for Hybrid Wireless Mesh Networks

In a Wireless Mesh Network(WMN),the convenience of a routing strategy strongly depends on the mobility of the intermediate nodes that compose the paths.Taking this behaviour into account,this paper presents a routing scheme that works differently accordingly to the node mobility.In this sense,a proactive routing scheme is restricted to the backbone to promote the use of stable routes.Conversely,the reactive protocol is used for searching routes to or from a mobile destination.Both approaches are simultaneously implemented in the mesh nodes so that the routing protocols share routing information that optimises the network performance.Aimed at guaranteeing the IP compatibility,the combination of the two protocols in the core routers is carried out in the Medium Access Control(MAC)layer.In contrast to the operation in the IP layer where two routing protocols cannot work concurrently,the transfer of the routing tasks to the MAC layer enables the use of multiple independent forwarding tables.Simulation results show the advantage of the proposal in terms of packet losses and data delay.

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.