Spatial reuse TDMA (STDMA) has been proposed as an access scheme for multi-hop radio networks where real-time service guarantees are important. The idea is to achieve high capacity by letting several radio terminals use the same time slot when the radio units are geographically separated such that small interference is obtained. The transmission rights of the different users are described with a schedule. Due to the mobility of the users, this schedule must be constantly updated. To make this possible such updates must be made in parallel with only local information, i.e. distributed STDMA algorithms must be used. In this report we investigate and list the properties a distributed STDMA algorithm must have to be efficient in a military scenario. We also study the existing STDMA algorithms and see what methods they use to fulfill these properties and show that no existing algorithm can fulfill all these properties. The main contribution of this report is the description of the central parts of an interference-based distributed STDMA algorithm. This is the first distributed algorithm that uses a interference-based model of the network, which is important since this property can make STDMA really efficient and competitive. The algorithm is evaluated to show that this distributed algorithm can achieve as high network capacity as a centralized scheme using the same information.