Dynamic Counting Sketch for Wireless Sensor Data Aggregation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current wireless sensing systems face issues with data aggregation reliability and accuracy due to double counting problems in multi-path data aggregation computation, leading to incorrect results.

Innovation Solution

The implementation of a dynamic counting sketch data structure with variable length, where sensor nodes process and aggregate data into dynamic counting sketch data structures, allowing for in-network aggregation and estimation of source data, thereby avoiding double counting and ensuring accurate data aggregation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If multi-path data aggregation computation is applied to enhance reliability, then the reliability is improved, but the same data may be calculated repeatedly causing double counting problem and incorrect aggregation results

Engineering Contradiction:
Improvedata aggregation reliabilityVSAvoiddata aggregation accuracy
Core Design Contradiction:
ReliabilityVSMeasurement precision

Solution Approach 1:

The patent segments the data aggregation process by introducing unique identifiers for data items and tracking their propagation paths through the network. Each data item is divided into identifiable units that can be traced individually, allowing the system to recognize and eliminate duplicate calculations while maintaining multi-path transmission for reliability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an intermediary mechanism in the form of a data aggregation function that uses unique identifiers and path tracking. This intermediary layer sits between the multi-path transmission and the final aggregation, mediating the process to prevent double counting while allowing multiple transmission paths to operate for enhanced reliability.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If data is broadcast to all upper layer nodes in multi-path aggregation, then fault-tolerance ability is enhanced, but network traffic and computation overhead increase

Engineering Contradiction:
Improvefault-tolerance abilityVSAvoidnetwork traffic and computation overhead
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent applies preliminary action by equipping data items with unique identifiers before broadcast. This pre-marking allows receiving nodes to quickly identify and track data items they have already processed, enabling them to filter out duplicates without full recomputation. This reduces the energy overhead associated with processing broadcasted data while maintaining the fault-tolerance benefits of multi-path transmission.

Inventive Principle:
Principle #10Preliminary action

3Device complexity

If traditional tree-based data aggregation is used, then computation is simpler, but the system lacks fault-tolerance and reliability

Engineering Contradiction:
Improvecomputation complexityVSAvoidfault-tolerance
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent introduces dynamics by transitioning from a static tree-based aggregation structure to a dynamic multi-path graph structure. The system adaptively routes data through multiple paths based on network conditions and node availability, with unique identifiers enabling flexible tracking regardless of the specific path taken. This dynamic approach maintains computational tractability while significantly improving fault-tolerance.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS8301655B2Wireless sensing system and method thereof
Publication Date: 2012.10.30 IND TECH RES INST
  • US8301655B2 patent drawing
  • US8301655B2 patent drawing
  • US8301655B2 patent drawing

AI summary

A wireless sensing system and a method thereof are provided. The wireless sensing system includes: a data processing center; and a first sensor module for processing a first source data into a first dynamic counting sketch data structure. The first dynamic counting sketch data structure has a bit length determined based on the first source data. The data processing center estimates the first source data based on the first dynamic counting sketch data.