Scheduling Wireless Ad Hoc Networks in Polynomial Time Using Claw-free Conflict Graphs

@inproceedings{Kose2017SchedulingWA,
  title={Scheduling Wireless Ad Hoc Networks in Polynomial Time Using Claw-free Conflict Graphs},
  author={Alper Kose and Muriel M{\'e}dard},
  booktitle={PIMRC},
  year={2017}
}
We study the scheduling problem in wireless ad hoc networks. In a wireless broadcast medium, networks are usually interference limited and hence, interfering transmissions cannot be done simultaneously. On the other hand, it is necessary to maximize the number of simultaneous transmissions in order to obtain a high throughput in the network. This trade-off enforces us to do scheduling which aims to maximize the number of noninterfering simultaneous transmissions in considered time slot. 
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS