EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Data aggregation algorithm for wireless sensor networks with different initial energy of nodes

Zhenpeng Liu, Jialiang Zhang, Yi Liu, Fan Feng, Yifan Liu

PeerJ Computer Science · 15.03.2024 · 10 · e1932

DOI: 10.7717/peerj-cs.1932 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 15.03.2024. Verfasst von Zhenpeng Liu und 4 weiteren Autor:innen. Beteiligte Einrichtung: School of Cyber Security and Computer, Hebei University, Baoding, Hebei, China. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of Hebei Province, China, Fund for Integration of Cloud Computing and Big Data, Innovation of Science and Education (FII) of Ministry of Education of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Data aggregation plays a critical role in sensor networks for efficient data collection. However, the assumption of uniform initial energy levels among sensors in existing algorithms is unrealistic in practical production applications. This discrepancy in initial energy levels significantly impacts data aggregation in sensor networks. To address this issue, we propose Data Aggregation with Different Initial Energy (DADIE), a novel algorithm that aims to enhance energy-saving, privacy-preserving efficiency, and reduce node death rates in sensor networks with varying initial energy nodes. DADIE considers the transmission distance between nodes and their initial energy levels when forming the network topology, while also limiting the number of child nodes. Furthermore, DADIE reconstructs the aggregation tree before each round of data transmission. This allows nodes closer to the receiving end with higher initial energy to undertake more data aggregation and transmission tasks while limiting energy consumption. As a result, DADIE effectively reduces the node death rate and improves the efficiency of data transmission throughout the network. To enhance network security, DADIE establishes secure transmission channels between transmission nodes prior to data transmission, and it employs slice-and-mix technology within the network. Our experimental simulations demonstrate that the proposed DADIE algorithm effectively resolves the data aggregation challenges in sensor networks with varying initial energy nodes. It achieves 5–20% lower communication overhead and energy consumption, 10–20% higher security, and 10–30% lower node mortality than existing algorithms.

Schlagwörter

Stichwörter der Autor:innen

Communication overheadData aggregationDifferent initial energyDynamically reconfigureEnergy consumptionNode death ratePrivacy-preservingSlice-and-mix technologyTree topologyWireless sensor networks

Autor:innen und Institutionen

  • School of Cyber Security and Computer, Hebei University, Baoding, Hebei, China.
  • Information Technology Center, Hebei University, Baoding, Hebei, China.

Förderung

  • National Natural Science Foundation of Hebei Province, China
  • Fund for Integration of Cloud Computing and Big Data, Innovation of Science and Education (FII) of Ministry of Education of China

Zitieren

APA

Liu, Z., Zhang, J., Liu, Y., Feng, F., & Liu, Y. (2024). Data aggregation algorithm for wireless sensor networks with different initial energy of nodes. PeerJ Computer Science, 10, e1932. https://doi.org/10.7717/peerj-cs.1932

Vancouver

Liu Z, Zhang J, Liu Y, Feng F, Liu Y. Data aggregation algorithm for wireless sensor networks with different initial energy of nodes. PeerJ Computer Science. 2024;10:e1932. doi:10.7717/peerj-cs.1932

BibTeX
@article{Liu2024,
  author = {Liu, Zhenpeng and Zhang, Jialiang and Liu, Yi and Feng, Fan and Liu, Yifan},
  title = {Data aggregation algorithm for wireless sensor networks with different initial energy of nodes},
  journal = {PeerJ Computer Science},
  year = {2024},
  volume = {10},
  pages = {e1932},
  doi = {10.7717/peerj-cs.1932}
}
Kostenlos starten →