In this paper, we design a new routing protocol named shortest time regional head path protocol (STRHP). The fundamental concept is to make different regions of the network that must be located in a particular angle from a fixed point. After that it is expected to get divided into positive and negative regions. Finally, the packet will be sent to the base station (BS) by choosing the region head (RH) from different regions basing upon the minimum distance. In low-energy adaptive clustering hierarchy (LEACH) and improved energy balanced routing protocol (IEBRP), a packet is sent to the cluster head first, next to sink and then to the BS which may tend to travel a longer distance, but in STRHP, the packet is sent to the region head first and then to the BS that covers significantly less distance. Due to this reason, more energy consumption occurs in LEACH and IEBRP, but in the STRHP, less energy is consumed. Here we measure the performance on the basis of new routing protocol in terms of network energy consumption, network life time and number of data packets sent to the base station, etc. From the result analysis, we can conclude that it may be the newly approached better protocol as compared to LEACH, IEBRP, stable election protocol (SEP), DEEC (distributed energy efficient clustering) and M-SEP (modified stable election protocol) in all respects.

regions, homogeneous, heterogeneous, threshold, cluster head.