Improving network throughput using a fixed scheduling scheme and a p-persistent approach

  • Authors:
  • Nam Pham;Jong-Hoon Youn;Hesham Ali

  • Affiliations:
  • Department of Computer Science, University of Nebraska at Omaha, Omaha, Nebraska;Department of Computer Science, University of Nebraska at Omaha, Omaha, Nebraska;Department of Computer Science, University of Nebraska at Omaha, Omaha, Nebraska

  • Venue:
  • NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper combines a fixed scheduling scheme and a simple p-persistent approach, creating a new MAC scheduling scheme for wireless networks. In a fixed scheduling scheme, a predetermined scheduling vector is assigned to each wireless node before run time. When a node is ready, it calculates the transmission probability pnew, using a successful transmission ratio, a previous transmission probability pold, and a queue utilization ratio. The transmission probability pnew determines whether or not a node can transmit. Our simulation study shows that the new MAC scheduling scheme improves the network throughput and minimizes collision counts.