Pruning Local Schedules for Efficient Swarm Communication

Abstract

Reliable wireless communication underwater is a precondition for swarming technologies. This paper discusses a time division multiple access (TDMA) algorithm suitable for dynamic multi-hop wireless networks, which offers quick all-to-all information exchange (Omnicast), dense local schedules and predictable latencies. The algorithm is based on an earlier algorithm published by the authors in [Schill F., et al., 2006]. This paper presents an improved and simplified algorithm to calculate the local schedules, and uses a new mapping function for logical time slots to actual time slots, which balances sending frequencies between nodes. An extension of this algorithm is then presented which employs a technique to reduce the average degree of the connection graph as seen by the scheduling algorithm. It is explained how this reduction of degree can be achieved without causing communication collisions. The results of experiments performed in a real time simulation show the performance of the algorithm, and the performance gain achieved by local reduction of the degree.