2017
DOI: 10.1111/coin.12132
|View full text |Cite
|
Sign up to set email alerts
|

Optimal data aggregation tree in wireless sensor networks based on improved river formation dynamics

Abstract: The restricted energy of nodes is one of the most important challenges in wireless sensor networks. Since data transmissions among nodes consume most of the nodes' energy, thus, minimizing the unnecessary transmissions reduces the consumed energy. One of the sources of this problem is the redundancy of raw data that can be eliminated at the aggregation points. As a result, data aggregation can be considered as an effective strategy to tackle the mentioned issue and to optimize the communication energy consumpt… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 25 publications
0
13
0
Order By: Relevance
“…There are some works that take the benefits of both clusterbased and the tree-based techniques such as [10], [16], [17] and [18]. According to the particularity of the data in Internet of things, In [10], the author proposed a data fusion clustertree construction algorithm based on event-driven (DFCTA) and the data fusion architecture of fusion tree composed of fusion nodes.…”
Section: B Tree Structure-based Data Fusion Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…There are some works that take the benefits of both clusterbased and the tree-based techniques such as [10], [16], [17] and [18]. According to the particularity of the data in Internet of things, In [10], the author proposed a data fusion clustertree construction algorithm based on event-driven (DFCTA) and the data fusion architecture of fusion tree composed of fusion nodes.…”
Section: B Tree Structure-based Data Fusion Algorithmmentioning
confidence: 99%
“…In [17], the author proposed a new Cluster-Tree routing scheme for gathering data (CTRS-DG), the proposed scheme outperforms existing baseline algorithms in terms of stability period and network lifetime. In [18], the sensor nodes are organized in a tree structure, and the data aggregation are done in intermediate nodes at the junction of tree branches. One of the main characteristics of tree protocols is reduction of energy consumption through optimizing the structure of a data aggregation tree.…”
Section: B Tree Structure-based Data Fusion Algorithmmentioning
confidence: 99%
“…Another approach based on the RFD metaheuristic is presented in Mehrjoo and Khunjush. 14 The algorithm Figure 1. General scenario where the sensor nodes are connected to the sink which computes the routing tree and serves as a gateway to the application.…”
Section: Related Workmentioning
confidence: 99%
“…Another approach based on the RFD metaheuristic is presented in Mehrjoo and Khunjush. 14 The algorithm starts by broadcasting messages that let the nodes know its distance in hops to the sink. The authors consider the remaining battery in the algorithm design, so each time a packet is processed, nodes with more energy available have a higher probability of routing packets.…”
Section: Related Workmentioning
confidence: 99%
“…We have considered multiple‐source, single‐sink (MSSS) systems with data aggregation techniques for our analysis [15]. Research on developing an optimal data aggregation tree based on intelligent water drops (IWD) algorithm [16] and swarm intelligent algorithm [17] has been carried out. However, we focus on implementing simple data aggregation strategies like min–max and averaging to reduce computational overheads.…”
Section: Introductionmentioning
confidence: 99%