ANALYSIS OF WIRELESS MESH NETWORKS USING ROUTING AND SCHEDULING TECHNIQUES

This paper represents the data rate allocation algorithms provide the average data rates at which the source must transmit data. They do not determine scheduling on a time slot basis. To address that, we consider transmission scheduling in wireless networks. We also compare the suggested algorithm with a centralized optimal data rate allocation algorithm to verify that our algorithm follows the optimal solution. Through simulations, we show that fairness provisioning leads to higher network performance. We show that the suggested algorithm outperforms the current algorithms in the literature in terms of both network throughput and fairness provisioning. Wireless networks over the year have undergone huge technological advancements. Due to integration of all three types of services viz. voice, data, video, during improvement in wireless technologies, bandwidth has become the most crucial network resource that needs to be optimized for these bandwidth hungry services. In multi hop scenarios (in WMNs), performance depends on the routing protocol to properly choose routes, given the current network conditions. To efficiently optimize these wireless networks, efficient routing and scheduling techniques needs to be incorporated to improve Quality of Service (QoS). Routing and scheduling techniques have been analyzed. Different techniques in various technologies are discussed to improve network performance