The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Maximum lifetime routing in wireless ad-hoc networks
Abstract
Routing problems in mobile ad-hoc networks (MANET) have been receiving increasing attention in the last few years. Most of the proposed routing protocols concentrate on finding and maintaining routes in the face of changing topology caused by mobility or other environmental changes. More recently, power-aware routing protocols and topology control algorithms have been developed to address the issue of limited energy reserve of the nodes in ad-hoc networks. We consider the routing problem in MANET with the goal of maximizing the life time of the network. We propose a distributed routing algorithm that reaches the optimal (centralized) solution to within an asymptotically small relative error. Our approach is based on the formulation of multicommodity flow, and it allows to consider different power consumption models and bandwidth constraints. It works for both static and slowly changing dynamic networks.
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
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
A highly adaptive distributed routing algorithm for mobile wireless networks
Park, V. D., & Corson, M. S. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.631180 · Cited by 2,234
Energy conserving routing in wireless ad-hoc networks
Chang, J.-H., & Tassiulas, L. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832170 · Cited by 1,669
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (2001) · Wireless Networks · doi:10.1023/a:1012319418150 · Cited by 1,199
A new routing protocol for the reconfigurable wireless networks
Haas, Z. J. (2002) · IEEE International Conference on Universal Personal Communications (ICUPC) · doi:10.1109/icupc.1997.627227 · Cited by 695
Routing with guaranteed delivery in ad hoc wireless networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (1999) · Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications · doi:10.1145/313239.313282 · Cited by 668
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
Garg, N., & Könemann, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743463 · Cited by 561
A simple local-control approximation algorithm for multicommodity flow
Awerbuch, B., & Leighton, T. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366841 · Cited by 141
Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks
Chang, J.-H., & Tassiulas, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45551-5_59 · Cited by 75
Cited by
Joint mobility and routing for lifetime elongation in wireless sensor networks
Luo, J., & Hubaux, J.-P. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498454 · Cited by 880
Hu, T., & Fei, Y. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.28 · Cited by 405
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
Metadata
- Authors
- Sankar, A., & Liu, Z.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2005-02-22
- Volume
- 2
- Pages
- 1089-1097
- OpenAlex
- W2142372059
- Cited by
- 273
- References
- 11
- FWCI
- 25.02
- 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: Maximum lifetime routing in wireless ad-hoc networks. https://app.cochat.ai/papers/10.1109/infcom.2004.1356995
- The paper
- Sankar, A., & Liu, Z. (2005). Maximum lifetime routing in wireless ad-hoc networks. IEEE INFOCOM 2004. https://doi.org/10.1109/infcom.2004.1356995
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.