2017
DOI: 10.1007/s11227-017-2072-0
|View full text |Cite
|
Sign up to set email alerts
|

Scalable structure-free data fusion on wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…Koupaee Mahnaz introduces a distributed dynamic fusion algorithm. At the end of the waiting time, the method node performs data fusion and sends the fusion data to the best neighbor selected by the proposed optimal neighbor algorithm [12].…”
Section: Related Workmentioning
confidence: 99%
“…Koupaee Mahnaz introduces a distributed dynamic fusion algorithm. At the end of the waiting time, the method node performs data fusion and sends the fusion data to the best neighbor selected by the proposed optimal neighbor algorithm [12].…”
Section: Related Workmentioning
confidence: 99%
“…The heart rate value is compared with the target heart rate to determine whether the user is doing aerobic exercise, and the voice module is used to remind the user. Using inertial sensors to collect gait information, after preprocessing and algorithm analysis, the user's movement steps are finally displayed in real time [21]. The influencing factors of energy expenditure are mostly related to the biological factors of the individual.…”
Section: Overall Design Planmentioning
confidence: 99%
“…Data from different types and different applications are considered in this method. [30] Assigns waiting time to the node rather than packets. This makes all nodes, even those which are not in the event area, have the possibility to fuse data rather than just forwarding separate packets.…”
Section: Spatial Convergencementioning
confidence: 99%
“…In order to perform fusion, packets containing data need to be met at the same type at the same place. [18] with the same data type MAC layer DASD Homogenous sensors Potential field theory --R [28] with the same data type RAG -Heterogeneous sensors Data aware any cast at Packet Judiciously waiting time [19] with different data type MAC layer Policy ADA Heterogeneous sensors Potential field theory Packet Packet-Driven Adaptive [29] with the same data type Timing Scheme BN+WT Heterogeneous sensors Graph summarization Node Waiting time according to [30] with different data type using sensors attributes the distance to the sink and furthest point of the network…”
Section: Spatial Convergencementioning
confidence: 99%