The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Energy conserving routing in wireless ad-hoc networks
Abstract
An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed at different rates depending on the power level and the intended receiver. We propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves, instead of routing to minimize the absolute consumed power.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
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
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
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
Linear and Non Linear Programming
Nash, S. G. (1996) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 841
Linear and nonlinear programming
(2005) · Economists’ Mathematical Manual · doi:10.1007/3-540-28518-0_15 · Cited by 766
Cited by
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
Younis, O., & Fahmy, S. (2004) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2004.41 · Cited by 5,025
Geography-informed energy conservation for Ad Hoc routing
Xu, Y., Heidemann, J., & Estrin, D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381685 · Cited by 2,833
Survey of Important Issues in UAV Communication Networks
Gupta, L., Jain, R., & Vaszkun, G. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2495297 · Cited by 2,343
Energy-aware wireless microsensor networks
Raghunathan, V., Schurgers, C., Park, S., & Srivastava, M. B. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985679 · Cited by 1,706
Energy aware routing for low energy ad hoc sensor networks
Shah, R. C., & Rabaey, J. M. (2003) · 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609) · doi:10.1109/wcnc.2002.993520 · Cited by 1,458
Metadata
- Authors
- Chang, J.-H., & Tassiulas, L.
- Venue
- Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
- Publisher
- IEEE
- Published
- 2002-11-07
- Volume
- 1
- Pages
- 22-31
- OpenAlex
- W1787995280
- Cited by
- 1,669
- References
- 8
- FWCI
- 83.78
- 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.