Journal of the ACM (JACM)
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Journal of the ACM (JACM)
The capacity of wireless networks
IEEE Transactions on Information Theory
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Deterministic broadcast on multiple access channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Bounds on stability and latency in wireless communication
IEEE Communications Letters
Medium access control for adversarial channels with jamming
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
| Hi-index | 0.00 |
We study routing and scheduling in multihop wireless networks. When data is transmitted from its source node to its destination node it may go through other wireless nodes as intermediate hops. The data transmission is node constrained, that is, every node can transmit data to at most one neighboring node per time step. The transmission rates are time varying as a result of changing wireless channel conditions. In this article, we assume that data arrivals and transmission rates are governed by an adversary. The power of the adversary is limited by an admissibility condition which forbids the adversary from overloading any wireless node a priori. The node-constrained transmission and time-varying nature of the transmission rates make our model different from and harder than the standard adversarial queueing model which relates to wireline networks. For the case in which the adversary specifies the paths that the data must follow, we design scheduling algorithms that ensure network stability. These algorithms try to give priority to the data that is closest to its source node. However, at each time step only a subset of the data queued at a node is eligible for scheduling. One of our algorithms is fully distributed. For the case in which the adversary does not dictate the data paths, we show how to route data so that the admissibility condition is satisfied. We can then schedule data along the chosen paths using our stable scheduling algorithms.