Event-triggered distributed optimization in sensor networks
The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Many problems in sensor networks can be formulated as optimization problems. Existing distributed optimization algorithms typically rely on choosing a step size to ensure convergence. In this case, the communication between sensor nodes occurs each time the computations are carried out. Since in sensor networks, the energy required for communication can be significantly greater than the energy required to perform computation, it would be beneficial if we can somehow separate communication and computation. This paper presents such a distributed algorithm called the event-triggered algorithm. Under event triggering, each agent broadcasts to its neighbors when a local “error” signal exceeds a state dependent threshold. We give a general class of problems in sensor networks where the event-triggered algorithm can be used. In particular, this paper uses the data gathering problem as an example. We propose an event-triggered distributed algorithm and prove its convergence. Simulation results show that the proposed algorithm reduces the number of message exchanges by two orders of magnitude compared to commonly used dual decomposition algorithms. It also enjoys better scalability with respect to the depth of the tree and the maximum branch number of the tree.
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
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901
Cited by
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
Event-triggered communication and control of networked systems for multi-agent consensus
Nowzari, C., Garcia, E., & Cortés, J. (2019) · Automatica · doi:10.1016/j.automatica.2019.03.009 · Cited by 655
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Metadata
- Authors
- Wan, P., & Lemmon, M. D.
- Venue
- Information Processing in Sensor Networks
- Published
- 2009-04-13
- Pages
- 49-60
- DOI
- 10.5555/1602165.1602172
- OpenAlex
- W2149519261
- Cited by
- 101
- References
- 1
- FWCI
- 7.40
- 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.