Dynamic Minimal Spanning Tree Routing Protocol for large Wireless Sensor Networks

Hundreds or thousands of wireless sensor nodes with limited energy resource are randomly scattered in the observation fields to extract the data messages for users. Because their energy resource cannot be recharged, energy efficiency becomes one of the most important problems. LEACH is an energy efficient protocol by grouping nodes into clusters and using Cluster Heads (CH) to fuse data before transmitting to the Base Station (BS). BCDCP improves LEACH by introducing a Minimal Spanning Tree (MST) to connect CHs and adopting iterative cluster splitting algorithm to choose CHs or form clusters. This paper proposes another innovative cluster-based routing protocol named Dynamic Minimal Spanning Tree Routing Protocol (DMSTRP), which improves BCDCP by introducing MSTs instead of clubs to connect nodes in clusters. Simulation results show that DMSTRP excels LEACH and BCDCP in terms of both network lifetime and delay when the network size becomes large.