Performance Study of Reconfiguration Algorithms in Cluster-Tree Topologies for Wireless Sensor Networks

This paper presents a performance study of two new proposed strategies for the reorganization of a cluster-tree and its address space: proactive and reactive algorithms. The goal of the proactive reconfiguration is to minimize the average number of hops between the possible source and destination pairs. It is achieved by attempting to reconnect nodes to a parent node with the highest possible level. The goal of the reactive reconfiguration is to reorganize the cluster on- demand when a node wishing to join the cluster cannot do it, because the possible parents exhausted their free address space. Our simulation results show that with an optimized reconfiguration a higher performance in terms of connection time and connectivity of the cluster-tree can be achieved.