GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks

Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions of optimal, i.e. under different cost metrics). However, all these schemes differ from one common failing - they construct an optimal tree for a given fixed subset of the sensors. In most practical scenarios, the sensor group is continuously and dynamically varying - consider for example the set of sensors scattered in a forest that are sensing temperatures above some specified threshold, during a wildfire. Given the limited computational and energy resources of sensor nodes it is impossible to either prestore the optimal tree for every conceivable group or to dynamically generate them on the fly. In this paper we propose the novel approach of constructing a single group-independent spanning tree (GIST) T for the network and then letting any sensor group S use the subtree induced by S on T, TS as its group agg...

• Type: Conference
• Year: 2006
• Where: DCOSS
• Authors: Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram
• Keywords: DCOSS 2006, Distributed And Parallel Computing, GIST, Optimal Tree, Sensor