Routing Protocol For Wireless Mesh Networks Research Articles

RETRACTED ARTICLE: A reliable multi-hop opportunistic routing scheme with bandwidth guarantee for multimedia wireless mesh networks

Opportunistic routing (OR) is a novel challenging idea that has been designed for the wireless mesh network (WMN). This routing strategy captured the attention of numerous researchers due to its intense performance encountered in WMN. Broadcast characteristics of OR lead to performance enhancement in WMN. It possesses the ability to overhear packet transmission and accomplishing coordination between the relay nodes. In this paper, a reliable opportunistic routing scheme with bandwidth guarantee for multimedia wireless mesh networks (RORBG) scheme for multimedia WMN is proposed. This strategy is capable of recognizing various attacks like a black hole, grey hole, and denial of service attacks proficiently. The important pertains to treat the overhead and the latency of transmitting the data packet. In this scheme, we establish a node honesty rate to distinguish malicious behaviour and give assurance bandwidth. The expected available bandwidth (EAB) is computed by the local available bandwidth. Moreover, the forwarder candidate node is selected based on the bandwidth as well as the communication quality factor. This scheme grants to attain forwarder candidate selection procedure and coordination methods are a helping to improve the WMN execution along with efficient packet delivery. The application of RORBG is army and traffic management. The simulation results illustrate that RORBG scheme increases the 12.17% throughput and 16.81% delay minimization compare to the baseline routing protocols in WMN.

An Efficient Local Repair‐Based Multi‐Constrained Routing for Congestion Control in Wireless Mesh Networks

Multi‐constrained routing is a key driver to support quality‐of‐service (QoS) for real‐time multimedia applications in wireless mesh networks (WMNs). Due to the difficulty of applying strict admission control into a public WMN, it is inevitable to accommodate multiple application flows with different QoS requirements exceeding the capacity of a certain link shared by multiple flows. However, existing multi‐constrained routing protocols under such an environment find the QoS degradation based on end‐to‐end path quality probing and trigger flooding‐based route discovery from a scratch for resolving the QoS degradation, which incurs a longer recovery time and much routing overhead. In this paper, we propose a novel multi‐constrained routing protocol for WMNs that finds problematic links that may affect QoS degradation to end‐to‐end paths and replaces them with a detour path using a local repair principle. We model congestion threshold estimation for finding problematic links and design algorithms for quickly finding detour paths and selecting an optimal path by minimizing the negative effect on existing flows nearby the detour path. Simulation results show that the proposed routing protocol achieves up to 19.6% more goodput of live video streaming applications with up to 33% reduced routing overhead compared with an existing work.

The Design and Implementation of the XWCETT Routing Algorithm in Cognitive Radio Based Wireless Mesh Networks

The Wireless Mesh Networks (WMNs) technology has recently emerged as a promising high‐speed wireless technology, which provides the last mile broadband Internet access and delivers integrated wireless communication solutions. Integrating the traditional wireless with new wireless technologies such as cognitive radio (CR) technology creates a platform for high‐speed broadband communication. In a multihop ad hoc cognitive radio network (CRN) environment, the performance of the network is degraded by the routing protocols, which are adapted from the traditional wireless networks. In an endeavor to optimize the performance of the CRNs, existing routing protocols can be adapted and optimized. Secondly, new dynamic routing protocols can be designed to meet the requirements of CRNs. This paper investigates the existing routing protocols in WMNs and proposes a new routing protocol called extended Weighted Cumulative Expected Transmission Time (xWCETT). The xWCETT routing protocol was evaluated through network simulations using the NS 2. Its performance was evaluated with respect to the end‐to‐end average latency, the throughput, jitter, packet delivery ratio, and the normalized routing load. The comparative evaluation results show that the xWCETT achieves superior results in terms of average throughput, latency, and the normalized routing load.

Load-aware multicast routing in multi-radio wireless mesh networks using FCA-CMAC neural network

Multicasting is a useful network service in wireless mesh networks (WMNs) for delivering same data from a source to multiple destinations. An effective multicast routing protocol in multi-channel multi-radio WMNs (MCMR-WMNs) is required to satisfy the following criteria together: high network throughput, low end-to-end delay, low tree cost, low computational time, and load-aware routing. Furthermore, how to fully exploit channel diversity in MCMR-WMNs to accomplish low channel interference criteria is a critical issue in designing multicast routing protocol. In spite of its significance, multicast routing which satisfies all of the mentioned criteria, has not drawn much attention so far. Besides, major multicast routing protocols proposed in MCMR-WMNs are centralized or solve two problems of multicast tree construction and channel assignment sequentially. These protocols are time-consuming in addition to suffering from a single-point-of-failure. In this paper, we propose a distributed cross-layer algorithm for joint multicast routing and channel assignment in MCMR-WMNs. For the first time, we apply fuzzy credit assigned cerebellum model articulation controller (FCA-CMAC) neural network model to construct multicast routing tree considering load on the mesh nodes and the delay between neighboring mesh nodes. Moreover, we present a heuristic channel assignment algorithm aiming to reduce interference among the links of the multicast tree. FCA-CMAC converges quickly and creates minimal delay and load-aware multicast tree. Therefore, proposed method can optimize the network throughput, end-to-end delay, tree cost, and computational time. Additionally, channel assignment algorithm is subject to produce the minimal interference multicast tree. Simulation results show that in terms of aforementioned criteria, the proposed FCA-CMAC based multicast algorithm achieves better performance than those comparative references.

Improving the Reliability of Optimised Link State Routing in a Smart Grid Neighbour Area Network based Wireless Mesh Network Using Multiple Metrics

Reliable communication is the backbone of advanced metering infrastructure (AMI). Within the AMI, the neighbourhood area network (NAN) transports a multitude of traffic, each with unique requirements. In order to deliver an acceptable level of reliability and latency, the underlying network, such as the wireless mesh network(WMN), must provide or guarantee the quality-of-service (QoS) level required by the respective application traffic. Existing WMN routing protocols, such as optimised link state routing (OLSR), typically utilise a single metric and do not consider the requirements of individual traffic; hence, packets are delivered on a best-effort basis. This paper presents a QoS-aware WMN routing technique that employs multiple metrics in OLSR optimal path selection for AMI applications. The problems arising from this approach are non deterministic polynomial time (NP)-complete in nature, which were solved through the combined use of the analytical hierarchy process (AHP) algorithm and pruning techniques. For smart meters transmitting Internet Protocol (IP) packets of varying sizes at different intervals, the proposed technique considers the constraints of NAN and the applications’ traffic characteristics. The technique was developed by combining multiple OLSR path selection metrics with the AHP algorithminns-2. Compared with the conventional link metric in OLSR, the results show improvements of about 23% and 45% in latency and Packet Delivery Ratio (PDR), respectively, in a 25-node grid NAN.

Load-aware cooperative hybrid routing protocol in hybrid wireless mesh networks

Hybrid wireless mesh networks (WMNs) combine the advantages of infrastructure and client mesh networks. Hybrid routing protocols which are the most adaptive types of routing protocols for hybrid WMNs all neglect load condition up till now. This paper proposes a load-aware cooperative hybrid routing protocol (LA-CHRP). LA-CHRP is not only adapted to cover the peculiarities of routers and clients, but also considers load in routing. Different load levels are set for mesh routers and clients respectively. Gateway and client oriented traffic are handled differently. For the former, in the cooperative mechanism, mesh routers can be used more reasonably by considering the load levels. For the latter, node-aware routing metric is used to choose mesh routers in priority, and state of load is also considered for mesh clients. When the energy is adequate, clients with less load are chosen to transport packets. The simulation results indicate that LA-CHRP can achieve high throughput with low latency and packet loss rate in hybrid WMNs.

GAZELLE: An Enhanced Random Network Coding Based Framework for Efficient P2P Live Video Streaming Over Hybrid WMNs

Although Peer-to-Peer live video streaming over wireless mesh networks (WMNs) is considered a promising technology, some important challenges such as interference, mobility and limited available resources in gadgets (e.g. Smartphones and Tablets) may significantly reduce the perceived video quality. GREENIE and MATIN, in our previous studies, provided an efficient routing protocol in WMNs and a video streaming method based on random network coding (RNC), respectively. Therefore, their integration in the form of an enhanced framework, named GAZELLE, can considerably increase the video quality on these gadgets by decreasing the video distortion, dependency distortion, initial start-up delay and end-to-end delay. Findings using a precise simulation in OMNET++ show that GAZELLE noticeably outperforms other frameworks. GAZELLE not only decreases the imposed computational complexity and transmission overhead due to using RNC considerably, but it also efficiently routes video packets through those gadgets which does not require neither high battery energy sources nor high CPU power.

Wireless Mesh Network Routing Protocol Based on Multi-Routing Metric

Wireless Mesh Network Routing Protocol Based on Multi-Routing Metric

VirtualMeshLab: Virtual laboratory for teaching Wireless Mesh Network

ABSTRACTThis paper analyzed WMN routing protocols, modeling, and implementation of software environment for emulation of nodes in WMN network in education area. Use of emulators would enable students and teachers to research performance of the WMN (Wireless Mesh Network) protocol. This concept would contribute to an easier understanding of the WMN protocol related to different algorithms for transfer of routing traffic between nodes. © 2016 Wiley Periodicals, Inc. Comput Appl Eng Educ 24:567–576, 2016; View this article online at wileyonlinelibrary.com/journal/cae; DOI 10.1002/cae.21732

A Distributed Adaptive Admission Control Scheme for Multimedia Wireless Mesh Networks <xref ref-type="fn" rid="fn1"/>

Due to recent advances in wireless technologies, wireless mesh networks (WMNs) are expected in the near future to fully handle content-rich multimedia services with various quality of services (QoS) guarantee. Unlike traditional data applications, multimedia applications require QoS support in order to satisfy the user's service requirements. Admission control has been advocated as a promising approach to tackle this challenging issue since it is a key management function for which a new flow is admitted based on the condition that the QoS requirements of all flows in the network can still be met after the new flow begins. In this paper, a Rate Adaptive Routing on Cliques Admission Control protocol (so-called RA-RCAC) for WMNs is proposed, which is able to provide feedbacks to the application layer whenever congestion occurs in the network. The RA-RCAC scheme merges the design features of two chosen benchmarking schemes, namely, an Interference-Aware Admission Control and QoS routing protocol in WMN (so-called IAAC) and a distributed admission control protocol for WMNs (so-called RCAC) to produce a protocol design that satisfies the QoS guarantee. Our proposed RA-RCAC protocol is evaluated using simulation analysis. The performance evaluation results demonstrate its superiority over the aforementioned benchmark schemes in terms of throughput, end-to-end delay, packet delivery ratio, and loss ratio performance evaluation metrics.

Network Coding-Aware routing protocol in Wireless Mesh Networks

Network coding mechanisms, such as COPE, can improve network throughput effectively in Wireless Mesh Networks (WMN). While the Hybrid Wireless Mesh Protocol (HWMP) is suitable for WMN, its extension with COPE does not provide any added benefits; specifically, HWMP cannot establish paths with more coding opportunities. As a result, the advantages of network coding cannot be exploited sufficiently. This paper proposes improvements upon HWMP with a new, network Coding-Aware routing protocol (CAHWMP) for WMN. In the CAHWMP protocol, we propose a coding criterion based on data streams to devise an algorithm for actively detecting coding opportunities during path discovery. CAHWMP subsequently establishes paths using the coding-aware routing metric, which can balance channel resource consumption and the gain due to sharing resources introduced by network coding. Simulation results show that CAHWMP can establish paths with more coding opportunities; as a result, it improves network performance such as network throughput.

A New Routing Protocol for WMNs

Opportunistic routing is an emerging research area in Wireless Mesh Networks (WMNs), which exploits the broadcast nature of wireless networks to find the optimal routing solution that maximizes throughput and minimizes packet loss. Opportunistic routing protocols mainly suffer from computational overheads, as most of the protocols try to find the best next forwarding node. In this paper we address the key issue of computational overhead by designing new routing technique without using pre-selected list of potential forwarders. We propose a novel opportunistic routing technique for WMNs. We compare it with well-known protocols, such as AODV, OLSR, and ROMER based on throughput, delivery ratio, and average end to end delay. Simulation results show that proposed protocol, gives average throughput increase up to 32%, and increase in delivery ratio (from 10% to 20%). We also analyze the performance of proposed protocol and ROMER based on various parameters, such as duplicate transmissions and network collisions, by analysis depicts that proposed protocol reduces duplicate transmissions up to 70% and network collisions up to 30%

Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks

Privacy preservation and security provision against internal attacks in wireless mesh networks (WMNs) are more demanding than in wired networks due to the open nature and mobility of certain nodes in the network. Several schemes have been proposed to preserve privacy and provide security in WMNs. To provide complete privacy protection in WMNs, the properties of unobservability, unlinkability, and anonymity are to be ensured during route discovery. These properties can be achieved by implementing group signature and ID-based encryption schemes during route discovery. Due to the characteristics of WMNs, it is more vulnerable to many network layer attacks. Hence, a strong protection is needed to avoid these attacks and this can be achieved by introducing a new Cross-Layer and Subject Logic based Dynamic Reputation (CLSL-DR) mechanism during route discovery. In this paper, we propose a new Privacy preserved and Secured Reliable Routing (PSRR) protocol for WMNs. This protocol incorporates group signature, ID-based encryption schemes, and CLSL-DR mechanism to ensure strong privacy, security, and reliability in WMNs. Simulation results prove this by showing better performance in terms of most of the chosen parameters than the existing protocols.

Proposal and Performance Evaluation of a Multicast Routing Protocol for Wireless Mesh Networks Based on Network Load

Wireless Mesh Networks (WMNs) can provide wide range Wireless Local Area Networks (WLANs) area by connecting Access Points (APs) of WLANs with each other using radio communications. A routing protocol is very important to keep communication quality over radio multihop communications because radio waves are impacted much by surrounding environment. When we use multiuser shared applications like a video conference and an IP phone, it is predicted that large amount of traffic flows on network. Therefore, we should consider network loads to use these applications. In this paper, we propose a multicast routing protocol for WMNs which considers network loads and hop count. Furthermore, we evaluate performance by simulation. In the simulation results, we show that the proposed protocol has better performance than a conventional protocol (MAODV) at high loaded scenario.

Dynamic Channel Allocation Technique for Distributed Multi-radio Multichannel Multi-path Routing Protocol in Wireless Mesh Networks

Wireless Mesh Networks (WMNs) have gained main attraction in providing flexible network services and support to the end users. There are many efforts seen to design robust routing protocol for WMNs and solutions are proposed to standardized channel allocation techniques. There are various approaches dedicated to maximize the network though put and minimize network interface. Existing multi radio multi channel routing protocols utilize only single channel situation and static channel allocation degrades the performance of the WMNs. The challenge is to allocate channel without link interference and to improve end-to-end throughput efficiency in multipath routing for WMNs. In this paper, we propose a dynamic channel allocation technique is proposed for multi path routing protocol for WMNs. Dynamic channel allocation is used to avoid the inter-flow and intra-flow channel competition and interference. The protocol establishes and maintains multiple channel dimensional disjoint points changing frequently and each data flow is separated into multiple paths. NS2 simulations are carried out for the evaluation of the performance of the proposed channel allocation technique and compared with popular routing protocols of Mesh Networks Ad hoc On Demand Distance Vector Routing Protocol (AODV) and Hybrid Wireless Mesh Protocol (HWMP). The simulation results show that proposed dynamic channel allocation technique achieve better adaptability with less overhead and interference. The multipath routing show increase end-to-end throughput significantly.

Research and Implementation of Multiple Interfaces Wireless Mesh Network Routing Protocol

In this paper, routing protocols of wireless Meshnet work is studied about implmentation and verification them on platform. Fistly, routing algorithm of a single-interface Mesh network is studied about implementation routing protocols. This Mesh platform can provid us with wireless aceess, video surveillance and some other services. Experiments results demonstrate that the path throughout will deerease rapidly as the number of Hops increases. Because in a single interface Mesh network, all links are working on the same interfaee, which causes serious interference.

Comparison and Analysis of Routing Protocols Based on OPNET for Fiber-Wireless Broadband Access Network

As a promising communication technology for smart grid system, Fiber-Wireless (FiWi) broadband access network integrating wireless and optical access technologies, is becoming a promising “last mile” access technology. As the front-end of FiWi broadband access network, Wireless Mesh Network (WMN) has the features of high transmission rate, wide coverage and low cost of networking, etc, which can make FiWi broadband access network have the advantages of self-healing, self-configuring and flexibility. As one of the key technologies in WMN, wireless routing protocols play an important role in the performance optimization of WMN, which directly influence FiWi broadband access network. Thus, this paper mainly studies the routing protocols in WMN based on OPNET network simulation platform. By simulation and analysis, this paper shows that Ad hoc On-demand Distance Vector (AODV) routing protocol has low data dropped and good performance in network delay. Dynamic Source Routing (DSR) protocol has low network load. Meanwhile, Optimized Link State Routing (OLSR) protocol has high network throughput.

Analysis of Wireless Mesh Network Routing

Since the wireless mesh network topology dynamics and the radio channels instable, the design of wireless mesh network routing protocol become one of the key factors to determine the performance. This paper mainly studied the existing several kinds of typical three-layer mesh network routing protocol (DSDV and AODV), aimed at the defects of three-layer routing limited to the network topology changes, the paper proposed a network model based on two-layer routing. Forwarding the packet, establishing and maintaining the communication links are accomplished on the Mac layer. Simulation tests showed that two-layer routing has a big improvement on the efficiency of packet forwarding, and it effectively reduced the routing overhead and end-to-end delay simultaneously.

Design and Analysis of a Novel Hybrid Wireless Mesh Network Routing Protocol

Wireless mesh network (WMN) operates both in infrastructure and ad-hoc mode. It provides extended network coverage based on heterogeneous wireless technologies through multi-hop communications. In WMNs, the routing mechanisms and network organization need to be improved so that optimal path discovery or different protocols adaptability can be achieved. Hybrid routing is a demanding issue to be discussed these days as need of higher mobility management in the diverse situations and environments. It's required to improve the older schemes for higher data rate and minimum energy consumptions. The proposed work presents a design of a novel routing algorithm for optimal route discovery, congestion reduction, dynamic route selection and scalability in hybrid mesh networks. The authors have focused on Hybrid Routing Protocols to originate a novel routing scheme based on AODV (Ad hoc On-Demand Distance Vector routing protocol) in Ad-Hoc level with clustering scheme and DSDV (Destination Sequence Distance Vector) as proactive routing protocol in Backbone Mesh Router Level to form a new hybrid routing protocol. In this work a Novel Hybrid Distance Vector (NHDV) routing protocol algorithm has been introduced, which is the combination of DSDV (Destination Sequence Distance Vector) and AODV routing protocols. A clustering scheme with the combination of two efficient clustering schemes for Ad-hoc mesh client levels is discussed in detail and a performance metric for DSDV is also discussed which ETX (Expected Transmission Count) is for measuring packet loss ratio at each link for higher throughput. A new performance metric introduced in AODV as Mesh Router Count is used to improve the performance of communication to the Mesh Routers. The proposed work is the design of new algorithm that presents an optimal solution in bringing out a revolutionary change to Hybrid Routing.

Multicast routing protocols in wireless mesh networks: a survey

Wireless mesh networks (WMNs) introduce a new type of network that has been applied over the last few years. One of the most important developing issues in WMNs is multicast routing, which is a key technology that provides dissemination of data to a group of members in an efficient way. In this article, after an introduction about the structure of a WMN, multicast routing algorithms and protocols in WMNs are surveyed in a detailed and efficient manner. Moreover, effort is made to scale the study into one of the important potential capabilities of multicast routing mechanisms in WMNs, which is taking advantage of using different channels and radios association. While nodes in a single-radio mesh network operating on single-channel have restrictions for capacity, equipping mesh routers with multiple radios using multiple channels can decrease the intention of capacity problem as well as increase the aggregate bandwidth available to the network and improving the throughput. Hence, the purpose of channel assignment is to decrease the interferences while increasing the network capacity and keeping the connectivity of the network. Therefore, this article investigates the multicast protocols considering a definition of three types of WMNs, based on channel-radio association including SRSC, SRMC and MRMC. In its follow, a classification for multicast routing algorithms regarding the achieved optimal solutions will be presented. Finally, a study of MRMC and its relevant problems will be offered, considering the joint channel assignment and the multicast tree construction problem.