An efficient routing protocol on a Dynamic Cluster-based Sensor Network

Abstract

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, our 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 we also propose two algorithms: Node-Move-In and Node-Move-Out. We show that to establish a route on graph G using the architecture, it requires O(p) rounds, where p is the number of clusters in the network. In a scenario where the number of sensor nodes n is enormous, p is much less than n. Finally, our simulation results describe that the proposed routing protocol finds a better route with less length.