TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring

Authors:
Lilia Paradis;Qi Han
Affiliations:
-;-
Venue:
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Year:
2008

Citing 0
Cited 3

Distributed wake-up scheduling for data collection in tree-based wireless sensor networks

IEEE Communications Letters
An efficient data collection scheme through multi-path routing structures in wireless sensor networks

International Journal of Sensor Networks
An efficient algorithm for scheduling sensor data collection through multi-path routing structures

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a protocol for sensor applicationsthat require periodic collection of raw data reportsfrom the entire network in a timely manner. We formulatethe problem as an NP-hard graph coloring problem. Wethen present TIGRA - a distributed heuristic for graph coloring that takes into account application semantics and special characteristics of sensor networks. TIGRA ensures that no interference occurs and spatial channel reuse is maximized by assigning a specific time slot for each node totransmit. Although the end-to-end delay incurred by sensordata collection largely depends on specific topology,platform, and application, TIGRA provides a transmissionschedule that guarantees near-optimal delay on sensor datacollection.