A Complexity Adjustable Scheduling Algorithm for Throughput Maximization in Clusterized TDMA Networks

Free registration required

Executive Summary

The authors consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA) to access a wireless channel that is shared among several clusters. Earlier work has demonstrated that a significant increase in network throughput can be achieved if all the schedules are optimized jointly. However, a drawback of this approach is the prohibitive level of computational complexity is required when a network with a large number of clusters and time-slots is to be scheduled.

  • Format: PDF
  • Size: 525.58 KB