Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks

A sensor network is a collection of transmitter-receiver devices (referred to as nodes). We assume that each node synchronizes and performs transmission or reception per round. In this paper, we consider the construction and maintenance of a cluster-based architecture for a sensor network, with two atomic operations node-move-in and node-move-out which are performed by appearance and disappearance of a node. In our proposed architecture, a deterministic broadcasting can be done in O(p) rounds, where p is the number of clusters. We present a randomized algorithm for a node-move-in and a deterministic algorithm for a node-move-out, which work in O(q) expected rounds and O(|T|) rounds, respectively, where q is the number of neighbors in the network of the joining node and T is a subtree of the architecture whose root is the leaving node. We also provide some alternative algorithms for the operations.