Routing Protocols Design and Performance Evaluation in Wireless Mesh Networks

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.

Nowadays there are inexpensive WiFi devices that have fostered the deployment of wireless communities. Well known routing protocols used in the Internet do not fit well to time varying characteristic of wireless networks. This has motivated an intensive research on routing protocols for wireless mesh networks. At this time there are a number of mature and stable implementations that are being deployed in production networks. In this paper we focus on the experimental evaluation of a production Wireless Mesh network being deployed in a testbed at Universitat Politecnica de Catalunya (UPC) and a quarter of the city of Barcelona, Spain. To our best knowledge, this is the first paper where a production community wireless network using 802.11an is analyzed.

Multi-hop Wireless Mesh Networks (WMNs) is a promising new technique for communication with routing protocol designs being critical to the effective and efficient of these WMNs. A common approach for routing traffic in these networks is to select a minimal distance from the source to destination as in wireless networks. Opportunistic Routing (OR) makes use of the broadcasting ability of wireless network and is especially very helpful for WMN because all nodes are static. Our proposed scheme of Multicast Opportunistic Routing (MOR) in WMNs is based on the broadcast transmissions and Learning Automata (LA) to expand the potential candidate nodes that can aid in the process of retransmission of the data. The receivers are required to be in sync with one another in order to avoid duplicated broadcasting of data which is generally achieved by formulating the forwarding candidates according to some LA based metric. The most helpful aspect of this protocol is that it intelligently learns from the past experience and improves its performance. The results obtained via this approach of MOR show that the proposed scheme outperforms some existing schemes and is an improved and more effective version of opportunistic routing in a mesh network.

The wireless mesh network is a new emerging technology that will change the world of industrial networks connectivity to more efficient and profitable. Mesh networks consist of static wireless nodes and mobile customer; have emerged as a key technology fornew generation networks. The Quality of Service (QOS) is designed to promote and support multimedia applications (audio and video), real time. However guarantee of QoS on wireless networks is a difficult problem by comparison at its deployment in a wired IP network. In this paper, we present an efficient routing protocol named as “QoS- Cluster Based Routing Protocol” (Q-CBRP) to support QoS in Wireless Mesh Network.

Interference makes it difficult for a wireless network to provide robust performance and could sometimes lead to transient failures. Dynamic channel switching (DCS) allows a wireless network interface (NIC) to operate in different frequency channels during different time periods without disrupting network connections that traverse the NIC. DCS enables a wireless mesh network to avoid frequency channels with serious interference in certain parts of its coverage area by switching to more idle channels. Although DCS provides additional radio agility, it significantly increases the complexity of the wireless mesh network's routing protocol. This paper describes the design, implementation and evaluation of a wireless mesh network system called Carlsbad, which supports both DCS and load-balancing/fault-tolerant routing, and successfully runs on low-cost commodity IEEE 802.11-based access points. Performance experiments on the first Carlsbad prototype show that despite the additional overhead it introduces, DCS can indeed improve the overall throughput of an IEEE 802.11-based wireless mesh network, sometimes by a factor of more than 2, for both TCP and UDP connections.

Resource allocation and admission control algorithm based on non-cooperation game in wireless mesh networks

The wireless mesh network is a new emerging technology that will change the world of industrial networks connectivity to more efficient and profitable. Mesh networks consist of static wireless nodes and mobile customer; have emerged as a key technology for new generation networks. The Quality of Service (QOS) is designed to promote and support multimedia applications (audio and video), real time. However guarantee of QoS on wireless networks is a difficult problem by comparison at its deployment in a wired IP network. In this paper, we present an efficient routing protocol named as “QoS-Cluster Based Routing Protocol” (Q-CBRP) to support QoS in Wireless Mesh Network.

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 Mesh Networks (WMNs) integrate the advantages of WLANs and mobile Ad Hoc networks, which have become the key techniques of next-generation wireless networks in the context of emergency recovery. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. These capabilities make WMNs a promising technology for incident and emergency communication. An incident area network (IAN) needs a reliable and lively routing path during disaster recovery and emergency response operations when infrastructure-based communications and power resources have been destroyed and no routes are available. Power aware routing plays a significant role in WMNs, in order to provide continuous efficient emergency services. The existing power aware routing algorithms used in wireless networks cannot fully fit the characteristics of WMNs, to be used for emergency recovery. This paper proposes a power aware routing algorithm (PARA) for WMNs, which selects optimal paths to send packets, mainly based on the power level of next node along the path. This algorithm was implemented and tested in a proven simulator. The analytic results show that the proposed power node-type aware routing algorithm metric can clearly improve the network performance by reducing the network overheads and maintaining a high delivery ratio with low latency.

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.

Wireless Mesh Network (WMN) is emerging concept in wireless networks supporting broadband and high speed multimedia services, so network must guaranteed the Quality-of-Services (QoS). Wireless mesh network characterized by multihop wireless connectivity and frequently changing network topology therefore required efficient and optimal dynamic routing protocols with node authentication for preventing data form networking attacks. AODV is commonly used routing matrix for path discovery in Ad-hoc network. So that, implementing in wireless mesh network, AODV should improve for find optimal shortest path. In this paper, the QoS aware improved AODV routing protocol in wireless mesh network with the node authentication schemas has been discussed.

Due to their adaptable deployment options and complementary communication features, Wireless Mesh Networks (WMNs) have experienced an exponential rise in popularity in recent years. WMNs, a crucial component of next-generation wireless networking, have great promise for both the academic and commercial worlds. However, the best routing protocols are lacking in the present WMNs. Instead, a lot of WMNs use ad hoc network routing methods, which have various network characteristics as a result, routing is now the most pressing issue that must be addressed as soon as possible. The proposed model used the Ant-In-Mesh routing algorithm and its upgraded version is being developed in this paper to deal with the demanding traffic needs of WMNs. This algorithm was influenced by the conventional Ant Colony Optimization (ACO) approach, which provides an optimum path for best routing in dynamic networks by using Ant colony optimization and improves network performance by removing and reconnecting dead paths in mesh networks.

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.

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.

This paper proposes an efficient, secure and anonymous routing protocol based on Weil pairing for wireless mesh networks (WMNs). The proposed protocol considers symmetric and asymmetric links during wireless communication in WMNs. A WMN integrates several types of wireless devices, and induces the asymmetric links that result from different transmission ranges of wireless devices. Enhancing the security and privacy of WMNs has been an important research focus in recent years. Most research on this topic has focused on providing security and anonymity for routing and data in symmetric links. However, the asymmetric links in these protocols have not been addressed. This paper proposes a novel distributed routing protocol suitable for WMNs that include symmetric and asymmetric links. The proposed protocol guarantees security, anonymity and high reliability in WMNs. The proposed protocol generates routes that are shorter than those of previous studies. The proposed scheme protects the real identities of the source and intermediate users, which remain unknown even to the mesh router, while still providing node authentication. Using the proposed protocol, mesh clients anonymously discover a secure route to the mesh router. This protocol also ensures data transmission anonymity and enhances WMN coverage, in addition to assuring security and anonymity.