title: A Message-Passing Algorithm for Wireless Network Scheduling.
abstract: We consider scheduling in wireless networks and formulate it as Maximum Weighted Independent Set (MWIS) problem on a "conflict" graph that captures interference among simultaneous transmissions. We propose a novel, low-complexity, and fully distributed algorithm that yields high-quality feasible solutions. Our proposed algorithm consists of two phases, each of which requires only local information and is based on message-passing. The first phase solves a relaxation of the MWIS problem using a gradient projection method. The relaxation we consider is tighter than the simple linear programming relaxation and incorporates constraints on all cliques in the graph. The second phase of the algorithm starts from the solution of the relaxation and constructs a feasible solution to the MWIS problem. We show that our algorithm always outputs an optimal solution to the MWIS problem for perfect graphs. Simulation results compare our policies against Carrier Sense Multiple Access (CSMA) and other alternatives and show excellent performance.
authors.affiliation: Department of Electrical and Computer Engineering, and Division of Systems Engineering, Boston University, 8 St. Mary's St., Boston, MA 02215, yannisp@bu.edu .
authors.forename: Ioannis Ch
authors.initials: IC
authors.lastname: Paschalidis
authors.affiliation: Center for Information and Systems Engineering, Boston University, Boston, MA 02215, huangfz@bu.edu .
authors.forename: Fuzhuo
authors.initials: F
authors.lastname: Huang
authors.affiliation: Center for Information and Systems Engineering, Boston University, Boston, MA 02215, wei@alum.bu.edu .
authors.forename: Wei
authors.initials: W
authors.lastname: Lai
keywords: Wireless networks; distributed algorithms; graph theory; maximum weighted independent set problem; message-passing; scheduling