The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Energy-efficient packet transmission over a wireless link
Abstract
The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and code rate and therefore transmitting the packet over a longer period of time. However, information is often time-critical or delay-sensitive and transmission times cannot be made arbitrarily long. We therefore consider packet transmission schedules that minimize energy subject to a deadline or a delay constraint. Specifically, we obtain an optimal offline schedule for a node operating under a deadline constraint. An inspection of the form of this schedule naturally leads us to an online schedule which is shown, through simulations, to perform closely to the optimal offline schedule. Taking the deadline to infinity, we provide an exact probabilistic analysis of our offline scheduling algorithm. The results of this analysis enable us to devise a lazy online algorithm that varies transmission times according to backlog. We show that this lazy schedule is significantly more energy-efficient compared to a deterministic (fixed transmission time) schedule that guarantees queue stability for the same range of arrival rates.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Doob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
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
PROBABILITY: THEORY AND EXAMPLES
Rogers, L. C. G. (1992) · Bulletin of the London Mathematical Society · doi:10.1112/blms/24.2.205 · Cited by 1,435
Communication Systems Engineering
Proakis, J. G., & Salehi, M. (1994) · Virtual Defense Library (Ministerio de Defensa) · Cited by 899
Gallager, R. G. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600329 · Cited by 691
Discrete Parameter Martingales
(2006) · Springer eBooks · doi:10.1007/978-0-387-35434-7_14 · Cited by 682
Gallager, R. G. (1996) · doi:10.1007/978-1-4615-2329-1 · Cited by 494
Viswanath, P., Anantharam, V., & Tse, D. N. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782119 · Cited by 420
Energy-efficient transmission over a wireless link via lazy packet scheduling
Prabhakar, B., Uysal-Biyikoglu, E., & Gamal, A. E. (2001) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916721 · Cited by 380
Self-citationGrandhi, S. A., Zander, J., & Yates, R. (1994) · Wireless Personal Communications · doi:10.1007/bf01098870 · Cited by 344
Pottie, G. J. (2002) · 1998 Information Theory Workshop (Cat. No.98EX131) · doi:10.1109/itw.1998.706478 · Cited by 234
Minimum energy cost of an observation
Adler, F. (1955) · IRE Transactions on Information Theory · doi:10.1109/tit.1955.1055139 · Cited by 12
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
Fundamental trade-offs on green wireless networks
Chen, Y., Zhang, S., Xu, S., & Li, G. Y. (2011) · IEEE Communications Magazine · doi:10.1109/mcom.2011.5783982 · Cited by 1,134
Energy-Optimal Mobile Cloud Computing under Stochastic Wireless Channel
Zhang, W., Wen, Y., Guan, K., Kilper, D., Luo, H., & Wu, D. O. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.072513.121842 · Cited by 863
Optimal Packet Scheduling in an Energy Harvesting Communication System
Yang, J., & Ulukus, S. (2012) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.112811.100349 · Cited by 829
Optimum Transmission Policies for Battery Limited Energy Harvesting Nodes
Tutuncuoglu, K., & Yener, A. (2012) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.012412.110805 · Cited by 749
Metadata
- Authors
- Uysal-Biyikoglu, E., Prabhakar, B., & El Gamal, A.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2002-08
- Volume
- 10
- Issue
- 4
- Pages
- 487-499
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2155670180
- Cited by
- 496
- References
- 14
- FWCI
- 17.88
- 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.