Distributed operator placement and data caching in large-scale sensor networks

Lei Ying, Zhen Liu, Don Towsley, Cathy H. Xia

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

42 Scopus citations

Abstract

Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data are generated by a large number of distributed sources. Queries are made that may require sophisticated processing and filtering of the data. A query is represented by a query graph. In order to reduce the data transmission and to better utilize resources, it is desirable to place operators of the query graph inside the network, and thus to perform in-network processing. Moreover, given that various queries occur with different frequencies and that only a subset of sensor data may actually be queried, caching intermediate data objects inside the network can help improve query efficiency. In this paper, we consider the problem of placing both operators and intermediate data objects inside the network for a set of queries so as to minimize the total cost of storage, computation, and data transmission. We propose distributed algorithms that achieve optimal solutions for tree-structured query graph topologies and general network topologies. The algorithms converge in Lmax(H Q + 1) iterations, where Lmax is the order of the diameter of the sensor network, and HQ represents the depth of the query graph, defined as the maximum number of operations needed for a raw data to become a final data. For a regular grid network and complete binary tree query graph, the complexity is O(√N log2 M), where N is the number of nodes in the sensor network and M is the number of data objects in a query graph. The most attractive features of these algorithms are that they require only information exchanges between neighbors, can be executed asynchronously, are adaptive to cost change and topology change, and are resilient to node or link failures.

Original languageEnglish (US)
Title of host publicationINFOCOM 2008
Subtitle of host publication27th IEEE Communications Society Conference on Computer Communications
Pages1651-1659
Number of pages9
DOIs
StatePublished - Sep 15 2008
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: Apr 13 2008Apr 18 2008

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period4/13/084/18/08

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Distributed operator placement and data caching in large-scale sensor networks'. Together they form a unique fingerprint.

  • Cite this

    Ying, L., Liu, Z., Towsley, D., & Xia, C. H. (2008). Distributed operator placement and data caching in large-scale sensor networks. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications (pp. 1651-1659). [4509746] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.151