The DOI matches its Crossref record.
On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control
Abstract
With increasing interest in energy constrained multi-hop wireless networks (Bambos, N. et al., 1991), a fundamental problem is one of determining energy efficient communication strategies over these multi-hop networks. The simplest problem is one where a given source node wants to communicate with a given destination, with a given rate over a multi-hop wireless network, using minimum power. Here the power refers to the total amount of power consumed over the entire network in order to achieve this rate between the source and the destination. There are three decisions that have to be made (jointly) in order to minimize the power requirement. (1) The path(s) that the data has to take between the source and the destination. (Routing). (2) The power with each link transmission is done. (Power Control). (3) Depending on the interference or the MAC characteristics, the time slots in which specific link transmissions have to take place. (Scheduling). (4) To the best of our knowledge, ours is the first attempt to derive a performance guaranteed polynomial time approximation algorithm for jointly solving these three problems. We formulate the overall problem as an optimization problem with non-linear objective function and non-linear constraints. We then derive a polynomial time 3-approximation algorithm to solve this problem. We also present a simple version of the algorithm, with the same performance bound, which involves solving only shortest path problems and which is quite efficient in practice. Our approach readily extends to the case where there are multiple source-destination pairs that have to communicate simultaneously over the multi-hop network.
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
Cited by
Wireless mesh networks: a survey
Akyildiz, I. F., Wang, X., & Wang, W. (2005) · Computer Networks · doi:10.1016/j.comnet.2004.12.001 · Cited by 4,007
Alicherry, M., Bhatia, R., & Li, L. E. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.881641 · Cited by 384
Self-citationCross-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
Hughes, L., Wang, X., & Chen, T. (2012) · Sensors · doi:10.3390/s121114730 · Cited by 71
Metadata
- Authors
- Bhatia, R., & Kodialam, M.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2005-02-22
- Volume
- 2
- Pages
- 1457-1466
- OpenAlex
- W2115651379
- Cited by
- 165
- References
- 0
- FWCI
- 14.24
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control. https://app.cochat.ai/papers/10.1109/infcom.2004.1357030
- The paper
- Bhatia, R., & Kodialam, M. (2005). On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control. IEEE INFOCOM 2004. https://doi.org/10.1109/infcom.2004.1357030
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.