On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks

TL;DR

This paper introduces a new SINR-aware link scheduling algorithm for STDMA wireless ad hoc networks that improves spatial reuse and throughput compared to existing methods.

Contribution

The paper proposes a novel graph-based link scheduling algorithm incorporating SINR calculations to enhance spatial reuse in STDMA networks.

Findings

The new algorithm outperforms existing algorithms in spatial reuse.

Simulation results show improved throughput and efficiency.

The approach balances computational complexity with performance gains.

Abstract

Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome this problem, we propose a new algorithm for STDMA link scheduling based on a graph model of the network as well as SINR computations. The performance of our algorithm is evaluated in terms of spatial reuse and computational complexity. Simulation results demonstrate that our algorithm achieves better performance than existing algorithms.