Algebraic optimization of data delivery patterns in mobile sensor networks

DMCA

Algebraic optimization of data delivery patterns in mobile sensor networks (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Vladimir Zadorozhny , Panos K. Chrysanthis , Alexandros Labrinidis

Venue:	In DEXA
Citations:	8 - 2 self

BibTeX

@INPROCEEDINGS{Zadorozhny04algebraicoptimization,
    author = {Vladimir Zadorozhny and Panos K. Chrysanthis and Alexandros Labrinidis},
    title = {Algebraic optimization of data delivery patterns in mobile sensor networks},
    booktitle = {In DEXA},
    year = {2004}
}

OpenURL

Abstract

Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. In this work, we propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a Data Transmission Algebra (DTA) and apply it for efficient generation of such query trees. 1.

Keyphrases

algebraic optimization data delivery pattern mobile sensor network query tree possible in-node data filtering attractive paradigm query execution plan database-like query processing efficient generation routing tree sensor node building sensor application collision-free concurrent data transmission sensor query data transmission algebra data stream tree-like data delivery pattern tree construction time waste

DMCA