.png){kind=icon}
Return
A Message-Passing Algorithm for Wireless Network Scheduling
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2014.2338277.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider scheduling in wireless networks and formulate it as a 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.
Keywords:
Distributed algorithms
graph theory
Maximum Weighted Independent Set problem
message-passing
scheduling
wireless networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more