Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs
Author(s)
Kose, Alper; Medard, Muriel
DownloadSubmitted version (150.1Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
© 2017 IEEE. In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented by claw-free conflict graphs. It is possible to formulate a scheduling problem of network coded flows as finding maximum weighted independent set (MWIS) in the conflict graph of the network. We consider activation of hyperedges in a hypergraph to model a wireless broadcast medium. We show that the conflict graph of certain wireless ad hoc networks are claw-free. It is known that finding MWIS of a general graph is NP-hard, but in a claw-free conflict graph, it is possible to apply Minty's or Faenza et al.'s algorithms in polynomial time. We discuss our approach on some sample networks.
Date issued
2017-10Department
Massachusetts Institute of Technology. Research Laboratory of Electronics; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer SciencePublisher
IEEE
Citation
Kose, Alper and Medard, Muriel. 2017. "Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs."
Version: Original manuscript