PROJECT TITLE :

A Message-Passing Algorithm for Wireless Network Scheduling

ABSTRACT:

We have a tendency to consider scheduling in wireless networks and formulate it as a Most Weighted Freelance Set (MWIS) downside on a “conflict” graph that captures interference among simultaneous transmissions. We tend to propose a unique, low-complexity, and totally distributed algorithm that yields high-quality possible solutions. Our proposed algorithm consists of 2 phases, every of which requires solely local data and is based on message-passing. The primary section solves a relaxation of the MWIS downside using a gradient projection technique. The relaxation we tend to consider is tighter than the straightforward linear programming relaxation and incorporates constraints on all cliques within the graph. The second part of the algorithm starts from the answer of the relaxation and constructs a possible solution to the MWIS drawback. We show that our algorithm continually outputs an optimal answer to the MWIS drawback for excellent graphs. Simulation results compare our policies against carrier sense multiple access (CSMA) and different alternatives and show glorious performance.