The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Optimal Energy Aware Clustering in Sensor Networks
Open accessAbstract
Sensor networks is among the fastest growing technologies that have the potential of changing our lives drastically. These collaborative, dynamic and distributed computing and communicating systems will be self organizing. They will have capabilities of distributing a task among themselves for efficient computation. There are many challenges in implementation of such systems: energy dissipation and clustering being one of them. In order to maintain a certain degree of service quality and a reasonable system lifetime, energy needs to be optimized at every stage of system operation. Sensor node clustering is another very important optimization problem. Nodes that are clustered together will easily be able to communicate with each other. Considering energy as an optimization parameter while clustering is imperative. In this paper we study the theoretical aspects of the clustering problem in sensor networks with application to energy optimization. We illustrate an optimal algorithm for clustering the sensor nodes such that each cluster (which has a master) is balanced and the total distance between sensor nodes and master nodes is minimized. Balancing the clusters is needed for evenly distributing the load on all master nodes. Minimizing the total distance helps in reducing the communication overhead and hence the energy dissipation. This problem (which we call balanced k-clustering) is modeled as a mincost flow problem which can be solved optimally using existing techniques.
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
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Next century challenges: scalable coordination in sensor networks
Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313556 · Cited by 2,703
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
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
PicoRodio supports ad hoc ultra-low power wireless networking
Rabaey, J. M., Ammer, M. J., da Silva, J. L., Patel, D., & Roundy, S. (2000) · Computer · doi:10.1109/2.869369 · Cited by 1,010
Energy-efficient communication protocols for wireless microsensor networks
Heinzelman, W., Chandrakasan, A. P., & Balakrishnan, H. (2000) · Cited by 929
GORDIAN: VLSI placement by quadratic programming and slicing optimization
Kleinhans, J. M., Sigl, G., Johannes, F. M., et al. (1991) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.67789 · Cited by 534
Design considerations for distributed microsensor systems
Chandrakasan, A., Amirtharajah, R., Cho, S., Goodman, J., Konduri, G., Kulik, J., Rabiner, W., & Wang, A. (2003) · Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (Cat. No.99CH36327) · doi:10.1109/cicc.1999.777291 · Cited by 339
Clustering algorithms based on minimum and maximum spanning trees
Asano, T., Bhattacharya, B. K., Keil, M., et al. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73419 · Cited by 135
Capoyleas, V., Rote, G., & Woeginger, G. J. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90007-l · Cited by 98
Cited by
A survey on clustering algorithms for wireless sensor networks
Abbasi, A. A., & Younis, M. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.05.024 · Cited by 2,383
Data Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620
Metadata
- Authors
- Ghiasi, S., Srivastava, A., Yang, X., & Sarrafzadeh, M.
- Venue
- Sensors
- Publisher
- MDPI AG
- Published
- 2002-07-12
- Volume
- 2
- Issue
- 7
- Pages
- 258-269
- ISSN
- 1424-8220 (ISSN-L)
- OpenAlex
- W2130593958
- Cited by
- 339
- References
- 10
- FWCI
- 11.98
- Type
- journal article
- Language
- en
- Open access
- gold
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: Optimal Energy Aware Clustering in Sensor Networks. https://app.cochat.ai/papers/10.3390/s20700258
- The paper
- Ghiasi, S., Srivastava, A., Yang, X., & Sarrafzadeh, M. (2002). Optimal Energy Aware Clustering in Sensor Networks. Sensors. https://doi.org/10.3390/s20700258
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.
