Link Scheduling in STDMA Wireless Networks: A Line Graph Approach

TL;DR

This paper introduces a new link scheduling algorithm for STDMA wireless networks using line graph representation, resulting in shorter schedules and faster computation compared to existing methods.

Contribution

The paper presents a novel line graph-based approach for link scheduling in STDMA networks, improving efficiency and schedule length over prior algorithms.

Findings

Achieves lower schedule length than existing algorithms.

Reduces run time complexity for link scheduling.

Demonstrates effectiveness through simulations or analysis.

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.