PERFORMANCE EVALUATION OF DSDV IN HYBRID WIRELESS MESH NETWORK

Wireless mesh networks (WMNs) are gaining significant momentum as a promising technology for the next-coming state-of-the-art wireless networking. Among many factors, the performance of WMNs would be largely affected by the properness of the deployed routing protocols and the efficient usage of wireless resources. Routing protocols are required to well capture WMNs' features while wireless channels should be used efficiently in order to accommodate high amount of traffics over the mesh backbone. Recently, a Tree-based Routing (TBR) protocol become a popular state-of-the-art proactive routing protocol and its tree-based broadcasting become an often used technique. Though TBR protocol is well-suited for WMNs' architecture and the skewed nature of traffic toward the root, the protocol in its current form faces issues which has to be addressed. Specifically, when some or all nodes are equipped with multiple radios, to reduce collision and co-channel interference, not only the parent-child relationship but also the sibling relationship need to be constructed by the TBR protocol in the multi-channel WMNs. In this paper, we propose a hybrid tree-based protocol for concurrent routing and channel assignment over WMNs. The protocol makes use of sibling links to mitigate the aforementioned shortcomings of TBR protocol. Moreover, in order to address high backbone traffic, the protocol integrates a receiver-based channel assignment scheme. The protocol efficiently deploys the parent-child topological relationships of nodes to enhance efficiency of broadcast transmissions over receiver-based multi-channel WMNs. Simulation results over NS-2 network simulator reveal that our proposed hybrid tree-based protocol achieves much higher performance than the utilization of the original receiver-based CA and TBR protocol.

Wireless technology is emerging as a key technology for the future networks. Wireless mesh networks (WMNs) have emerged as an indispensable technology for deployment of wireless services for various applications in personal, enterprise, and metropolitan areas. Researchers are working actively in different fields of WMNs for providing better services. Routing protocols play a vital role in WMNs to provide reliable configuration and maintenance of topology of the network. Designing a suitable cost metric for routing protocols to provide quality links for data transmission is the backbone of WMNs. Many cost metrics have been proposed for WMNs and is still an active research topic as new performance metrics need to be discovered due to the dynamics of this field. This paper considers the genetic algorithm-based routing technique for WMN.We have studied the existing cost metrics and proposed a genetic algorithm technique for routing in WMN. To evaluate the genetic algorithm, and to determine the relative performance of the genetic algorithm in the context of routing in WMN, we carry out experiments on two test systems. We have evaluated the quality of the results produced by our algorithm with the traditional hop count metric results. Our results show that routing in WMN using genetic algorithm produces better results as compared to traditional hop count metric results. Finally, we carry out a detailed analysis of results, which help us in gaining an insight into the suitability of genetic algorithm for routing in WMN.

Wireless mesh networks (WMNs) are known for possessing good attributes such as low up-front cost, easy network maintenance, and reliable service coverage. This has largely made them to be adopted in various environments such as; school campus networks, community networking, pervasive healthcare, office and home automation, emergency rescue operations and ubiquitous wireless networks. The routing nodes are equipped with self-organized and self-configuring capabilities. However, the routing mechanisms of WMNs depend on the collaboration of all participating nodes for reliable network performance. The authors of this paper have noted that most routing algorithms proposed for WMNs in the last few years are designed with the assumption that all the participating nodes will collaboratively be involved in relaying the data packets originated from a source to a multi-hop destination. Such design approach however exposes WMNs to vulnerability such as malicious packet drop attack. This paper presents an evaluation of the effect of the black hole attack with other influential factors in WMNs. In this study, NS-3 simulator was used with AODV as the routing protocol. The results show that the packet delivery ratio and throughput of WMN under attack decreases sharply as compared to WMN free from attack. On an average, 47.41% of the transmitted data packets were dropped in presence of black hole attack.

Mobile Ad hoc Networks (MANETs) are considered as a new paradigm of infrastructure-less mobile wireless communication systems. MANETs are being widely studied and it is the technology that is attracting a large variety of applications. Routing in MANETs is considered a challenging task due to the unpredictable changes in the network topology, resulting from the random and frequent movement of the nodes and due to the absence of any centralized control [1][2]. In this paper, we evaluate the performance of reactive routing protocols, Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) and proactive routing protocol Destination Sequenced Distance Vector (DSDV). The major goal of this study is to analyze the performance of well known MANETs routing protocol in high mobility case under low, medium and high density scenario. Unlike military applications, most of the other applications of MANETs require moderate to high mobility. Hence it becomes important to study the impact of high mobility on the performance of these routing protocols. The performance is analyzed with respect to Average End-to-End Delay, Normalized Routing Load (NRL), Packet Delivery Fraction (PDF) and Throughput. Simulation results verify that AODV gives better performance as compared to DSR and DSDV.

Vehicle-to-Vehicle (V2V), Vehicle-to-Road Infrastructure (V2R) and Vehicle-to-Pedestrian (V2P) communications are paramount for paving the way for smarter, cleaner and safer cities and roads. We investigate on how three state-of-the-art Mobile Ad-Hoc Network (MANET) routing protocols behave over the IEEE 802.11p/WAVE stack, which has been recently been specified for Vehicular Ad-hoc Networks (VANETs): Ad-hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Destination-Sequenced Distance-Vector (DSDV). Based on ns-3 and BonnMotion simulations, we evaluate Packet Delivery Rate, Goodput, Routing Overhead and End-to-End Delay for different trajectories, average speeds, and network densities. Our results show that the DSDV and OLSR protocols have a better performance than AODV, for low-density and low-speed scenarios. Additionally, we have observed that when the number of Nodes (network density) or Nodes’ velocity increases, the OLSR protocol performs better than the other two.

Wireless mesh networks are popular due to their adaptability, easy-setup, flexibility, cost, and transmission time-reductions. The routing algorithm plays a vital role in transferring the data between the nodes. The network’s performance is significantly impacted by the route opted by the algorithm. The router takes the decision to send the packet to the next router as per the policy of that algorithm. So even though that decision does not favor the right path selection, the router tends to follow its policy. This can be avoided by having intelligent routers that can make routing decisions on the fly. This paper presents the QL-Feed Forward routing algorithm (QFFR), a new generation of routing algorithms that combines reinforcement learning based on the Q-learning algorithm with a Feed Forward neural network. This algorithm (QFFR) can learn from the network environment and make routing decisions based on the algorithm’s learnings. The AI agent’s ability to select the fastest path, which enhances the efficiency of the routing operation, is demonstrated by the working of the suggested QFFR algorithm. This paper also evaluates the performance of traditional algorithms, namely, Ad-hoc On-Demand Distance-Vector, Optimized-Link-State-routing, Destination-Sequenced Distance-Vector and Distance Source routing. The evaluation parameters include throughput, packet delivery ratio, and delay. The parameters are the outcomes of the time the information takes to reach from source to destination. This analysis highlights the improvement in the routing decision ability of a router. As per analysis, Ad hoc On-Demand Distance Vector Algorithm outperforms with throughput 723.13 Kbps, delay 343.73 ns. Q-learning agent identifies the route and reaches the destination in average of 3.7s in non-grid architecture. The Q-learning agent takes 0.49sec with a grid size ten by ten and 0.53sec in three by four grid size. The suggested QFFR takes 7.62s score-over time with stable, consistent performance.

There has been rapid growth in the area of wireless communication by Wireless Mesh Networks (WMNs) where routing metric is the key metric to find the optimized route in WMNs. For obtaining optimal performance, integrating multiple performance metrics into a routing protocol is effective, as single metric will not be able to satisfy the thorough requirement of WMNs. This paper has proposed a new routing metric for Multiple Metric Cost (MMC), WMNs, incorporating three metrics: Residual energy 2) Available Bandwidth and 3) Expected Transmission Count (ETX). MMC results in a better throughput. We evaluated the performance of MMC for proactive, reactive and opportunistic routing protocols using the OMNET++ network simulator. Our evaluation shows that MMC performs well in all three classes of routing protocols.

Systems with multiple channels and multiple radios per node have been shown to enhance throughput of wireless mesh networks (WMNs). Recently, network coding has also been proved to be a promising technique for improving network throughput of WMNs. However, the performance of network coding in the context of multicast in multi-channel multi-radio (MCMR) WMNs is still unknown. In this paper, we present a comprehensive performance evaluation of network-coded multicast in MCMR WMNs using extensive simulations, realistic network settings and meaningful performance metrics such as throughput, file completion time, packet end-to-end delay, and packet delivery ratio under a wide range of scenarios.

In wireless network technologies, Wireless Mesh Network (WMN) is decentralized, low cast and resilient. Hybrid WMN provides minimal configuration and infrastructure to communicate with large community networks like military networks. Since military networks are well planned networks, we can address them as tactical networks. The widely spread fighting forces in military networks have to share information about strategic situations quickly and with better clarity in rapidly changing network. Due to its mobility in terrain topology, network is suffering from suitable routing protocol. Hybrid Wireless Mesh network Protocol (HWMP) is one of the promising routing protocol for such tactical networks. In this paper authors are proposing a framework of analytical model for WMN network, queuing system and delay. The suggested analytical model is also better suited for tactical networks during warefare communication. Using HWMP the analytical delay model is compared with simulation model for 50 nodes. As the simulation proceeds End-to-end delay of delay model is same as simulation model. The authors also focus on analysis of HWMP using military application, against different parameters like Packet Delivery Fraction (PDF), End-to-end delay and routing overhead. The HWMP is compared against well-known protocols of wireless network AODV and DSDV. The results show that PDR and End-to-end delay of HWMP is better than AODV and DSDV as the network size increases. The routing overhead of HWMP is almost nil compared to other two.KeywordsTactical networksHybrid architectureQueuing NetworksAd hoc network

Wireless sensor network (WSN) with several sensors is used to group measurements of certain physical quantities or environmental conditions, including sound, temperature, pressure, vibration, motion, or pollution, at various locations and ranges. In WSNs, several protocols address the issue of routing. Sensor nodes in WSN usually have limited energy resources and storage capacities. Therefore, the issue of energy usage in sensors and protocols is very important. This paper analyzes and compares the quality of service (QoS) performances of three important routing protocols of the mobile ad-hoc network (MANET) including Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), and destination sequenced distance vector (DSDV), in a smart building case study. The QoS evaluation metrics include residual energy of nodes, instant throughput (IT), average throughput (AT), packet delivery ratio (PDR), packet loss ratio (PLR), and route discovery latency (RDL) based on IEEE 802.15.4 MAC protocol standard. The simulation is carried out using NS2, and the WSN has 16 fixed and 4 mobility nodes with different speeds and paths. The simulation results illustrate that average throughput in AODV is 1.985118 (kbps), however, the figures for DSR and DSDV are 1.977780 and 1.720700 (kbps), respectively. PDR, also, in DSR stands at 1.0, but the figures for AODV and DSDV are lower with the range of 0.999572 and 0.997930, respectively. Overall, The DSR protocol provides a better performance compared to AODV and DSDV routing protocols in terms of PLR and PDR. Also, AODV has better efficiency in RDL and AT compared to other assumed protocols.

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

A Wireless Mesh Network (WMN) is a multi-hop network that gains the benefits of low deployment cost, fast access speed, expanded service coverage and large network capacity. However, the multi-hop communication in WMNs limits the throughput capacity due to increased number of packet transmissions. As a result, network coding is a recently emerged paradigm that can enhance the throughput capacity (i.e. network throughput) by minimizing the quantity of network workload and at the same time it ensures the data transfer among all the users. Further, with network coding the transmission effectiveness of a node can be improved by encoding (combining) several packets collectively and verifies whether the coding strategies is satisfied or not. Subsequently, if the coding strategies are satisfied then it transmits only the resultant encoded packet to the desired destination. In other words, network coding can improve the network throughput in WMNs by minimizing the transmission counts needed to transfer several packets to the destination. It should be noted that, while employing network coding in WMNs there are several challenges that should be compensated such as (i) identifying packets that can be combined (encoded) collectively and (ii) integrating the coding strategies in routing protocols. In this paper, we proposed a new mesh routing protocol that integrates network-coding called as Network Coding Aware Routing (Net-CART) protocol. Therefore, to enjoy the whole benefit of network coding a Net-CART protocol uses the innovative routing metric called Code-Aware and Load-Aware Routing Metric. Additionally, to identify numerous ‘coding structures’ and to support number of ‘packet encodings’ an improved set of coding strategies known as Enhanced Universal Coding Strategies is also proposed. The proposed Net-CART protocol comprising an improved set of coding strategies and a new routing-metric considers both the coding-opportunities and “network workload”. The simulation study carried out in wide forms of network configurations showed that Net-CART gives more fairness performances than other protocols.

The vehicular ad-hoc network (VANET) is a promising technology in near future. VANET allows vehicles to communicate with each other and with roadside units (RSUs). Wireless Access in Vehicular Environment (WAVE), defined by IEEE, provides the Internet connectivity for vehicles as well as vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. RSUs can form a wireless mesh network (WMN) as a backbone infrastructure to enhance the performance of VANET. However, WAVE supports only one-hop communications for IP packets in VANET, and existing researches do not consider the compatibility between VANET and WMN infrastructure formed by RSUs. We propose the extended WMN (ExWMN) which has the feasibility to extend WMN to VANET domain. In ExWMN, the vehicles can send IP packets to an access router by using the multi-hop capability of WMN. ExWMN uses the addressing scheme of WMN for the extended VANET domain and exploits geographical routing protocols instead of existing routing protocols of WMN due to VANET characteristics such as mobility and dynamically changing network topologies. ExWMN supports the compatibility between the extended VANET and a WMN infrastructure due to RSUs, which provide a bridging function between them. This paper presents the architecture and the detailed procedures of the ExWMN.

The wireless mesh network is an innovative and efficient wireless communication approach with immense potential to transform future wireless networks. This cutting-edge wireless technology provides a wide range of wireless services for personal, local, campus, and metropolitan environments. The wireless mesh network consists of a cluster of mobile wireless nodes that can dynamically and instantaneously create random and temporary network topologies, forming a wireless ad-hoc network. Ad hoc wireless networks are particularly advantageous due to their cost-effectiveness and ease of deployment. In order to further optimize the performance of ad-hoc networks, different routing algorithms such as Ad-hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing Algorithm (DSR) and Destination Sequenced Distance Vector (DSDV) have been thoroughly researched via simulation.

Mobile ad hoc network (MANET) is a collection of several wireless devices or mobile users that can communicate among themselves over wireless links in a peer to peer basis and thereby creating a dynamic, arbitrary graph. But some adverse characteristics of MANET like dynamic topology, limited bandwidth, link failure and energy constraints, imposes new demands on routing protocol. This paper aims to study the performance evaluation and comparison of three prominent routing protocols: Destination Sequence Distance Vector (DSDV), Ad-hoc On demand Distance Vector (AODV) and Optimized Link State Routing (OLSR), in a real life scenario. In a given scenario, students investigate the historical site in which number of packets being sends and number of nodes in the network affects the communication reliability. Extensive simulations are made to evaluate the performance of these protocols using various performance differential metrics like packet delivery ratio, total energy consumption and throughput using NS-3.29. In the end it is seen that in most simulation results, proactive routing protocols (DSDV, OLSR) performed significantly better than reactive routing protocols.