The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Dynamic power allocation and routing for time-varying wireless networks
Abstract
We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (/spl lambda//sub ij/) that the system can stably support-where /spl lambda//sub ij/ represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed that stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad hoc wireless network, where channel variations are due to user mobility. Centralized and decentralized implementations are compared, and the stability region of the decentralized algorithm is shown to contain that of the mobile relay strategy developed by Grossglauser and Tse (2002).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Mangasarian, O. L. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971255 · Cited by 3,220
Mobility increases the capacity of ad hoc wireless networks
Grossglauser, M., & Tse, D. N. C. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801403 · Cited by 2,839
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Markov Chains and Stochastic Stability
Meyn, S., Tweedie, R. L., & Glynn, P. W. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626630 · Cited by 1,680
Applied Probability and Queues
Asmussen, S. (2003) · Springer eBooks · doi:10.1007/b97236 · Cited by 1,283
Providing quality of service over a shared wireless link
Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P., & Vijayakumar, R. (2001) · IEEE Communications Magazine · doi:10.1109/35.900644 · Cited by 1,197
Critical Power for Asymptotic Connectivity in Wireless Networks
Gupta, P., & Kumar, P. R. (1999) · Stochastic Analysis, Control, Optimization and Applications · doi:10.1007/978-1-4612-1784-8_33 · Cited by 1,137
A Minimum Delay Routing Algorithm Using Distributed Computation
Gallager, R. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093711 · Cited by 651
Optimal routing, link scheduling and power control in multihop wireless networks
Cruz, R. L., & Santhanam, A. V. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208720 · Cited by 610
Joint scheduling and power control for wireless ad hoc networks
ElBatt, T., & Ephremides, A. (2004) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2003.819032 · Cited by 569
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
Li, L., & Goldsmith, A. J. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915665 · Cited by 518
Energy-efficient packet transmission over a wireless link
Uysal-Biyikoglu, E., Prabhakar, B., & El Gamal, A. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801419 · Cited by 496
Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.2307/3010473 · Cited by 401
Stability of queueing networks and scheduling policies
Kumar, P. R., & Meyn, S. (1995) · IEEE Transactions on Automatic Control · doi:10.1109/9.341782 · Cited by 280
Dynamic power allocation and routing for time varying wireless networks
Neely, M. J., Modiano, E., & Rohrs, C. E. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208724 · Cited by 247
Self-citationJulian, D., Chiang, M., O'Neill, D., & Boyd, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019292 · Cited by 220
Fast Approximation Algorithms for Multicommodity Flow Problems
Leighton, T., Makedon, F. S., Plotkin, S. A., Stein, C., Eva Tardos, D., & Tragoudas, S. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1020 · Cited by 125
Priority service and max-min fairness
Marbach, P. (2003) · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · doi:10.1109/infcom.2002.1019268 · Cited by 84
Dynamic global packet routing in wireless networks
Kahalé, N., & Wright, P. E. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1997.631182 · Cited by 76
Cited by
Stochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
Self-citationLayering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Multi-Agent Deep Reinforcement Learning for Dynamic Power Allocation in Wireless Networks
Nasir, Y. S., & Guo, D. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2933973 · Cited by 660
Di Taranto, R., Muppirisetty, S., Raulefs, R., Slock, D., Svensson, T., & Wymeersch, H. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2332611 · Cited by 442
Fairness and Optimal Stochastic Control for Heterogeneous Networks
Neely, M. J., Modiano, E., & Li, C.-P. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.900405 · Cited by 433
Self-citation
Metadata
- Authors
- Neely, M. J., Modiano, E., & Rohrs, C. E.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2005-01
- Volume
- 23
- Issue
- 1
- Pages
- 89-103
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W4253990512
- Cited by
- 596
- References
- 22
- FWCI
- 21.29
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.