Before revision: This paperfocuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link,  exploit only local information, for multi-hop wireless networks under general interference constraints .
After revision: In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, for multi-hop wireless networks under general interference constraints .