OPTIMAL SCHEDULING ALGORITHM FOR THROUGHPUT MAXIMIZATION IN MULTIHOP WIRELESS NETWORKS

S. Daisy Rani, B.Sivasankar

Abstract: In this paper, focus on designing a scheduling scheme for achieve maximum throughput. Although, it does not require per-flow or perdestination information and also, this paper consider the problem of link scheduling in Multihop Wireless Networks under general interference constraints. The main goal is to achieve maximum throughput and better delay performance at low complexity. Previously, we use Max Weight Scheduling Algorithm (Per-Hop Queue and Per-Link Queue Scheduling) for Throughput maximization. These algorithms does not require per-flow information but it need local hop count information and use simple data Queue for each link in the network. Some time occurring buffer overflow (that is data queue overflow) because each link maintain simple data Queue. Our proposed scheme overcomes this problem and produces better delay performance and throughput at low complexity. Our proposed scheme combines MaxWeightScheduling and Greedy Algorithm, which reduce buffer overflow and achieve maximum throughput at low complexity. The performance of the proposed scheme is analyzed by various setting NS2 simulation. Prove that proposed scheme is optimal one and produce efficient throughput at low complexity.

Keywords: Max Weight Scheduling, Throughput, Scheduling, Per-Hop Queue Scheduling, Per-Link Queue Scheduling, Greedy Algorithm, hop count information, buffer overflow, without per-flow information.

DOI: https://doi.org/10.15623/ijret.2014.0305102