The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Optimal routing, link scheduling and power control in multihop wireless networks
Abstract
In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multihop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in the wireless multihop network, subject to given constraints regarding the minimum average data rate per link, as well as peak transmission power constraints per node. Multiaccess signal interference is explicitly modeled. We use a duality approach whereby, as a byproduct of finding the optimal policy, we find the sensitivity of the minimal total average power with respect to the average data rate for each link. Since the minimal total average power is a convex function of the required minimum average data rates, shortest path algorithms with the link weights set to the link sensitivities can be used to guide the search for a globally optimum routing. We present a few simple examples that show our algorithm can find policies that support data rates that are not possible with conventional approaches. Moreover, we find that optimum allocations do not necessarily route traffic over minimum energy paths.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
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
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
A simple distributed autonomous power control algorithm and its convergence
Foschini, G. J., & Miljanic, Z. (1993) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.260747 · Cited by 1,723
(2000) · Electric Power System Applications of Optimization · doi:10.1201/9781420056266-13 · Cited by 908
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
Layering 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
A tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
Dynamic power allocation and routing for time-varying wireless networks
Neely, M. J., Modiano, E., & Rohrs, C. E. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837349 · Cited by 596
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
A survey of multimedia streaming in wireless sensor networks
Misra, S., Reisslein, M., & Xue, G. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080404 · Cited by 392
Power Control in Wireless Cellular Networks
Chiang, M., Hande, P., Lan, T., & Tan, C. W. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981370 · Cited by 361
A Unified Framework for Max-Min and Min-Max Fairness With Applications
Radunovic, B., & Le Boudec, J.-Y. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.896231 · Cited by 345
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · doi:10.1109/tent.2006.872546 · Cited by 306
The impact of imperfect scheduling on cross-Layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.872546 · Cited by 268
Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks
Madan, R., Cui, S., Lall, S., & Goldsmith, A. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.04770 · Cited by 253
Lin, Z., & van der Schaar, M. (2011) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.111910.091238 · Cited by 68
Metadata
- Authors
- Cruz, R. L., & Santhanam, A. V.
- Venue
- IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
- Publisher
- IEEE
- Published
- 2004-03-22
- Volume
- 1
- Pages
- 702-711
- OpenAlex
- W2125859743
- Cited by
- 610
- References
- 5
- FWCI
- 91.11
- Type
- conference paper
- 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.