Get help with any kind of assignment - from a high school essay to a PhD dissertation
This project uses a window based flow control and rate based scheduling algorithm for multihop wireless networks using fixed-route flows operated under a general interference version with interference degree. The proposed algorithm not only accomplishes a provable throughput warranty, but also leads to explicit upper bounds on the end-to-end delay of each stream. The end-to-end delay and throughput bounds are in simple and closed types, and they explicitly quantify the tradeoff between throughput and delay of each flow. The proposed algorithm is completely distributed and demands a low per-node sophistication that does not increase with the community size. Consequently, it can be readily implemented in practice. Key words: multihop wireless networks, rate based scheduling, throughput, window based flow controller, I.INTRODUCTION The combined congestion management and scheduling problem in multihop wireless networks has been extensively examined in the literature. Many times, every user is associated with a non invasive and concave utility function of its speed, and a cross-layer utility maximization significant as well because, practical congestion control protocols will need to establish retransmission timeout values dependent on the packet delay, and such parameters may significantly impact the rate of recovery when packet loss occurs. Packet delay is also important for multimedia traffic, some of which have been carried on congestion-controlled sessions.There are two major issues on the delay-performance of the back-pressure algorithm. First, for long flows, the end-to-end delay may grow quadratically with the number of hops. Under the back-pressure algorithm, if a link schedules the lengthy flow, the...