The source of each session is selected randomly. selleck chemicals Pazopanib In addition, the traffic model of all sessions is assumed to be Constant Bit Rate (CBR) with trsj = 0.4Mbps. Assuming R = 3, c0 = 12Mbps, and 25 broadcast session requests, we study the performance of the network for different number of channels; that is, K = 1,��, 6. It is clear that in the case of K = 1, we have a SCSR-WMN. Figure 4 compares the throughput of the aforementioned protocols in terms of the number of channels K. 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 15 individual runs on different randomly experiments. In this table, NT��, U��, X��LS, and ��sim 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 ��sim with the theoretical throughput ��theory extracted from (28). Obviously, ��sim is similar to ��theory 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 load-balanced routing tree construction [20]. These schemes not only take into account the number of transmissions, but also consider both inter-flow and intra-flow interferences to route the sessions through alternative feasible paths. Thus, the traffic load is balanced in the network.

However, the MCM-JCRS and the SPT-JCRS algorithms cannot efficiently use the resources of the network due to being limited to non-interference-aware Cilengitide routing trees.Figure 4Network’s throughput as function of the number of channels.Table 1Performance comparison for different number of channels.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 K = 1,2, 3 (i.e.