A Simple Greedy Algorithm for Link Scheduling With the Physical Interference Model

Free registration required

Executive Summary

In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, the authors propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model.

  • Format: PDF
  • Size: 334.2 KB