The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Distributed algorithms for maximum lifetime routing in wireless sensor networks
Abstract
A sensor network of nodes with wireless transceiver capabilities and limited energy is considered. We propose distributed algorithms to compute an optimal routing scheme that maximizes the time at which the first node in the network drains out of energy. The problem is formulated as a linear programming problem and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms have low computational complexity and are guaranteed to converge to an optimal routing scheme that maximizes the network lifetime. The algorithms are illustrated by an example in which an optimal flow is computed for a network of randomly distributed nodes. We also show how our approach can be used to obtain distributed algorithms for many different extensions to the problem. Finally, we extend our problem formulation to more general definitions of network lifetime to model realistic scenarios in sensor networks
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Minimum energy mobile wireless networks
Rodoplu, V., & Meng, T. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.779917 · Cited by 1,685
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
Minimization Methods for Non-Differentiable Functions
Shor, N. Z. (1985) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-82118-9 · Cited by 1,551
Simultaneous Routing and Resource Allocation Via Dual Decomposition
Xiao, L., Johansson, M., & Boyd, S. P. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.831346 · Cited by 561
Cited by
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks
Yetgin, H., Cheung, K. T. K., El-Hajjar, M., & Hanzo, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2650979 · Cited by 627
Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
Chang, T.-H., Nedic, A., & Scaglione, A. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2308612 · Cited by 401
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
Self-citation
Metadata
- Authors
- Madan, R., & Lall, S.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2006-08
- Volume
- 5
- Issue
- 8
- Pages
- 2185-2193
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2061560193
- Cited by
- 357
- References
- 10
- FWCI
- 26.92
- 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.