Routing and Scheduling in Multihop Wireless Networks

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, i.e., every node can transmit data to at most one neighboring mode per time step. The transmission rates are time varying as a result of the changing wireless channel conditions. In this paper we assume 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 the 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.