Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Selected topics on assignment problems
Discrete Applied Mathematics
Optimal TDMA time slot and cycle length allocation for hard real-time systems
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
A combinatorial algorithm for the TDMA message scheduling problem
Computational Optimization and Applications
Transformations for write-all-with-collision model
Computer Communications
| Hi-index | 0.00 |
Treating clock drift to avoid message collision and loss is a major challenge when the Time Division Multiple Access (TDMA) protocol is used to schedule communication over a shared medium in networks. We consider clock drift in synchronized networks with tree topology and limited energy, where the root provides the reference clock. We provide a formal approach for analyzing the effect of the slot assignment on the maximal clock drift, given an upper bound on the drift rates of the clocks. We give exact topological characterizations of the slot assignments with largest and least existing clock drift and provide least upper bounds on the clock drift in both cases. We apply our results to derive an optimal, i.e. minimal, safe guard time which effectively avoids message collision or loss due to clock drift.