Adaptive approach based joint scheduling and congestion control in wireless networks

Wireless networks are defined as that the network nodes which are connected by wireless data connections. The devices are connected via wireless link to communicate with each other. Measuring the delay performance of end-to-end nodes is the one of the most convoluted issues in wireless networks. In wireless networks, it is very difficult to maintain the substitution between throughput and delay. This paper proposes a new joint scheduling and congestion control algorithm for multihop wireless networks with dynamic route flows. The proposed algorithm achieves a provable throughput guarantee and provable end-to-end delay of every flow. The new joint scheduling and congestion control algorithm improves throughput and delay for dynamic wireless network by shifting scheduling scheme with virtual adaptation model. The proposed algorithm combines window-based flow control with a new rate based distributed scheduling algorithm to survive the quality of the system. This approach adaptively selects a set of routes according to the traffic load. Furthermore this dynamic adaptation mechanism achieves better concert in terms of throughput, end-to-end delay and packet delivery ratio.