An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
As an important part of industrial application (IA), the wireless sensor network (WSN) has been an active research area over the past few years. Due to the limited energy and communication ability of sensor nodes, it seems especially important to design a routing protocol for WSNs so that sensing data can be transmitted to the receiver effectively. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) is proposed in this paper. In FAF-EBRM, the next-hop node is selected according to the awareness of link weight and forward energy density. Furthermore, a spontaneous reconstruction mechanism for local topology is designed additionally. In the experiments, FAF-EBRM is compared with LEACH and EEUC, experimental results show that FAF-EBRM outperforms LEACH and EEUC, which balances the energy consumption, prolongs the function lifetime and guarantees high QoS of WSN.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060 · cited 1×
“In [18], the small-world property of complex network is found by Watts and Strogatz, who establish the WS small-world network model.”
MethodEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
An application-specific protocol architecture for wireless microsensor networks
Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2002.804190 · Cited by 10,565
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Scale-Free Networks: A Decade and Beyond
Barabási, A.-L. (2009) · Science · doi:10.1126/science.1173299 · Cited by 2,109
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
A local-world evolving network model
Li, X., & Chen, G. (2003) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(03)00604-6 · Cited by 399
Modeling the evolution of weighted networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2004) · Physical Review E · doi:10.1103/physreve.70.066149 · Cited by 300
A new approach and system for attentive mobile learning based on seamless migration
Zhang, D. (2010) · Applied Intelligence · doi:10.1007/s10489-010-0245-0 · Cited by 150
Self-citationZhang, D., & Zhang, X. (2011) · Enterprise Information Systems · doi:10.1080/17517575.2011.626872 · Cited by 149
Self-citationKolchin, V. F. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721342.003 · Cited by 146
Martins, F. V. C., Carrano, E. G., Wanner, E. F., Takahashi, R. H. C., & Mateus, G. R. (2011) · IEEE Sensors Journal · doi:10.1109/jsen.2010.2048897 · Cited by 95
A novel image de-noising method based on spherical coordinates system
Zhang, D., Kang, X., & Wang, J. (2012) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/1687-6180-2012-110 · Cited by 81
Self-citationEvolutionary design of wireless sensor networks based on complex networks
Ruela, A. S., Cabral, R. S., Aquino, A. L. L., & Guimarães, F. G. (2009) · International Conference on Intelligent Sensors, Sensor Networks and Information Processing · doi:10.1109/issnip.2009.5416785 · Cited by 17
Cited by
New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks
Zhang, D., Ge, H., Zhang, T., Cui, Y.-Y., Liu, X., & Mao, G. (2019) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2018.2853165 · Cited by 395
Self-citationSecure Surveillance Framework for IoT Systems Using Probabilistic Image Encryption
Muhammad, K., Hamza, R., Ahmad, J., Lloret, J., Wang, H., & Baik, S. W. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2791944 · Cited by 299
Metadata
- Authors
- Zhang, D., Li, G., Zheng, K., Ming, X., & Pan, Z.-H.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2014-02
- Volume
- 10
- Issue
- 1
- Pages
- 766-773
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2090849497
- Cited by
- 520
- References
- 15
- FWCI
- 58.94
- 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.