A generalization of line graphs via link scheduling in wireless networks

TL;DR

This paper introduces a polynomial-time algorithm for link scheduling in wireless networks with line multigraph conflict graphs, enabling efficient throughput optimization under specific network topology conditions.

Contribution

It presents a novel polynomial-time scheduling algorithm applicable when the network's conflict graph is a line multigraph, expanding the class of networks with efficient scheduling solutions.

Findings

Polynomial-time algorithm for line multigraph conflict graphs

Guidelines for network topology design to enable efficient scheduling

Potential for improved throughput in stationary wireless networks

Abstract

In single channel wireless networks, concurrent transmission at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to choose a subset of links at each time slot for data trasmission. Throughput optimal link scheduling discipline in such a wireless network is generally an NP-hard problem. In this paper, we develop a poylnomial time algorithm for link scheduling problem provided that network conflict graph is line multigraph. (i.e. line graph for which its root graph is multigraph). This result can be a guideline for network designers to plan the topology of a stationary wireless network such that the required conditions hold and then the throughput optimal algorithm can be run in a much less time.