Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing and scheduling in multihop wireless networks with time-varying channels
ACM Transactions on Algorithms (TALG)
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless communication. More precisely, there is an adversary that specifies transmission rates of wireless links and injects data in such a way that an average number of data injected in a single round and routed through a single wireless link is at most r, for a given r ∈ (0,1). We also assume that the additional "burst" of data injected during any time interval and scheduled via a single link is bounded by a given parameter b. Under this scenario, we show that the nodes following so called work-conserving scheduling policies, not necessarily the same, are guaranteed stability (i.e., bounded queues) and reasonably small data latency (i.e., bounded time on data delivery), for injection rates r d, where d is the maximum length of a routing path. Furthermore, we also show that such a bound is asymptotically optimal on d.