Minimum Interference Channel Assignment for Multicast in Multi-Radio Wireless Mesh Networks

Nguyen, Ha; Nguyen, Uyen Trang

doi:10.1109/iwcmc.2008.108

Cited by 46 publications

(88 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposals for multicast routing in MC-MR WMNs are described in [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25]. References [11][12][13][14][17][18][19][20][21][22][23][24] have employed contention-based MAC layer for data transmission.…”

Section: Related Workmentioning

confidence: 99%

“…A portion of these works have studied unicast routing and considered the characteristics of data flows to fully exploit the capacity of MC-MR WMNs [2][3][4][5][6][7][8][9][10]. The problem of multicast routing in these networks has been studied in a number of works including [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25], where the interdependence of multicast traffic and channel assignment is taken into account to provide efficient solutions.…”

mentioning

confidence: 99%

See 1 more Smart Citation

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

Farzinvash

Dehghan

2014

Wireless Pers Commun

View full text Add to dashboard Cite

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

show abstract

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

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

Farzinvash

Dehghan

2014

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…In the context of MC-MR network, multicast was studied in [21], [22]. In [21], Zeng et al studied a joint routing and channel assignment problem for MC-MR wireless mesh networks with the goal of maximizing throughput.…”

Section: Related Workmentioning

confidence: 99%

“…Once the multicast tree is obtained, the channel assignment part commences, where the authors proposed two algorithms, depending on whether the channels are orthogonal or overlapping. In [22], the authors studied channel assignment for a multicast problem in MC-MR wireless mesh networks. Here, the authors first assumed that there is a pre-built multicast tree (e.g., via multicast ad-hoc on-demand distance vector (MAODV) protocol).…”

Section: Related Workmentioning

confidence: 99%

Multicast Communications in Multi-Hop Cognitive Radio Networks

Gao

Shi

Hou

et al. 2011

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-We study a multicast communication problem in a multi-hop ad hoc network where each node is equipped with a cognitive radio (CR). The goal is to minimize the required network-wide resource to support a set of multicast sessions, with a given bit rate requirement for each multicast session. The unique characteristics and complexity associated with CR distinguish this problem from existing multicast problems for ad hoc networks. In this paper, we formulate this problem via a cross-layer approach by taking consideration of scheduling and routing jointly. Although the problem formulation is in the form of a mixed-integer linear program, we develop a polynomial-time algorithm that offers highly competitive solutions. By comparing the solution values with a lower bound, we show that the proposed algorithm can provide a solution that is close to the optimum.

show abstract

“…When a mesh router has several radio interfaces, it can tune them to different channels and use them simultaneously. The main problem in this approach is thus to assign static channels to interfaces in a way that maximizes network capacity, either with a centralized [2] or a distributed algorithm [3].…”

Section: Introductionmentioning

confidence: 99%

A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network

Darties

Théoleyre

Duda

2009

2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

View full text Add to dashboard Cite

Minimum Interference Channel Assignment for Multicast in Multi-Radio Wireless Mesh Networks

Cited by 46 publications

References 19 publications

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

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

Multicast Communications in Multi-Hop Cognitive Radio Networks

A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network

Contact Info

Product

Resources

About