Link Scheduling in STDMA Wireless Networks: A Line Graph Approach

N. Kumar,Ashutosh Deepak Gore,A. Karandikar

Published 2007 in arXiv.org

ABSTRACT

We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link scheduling algorithm based on a line graph representation of the network, by embedding the interferences between pairs of nodes into the edge weights of the line graph. Our algorithm achieves lower schedule length and lower run time complexity than existing algorithms.

PUBLICATION RECORD

  • Publication year

    2007

  • Venue

    arXiv.org

  • Publication date

    2007-12-11

  • Fields of study

    Computer Science, Engineering

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.