MTPR tries to select a path that has minimum total transmission power. A node that requires a
path to a distant node broadcast RREQ to all its neighbours. This process continues at each and
every intermediate nodes till the packet reaches to a destination node. The diagram of routing
protocol is given below
The destination node receives RREQs from various nodes but selects the path with minimum total
transmission power. It should be noted here that the total transmission power scales with
transmitted distance as d2
to d4
depending on environmental conditions. This routing approach
will in most cases tend to select routes with more hops than others [12,13].
The above protocol can made clearer with the help of an example network as shown in Figure 2.
The distances between various pairs of nodes are shown in path matrix (see Table-1). Let us
suppose 1 as the source and 7 as the destination. The paths selected from source to destination
may be as follows: