A Contention-Vector Based Hybrid Scheduling Algorithm for Wireless Networks

Free registration required

Executive Summary

A good scheduling algorithm in wireless networks is the key for the efficient use of wireless medium. This paper presents a hybrid scheduling algorithm, called Contention-Vector based Hybrid Scheduling (CVHS) algorithm, for wireless networks wherein stations can sense each other. Examples of such wireless networks include Wireless LANs and small wireless ad hoc networks. CVHS offers collision-free transmissions and QoS support. In addition, the proposed solution is free from hidden node problems, exhibits fairness across the network, and is adaptive to network dynamics such as nodes leaving and joining, changes in packet size and arrival rate. Analyses and simulations demonstrate that CVHS has high performance in terms of network throughput, delay, jitter, and fairness.

  • Format: PDF
  • Size: 452.48 KB