Bandwidth-Guaranteed Multicast in Multi-Channel Multi-Interface Wireless Mesh Networks

Abstract

We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other to be active at different time slots. When a (point-tomultipoint) multicast call arrives, the call is accepted if a multicast distribution tree can be established for connecting the source node with all the receiving nodes, and with sufficient bandwidth reserved on each link. Otherwise, the call is rejected. To maximize the call acceptance rate, the multicast tree must be constructed judiciously upon each call arrival. Aiming at minimizing the carried load on the most-heavily loaded channel, and maximizing the residual capacity of the most heavily loaded node, an integer linear program (ILP) is formulated for multicast tree construction. Since solving ILP can be time-consuming, an efficient heuristic algorithm is then proposed. We compare the two tree construction algorithms by simulations. We found that both algorithms give comparable call acceptance rate, but the heuristic algorithm requires much shorter running time.

High-Performance Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks

“…In particular, for each node v in the current tree T cur , we find the least cost path connecting v to each node d in the current set of unconnected destinations Δ cur using the Dijkstra's algorithm (line 11). We then consider all the computed least cost paths P (v, d), ∀d ∈ Δ cur , ∀v ∈ T cur , and select the path P min with the minimum cost (lines [13][14]. This path P min and the corresponding destination d min are then added to the solution tree (lines [17][18][19].…”

“…RELATED WORK Research work on multicast in single-channel WMNs focuses mainly on multicast routing and performance study of routing approaches [3], [4], [5], [6]. The topic of channel assignment and routing for multicast in multi-channel multiradio networks has been studied only recently [7], [8], [9], [10], [11], [12], [13]. The algorithms proposed in [7], [8], [9], [10] aim at minimizing the interference among multicast nodes and maximizing throughput using the "routing first, CA second" approach wherein a multicast routing tree is first constructed, and a CA scheme minimizing interference is then applied to the tree.…”

“…There exist also algorithms that consider both routing and CA simultaneously [12], [13]. Cheng et al's algorithm [12] constructs a multicast tree and a CA scheme with minimized channel conflict and minimal tree cost (defined as the total number of radios used by the nodes in the tree).…”

“…Cheng et al's algorithm [12] constructs a multicast tree and a CA scheme with minimized channel conflict and minimal tree cost (defined as the total number of radios used by the nodes in the tree). Chiu et al [13] propose a CA and tree construction scheme that satisfies a bandwidth constraint. The main limitation of the scheme is the assumption of a perfect, no-collision MAC scheduler.…”

Using Orthogonal Channels for Supporting Multicast Service in Multi-channel Wireless Mesh Networks

“…It has been proven that channel assignment improves throughput [6]. Work in [4] [5] prove that multicast routing in MIMC-WMN is an NP-hard problem and formulate it as an ILP and propose some heuristic scheme for solving it.…”