Multi-hop energy-efficient routing protocol based on Minimum Spanning Tree for anisotropic Wireless Sensor Networks

Wireless sensor network (WSN) is composed of many tiny sensor nodes deployed in isolated areas and planned to work for WSN research interest. These sensor nodes have several resource constraints such as limited battery power. Besides, sensing and communications tasks consume energy, so a power management using optimized routing methods may effectively extend node's operational time. Routing in Wireless Sensor Networks have received an increased interest by researchers and have been developed with different characteristics according to the exigence of application, the architecture of network, and specially the metric used to route packets (distance of path or number of hops, etc). The selection of an appropriate routing protocol is important since a well-designed routing protocol will increase transmission efficiency and maximize the overall network lifetime. A critical aspect of applications based on wireless sensor networks is their lifetime. In this paper, a new routing protocol strategy for wireless sensor nodes communications suitable for both isotropic and anisotropic networks distributions is proposed. This approach focuses on the minimum number of hops of each node to discover the optimal paths inserting them in its routing table. The main idea of this algorithm comes from the Minimum Spanning Tree (MST) graph theory with a modification of Prim's algorithm. Further, the simulation results show that our proposed approach significantly performs in terms of minimization of the number of individual transmissions in a random sensor network for both isotropic and anisotropic sensing area.