Mobility

Topology-Transparent Distributed Scheduling in Multi-Hop Wireless Networks

Free registration required

Executive Summary

Transmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the Time-Division Multiple-Access (TDMA) frame length. Most of scheduling algorithms are graph-based, dependent on the exact network topology information and cannot adapt to the dynamic wireless environment. Some topology-independent TDMA scheduling algorithms have been proposed, and do not need accurate topology information. The paper proposed algorithm follows a similar approach but with a different design strategy. Instead of minimizing the TDMA frame length, one maximizes the minimum expected throughput, and one considers multicasting and broadcasting. The simulation result shows that the performance of the algorithm is better than the conventional TDMA and other existing algorithms in most cases.

  • Format: PDF
  • Size: 214.8 KB