Shortest Link Scheduling Algorithms in Wireless Networks under the SINR Model

This paper considers the shortest link scheduling problem in wireless networks under the signal-to-interferenceplus-noise ratio(SINR) model. The authors propose an O(log(l[subscript max]/l [subscript min]))approximation algorithm called shortest link scheduling with power control (SLSPC) with oblivious power assignment and an O(log[subscript 1+φ]([subscript max]/l [subscript min])-approximation algorithm called shortest link scheduling with uniform or mean power assignment (SLSUM) with uniform or mean power control, where φ > 0 is a constant serving as a regulatory factor for slight transmit power adjustment, and where l [subscript max] and l [subscript min] denote the lengths of the longest and shortest links, respectively. The authors conduct a rigorous theoretical performance analysis to analyze the feasibility and approximation factors of the proposed algorithms. The authors also carry out an extensive comparison-based simulation study, whose results indicate that the performances of SLSPC and SLSUM are superior over the state of the art as the set of the so-called “black and gray” links, which are difficult to schedule and should be sequentially scheduled, is completely removed by adjusting the transmit power appropriately via φ. The authors' numerical analysis demonstrates that the approximation ratios of the algorithms are tighter than the best known ratios.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01633523
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 28 2017 10:44AM