Abstract
In this paper, topology-transparent scheduling for mobile multi-hop wireless networks is extended from constant-weight to variable-weight schedules. A construction of variable-weight topology-transparent schedules – the first of its kind – is provided based on transversal designs from the finite field. The schedules are integrated into the VWATT medium access control (MAC) protocol, enabling nodes to dynamically select their schedule weights to accommodate both their local traffic load and local topology while maintaining a guarantee on maximum delay. Simulations show VWATT to increase throughput compared to constant-weight topology-transparent schedules, to reduce both maximum and expected delay relative to schedules whose weights are not constrained to the set of weights, and to adapt rapidly to changes in topology and traffic load. The results suggest variable-weight topology-transparent scheduling as a viable approach to medium access control when a bound on delay is required.
Original language | English (US) |
---|---|
Pages (from-to) | 16-28 |
Number of pages | 13 |
Journal | Computer Networks |
Volume | 122 |
DOIs | |
State | Published - Jul 20 2017 |
Keywords
- Adaptive algorithms
- Channel allocation
- Combinatorial mathematics
- Distributed algorithms
- Wireless networks
ASJC Scopus subject areas
- Computer Networks and Communications