## 1 Introduction
In the announcement phase, all the CHs and the INs proclaim themselves to each other to facilitate creating the RTs. In the selection phase, the RTs of the CHs and the INs will be established. Finally, a cost function is evaluated and used in the routing phase to arrange the routes of the RTs based on their costs. Here, the lowest cost routes will be initially chosen to be used. During the round, the RTs of the CHs and the INs will be updated and the initial routes may be changed during the same round. The EDMHT-LEACH approach has reduced the total energy consumption of the network and distributed the energy load among different next hops. Hence, the lifespan of the sensor network is prolonged and its stability is increased. On other hand, the EDMHT-LEACH protocol did not pay attention to the data transmitting of the sensor nodes within the clusters. Thus, the dynamic routing approach is only used outside the clusters, whereas the direct data transmitting is used within the clusters as in LEACH protocol. In this paper, we aim to prolong the sensor network lifetime and its performance. Therefore, a new general approach is proposed for distributing all the deployed sensor nodes into levels around the BS. Moreover, we suppose that each cluster will be divided into two levels around the CH too. The main reason behind the previous assumption is to minimize the data transmission distances as much as possible between the nodes themselves and from them to the BS. The network lifetime is split into rounds, and it is assumed that the sensor nodes will belong to one of three groups (CHs, INs and Ns) and have different responsibilities from one round to another. In this context, we expect that the energy load will be distributed among all the network member nodes, which will increase the stability of the network. Further, new full routing mechanisms will be utilized to convey the data intra-cluster and inter-cluster. One of these mechanisms belongs to the static class of routing algorithms, while the second mechanism belongs to the dynamic one. In the case of the new approaches, the routing data process becomes more organized and dependent on the coordinates and energy status of every sensor node. The static routing mechanism proposes a static approach based on choosing the routes that have the shortest distances to be used along the duration of the round. By the static mechanism, we look forward to selecting the lowest distance routes to minimize the energy dissipation needed to transmit the sensor data. For considering the energy loads on the next hop nodes, a dynamic mechanism is proposed. This approach considers switching between the available routes depending on a cost equation that was defined for this purpose. By proposing the dynamic approach, we seek to reduce the energy consumption and distribute the energy load on different routes during every round. This paper is organized as follows: Section 2 describes some protocols presented in the related research. Section 3 is dedicated to analyzing the whole approaches of the proposed ideas. Section 4 presents the evaluation of the proposed algorithms performance by means of simulation and discusses the obtained results. Finally, Section 5 concludes the paper.