Routing and scheduling in multihop wireless networks with time-varying channels

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 node per time step. The transmission rates are time varying as a result of the changing wireless channel conditions.In this paper we assume that the 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.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 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 the data so that the admissibility condition is satisfied. We can then schedule data along the chosen paths using our stable scheduling algorithms. We conclude by discussing the performance of distributed load balancing algorithms for combined routing and scheduling.

[1]  Philip A. Whiting,et al.  Cdma data qos scheduling on the forward link with variable channel conditions , 2000 .

[2]  Jon M. Kleinberg,et al.  Stability of load balancing algorithms in dynamic adversarial systems , 2002, STOC '02.

[3]  Alexander L. Stolyar,et al.  Scheduling for multiple flows sharing a time-varying channel: the exponential rule , 2000 .

[4]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..

[6]  Ashish Goel,et al.  Source routing and scheduling in packet networks , 2005, JACM.

[7]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Rafail Ostrovsky,et al.  Adaptive packet routing for bursty adversarial traffic , 1998, STOC '98.

[9]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[10]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[12]  H. Kushner,et al.  Asymptotic Properties of Proportional-Fair Sharing Algorithms , 2002 .

[13]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[14]  Eytan Modiano,et al.  Power and server allocation in a multi-beam satellite with time varying channels , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Allan Borodin,et al.  Stability preserving transformations: packet routing networks with edge capacities and speeds , 2001, SODA '01.

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[18]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[19]  A. Jalali,et al.  Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[20]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[21]  Lisa Zhang,et al.  Scheduling over a time-varying user-dependent channel with applications to high speed wireless data , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[22]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[23]  Lisa Zhang,et al.  Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data , 2005, JACM.

[24]  Christian Scheideler,et al.  Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.