Suppressing redundancy in wireless sensor network traffic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Redundancy suppression is a network traffic compression technique that, by caching recurring transmission contents at receiving nodes, avoids repeatedly sending duplicate data. Existing implementations require abundant memory both to analyze recent traffic for redundancy and to maintain the cache. Wireless sensor nodes at the same time cannot provide such resources due to hardware constraints. The diversity of protocols and traffic patterns in sensor networks furthermore makes the frequencies and proportions of redundancy in traffic unpredictable. The common practice of narrowing down search parameters based on characteristics of representative packet traces when dissecting data for redundancy thus becomes inappropriate. Such difficulties made us devise a novel protocol that conducts a probabilistic traffic analysis to identify and cache only the subset of redundant transfers that yields most traffic savings. We verified this approach to perform close enough to a solution built on exhaustive analysis and unconstrained caching to be practicable.

Original languageEnglish
Title of host publicationDistributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings
Pages187-200
Number of pages14
DOIs
Publication statusPublished - 2010 Aug 13
Externally publishedYes
Event6th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2010 - Santa Barbara, CA, United States
Duration: 2010 Jun 212010 Jun 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6131 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2010
CountryUnited States
CitySanta Barbara, CA
Period10/6/2110/6/23

Fingerprint

Network Traffic
Redundancy
Wireless Sensor Networks
Wireless sensor networks
Traffic
Caching
Cache
Network protocols
Traffic Analysis
Probabilistic Analysis
Wireless Sensors
Vertex of a graph
Sensor nodes
Computer hardware
Sensor networks
Sensor Networks
Proportion
Compression
Trace
Hardware

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Abe, R., & Honiden, S. (2010). Suppressing redundancy in wireless sensor network traffic. In Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings (pp. 187-200). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6131 LNCS). https://doi.org/10.1007/978-3-642-13651-1_14

Suppressing redundancy in wireless sensor network traffic. / Abe, Rey; Honiden, Shinichi.

Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings. 2010. p. 187-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6131 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abe, R & Honiden, S 2010, Suppressing redundancy in wireless sensor network traffic. in Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6131 LNCS, pp. 187-200, 6th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2010, Santa Barbara, CA, United States, 10/6/21. https://doi.org/10.1007/978-3-642-13651-1_14
Abe R, Honiden S. Suppressing redundancy in wireless sensor network traffic. In Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings. 2010. p. 187-200. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-13651-1_14
Abe, Rey ; Honiden, Shinichi. / Suppressing redundancy in wireless sensor network traffic. Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings. 2010. pp. 187-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4d4680ccd79a4589b1d1b17233537701,
title = "Suppressing redundancy in wireless sensor network traffic",
abstract = "Redundancy suppression is a network traffic compression technique that, by caching recurring transmission contents at receiving nodes, avoids repeatedly sending duplicate data. Existing implementations require abundant memory both to analyze recent traffic for redundancy and to maintain the cache. Wireless sensor nodes at the same time cannot provide such resources due to hardware constraints. The diversity of protocols and traffic patterns in sensor networks furthermore makes the frequencies and proportions of redundancy in traffic unpredictable. The common practice of narrowing down search parameters based on characteristics of representative packet traces when dissecting data for redundancy thus becomes inappropriate. Such difficulties made us devise a novel protocol that conducts a probabilistic traffic analysis to identify and cache only the subset of redundant transfers that yields most traffic savings. We verified this approach to perform close enough to a solution built on exhaustive analysis and unconstrained caching to be practicable.",
author = "Rey Abe and Shinichi Honiden",
year = "2010",
month = "8",
day = "13",
doi = "10.1007/978-3-642-13651-1_14",
language = "English",
isbn = "3642136508",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "187--200",
booktitle = "Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings",

}

TY - GEN

T1 - Suppressing redundancy in wireless sensor network traffic

AU - Abe, Rey

AU - Honiden, Shinichi

PY - 2010/8/13

Y1 - 2010/8/13

N2 - Redundancy suppression is a network traffic compression technique that, by caching recurring transmission contents at receiving nodes, avoids repeatedly sending duplicate data. Existing implementations require abundant memory both to analyze recent traffic for redundancy and to maintain the cache. Wireless sensor nodes at the same time cannot provide such resources due to hardware constraints. The diversity of protocols and traffic patterns in sensor networks furthermore makes the frequencies and proportions of redundancy in traffic unpredictable. The common practice of narrowing down search parameters based on characteristics of representative packet traces when dissecting data for redundancy thus becomes inappropriate. Such difficulties made us devise a novel protocol that conducts a probabilistic traffic analysis to identify and cache only the subset of redundant transfers that yields most traffic savings. We verified this approach to perform close enough to a solution built on exhaustive analysis and unconstrained caching to be practicable.

AB - Redundancy suppression is a network traffic compression technique that, by caching recurring transmission contents at receiving nodes, avoids repeatedly sending duplicate data. Existing implementations require abundant memory both to analyze recent traffic for redundancy and to maintain the cache. Wireless sensor nodes at the same time cannot provide such resources due to hardware constraints. The diversity of protocols and traffic patterns in sensor networks furthermore makes the frequencies and proportions of redundancy in traffic unpredictable. The common practice of narrowing down search parameters based on characteristics of representative packet traces when dissecting data for redundancy thus becomes inappropriate. Such difficulties made us devise a novel protocol that conducts a probabilistic traffic analysis to identify and cache only the subset of redundant transfers that yields most traffic savings. We verified this approach to perform close enough to a solution built on exhaustive analysis and unconstrained caching to be practicable.

UR - http://www.scopus.com/inward/record.url?scp=77955410181&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955410181&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13651-1_14

DO - 10.1007/978-3-642-13651-1_14

M3 - Conference contribution

AN - SCOPUS:77955410181

SN - 3642136508

SN - 9783642136504

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 187

EP - 200

BT - Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings

ER -