Research Article  Open Access
On the Relationship between Multicast/Broadcast Throughput and Resource Utilizations in Wireless Mesh Networks
Abstract
This paper deals with the problem of multicast/broadcast throughput in multichannel multiradio wireless mesh networks that suffer from the resource constraints. We provide a formulation to capture the utilization of the network resources and derive analytical relationships for the network’s throughput in terms of the node utilization, the channel utilization, and the number of transmissions. Our model relies on the ondemand quality of service multicast/broadcast sessions, where each admitted session creates a unique tree with a specific bandwidth. As an advantage, the derived relationships are independent of the type of tree built for each session and can be used for different protocols. The proposed formulation considers the channel assignment strategy and reflects both the wireless broadcast advantage and the interference constraint. We also offer a comprehensive discussion to evaluate the effects of loadbalancing and number of transmissions on the network’s throughput. Numerical results confirm the accuracy of the presented analysis.
1. Introduction
Wireless mesh networks (WMNs) have been recognized as a new class of multihop networks that provide lowcost solutions for broadband wireless applications [1]. A WMN is composed of three types of nodes: gateways, mesh routers, and mesh clients [1, 2]. Gateways enable the integration of various networks, for example, WiFi, Zigbee, WiMAX, and cellular networks. Mesh routers have minimal mobility and form the backbone of the network. They have the functionality of both an access point and a relay node. As a relay node, mesh routers forward the packets from the source node to the destination nodes. However, as an access point, they provide network access for mesh clients within their coverage area. One challenge in WMNs is the degradation of the network’s capacity due to the cochannel interference. This problem has motivated the researchers to improve the network’s throughput using efficient schemes. An effective approach to mitigate the cochannel interference is to equip the mesh routers with multiple radios tuned to nonoverlapping channels. The ability to utilize multiple radios allows the mesh routers to send/receive packets simultaneously on distinct channels and, therefore, increases the bandwidth available to the network [2]. However, due to the limited number of radios and nonoverlapping channels, some links interfere with each other and cannot be active at the same time. These resource constraints degrade the performance of MultiChannel MultiRadio WMNs (MCMRWMNs). Thus, a proper resource assignment strategy is required to improve the performance of such networks.
On the other hand, recently, the popularity of multimedia services such as IPTV, video conference, and distant education, has significantly increased [3–5]. In this regard, the multicast routing provides underlying facilities for the multimedia applications in WMNs. The basic difference between multicast routing in wireless and wired networks is the broadcast nature of the wireless medium that results in a wellknown property named wireless broadcast advantage (WBA) [6, 7]. Based on the WBA, a single transmission in a node simultaneously covers multiple neighboring receivers. Minimizing the number of transmissions improves the utilization of the network resources and subsequently increases the network’s throughput. Besides the number of transmissions, the loadbalancing problem is another pertinent issue to be considered in MCMRWMNs. This problem can be discussed from two perspectives: spatial loadbalancing and channel loadbalancing. From the viewpoint of a specific channel, when a part of the network experiences congestion, the new traffic flows should not be routed through that part. In addition, from the perspective of a specific location, the traffic load must be balanced over all available channels in the network. If the traffic load in the network is balanced, the interference will be decreased, and more resources will be available for accepting the future traffics.
To evaluate the performance of a MCMRWMN, there are several criteria that often interact with each other. Thus, it is not possible to draw a clear boundary between them. In this regard, different approaches try to improve different aspects of the networks. One difficulty in comparing different schemes is the lack of a standard benchmark. Certainly, having a prior knowledge about the bounds of criteria and their corresponding relationship provides more options for the system administrator to control the parameters of the network.
Taking the above challenges into account, the main goal of this paper is to quantify the throughput in MCMRWMNs. We focus on the scenario of multicast and broadcast sessions, where each session has a specific bandwidth requirement. Ondemand requests arrive dynamically one by one without any prior knowledge of future arrivals. A session will be accepted if a routing tree with sufficient bandwidth on each link can be established. In particular, we provide a formulation to express the network’s throughput in terms of the node utilization, the channel utilization, and the number of transmissions. We also discuss how appropriate use of the resources affects the network’s throughput.
The rest of the paper is organized as follows. Section 2 surveys the previous related works. The details of the network model are described in Section 3. Section 4 presents a formulation to capture the resource utilizations. In Section 5, we derive analytical expressions for the multicast/broadcast throughput in both smallscale MCMRWMN and largescale MCMRWMN. Section 6 presents the numerical results and the discussion. Finally, some concluding remarks are provided in Section 7.
2. Related Work
In past years, different aspects of MCMRWMNs have been widely studied for unicast flows. In particular, some works endeavor to heuristically improve the network’s performance [2, 8], while others focus on the optimization solutions [9–11]. In this regard, several routing metrics (such as ETX, ETT, WCETT, WCCETT, MIC, iAWARE, and MIND [1, 12]) have been proposed. However, due to the differences between unicast and multicast routing, the designed unicast schemes cannot be efficient for the multicast traffics. In one of the most fundamental researches on the multicast routing, the work in [4] compares the performance of the Minimum Steiner Trees (MSTs) and the Shortest Path Trees (SPTs) in SingleChannel SingleRadio WMNs (SCSRWMNs). Experimental results in [4] show that SPTs offer a better performance than MSTs. In addition, the implementation difficulty of MSTs is another factor that makes SPTs more favorable in WMNs. However, none of these protocols consider the problems of loadbalancing and resource utilization.
Roy et al. [13] study the highthroughput metrics for multicast routing in WMNs. They point out the difference between unicast and multicast routing and show how to adapt the unicast routing metrics for use in multicast flows. They also propose a lowoverhead adaptive algorithm to incorporate the linkqualitybased metrics to a representative multicast routing protocol.
As mentioned before, the ability to make an appropriate use of the network resources can efficiently increase the throughput in WMNs. In line with this concept, some works aim to minimize the number of transmissions required to deliver one packet from the source to all the destinations [14–16]. The authors in [15] propose a multicast routing metric, named MultiChannel Minimum Number of Transmissions (MCMNT), that considers the wireless broadcast advantage and the channel diversity to minimize the network bandwidth consumed by the routing tree. MCMNT also tries to minimize the intraflow interference in the network. Zeng et al. [16] propose two algorithms, named Level Channel Assignment (LCA) and MultiChannel Multicast (MCM), to minimize the number of forwarding nodes and the total hopcount distances in MCMRWMNs. These algorithms reduce the intraflow interference using the heuristic channel assignment strategies. The authors in [16] show that the LCA and the MCM algorithms outperform the singlechannel multicast in terms of the throughput and the delay. They also demonstrate that using all the partially overlapping channels instead of only the nonoverlapping channels can further diminish the interference in the network.
In [17], Chiu et al. challenge the loadbalancing issue in MCMRWMNs. The basic idea in [17] is that if the traffic on the mostheavily loaded channel is minimized, the traffic load in the network will be balanced. In this way, they first present an integer linear programming formulation to optimally construct the bandwidthguaranteed broadcast trees. Then, an efficient algorithm is proposed to heuristically improve the call acceptance rate in the network. Reference [18] proposes two loadaware metrics, named “Flow Load Multicast Metric (FLMM)” and “Reliable Flow Load Multicast Metric (FLMM^{R})”, for multicast routing in MCMRWMNs. Although both metrics count the interference and the WBA, the latter case further considers the unreliability of the IEEE 802.11 MAC protocol. FLMM^{R} uses the Packet Delivery Ratio (PDR) of the wireless links and reduces retransmission overheads. In line with this concept, the work in [19] suggests two distributed strategies, named “Multicast AutoRate Selection (MARS)” and “MARSRetransmit (MARSR)”. The MARS scheme uses PDR of the wireless links at various transmission rates. The MARSR algorithm facilitates the joint use of rate control and linklayer mechanisms (such as acknowledgments and retransmissions) to improve the reliability of highthroughput multicast flows.
During recent years, we have considered the problem of traffic engineering for multicast/broadcast flows in WMNs [3, 7, 20]. The work in [3] studies the special case of broadcasting for the smallscale WMNs. In [7], we present an InterferenceAware Joint Channel and Rate Selection (IAJCRS) algorithm to choose the best transmission rates and the best transmission channels for a given fixed routing tree. However, being bound to a routing tree reduces the freedom to choose the alternative feasible paths. Indeed, using a joint interferenceaware routing scheme leads to a better utilization of the network resources. Accordingly, in [20], we propose two crosslayer algorithms, named the “Interference and Rateaware Multicast Tree (IRMT)” and the “Interference and Rateaware Broadcast Tree (IRBT).” As an advantage, the proposed algorithms jointly address the problems of multicast/broadcast routing tree construction, transmission rate selection, transmission channel selection, and call admission control.
One drawback of the previous works is that they pay less attention to the theoretical analysis of multicast/broadcast flows. Most of the literature tries to propose some heuristically or optimally solutions to improve different aspects of the network. Unlike the previous works, this paper quantifies the multicast and the broadcast throughput in both smallscale MCMRWMN and largescale MCMRWMN. In this regard, we also present a simulationbased discussion to simultaneously study the effects of loadbalancing and number of transmissions on the network’s throughput.
3. Network Model and Assumptions
We consider a typical MCMRWMN consisting of stationary nodes (In this paper, the terms “mesh router” and “node” are used interchangeably for convenience.). Each node is equipped with halfduplex radios tuned to one of the available nonoverlapping channels where no channel switching is allowed. For the sake of efficiency, the radios of a node are tuned to different nonoverlapping channels. When a radio of a node transmits or receives the packets on a channel, other radios of the same node are able to communicate at the same time with neighboring nodes on other channels. In this paper, a singlerate framework is assumed for all linklayer transmissions. In addition, we suppose that the radios of the nodes are equipped with omnidirectional antennas characterized by the same transmission range and the same interference range. Node is directly connected to node and forms a wireless link, if and only if node is within the transmission range of node and they share a common channel. In this regard, we model the network as a directed graph , where is the set of vertices representing nodes and denotes the set of communication links. In this work, we consider the traffic model of ondemand multicast/broadcast sessions, where each admitted session creates a unique tree with a specific bandwidth requirement. In this way, we adopt a schedulebased MAC protocol, in which the conflictfree transmission is ensured by assigning the interfering transmitters to either send on different nonoverlapping channels or send on the same channel but at different time slots.
4. Problem Formulation
The limited number of radios and the shared nature of wireless medium impose some resource constraints on MCMRWMNs. In this section, we derive a formulation to capture the utilization of the network resources and to analyze the feasibility of multicast/broadcast session requests.
Definition 1. The capacity of the mesh router is defined as , where represents the number of its radios and is the capacity of the channels. In addition, we define the sent and the received traffic loads of the mesh router, denoted by and , respectively, as and , , where and are the sent and the received traffic loads of the radio in the mesh router, respectively. Thus, the total traffic load of the mesh router is obtained as , .
According to the assumption of the halfduplex radios, each radio can only send or receive on a fixed channel at any time slot; therefore, it is required that
Let denote the created load by the session on the mesh router. Thus, the total load of the mesh router can be rewritten as , , where is the number of active sessions. In general, each multicast/broadcast tree is composed of a set of MAC multicast transmissions on different nodes and channels. The number of transmissions of node at the tree, denoted by , is given by
where is the set of available nonoverlapping channels and if node is a forwarding node on channel at the tree, and otherwise. In this case, we define the total number of transmissions for the tree as
In fact, shows the number of transmissions required to deliver one packet from the source node to all the destinations at the multicast/broadcast tree. Thus, the average number of transmissions per active session is expressed as
Since more transmissions take longer time on scheduling frame, minimizing the number of transmissions helps to improve the network’s throughput. In a typical multicast/broadcast tree , there are three kinds of nodes: source node , forwarding nodes set (), and leaf nodes set (). For example, consider the multicast tree shown in Figure 1. Here, the number associated with each link represents the channel assigned to that link. All nodes of tree, except the source node, have one parent. The source node (e.g., node A), as the root of the tree, sends data toward its children. A forwarding node (e.g., nodes B, C, E, F, and I) acts as both parent and child node; as a child node, it receives data from its parent, while in the role of a parent node, it sends the traffic toward its children. A leaf node (e.g., nodes D, K, L, M, N, and P) only plays the role of a child and receives data from its parent. It is clear from Figure 1 that , while (i.e., ).
Since we assume the bandwidthguaranteed trees with bandwidth requirement , the created load by the session on the node can be generally formulated by the role of node and the number of its transmissions as
Here, we define the utilization of the mesh router, denoted by , as follows: where indicates the percentage of the node’s capacity used for routing of multicast/broadcast sessions. For this case, the average utilization of the nodes is defined as where is the total number of nodes in the network.
On the other hand, due to the shared nature of the wireless medium, adjacent transmissions cannot occur simultaneously on the same channel. To formulate this issue, we use the channel utilization concept defined in [17] with minor modifications. For the described MCMRWMN model, consider a fixed transmission rate of . Each MAC multicast transmission in the routing tree uses a time fraction of the scheduling frame that is equal to . By definition, the utilization of channel observed by node () is the sum of the time fractions assigned to all nodes within the interference range of node that are intended to transmit on channel . Thus, considering admitted multicast/broadcast sessions, the utilization of channel observed by node is formulated as where denotes the set of interfering nodes located within the interference range of node . For this case, the channel capacity constraint is given by where indicates the set of assigned channels to the radios of node . Since the radios of each node are assigned to different nonoverlapping channels and no channel switching is allowed, one can show that condition (9) satisfies the described condition in (1). Therefore, the bandwidthguaranteed multicast/broadcast sessions are feasible and schedulable if all interfering transmissions have a total load less than the normalized channel capacity. Different from the besteffort routing algorithms, quality of service (QoS) routing algorithms must use call admission control mechanisms to protect the QoS requirements of the existing flows [17, 21]. Clearly, it is desired to maximize the number of admitted sessions. In this regard, we define the network’s throughput, denoted by , as the sum of the traffic load of all admitted feasible sessions as .
5. Network’s Throughput versus Resource Utilizations in MCMRWMNs
In this section, we aim to derive analytical relationships for the network’s throughput in terms of the node utilizations, the channel utilizations, and the number of transmissions.
Theorem 2. If all sessions have the same traffic load, for example, , and the capacity of all nodes in the network is identical, for example, and , the average number of transmissions for the multicast flows is expressed as where and denote the number of admitted sessions and the average node utilization, respectively. In addition, shows the average number of links in the tree of each session and is the number of links in the multicast tree.
Proof. Under the assumption and using (6) and (7), we have
where () comes from (5) and the fact that each multicast routing tree includes three kinds of nodes: a source node, forwarding nodes, and leaf nodes. In the above equations, is the number of transmissions of source node, and and denote the number of forwarding nodes and leaf nodes at the tree, respectively. On the other hand, from the graph theory [22]
Thus, (11) can be simplified as
According to (3) and (4) and considering the fact that for , we have
Thus,
As a result, .
Corollary 3. For the broadcast case, (12) can be rewritten as [22]. Thus,
In the rest of the section, we first present the problem for the smallscale MCMRWMNs, and then, we extend our work to the case of largescale MCMRWMNs. In addition, due to the similarity of equations for the multicast and the broadcast sessions, we follow the problem only for the broadcast sessions.
SmallScale MCMRWMNs. In a smallscale MCMRWMN, we suppose that all nodes are located in the interference range of each other. Thus, the channel utilization observed by any node is identical. For a smallscale MCMRWMN, we define the utilization of channel denoted by and the average channel utilization as follows:
Lemma 4. Under the same conditions as in Theorem 2, the broadcast throughput of a smallscale MCMRWMN is expressed in terms of the average node utilization and the average channel utilization, as follows:
Proof. Using (17) and averaging the utilization on different channels, we have where () comes from (2)–(4), and the assumption . Considering , , and replacing with the result in (16) for broadcast sessions, the throughput can be expressed as .
LargeScale MCMRWMNs. Now, we extend the result of Lemma 4 to the largescale MCMRWMN case. In general, the channel utilization is a locationdependent parameter. However, due to the shared nature of the wireless medium, the channel utilizations observed by neighboring nodes are close to each other. Thus, considering the channel utilization observed by all nodes gives a lot of redundancy. One idea is to study the channel utilization observed by a special node on behalf of its neighbors. To address this solution, we define the “interference domain (ID)” and the “interference domain head” as follows.
Definition 5. The “interference domain" is defined as a subset of the network’s nodes which satisfies three conditions.(i)The interference domains have no common node that is, .(ii)The interference domains span all nodes in the network that is, , where denotes the total number of interference domains.(iii)Each interference domain, for example, the interference domain, includes a node denoted by so that only the nodes of are located within the interference range of . We define as the “interference domain head” of .
It is clear from Definition 5 that a smallscale MCMRWMN is a special case which consists of only one interference domain. The feasibility of condition (iii) is justified by the fact that mesh routers are usually deployed with careful planning. To clarify the above definition, consider a typical grid topology plotted in Figure 2 as a popular topology for the WMNs. Let the grid length be set to . In this case, for the interference range , assume which is a reasonable interference range [2]. Thus, we can model the interference domains as a square grids as shown in Figure 2(b). This modeling satisfies conditions (i)–(iii) in Definition 5. In Figure 2(a), each circle represents an interference domain and the central black nodes play the role of the corresponding interference domain head.
(a)
(b)
Now, let the network be composed of interference domains . For largescale MCMRWMNs, we define the average channel utilization as follows: where denotes the utilization of channel observed by the interference domain head.
Theorem 6. Assume all sessions have the same traffic load, for example, . The network’s throughput of the largescale MCMRWMN is obtained as
Proof. According to (8) and considering the condition (iii) in Definition 5, the utilization of the channel observed by the interference domain head is given by
Using (23) and averaging the utilization on different channels and different interference domain heads, we have
where () comes from assumption . Under conditions (i) and (ii) in Definition 5 and using (2)–(4), we obtain
Thus, (25) can be simplified as
As a result, since , the network’s throughput can be obtained as .
Corollary 7. Under the same conditions as in Theorem 2, considering and replacing with the result in (16), the broadcast throughput of a largescale MCMRWMN is expressed in terms of the average node utilization and the average channel utilization as follows:
It is clear that different parameters of the network interact with each other. Thus, it is not possible to draw a specified boundary between them. Due to the limited number of radios and nonoverlapping channels, proper use of the resources could improve the performance of the network. In this regard, as we will show in the next section, the number of transmissions and the loadbalancing significantly affect the network’s throughput.
6. Numerical Results
In this section, we present a comprehensive evaluation on the relationship between the network’s throughput and the resource utilizations. For this purpose, we apply the following protocols in a singlerate framework: SPTJCRS [7], MCMJCRS [7], IRMT [20], and IRBT [20]. In our Matlab simulation setup, as shown in Figure 3, we consider a square grid with and , where nodes , , , and are the interference domain heads. The grid length (the distance between neighbor nodes in the same row or column) and the interference range are set to m and m, respectively. We also use the random channel assignment, in which the radios of each node are randomly assigned to the distinct channels. Obviously, in the cases that the number of channels is less than or equal to the number of radios, this method will act as the common channel assignment strategy.
In the simulations, the broadcast session requests arrive one by one at the network without any knowledge of the future requests. The source of each session is selected randomly. In addition, the traffic model of all sessions is assumed to be Constant Bit Rate (CBR) with Mbps. Assuming , Mbps, and broadcast session requests, we study the performance of the network for different number of channels; that is, . It is clear that in the case of , we have a SCSRWMN. Figure 4 compares the throughput of the aforementioned protocols in terms of the number of channels . In addition, Table 1 shows the simulation results in more details. It should be noted that each data point is obtained by averaging the results of individual runs on different randomly experiments. In this table, , , , and present the experimental results obtained for the average number of transmissions, the average node utilization, the average channel utilization, and the network’s throughput, respectively. It is worth noting that the results in Table 1 exactly follow the described theoretical relationships in (16), (22), and (28). As an example, Table 1 compares with the theoretical throughput extracted from (28). Obviously, is similar to for different number of channels. This shows the validity of our analysis. This comparison can be also verified for relationships (16) and (22). It is clear that different parameters of the network interact with each other. In this situation, given the limited number of radios and channels, proper use of the resources could improve the performance of the network. Actually, using an efficient traffic engineering mechanism leads to better spectrum utilization and increases the fairness in the network. Thus, more resources will be available for accepting the future sessions and the overall throughput will be increased. In this regard, it is observed that the performance of the IRBT and the IRMT algorithms much better than that of the other two algorithms. In fact, the IRBT and the IRMT algorithms jointly address the transmission channel selection and the loadbalanced routing tree construction [20]. These schemes not only take into account the number of transmissions, but also consider both interflow and intraflow interferences to route the sessions through alternative feasible paths. Thus, the traffic load is balanced in the network. However, the MCMJCRS and the SPTJCRS algorithms cannot efficiently use the resources of the network due to being limited to noninterferenceaware routing trees.

In [20], we demonstrated that the IRBT algorithm balances the traffic load in the network more efficiently than the IRMT algorithm. The results in Table 1 also confirm this issue. From this table, we can see that the IRBT approach improves the utilization of the network resources. For (i.e., common channel assignment), although the IRMT algorithm leads to less number of transmissions than the IRBT algorithm, the loadbalancing ability of the IRBT makes both schemes have the same network’s throughput. If the traffic load in the network is balanced, the interference will be decreased, and consequently, the call acceptance rate will be increased. In contrast, for , both IRMT and IRBT algorithms nearly have the same number of transmissions. In this situation, the loadbalancing factor plays more efficient role in the network’s performance. This causes the IRBT algorithm to show better throughput.
On the other hand, by increasing the number of channels, first the network’s throughput linearly increases. However, for , it is gradually saturated. Due to the random channel assignment strategy, further increasing of the channels leads to the less number of common channels between the neighbor nodes. Thus, the possibility of enjoying the wireless broadcast advantage will be decreased. This increases the number of transmissions as shown in Table 1. In this situation, the lack of loadbalancing could sufficiently reduce the network’s throughput.
7. Conclusion
In this paper, the throughput of a MCMRWMN was quantified. We focused on the scenario of ondemand QoS multicast/broadcast sessions, where each session has a specific bandwidth requirement. In particular, considering the resource constraints, we derived analytical relationships for the network’s throughput in terms of the node utilization, the channel utilization, and the number of transmissions. This gives simple solutions for the future designs to predict the network’s throughput based on the resource utilizations. In line with the proposed relationships, we also demonstrated that the network’s throughput is significantly affected by both number of transmissions and degree of loadbalancing. On one hand, minimizing the number of transmissions reduces the use of the network resources. On the other hand, loadbalancing increases the fairness in the network. In this situation, more resources will be available for accepting the future sessions. Thus, the overall network’s throughput will be increased.
Acknowledgment
This work is supported by the Iranian Telecommunication Research Center (ITRC).
References
 P. H. Pathak and R. Dutta, “A survey of network design problems and joint design approaches in wireless mesh networks,” IEEE Communications Surveys and Tutorials, vol. 13, no. 3, pp. 396–428, 2011. View at: Publisher Site  Google Scholar
 A. Raniwala and T.C. Chiueh, “Architecture and algorithms for an IEEE 802.11based multichannel wireless mesh network,” in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM '05), vol. 3, pp. 2223–2234, March 2005. View at: Google Scholar
 A. Avokh and G. Mirjalily, “Performance analysis of broadcasting in smallscale multiradio multichannel wireless mesh networks,” in Proceedings of the 14th International Conference on Advanced Communication Technology (ICACT '12), pp. 537–542, February 2012. View at: Google Scholar
 U. T. Nguyen and J. Xu, “Multicast routing in wireless mesh networks: minimum cost trees or shortest path trees?” IEEE Communications Magazine, vol. 45, no. 11, pp. 72–77, 2007. View at: Publisher Site  Google Scholar
 Y. Li and I. Chen, “Dynamic agentbased hierarchical multicast for wireless mesh networks,” Ad Hoc Networks, vol. 11, no. 6, pp. 1683–1698, 2013. View at: Google Scholar
 J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, “Energyefficient broadcast and multicast trees in wireless networks,” Mobile Networks and Applications, vol. 7, no. 6, pp. 481–492, 2002. View at: Publisher Site  Google Scholar
 A. Avokh, G. Mirjalily, and J. Abouei, “Joint channel and rate selection for multicast routing trees in wireless mesh networks,” in Proceedings of the International Symposium on Telecommunications, pp. 548–553, November 2012. View at: Google Scholar
 K. N. Ramachandran, E. M. Belding, K. C. Almeroth, and M. M. Buddhikot, “Interferenceaware channel assignment in multiradio wireless mesh networks,” in Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), pp. 1–12, April 2006. View at: Publisher Site  Google Scholar
 R.H. Jan, S.Y. Huang, and C.F. Wang, “An upper bound of the throughput for multiradio wireless mesh networks,” IEEE Communications Letters, vol. 14, no. 8, pp. 698–700, 2010. View at: Publisher Site  Google Scholar
 A. Capone, G. Carello, I. Filippini, S. Gualandi, and F. Malucelli, “Routing, scheduling and channel assignment in wireless mesh networks: optimization models and algorithms,” Ad Hoc Networks, vol. 8, no. 6, pp. 545–563, 2010. View at: Publisher Site  Google Scholar
 E. Alotaibi, V. Ramamurthi, M. Batayneh, and B. Mukherjee, “Interferenceaware routing for multihop wireless mesh networks,” Computer Communications, vol. 33, no. 16, pp. 1961–1971, 2010. View at: Publisher Site  Google Scholar
 V. C. M. Borges, D. Pereira, M. Curado, and E. Monteiro, “Routing metric for interference and channel diversity in multiradio wireless mesh networks,” in AdHoc, Mobile and Wireless Networks, vol. 5793 of Lecture Notes in Computer Science, pp. 55–68, Springer, Berlin, Germany, 2009. View at: Publisher Site  Google Scholar
 S. Roy, D. Koutsonikolas, S. Das, and Y. C. Hu, “Highthroughput multicast routing metrics in wireless mesh networks,” Ad Hoc Networks, vol. 6, no. 6, pp. 878–899, 2008. View at: Publisher Site  Google Scholar
 P. M. Ruiz and A. F. GomezSkarmeta, “Approximating optimal multicast trees in wireless multihop networks,” in Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC '05), pp. 686–691, June 2005. View at: Publisher Site  Google Scholar
 H. L. Nguyen and U. T. Nguyen, “Bandwidth efficient multicast routing in multichannel multiradio wireless mesh networks,” in Proceedings of the International Conference on Ultra Modern Telecommunications and Workshops (ICUMT '09), pp. 1–8, October 2009. View at: Publisher Site  Google Scholar
 G. Zeng, B. Wang, Y. Ding, L. Xiao, and M. Mutka, “Efficient multicast algorithms for multichannel wireless mesh networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 1, pp. 86–99, 2010. View at: Publisher Site  Google Scholar
 H. S. Chiu, K. L. Yeung, and K.S. Lui, “Maximizing broadcast load in multichannel Multiinterface wireless mesh networks,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '08), pp. 533–537, December 2008. View at: Publisher Site  Google Scholar
 F. Li, Y. Fang, F. Hu, and X. Liu, “Loadaware multicast routing metrics in multiradio multichannel wireless mesh networks,” Computer Networks, vol. 55, no. 9, pp. 2150–2167, 2011. View at: Publisher Site  Google Scholar
 P. A. K. Acharya and E. M. Belding, “MARS: linklayer rate selection for multicast transmissions in wireless mesh networks,” Ad Hoc Networks, vol. 9, no. 1, pp. 48–60, 2011. View at: Publisher Site  Google Scholar
 A. Avokh and G. Mirjalily, “Interferenceaware multicast and broadcast routing in wireless mesh networks using both rate and channel diversity,” Computers & Electrical Engineering, 2013. View at: Publisher Site  Google Scholar
 T. Kim, Y. Yang, J. C. Hou, and S. V. Krishnamurthy, “Resource allocation for QoS support in wireless mesh networks,” IEEE Transactions on Wireless Communications, vol. 12, no. 5, pp. 2046–2054, 2013. View at: Google Scholar
 W. Kocay and D. Kreher, Graphs, Algorithms and Optimization: Discrete Mathematics and Its Applications, Chapman & Hall/CRC, Boca Raton, Fla, USA, 2005.
Copyright
Copyright © 2013 Avid Avokh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.