An Efficient Routing Protocol on a Dynamic Cluster-Based Sensor Network
This paper presents an efficient routing protocol on a Dynamic Cluster-based Wireless Sensor Network (WSN). The cluster-based architecture presented here is constructed dynamically. Unlike some previous routing protocol that finds the route on cluster-based architecture which is a spanning tree of graph G, the authors' proposed protocol finds route on G. The cluster-based architecture is dynamic, thus it is self-constructible and reconfigurable and is facilitated by two topology management operations: node-move-in and node-move-out. For these two operations they also propose two algorithms: Node-Move-In and Node-Move-Out.