The DOI matches its Crossref record.
A generic model for optimizing single-hop transmission policy of replenishable sensors
Abstract
Energy harvesting from the working environment has received increasing attention in the research of wireless sensor networks. Recent developments in this area can be used to replenish the power supply of sensors. However, power management is still a crucial issue for such networks due to the uncertainty of stochastic replenishment. In this paper, we propose a generic mathematical framework to characterize the policy for single hop transmission over a replenishable sensor network. Firstly, we introduce a Markov chain model to describe different modes of energy renewal. Then, we derive the optimal transmission policy for sensors with different energy budgets. Depending on the energy status of a sensor and the reward for successfully transmitting a message, we prove the existence of optimal thresholds that maximize the average reward rate. Our results are quite general since the reward values can be made application-specific for different design objectives. Compared with the unconditional transmit-all policy, which transmits every message as long as the energy storage is positive, the proposed optimal transmission policy is shown to achieve significant gains in the average reward rate.
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
Cited by
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Ozel, O., Tutuncuoglu, K., Yang, J., Ulukus, S., & Yener, A. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.110921 · Cited by 1,086
Energy Harvesting Wireless Communications: A Review of Recent Advances
Ulukus, S., Yener, A., Erkip, E., Simeone, O., Zorzi, M., Grover, P., & Huang, K. (2015) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2391531 · Cited by 805
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
Advances in Energy Harvesting Communications: Past, Present, and Future Challenges
Ku, M.-L., Li, W., Chen, Y., & Ray Liu, K. J. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2497324 · Cited by 606
Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks
Medepally, B., & Mehta, N. B. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.091510.100447 · Cited by 335
Designing intelligent energy harvesting communication systems
Gunduz, D., Stamatiou, K., Michelusi, N., & Zorzi, M. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6710085 · Cited by 302
A Learning Theoretic Approach to Energy Harvesting Communication System Optimization
Blasco, P., Gunduz, D., & Dohler, M. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.030413.121120 · Cited by 276
Energy Cooperation in Energy Harvesting Communications
Gurakan, B., Ozel, O., Yang, J., & Ulukus, S. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.110113.130184 · Cited by 275
Achieving AWGN Capacity Under Stochastic Energy Harvesting
Ozel, O., & Ulukus, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2204389 · Cited by 258
Metadata
- Authors
- Lei, J., Yates, R., & Greenstein, L.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2009-02
- Volume
- 8
- Issue
- 2
- Pages
- 547-551
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2152144019
- Cited by
- 244
- References
- 0
- FWCI
- 10.56
- 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.