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

Byoungheon Shin,Dongman Lee

doi:10.1155/2018/2893494

Abstract

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.

Highlights

A wireless mesh network (WMN) is a promising network infrastructure for mobile devices in a public space which extends connectivity with self-configuration between distributed mesh routers [1]
Due to the mobility of mesh clients transiting multiple mesh routers, the amount of traffic to be guaranteed with a specific QoS requirement will vary over time. This opens up a new challenge to existing multi-constrained routing protocols for public WMNs: If admission control gets relaxed, that is, links are allowed to accommodate traffic flows exceeding their available capacity, there is a need to deal with congestions and the QoS degradation of application flows
We propose a new multi-constrained routing protocol in WMNs that (1) finds links that would hamper a target application’s end-to-end QoS by estimating the congestion threshold of each link and (2) replaces a link(s) performing lower than the required QoS with a detour path to recover the end-to-end QoS requirement exploiting the information of neighbor mesh routers

Summary

Introduction

A wireless mesh network (WMN) is a promising network infrastructure for mobile devices in a public space which extends connectivity with self-configuration between distributed mesh routers [1]. For guaranteeing QoS, many multi-constrained routing protocols assume admission control in a network which allocates a certain amount of network resources to a specific flow and blocks an additional flow request if the request exceeds available network capacity. Due to the mobility of mesh clients transiting multiple mesh routers, the amount of traffic to be guaranteed with a specific QoS requirement will vary over time This opens up a new challenge to existing multi-constrained routing protocols for public WMNs: If admission control gets relaxed, that is, links are allowed to accommodate traffic flows exceeding their available capacity, there is a need to deal with congestions and the QoS degradation of application flows. A fast and lightweight solution for resolving the QoS degradation of a multihop routing path is necessary

Objectives

Results

Conclusion