DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
An efficient TDMA slot assignment protocol in mobile ad hoc networks
Proceedings of the 2007 ACM symposium on Applied computing
| Hi-index | 0.00 |
In this paper, we present a TDMA MAC protocol for scenarios with real-time traffic like voice streams. While many previous works assume stationary networks, DynaMAC can quickly adapt to changing topologies while not violating delay guarantees for even a single data packet with high probability. By intelligent data aggregation, DynaMAC also accounts for the fact that the large synchronization preambles of high-speed PHYs make transmissions of very small packets like voice samples extremely inefficient. Further, it introduces a novel segmentation concept, which results in a discrete set of potential per-node delay guarantees, which can be exploited by higher layers to balance the endto-end delay of routes with different lengths. Finally, the slot allocation strategy tries to ensure a contiguous placement of unassigned slots, so that larger best-effort packets can be efficiently transmitted with a minimum of fragmentation. We validate our propositions with expressive simulations.