Cost effective ModLeach-A* search algorithm for shortest path routing in Wireless Sensor Networks

Cost effective shortest path routing is an important field of research in Wireless Sensor Networks (WSNs). In WSNs, the network is partitioned into several numbers of clusters of same or different size. In each cluster, a cluster head is selected. Some cluster heads are located nearer to the sink node and some are far away from the sink node. The cluster head distance from the sink node may probably influence the quality of data transmission and consume energy in high rate, which causes earlier death of cluster head. To reduce this problem, an informed search algorithm ModLeach-A∗ is proposed. The algorithm can evade prior death of several cluster head nodes and modify the energy utilization load from cluster-head nodes to the entire sensor network i.e. to extend the life time of the networks and improve the quality of data transmission.