Minimum Cost Bandwidth Guaranteed Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks

Abstract

Multicast communication is an important service in wireless mesh networks (WMNs). It covers a broad range of applications, including data distribution, video conferencing, and distance learning. In this paper, we discuss the issue of bandwidth guaranteed multicast routing in multi-channel multi-radio WMNs. The problem of our concern is to construct a tree per multicast session such that the cost of the system, which is defined as the amount of total consumed bandwidth, is minimized. In order to solve the problem efficiently, we design Bandwidth Guaranteed Minimum Cost Tree construction (BGMCT) algorithm. Our algorithm yields cost-effective solutions as it exploits the wireless broadcast advantage (WBA) property of the wireless medium. In the proposed algorithm, we have developed two strategies for constructing minimum cost trees. Firstly, the number of the relay nodes in each tree is minimized. Secondly, the amount of overlapping between the shortest paths which connect different destinations of each session to its source node, is taken into account. The simulation results demonstrate that our algorithm outperforms existing solutions. Moreover, BGMCT provides near to optimal outcomes in a reasonable time.Keywords Wireless mesh networks · WMN · Multicast · Bandwidth guaranteed tree · Wireless broadcast advantage · WBA · Multi-channel multi-radio networks · MC-MR

Online network coding-based multicast routing in multichannel multiradio wireless mesh networks

“…QoS-aware multicast routing in MC-MR WMNs was considered in [20][21][22][23][24]. The authors of [20] designed a cross-layer algorithm, which performs channel assignment and multicast tree construction jointly.…”

“…Recently, there have been many research studies on multicast routing in MC-MR WMNs [10][11][12][13][14][17][18][19][20][21][22][23][24][25][26][27]. Some proposals have used the multicast tree to enable data transmission from the source node to the receivers of the multicast session [17][18][19][20][21][22][23][24][25][26][27]. The main concern in these works is to diminish the imposed interference on the multicast tree.…”

“…This scheme constructs trees and performs channel assignment together to fully exploit the capacity of the network. The considered QoS criterion in [24] is the bandwidth of the sessions. The proposed algorithm in this work performs multicast routing in two phases.…”

“…15],[16][17][18][19][20][21][22][23][24][25][26][27][28][29][30],[31][32][33][34][35][36][37][38][39][40] (|V | = 40) [5-20], [21-40], [41-60] (|V | = 60) rt m 0.012 × cp M axV RecN o 1…”