Data Fusion Methods

Neural Network Probabilistic model Time series Kalman filtering

Other methods:
A-distributed database query methods B-mobile agent based data fusion C-processing according to message
5/29/12 categories 11

Neural Network
neural-networks use unsupervised learning

methods for categorization of the sensory inputs

No need for uncertainties or model of sensors Combine NN and discrete waveform transform

(initial data-processing)to extract features sensors

data robustness against malfunctioning Combine GROUP and Neural network

5/29/12 22

5/29/12

33

5/29/12

44

Probabilistic model
predicts the monitored data by maintaining a

pair of probabilistic models over the network attributes, one distributed in network and another at base station. sensed data is within the required error bound, the node does not need to report the sensed data, the base station uses the predicted data as sensed data.

When the gap between predicted data and

the better the user can tolerate the error, the

5/29/12

more energy can be saved.

55

Probabilistic model
where users need not only the result of the

object, but also all the information about every node.

Where need to get the information as much

as possible without too much network cost

data is correlative in temporal or space data within the tolerance value will not be

transmitted, So the accuracy is lowest tolerance value.

energy saving depend on the model and

5/29/12 66

5/29/12

77

Time series model

Good scalability Algorithm divided into three phases: history

data gathering, data predicating and data checking predicative algorithm can realize more accurate predication. simpler and more suitable for WSNs.

Time series models like autoregressive

little data needs to be transmitted no matter

how high frequency the sample rate is,(save 5/29/12 88 energy. )

Kalman Filtering
Predict state of dynamic system( position ,velocity )

in noisy environment.
reduce the affect of white Gauss noise, so the data

is more accurate, while the others are of lower accuracy

reduce the impact of abnormal data (environment

interference or the problem of the sensor node), so as to get more accurate information.
Transmits fused data instead of the raw data (save

energy).

5/29/12

99

5/29/12

1010

Distributed Kalman Filtering

local communication

Decomposes KF into n collaborative micro-KFs with

Distributed algorithm for Kalman filtering

Applicable in large-scale sensor networks with

limited capabilities (e.g. local communication, routing)

Excellent robustness properties regarding

various network imperfections, including delay, link loss, network fragmentation, and asynchronous operation
1111

Assumes identical sensing models across WSN

5/29/12

Comparision

5/29/12

1212

Other methods: A. Distributed database query network which the user queries information
according to requirement
Consider the WSNs as a distributed database,

each node stores very little data of database,

query result returns to the user in the form of

multi-hop: such as TAG & TINA

5/29/12

1313

TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks

TAG adopts a query grammar similar to SQL;

COUNT, MIN, MAX, SUM, and AVERAGE.

Flooding: sink broadcasts the request

message, If the message is received not for the first time, it will be dropped, otherwise the node sending this message will be taken as its parent until the requested message reaches every node in the network, meanwhile an aggregation tree is formed. In the result returning phase, data is fused during the 1414 5/29/12

5/29/12

1515

TiNA: A Scheme for Temporal Coherency-Aware in-Network Aggregation

if the query rate is very high or very dense

communication, the network will not be able to provide exact answers at the specified rate. reduce the amount of information transmitted and to improve quality of data when not all sensor readings can be transmitted (reduce power consumption by up to 50% without any loss in the quality of data.)

Data will not be reported if the gap between

the data and the one just report is within the tolerance value.(exploiting end-user tolerance 5/29/12 1616 to temporal coherency)

transmitting a single bit of data is equivalent

to 800 instructions.
a AA battery pack will allow a sensor to send

5.52 million messages which is equivalent to one message per second every day for about 5/29/12 months 1717 two

B. Mobile Agent Based Data Fusion

sensed data is stored in local node. mobile agent migrates among the nodes

according to the requirement, and gets the data of the nodes one by one. Then the agent fuses the data with previous results. consumption and latency.

Less demand for bandwidth, lower energy If combined with mobile agent routing

strategy, it could reduce congestion effectively.

5/29/12

1818

C. Processing According to Message Categories

non-emergency one
For emergency one, the nodes forward it

classify the message into emergency one and

immediately to meet the requirement of realtime system.

in the abnormal detection network to be

reported in time.

5/29/12

1919

D. Data Compression
for the applications requiring all the raw data node compresses the data before

transmitting, and the sink node decompresses the data after receiving it. (some energy consumption, but better than sending raw data) encode based data compression algorithm, relevance based compression algorithm, etc. nodes value is expressed by other

data compression techniques , such as sorting

sorting encode based data compression:

5/29/12 some

2020

Data Compression
Using joint entropy and bit-hop metric to

quantify the size of compressed data and total cost of joint routing with compression respectively.

Three schemes: DSC, RDC and CDR.

5/29/12

2121

Distributed Source Coding (DSC): If the sensor

nodes have perfect knowledge about their correlations, they can encode/compress data so as to avoid transmitting redundant information. In this case, each source can send its data to the sink along the shortest path possible without the need for 5/29/12 2222 intermediate aggregation.

Routing Driven Compression (RDC): In this

scheme, the sensor nodes do not have any knowledge about their correlations and send data along the shortest paths to the sink while allowing for opportunistic aggregation wherever the paths overlap. 5/29/12 2323

Compression Driven Routing (CDR): As in

RDC, nodes have no knowledge of the correlations but the data is aggregated close to the sources and initially routed so as to 5/29/12 for maximum possible aggregation at2424 allow

DSC(Distributed Source Coding ) performs the

ideal bit-hop metric based on having known the correlations, and its bit-hop metric is the lower bound for any possible routing scheme with lossless compression. (little data can be compressed) while CDR outperforms RDC for high correlation.

RDC outperforms CDR for low correlation

Neither RDC nor CDR performs well for

intermediate correlation. In this case, a hybrid scheme can be adopted. 5/29/12 2525

Conclusion and future study

In-network data processing is a unique

characteristic that differentiates wireless sensor networks from conventional data forwarding networks. fusion in wireless sensor networks into three categories: routing-driven, coding-driven, and fusion-driven

Classify routing schemes supporting data

Chal1:obtaining data correlation, which

serves as the foundation for coding-driven and fusion-driven approaches, is still a 5/29/12

2626

future study
while the fusion process curtails data

redundancy, it also decreases the reliability of routing schemes. In lossy and uncertain wireless environments, a certain degree of redundancy must be preserved in order to achieve the desired fault tolerance and reliability. Embedding this consideration in the routing design is desirable.

in-network fusion will inevitably introduce

delay in routing schemes, due to either the processing itself or the waiting time for side 5/29/12 2727 information. (need to provide mechanisms for