article

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

Authors:

Matthew Andrews,

Lisa ZhangAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 3, Issue 3

Pages 33 - es

https://doi.org/10.1145/1273340.1273349

Published: 01 August 2007 Publication History

Abstract

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.

References

[1]

Andrews, M., Fernández, A., Goel, A., and Zhang, L. 2005. Source routing and scheduling in packet networks. J. ACM 52, 4 (Jul.), 582--601.

Digital Library

[2]

Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Vijayakumar, R., and Whiting, P. 2004. Scheduling in a queueing system with asynchronously varying service rates. Probab. Eng. Inf. Sci. 18.

Digital Library

[3]

Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Vijayakumar, R., and Whiting, P. 2001. Providing quality of service over a shared wireless link. IEEE Commun. Mag. (Feb.).

Digital Library

[4]

Andrews, M., and Zhang, L. 2005. Scheduling over a time-varying user-dependent channel with applications to high speed wireless data. J. ACM 52, 5 (Sept.), 809--834.

Digital Library

[5]

Anshelevich, E., Kempe, D., and Kleinberg, J. 2002. Stability of load balancing algorithms in dynamic adversarial systems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (Montreal, Canada, May).

Digital Library

[6]

Awerbuch, B., Berenbrink, P., Brinkmann, A., and Scheideler, C. 2001. Simple routing strategies for adversarial systems. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (Las Vegas, NV, Oct.). 158--167.

Digital Library

[7]

Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., and Williamson, D. P. 2001. Adversarial queueing theory. J. ACM 48, 1 (Jan.), 13--38.

Digital Library

[8]

Borodin, A., Ostrovsky, R., and Raban, Y. 2004. Stability preserving transformations: Packet routing networks with edge capacities and speeds. J. Interconnect. Netw. 5, 1, 1--12.

[9]

Garg, N., and Konemann, J. 1998. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (Palo Alto, CA, Nov.) 300--309.

Digital Library

[10]

Grossglauser, M., and Tse, D. 2002. Mobility increases the capacity of ad-hoc wireless networks. IEEE/ACM Trans. Netw. 10, 4 (Aug.), 477--486.

Digital Library

[11]

Gupta, P., and Kumar, P. R. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 2, 388--404.

Digital Library

[12]

Jalali, A., Padovani, R., and Pankaj, R. 2000. Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In Proceedings of the IEEE Semiannual Vehicular Technology Conference (VTC Spring) (Tokyo, Japan, May).

[13]

Kushner, H., and Whiting, P. 2002. Asymptotic properties of proportional fair sharing algorithms. In the 40th Annual Allerton Conference on Communication, Control, and Computing.

[14]

Neely, M., Modiano, E., and Rohrs, C. 2003. Dynamic power allocation and routing for time varying wireless networks. In Proceedings of the Annual Joint INFOCOM Conference of the IEEE Computer and Communications Societies (San Francisco, CA, Apr.).

[15]

Neely, M., Modiano, E., and Rohrs, C. 2002. Power and server allocation in a multi-beam satellite with time varying channels. In Proceedings of the Annual Joint INFOCOM Conference of the IEEE Computer and Communications Societies (New York, Jun.).

[16]

Shakkottai, S., and Stolyar, A. 2002. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Anal. Meth. Appl. Probab. 207, 185--202.

[17]

Shakkottai, S., and Stolyar, A. 2001. Scheduling algorithms for a mixture of real-time and non-real-time data in HDR. In Proceedings of 17th International Teletraffic Congress (Salvador da Bahia, Brazil). 793--804.

[18]

Stolyar, A. 2005. On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation. Oper. Res. 53, 12--25.

Digital Library

[19]

Tassiulas, L., and Ephremides, A. 1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37, 12 (Dec.), 1936--1948.

[20]

Tassiulas, L., and Sarkar, S. 2002. Maxmin fair scheduling in wireless networks. In Proceedings of the Annual Joint INFOCOM Conference of the IEEE Computer and Communications Societies (New York, Jun.).

[21]

Tse, D. Multiuser diversity in wireless networks. 2001. http://degas.eecs.berkeley.edu/~dtse/pub.html.

Cited By

Sinha ABhattacharjee R(2022)Optimizing Age-of-Information in Adversarial and Stochastic EnvironmentsIEEE Transactions on Information Theory10.1109/TIT.2022.318304568:10(6860-6880)Online publication date: Oct-2022
https://doi.org/10.1109/TIT.2022.3183045
Cholvi VGarncarek PJurdziński TKowalski D(2022)Stable routing scheduling algorithms in multi-hop wireless networksTheoretical Computer Science10.1016/j.tcs.2022.03.038921(20-35)Online publication date: Jun-2022
https://doi.org/10.1016/j.tcs.2022.03.038
Bhattacharjee RSinha A(2020)Competitive Algorithms for Minimizing the Maximum Age-of-InformationACM SIGMETRICS Performance Evaluation Review10.1145/3439602.343960648:2(6-8)Online publication date: 25-Nov-2020
https://dl.acm.org/doi/10.1145/3439602.3439606
Show More Cited By

Index Terms

Routing and scheduling in multihop wireless networks with time-varying channels
1. Networks
  1. Network services
  2. Network types
    1. Mobile networks
    2. Wireless access networks
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Routing and scheduling in multihop wireless networks with time-varying channels
SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

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 ...
Centralized power control and routing policies for multihop wireless networks

This paper investigates joint power control and routing policies for general multihop wireless networks when all the transmitting nodes are subject to a long-term average power constraint. The main contribution of this paper is to propose online power ...
Distributed Channel Assignment and Routing in Multiradio Multichannel Multihop Wireless Networks

In this paper, we first identify several challenges in designing a joint channel assignment and routing (JCAR) protocol in heterogeneous multiradio multichannel multihop wireless networks (M³WNs) using commercial hardware [e.g., IEEE 802.11 Network ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 3, Issue 3

August 2007

216 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1273340

Issue’s Table of Contents

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2007

Published in TALG Volume 3, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
500
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sinha ABhattacharjee R(2022)Optimizing Age-of-Information in Adversarial and Stochastic EnvironmentsIEEE Transactions on Information Theory10.1109/TIT.2022.318304568:10(6860-6880)Online publication date: Oct-2022
https://doi.org/10.1109/TIT.2022.3183045
Cholvi VGarncarek PJurdziński TKowalski D(2022)Stable routing scheduling algorithms in multi-hop wireless networksTheoretical Computer Science10.1016/j.tcs.2022.03.038921(20-35)Online publication date: Jun-2022
https://doi.org/10.1016/j.tcs.2022.03.038
Bhattacharjee RSinha A(2020)Competitive Algorithms for Minimizing the Maximum Age-of-InformationACM SIGMETRICS Performance Evaluation Review10.1145/3439602.343960648:2(6-8)Online publication date: 25-Nov-2020
https://dl.acm.org/doi/10.1145/3439602.3439606
Chlebus BCholvi VKowalski D(2020)Universal stability in multi-hop radio networksJournal of Computer and System Sciences10.1016/j.jcss.2020.05.009114(48-64)Online publication date: Dec-2020
https://doi.org/10.1016/j.jcss.2020.05.009
Cholvi VGarncarek PJurdziński TKowalski D(2020)Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless NetworksStructural Information and Communication Complexity10.1007/978-3-030-54921-3_10(165-182)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-54921-3_10
Anantharamu LChlebus BKowalski DRokicki M(2019)Packet latency of deterministic broadcasting in adversarial multiple access channelsJournal of Computer and System Sciences10.1016/j.jcss.2018.07.00199(27-52)Online publication date: Feb-2019
https://doi.org/10.1016/j.jcss.2018.07.001
Chlebus BCholvi VGarncarek PJurdzinski TKowalski D(2017)Routing in Wireless Networks With InterferencesIEEE Communications Letters10.1109/LCOMM.2017.271634821:9(2105-2108)Online publication date: Sep-2017
https://doi.org/10.1109/LCOMM.2017.2716348
Anantharamu LChlebus BRokicki M(2017)Adversarial Multiple Access Channels with Individual Injection RatesTheory of Computing Systems10.1007/s00224-016-9725-x61:3(820-850)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s00224-016-9725-x
Chlebus BCholvi VKowalski D(2015)Stability of adversarial routing with feedbackNetworks10.1002/net.2160766:2(88-97)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1002/net.21607
Chlebus BCholvi VKowalski DSaia JYoung M(2014)Universal routing in multi hop radio networkProceedings of the 10th ACM international workshop on Foundations of mobile computing10.1145/2634274.2634278(19-28)Online publication date: 11-Aug-2014
https://dl.acm.org/doi/10.1145/2634274.2634278
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents