Adaptive Wireless Mesh Networks Routing Protocols (original) (raw)

ISSUES AND CHALLENGES FOR DESIGNING A NEW ROUTING PROTOCOL FOR WIRELESS MESH NETWORKS

Wireless Mesh Networks (WMNs), consisting of wireless access networks interconnected by a wireless backbone, present an attractive alternative. Compared to optical networks, WMNs have low investment overhead and can be rapidly deployed. The wireless infrastructure is self-organizing, self-optimizing, and fault tolerant. It can extend IP connectivity to regions otherwise unreachable by any single access technology. Many companies, such as Nokia, Microsoft, Motorola and Intel, are actively promoting wireless mesh networks as a full IP solution. Initial field tests have demonstrated WMN's tremendous potential and market value. WMNs combine concepts from a diverse set of existing and emerging wireless technologies, including cellular technologies, ad hoc networks, and sensor networks. The application of research results from these areas could greatly contribute to the development, implementation, and growth of wireless mesh networks. WMN demands a different approach to routing from conventional wireless access networks. It has much more in common with the ad hoc and sensor network fields. However, the overall properties of the individual nodes and the overall network are very different in many ways. Therefore, it is unclear exactly how applicable these approaches are to a WMN. This paper addresses the issue of routing in a WMN, by considering the specific characteristics of a WMN.

Packet routing in wireless mesh networks

10th Symposium on Neural Network Applications in Electrical Engineering, 2010

Wireless mesh networks (WMN) represent a type of mobile ad-hoc networks. These networks are very important in providing the Internet access to fixed and mobile terminal equipment. The main problem in WMNs (regarding to mesh routers and mesh clients) is a routing protocol, especially because it has to enable the access to network for both mesh and conventional clients. Access to Internet for wireless mesh networks is done via special mesh routers, the gateways. Several gateways may exist in a network. The main role of a routing protocol is to find way to establish connection between an end user and one of the gateways, as fast as possible, considering links status. This path should be optimized from the traffic distribution and path distance point. This paper presents one type of packet routing in wireless mesh networks based on Hopfield neural network. Artificial intelligence is used for path optimization. Distribution of local routing information and routing table updates is realized by mobile agents. In this way, network should have a simple way of routing information delivery and thus for effective user traffic support.

CLEAR: A Cross-Layer Enhanced and Adaptive Routing Framework for Wireless Mesh Networks

Wireless Personal Communications, 2009

Wireless Mesh Networks (WMNs) provide a new and promising solution for broadband Internet services. The distinguishing features and the wide range of WMNs’ applications have attracted both academic and industrial communities. Routing protocols play a crucial role in the functionality and the performance of WMNs due to their direct effect on network throughput, connectivity, supported Quality of Service (QoS) levels, etc. In this paper, a cross-layer based routing framework for multi-interface/multi-channel WMNs, called Cross-Layer Enhanced and Adaptive Routing (CLEAR), is proposed. This framework embodies optimal as well as heuristic solutions. The major component of CLEAR is a new bio-inspired routing protocol called Birds’ Migration Routing protocol (BMR). BMR adopts a newly developed routing metric called Multi-Level Routing metric (MLR) to efficiently utilize the advantages of both multi-radio/multi-channel WMNs and cross-layer design. We also provide an exact solution based on dynamic programming to solve the optimal routing problem in WMNs. Simulation results show that our framework outperforms other routing schemes in terms of network throughput, end-to-end delay, and interference reduction, in addition to being the closest one to the optimal solution.

A Throughput Optimizing Routing Protocol for Wireless Mesh Networks

Proceedings of the 12th IEEE International Conference on High Performance Computing and Communications, pp. 665- 670, Melbourne, Australia, September 1 - 3, 2010, 2010

Wireless mesh networks (WMNs) have emerged as a key technology for next generation wireless networks showing rapid progress and inspiring numerous applications. The persistence driving force in the development of WMNs comes from their envisioned advantages including extended coverage, robustness, self-configuration, easy maintenance, and low cost. However, to support real-time applications, WMNs must be equipped with a robust, reliable and efficient routing protocol so that packets can be routed through them with minimum delay. In this paper, we identify some critical factors in designing a routing protocol for WMNs, and propose an efficient and reliable routing protocol. The protocol is based on a reliable estimation of wireless link quality and the available bandwidth on a routing path. It also minimizes control overhead by effectively controlling broadcast messages in the network. Simulations carried out on the protocol demonstrate that it is more efficient than some of the current routing protocols.

Efficient routing for wireless mesh networks using a backup path

International Journal of Communication Systems, 2012

Wireless Mesh Network (WMN) has a proven record in providing viable solutions for some of the fundamental issues in wireless networks such as capacity and range limitations. WMN infrastructure includes clusters of Mobile Ad-Hoc Networks (MANETs) connected through a fixed backbone of mesh routers. The mesh network can be constrained severely due to various reasons, which could result in performance degradation such as a drop in throughput or long delays. Solutions to this problem often focus on multipath or multichannel extensions to the existing adhoc routing protocols. In this paper, we propose a novel solution by introducing an alternative path to the mesh backbone that traverses the MANET part of the WMN. The new routing solution allows the Mobile Nodes (MNs) to establish direct communication among peers without going through the backbone. The proposed alternative ad-hoc path is used only when the mesh backbone is severely constrained. We also propose, for the first time in WMNs, using MNs with two interfaces, one used in the mesh backbone communication and the other engaged in the ad-hoc network. A scheme is presented for making the MN aware of link quality measures by providing throughput values to the AODV protocol. We use piggybacking on route reply messages in AODV to avoid incurring additional costs. We implemented our solution in an OPNET simulator and evaluated its performance under a variety of conditions. Simulation results show that the alternative ad-hoc path provides higher throughput and lower delays. Delay analysis show that the throughput improvement does not impose additional costs.

A resource-efficient and scalable wireless mesh routing protocol

Ad Hoc Networks, 2007

By binding logic addresses to the network topology, routing can be carried out without going through route discovery. This eliminates the initial route discovery latency, saves storage space otherwise needed for routing table, and reduces the communication overhead and energy consumption. In this paper, an adaptive block addressing (ABA) scheme is first introduced for logic address assignment as well as network auto-configuration purpose. The scheme takes into account the actual network topology and thus is fully topology-adaptive. Then a distributed link state (DLS) scheme is further proposed and put on top of the block addressing scheme to improve the quality of routes, in terms of hop count or other routing cost metrics used, robustness, and load balancing. The network topology reflected in logic addresses is used as a guideline to tell towards which direction (rather than next hop) a packet should be relayed. The next hop is derived from each relaying node's local link state table. The routing scheme, named as topology-guided DLS (TDLS) as a whole, scales well with regard to various performance metrics. The ability of TDLS to provide multiple paths also precludes the need for explicit route repair, which is the most complicated part in many wireless routing protocols. While this paper targets low rate wireless mesh personal area networks (LR-WMPANs), including wireless mesh sensor networks (WMSNs), the TDLS itself is a general scheme and can be applied to other non-mobile wireless mesh networks.

An Efficient and Reliable Routing Protocol for Wireless Mesh Networks

Proceedings of International Conference on Computational Sciences and its Applications, Fukuaka, Japan, Springer LNCS Vol. 6018, pp. 246-257, March 2010, 2010

Wireless mesh networks (WMNs) have emerged as a key technology for next generation wireless networks showing rapid progress and inspiring numerous applications. The persistence driving force in the development of WMNs comes from their envisioned advantages including extended coverage, robustness, self-configuration, easy maintenance, and low cost. However, to support real-time applications with stringent quality of support (QoS), WMNs must be equipped with a robust, reliable and extremely efficient routing protocol so that packets can be routed through them with minimum delay. In this paper, we focus on the critical factors in designing a routing protocol for WMNs, and propose an efficient and reliable routing protocol. The protocol is based on a reliable estimation of available bandwidth in a wireless path and end-to-end delay measurements. Simulations carried out on the protocol demonstrate that it is more efficient than some of the current routing protocols.

Routing protocols in wireless mesh networks: challenges and design considerations

Multimedia Tools and Applications, 2006

Wireless Mesh Networks (WMNs) are an emerging technology that could revolutionize the way wireless network access is provided. The interconnection of access points using wireless links exhibits great potential in addressing the Blast mileĉ onnectivity issue. To realize this vision, it is imperative to provide efficient resource management. Resource management encompasses a number of different issues, including routing. Although a profusion of routing mechanisms has been proposed for other wireless networks, the unique characteristics of WMNs (e.g., wireless backbone) suggest that WMNs demand a specific solution. To have a clear and precise focus on future research in WMN routing, the characteristics of WMNs that have a strong impact on routing must be identified. Then a set of criteria is defined against which the existing routing protocols from ad hoc, sensor, and WMNs can be evaluated and performance metrics identified. This will serve as the basis for deriving the key design features for routing in wireless mesh networks. Thus, this paper will help to guide and refocus future works in this area.

Challenges and Evaluation of the State of the Art Routing Protocols for Wireless Mesh Networks

2009 Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, 2009

Wireless mesh networks (WMNs) comprise of mobile and static nodes which communicate wirelessly. WMNs have several unique features such as selforganizing, self-configuring and self-healing and are being used in many applications such as metropolitan area networks and disaster and rescue operations etc. Routing in WMNs is challenging as the network topology and connectivity in WMN are very dynamic due to unpredictable node mobility, interference, distributed wireless channel access and limited battery power of mobile devices in WMNs. This paper describes the challenges and the state of the art in provisioning of Routing over WMNs.