# Enhancing Energy Efficiency of Wireless Sensor Network through the Design of Energy Efficient Routing Protocol

Authors: Noor Zaman; Low Tang Jung; Muhammad Mehboob Yasin
Journal: Journal of Sensors
 (2016)

---

## Abstract

Wireless Sensor Network (WSN) is known to be a highly resource constrained class of network where energy consumption is one of the prime concerns. In this research, a cross layer design methodology was adopted to design an energy efficient routing protocol entitled “Position Responsive Routing Protocol” (PRRP). PRRP is designed to minimize energy consumed in each node by (1) reducing the amount of time in which a sensor node is in an idle listening state and (2) reducing the average communication distance over the network. The performance of the proposed PRRP was critically evaluated in the context of network lifetime, throughput, and energy consumption of the network per individual basis and per data packet basis. The research results were analyzed and benchmarked against the well-known LEACH and CELRP protocols. The outcomes show a significant improvement in the WSN in terms of energy efficiency and the overall performance of WSN.


---

## Body

## 1. Introduction

Wireless sensor technology is playing a vital role in many of the commercialized industrial automation processes and various other real life applications [1–4]. It is particularly suitable for harsh environment applications where deploying of other network infrastructure is difficult and/or almost impossible such as in battlefield, in hazardous chemical plant, and in high thermal environment. It is not uncommon to see that most of the crucial surveillance and security applications also rely on sensor based applications. Sensors which are tiny in size and cheap in cost have the capabilities to be deployed in a range of applications as explained in [5–9]. Essentially all sensor networks comprise some forms of sensing mechanism to collect data from an intended physical environment either by a time driven approach or by event triggering approach. By these approaches a sensor will convey the sensed data to a destination or sink (multiple destinations/sinks are also possible) via some kinds of routing algorithm such as Minimum Cost Forwarding Algorithm (MCFA), Directed Diffusion Routing Protocol (DDRP), or one of the cluster-based routing protocols. Being very small in size, sensor nodes are built with limited computational capacity, small storage memory, and finite battery power capacity [10].The structure of a typical WSN node [11] consists of four main components: a sensing element, normally used for sensing a physically measureable parameter; an Analog-to-Digital Converter (ADC), used for converting analog signals to some digital formats; a processing unit, providing simple/basic data processing and computation capabilities; and a power unit, responsible for sensor node’s operation life span. It is a known fact that WSN is a resource constrained network in which energy efficiency is always the main issue since the operation of WSN depends heavily on the life span of the sensor nodes’ battery [12]. The most energy consuming operation in WSN is the data packet routing activity. The characteristics of the WSN are different from the conventional networks [13, 14]. These unique characteristics are often taken into account for addressing the issues and challenges related to network coverage, runtime topologies management, node distribution, node administration, node mobility energy efficiency/consumption, network deployment, application areas/environment, and so forth [15–17].Nodes in a WSN are generally energy, computation, and memory constrained. Consequently, there is a need for research and development into low-computation resource-aware algorithms for WSNs, targeting at small, highly resource constrained embedded sensor nodes. Energy consumption is of prime importance in WSNs and thus some algorithms [18–24] and hardware were designed with energy efficiency or energy awareness as a central focal point of interest. Enhancing energy efficiency of WSN with respect to the communication routing protocol is the primary concern of this research. We propose a new routing protocol entitled “Position Responsive Routing Protocol (PRRP)” and compare its performance with the well-known LEACH and CELRP protocols. The simulation results show a significant improvement over the aforementioned protocols in terms of energy efficiency and the overall performance of the WSN.


## 2. Literature Review

The main operational sustainability concern in WSN is its energy resource constraint. This brings along in recent years that a great number of energy efficient routing protocols have been proposed for WSNs based on the network organization and the routing protocol operations. Some of these focused on minimizing the communication distance to reduce the energy consumption and a handful of them focused on fair energy distribution to avoid the routing hole (hot spot) problems [25, 26]. The routing hole issue was described and addressed in [25–28] by utilizing mobility based energy efficient routing protocols. These protocols are suitable in certain situations; however they may not be applicable in cases where mobility is not feasible such as earthquake, forest fire, and disaster management [29]. Mobility techniques do have other challenges like increased energy overhead owing to frequent network topology changes and data packet drops due to high latency [30, 31]. Various other research papers focusing on energy efficiency routing protocols can be found in [32–37]. Many researchers pay attention to the WSN energy issue by designing different routing techniques and MAC-layer protocols to raise the energy level in WSN. Our literature review reveals that a range of different energy efficient routing protocols in the recent past were designed mostly based on the network structure such as hierarchical routing, location routing, and flat based routing. Our extensive literature review also reveals that the existing routing protocols are still facing energy efficiency limitation issues. Critical analyses of some of the popular existing energy efficient routing protocols are presented in this section.Hierarchal routing protocols are considered more energy efficient when compared with flat and location based routing protocols. A number of hierarchal based energy efficient routing protocols have been referred to in the literature review such as LEACH [38], TEEN and APTEEN [39, 40], PEGASIS [41], MECN and SMECN [35, 42], SOP [43], HPAR [44], VGA [45], Sensor Aggregate [46], TTDD [47], Energy Efficient Self-Healing [48], Energy Efficient Position Based [49], and CELRP [50]. The literature review refers to the fact that the main advantage of hierarchal approach is to control the data duplication and is best suited for data aggregation. With this format, nodes are not allowed to communicate with the sink directly that they must go through a cluster head for communication purposes, while the cluster head collects the data from different nodes within a specific cluster area, and then it sends the collected data either to another cluster head or directly to the sink. This approach is more balanced and energy efficient comparable to flat and location based routing protocols [51–57]. However, the disadvantage of this approach is that it results in quick energy drain of the cluster head nodes as most of the time they are involved in sending and receiving the data packets. Rotation of cluster heads is possible but it also brings along an issue related to the loss of the energy resource.A number of different protocols have been proposed for WSN node localization or location based routing. These include GAF [58], GEAR [59], SPAN [60], MFR, GEDIR [61], and GOAFR [62]. These literatures referred to the fact that the main advantage of these protocols is the ability to identify the correct location of the sensor node within the sensor network. Node localization is directly linked to energy efficiency of WSN. It saves energy resources of WSN. However in most cases these protocols resulted in energy loss due to its geographical topology and node distribution in the WSN. There is thus still a gap in energy efficient routing protocol design and solutions for this class of routing.A good number of flat based routing protocols have been studied such as SPIN [63], Directed Diffusion [64–66], Rumor Routing [67], GBR [68, 69], MCFA [70], COUGAR [71], CADR [72], ACQUIRE [73], and EAR [74]. The literature review referred to the fact that the main advantage of flat based routing protocol is its simplicity in operation and it had a direct communication mechanism with the base station in which all nodes are allowed to participate during the routing operation. For its simplicity, the nodes only need information about their closest neighbors. However, the major disadvantage is that nodes spread out in a flat manner and all nodes are attempting to participate equally thus causing the nodes closer to the sink to deplete their power sooner than those located further away from the sink. This is mainly due to the heavy data transmission load. This is badly affecting the nodes closer to the sink for keeping them alive longer. Therefore the nodes further away may be unable to communicate with the base station after some time due to network isolated segmentation problem in the WSN. Consequently many of the nodes are not able to participate in routing thus not utilizing their entire energy effectively. More research works are deemed necessary to address the WSN energy efficiency in this aspect. In addition, flat routing is still having issues in data collision overhead, links formed on the fly without synchronization, energy dissipation depending on traffic patterns, and fairness being not guaranteed.


## 3. PRRP Research Methodology

This research is aimed to design a new energy efficient routing protocol, namely, Position Responsive Routing Protocol (PRRP), to address the energy issues in WSN and specifically to enhance the energy efficiency in WSN. The main contribution of PRRP is the novel way of selecting the cluster head (CH) in WSN. In comparing to the existing protocols such as LEACH and CELRP whereby the CHs are chosen randomly among all nodes based on their respective residual energy, in PRRP we considered different parameters such as distance from the sink, energy level, and the average distance of neighboring nodes from the candidate CH node.


### 3.1. Basic Assumptions

PRRP differs from existing protocols such as LEACH and CELRP in many ways. This research assumes that nodes are aware of their geographical locations in WSNs using GPS or some other cost effective location surveys [50, 75–79]. Each node is able to use different frequencies for transmitting and receiving as it is assumed that sensor node has a multichannel transceiver. It is assumed that each node can transmit its data to the sink as node has ability to transmit for longer distance. All nodes have homogeneous energy level at initial stage and this assumption is widely used in literature [80]. Sensor nodes are distributed in the grid format with a uniform random fashion and the sink is placed in the center of sensor network. This assumption is particularly relevant for forest fire surveillance systems and disaster management systems.


### 3.2. Network Model

The conceptual network model for PRRP implementation has the layout as shown in Figure1. It is considered a randomly uniform distributed WSN where nodes are distributed randomly in a sensor field based on a grid format. The static sink is located in the center of the network. The sensor nodes in the network are divided into different groups of clusters on both side of the sink. Normally, the tiers are defined in radii around the sink ranging within tier D
0, tier D
1, and so forth, depending on the network size. Each tier covers more than one grid (partially or fully) and has a logical range in which the number of nodes lies, which is depending on the distribution of the nodes. Initially, a signal with energy level E
0 is transmitted from the sink into the network. The signal with energy E
0 shall be received only by those nodes placed near the sink. After listening to the signal, these nodes will respond to the sink and they will be registered as tier D
0 nodes. Next, the sink will advertise signal with transmission energy of E
1, where E
1
>
E
0. The nodes, other than D
0, shall respond to this signal, forming tier D
1 nodes. This process will be repeated until a preset number of tiers are formed.Figure 1
PRRP network model.


### 3.3. Energy Model

The power control model used in this research work is based on the concept that energy consumption is directly proportional to the transmission distance. Equation (1) below shows the node energy consumption for transmitting k bits of data for a distance of d meters. The energy consumed for receiving of k bits is given by (2) [81]: (1)
E
T
x
=
k
E
e
l
e
c
+
k
E
a
m
p
d
2
,
(2)
E
R
x
=
k
E
e
l
e
c
,where E
e
l
e
c is the electronics energy in transceiver and E
a
m
p is the amplifier energy.The minimum energy for a node to be able to participate in the coming round of routing (or it is the minimum energy to participate in next round) is given in (3) as E
t
h
r
e
s
h
o
l
d
m
i
n:(3)
E
t
h
r
e
s
h
o
l
d
m
i
n
=
k
E
e
l
e
c
+
k
E
a
m
p
d
2
+
8
k
E
e
l
e
c
.


### 3.4. Analysis of PRRP

This section presents a brief analysis of the energy utilization in terms of energy consumed by cluster head nodes and the leaf nodes that can be linked to the life span of the CH node. Consider a WSN comprising ofN wireless sensor nodes that are uniformly distributed within a grid of size m
×
m, and within each grid cell one of the nodes acts as the cluster head (CH).CH spends its life in three modes, namely, receiving data samples from member nodes, transmitting its own data (and/or member nodes’ data), and sleep mode. LetE
i
n, E
t
h, E
r, and E
t, respectively, denote the initial energy, threshold energy, energy consumed during reception, and energy consumed during transmission of one data sample. Further, we assume that each data sample has a fixed size; therefore the transmitting time and the receiving time for each data sample are the same, namely, T
s. During each sampling interval, a CH, with k member nodes, spends T
t time for transmission, k
T
t time for receiving samples, and remaining T
s
-
(
k
+
1
)
T
t time in sleep mode. The CH is assumed to have died when its residual energy falls below the threshold (E
t
h) necessary for a node to function. Therefore, the life of the CH can be calculated in terms of the number of sampling intervals, N
s, as (4)
N
s
=
E
i
n
-
E
t
h
E
t
+
k
E
r
+
T
s
-
k
+
1
T
t
P
s
.


### 3.5. Proposed Routing Protocol PRRP Description

After system modeling, suitable gateways are identified from each cluster as all nodes are aware of their respective location and the distance from the sink and from their neighboring nodes. The selection of the gateway is based on parameters such as the node distance, number of nodes close to a particular node, and the energy threshold level. The energy threshold level is more significant than others. On this note, PRRP is therefore aimed to minimize the distance between the nodes and the gateway to save energy during data transmission. PRRP assumes that node’s data acquisition is event driven. That is, the majority of nodes will remain in sleep mode to save energy. It is assumed that type of all the sensed data within one grid is the same, so data aggregation can be applied and nodes will transfer their sensed data on a fixed schedule based on TDMA principle. Each node in PRRP will transmit its data to its closest neighbor. This is to ensure its transmission distance is shortest and therefore less energy is consumed for data transmission. It is noted that tree routing is an energy efficient routing mechanism; thus this mechanism is adopted in the proposed PRRP. A tree is built starting from the leaf nodes to the sink. The sink is placed in the center of the network instead of on the one end as in LEACH and CELRP. It should be mentioned here that, in PRRP, any node on the network can be a gateway but selection of a gateway is based on three parameters as mentioned earlier. Under the PRRP scheme, a node can only be allowed to join a tree if its energy is sufficient to survive for a complete round.An efficient distributed TDMA scheduling is used in the proposed PRRP. In this scheduling the radio module of the nonleaf node will be turned ON only for the assigned time slots instead of being ON for all times such as in LEACH protocol. In PRRP the number of leaf nodes and the distance from the nonleaf node is less as compared to LEACH and CELRP. Consequently energy conservation can be optimized based on stated technique. The distributed TDMA scheduling in PRRP strongly supports energy efficiency and good data throughput in the proposed PRRP.


#### 3.5.1. The Proposed PRRP Algorithm

In PRRP, each round of processing time consists of four phases:(
1
) gateway selection (GS), (
2
) tree building (TB), (
3
) schedule building (SB), and (
4
) transmission of data (TD) as shown in Figure 2. Processing rounds will continue till the routing tree is broken due to the energy level of the gateway dropping below the threshold level.Figure 2
PRRP phases.In the first phase, GS process is completed on the basis of its position, its residual energy level, and the number of neighboring nodes around it. This gateway will be responsible for transferring the aggregated/collected data from the neighboring nodes to the sink. This phase starts with the message initiated from the sink with energy threshold level ofE
0. In the second phase (TB), a routing tree rooted at the sink is built. The newly formed tree will be based on two types of the sensor node such as nonleaf nodes and leaf nodes. Leaf node transmits sensed data from the monitored area to its parent. The nonleaf nodes act as the intermediate nodes to transmit data from lower to upper level of the tree. Based on this tree, a Time Division Multiple Access (TDMA) schedule subsequently is built in phase-3 (SB) in a distributed manner. In the final phase (TD), the data are transmitted from nodes to the sink based on the schedule prepared in phase-3, that is, the distributed TDMA scheduling.The time required to forward all data packets in a single round is denoted as one data transmission period. That is, a data transmission period may consist of multiple TDs. The TDs may be repeated numerous times in a single round, depending on the energy level of the gateways as illustrated in Figure2. For instance, in the second round, it has more TDs than in the 1st round. On another note, the number of data transmission periods in a single round shall depend on the application and the periodic events of the sensor network data collection. The PRRP process flow is depicted in Figure 3. Always in case of tree rebuilt, different sensor nodes will take part in that process, which will become source of equal energy distribution in the network. The energy consumption for overall network will be distributed fairly among all nodes. The following sections describe all the phases.Figure 3
PRRP process flow.


#### 3.5.2. Gateway Selection

In the first phase a few nodes will be selected as gateways in such a manner as to minimize overall energy consumption in the WSN. The network is assumed to be divided into different grid cells and the cells are further divided into a number of tiers, sayn, on both sides of the sink. Initially the nodes in tier D
0 will be considered as the potential gateway candidates based on their energy level e, the distance from the sink d, and the number of neighboring nodes n. Some of these nodes are allowed to advertise themselves as gateways. However priority will be based on the residual energy in a node. A potential gateway will act as a gateway until its residual energy drops below a threshold value E
t
h. Following this, new gateways will be selected from the nodes of tier D
1. Again, the new selected nodes will act as gateways until their residual energy drop below E
t
h, and so on. When all tiers are considered and no more nodes can be selected as gateways based on the current E
t
h, a new round will start with a new lower E
t
h. The flow chart for gateway selection is given in Figure 4.Figure 4
Gateway selection flowchart.This mechanism will continue until the last tier(
D
n
) and with the second cycle the same process will be continued. However, in this time E
t
h by the sink will be little reduced by factor (
e
). The same mechanism will be continued for all tiers and all cycles until the end. The sink and sensor nodes will exchange messages using the CSMA mechanism. The node will remain ON until it receives the ADV message from the sink and then it sends theJOIN message. Since the node does not need a confirmation from the sink, it will go to sleep immediately after sending theJOIN message. The gateway selection is based on three different parameters such as energy level, number of neighboring nodes, and position from the sink. After selecting the gateways, the next phase will start to build the tree. The gateway nodes will initiate the process of building the tree. For further clarification for the mechanism of gateway selection, the algorithm in pseudocode is given in Algorithm 1.Algorithm 1:Gateway selection algorithm.
Step A:
Wait for sink advertisement message
IF (gateway Election → Gateway)
Message advertise
Wait for members’ joining request till T1
IF (number of joining members=
= 0)
Go to Step C
Form TDMA schedule and announce to all members
Step B:
Wait for data as per TDMA schedule
Data received
Process data: aggregation
Data transmit to sink
While (Gateway EnergyE
c
>
E
t
h)
Repeat from Step B
Repeat from Step A
ELSE (gateway Election → Normal node)
Step C:
Wait for gateway advertisement message
Send joining request
Wait for TDMA schedule to receive
Step D:
Wait for allotted slot
IF Energy available to transmit data
Send data
While (Gateway EnergyE
c
>
E
t
h)
Listen Broadcast from sink to gateway
Repeat from Step D
Repeat from Step A
ELSE
Node died
END IF


#### 3.5.3. Tree Building

Upon completing the gateway selection the tree building phase is initiated. A tree rooted at the sink is built by using a modified version of the algorithm proposed in [82]. A tree is built by the sink broadcasting a control message containing six fields, namely,sender, position, type, level, parent, and energy. For a sender nodev, t
y
p
e
v represents its status in which 0 is for undefined status, 1 is for leaf node, and 2 is for nonleaf node. L
e
v
e
l
v refers to the number of hops from v to the sink. P
a
r
e
n
t
v is the next hop ofv in the path to the sink, e
n
e
r
g
y
v is the residual energy E
v, and P
v denotes the position of the node from the sink.Initially each node has status 0, while sink always have status 2, implying that sink is a nonleaf node. The sink broadcasts the message (s, 2, 0,NULL, ∞, P
s), wheres is the identifier of sink, 2 is the status of the sink,NULL indicates that there is no parent of the sink, ∞ indicates that the sink is connected to a power source, and P
s is the position of the sink. When a nodev receives a message (u,2, l
e
v
e
l
u, p
a
r
e
n
t
u, E
u, P
u) from nodeu, it becomes a leaf node, senses the channel until the channel is idle, and then waits for T
v
2 time duration. If the channel is still idle,v will broadcast message (v, 1, l
e
v
e
l
u
+1, u, E
v, P
v). Ifv receives message (u,1, l
e
v
e
l
u, p
a
r
e
n
t
u, E
u, P
u) fromu, it will sense the channel until it is idle, and it waits for T
v
1 time duration. If the channel is still idle,v broadcasts message (v,2,
l
e
v
e
l
v, p
a
r
e
n
t
v, E
v, P
v). Then, it becomes nonleaf node. If nodev receives more than one message from different nodes before broadcasting its message, it will select the node with larger energy and with the nearest distance to it as its parent. If multiple nodes have the same energy and distance,v will select one of them randomly. If there is another node occupying the common channel before its time is out, the waiting node will go back to sensing state. If a nodev receives message (w,2, l
e
v
e
l
w
, v, E
w, P
w) from nodew indicating thatv is its parent,v will broadcast message (v,2, l
e
v
e
l
v, p
a
r
e
n
t
v, E
v, P
v) immediately after the channel is idle explain why. By this process, eventually all gateways will be able to build a routing tree from nodes to the sink as shown in Figure 5.Figure 5
Showing final routing trees built among the different regions.


#### 3.5.4. Schedule Building

The schedule building is the third phase for building an effective distributed scheduling scheme using TDMA principle for data transmission. The schedule is built on the assumption that all the nodes which are connected with the same gateway will transfer their data using same frequency. This assumption implies that nodes connecting to different gateways are using different frequencies for data transmission therefore simultaneous data transmission is allowed among the different trees. We have identified two time constants: Time Ready to Receive (TRR) and Time Ready to Transmit (TRT).T
R
R
v and T
R
T
v represent two different time slots: T
R
R
v, indicates when a node v is ready to receive from its children nodes and T
R
T
v shows when a node v can transmit to its parent towards the sink. The node wakeup time, during which its transceiver will stay in theON state, can be calculated using the values of T
R
T
v and T
R
R
v. For the leaf node, transmission time T
R
T
v is equal to the width of one time slot denoted as t
0, while reception time T
R
R
v is zero since it does not have any children.On the other hand, for nonleaf nodev,(5)
T
R
R
v
=
m
a
x
T
R
T
i
,
w
h
e
r
e
i
=
1,2
,
3
,
…
,
n
v
c
,
T
R
T
v
=
T
R
R
v
+
n
v
c
T
t
.In the above equationi show an index for the children of v node, n
v
c represents the count of v’s children which represents one data packet transmit time. As we select max function, the parent node will stay in theON state only when all of its children are ready to transmit, which is better than switching its state repeatedly fromOFF toON and back. Once the received data from children are aggregated then the parent can transfer the data to the next node. Initially, each leaf node will transmit its TRT value to its parent. After receiving TRT values from all of its children, the parent will calculate its TRT and TRR using above equation and then build a schedule for its children as shown in Figure 6.Figure 6
Building TRT and TRR scheduling time.The flow chart for building the schedule as explained above is given in Figure7.Figure 7
Flow chart for building time schedule.


#### 3.5.5. Transmission of Data

The data transmission phase can be repeated many times for a same round of schedule but node will require energy to be alive. Nonleaf node will remainON for more slots for having responsibility to collect the data from its child and then transfer it to its parent, while the leaf nodes will beON only for one slot, just to transfer the data to its parent. For each node, a time slot labeled by T represents a time slot at which a node transmits data and a time slot labeled by R represents time slot at which a node receives data as shown in Figure 8.Figure 8
Data transmission scheduling.As a summary, in PRRP the WSN is divided into grid and cells and then into different tiers. Meanwhile, sink is assumed to be placed in the center of the topology. The nodes are distributed in random fashion with an assumption that they are aware of their position/location through Global Positioning System (GPS) or any other local means. The gateways are the nodes that are close to the sink, normally witht
i
e
r
0. Furthermore, the gateways are selected with other tiers on the basis of node energy level, its position from the sink, and the number of nodes in its neighbor. PRRP operates in different phases starting from the gateway selection up to the data transfer. A tree rooted at the sink is formed and then data is collected using a TDMA scheduling technique. PRRP assumes that node can only join its neighbor which is available within the same tier. In such case, the minimum distance is ensured and so energy can be saved during data transfer, whereby each node will select a parent among its closest neighbors to avoid a long distance data transfer. Consequently, the transmission range for nodes is always short. Each node can listen to the transmission of the nodes close to it or available within the same tier. This technique guarantees the distance among communicating nodes is minimum for data transfer hence saving energy.


## 3.1. Basic Assumptions

PRRP differs from existing protocols such as LEACH and CELRP in many ways. This research assumes that nodes are aware of their geographical locations in WSNs using GPS or some other cost effective location surveys [50, 75–79]. Each node is able to use different frequencies for transmitting and receiving as it is assumed that sensor node has a multichannel transceiver. It is assumed that each node can transmit its data to the sink as node has ability to transmit for longer distance. All nodes have homogeneous energy level at initial stage and this assumption is widely used in literature [80]. Sensor nodes are distributed in the grid format with a uniform random fashion and the sink is placed in the center of sensor network. This assumption is particularly relevant for forest fire surveillance systems and disaster management systems.


## 3.2. Network Model

The conceptual network model for PRRP implementation has the layout as shown in Figure1. It is considered a randomly uniform distributed WSN where nodes are distributed randomly in a sensor field based on a grid format. The static sink is located in the center of the network. The sensor nodes in the network are divided into different groups of clusters on both side of the sink. Normally, the tiers are defined in radii around the sink ranging within tier D
0, tier D
1, and so forth, depending on the network size. Each tier covers more than one grid (partially or fully) and has a logical range in which the number of nodes lies, which is depending on the distribution of the nodes. Initially, a signal with energy level E
0 is transmitted from the sink into the network. The signal with energy E
0 shall be received only by those nodes placed near the sink. After listening to the signal, these nodes will respond to the sink and they will be registered as tier D
0 nodes. Next, the sink will advertise signal with transmission energy of E
1, where E
1
>
E
0. The nodes, other than D
0, shall respond to this signal, forming tier D
1 nodes. This process will be repeated until a preset number of tiers are formed.Figure 1
PRRP network model.


## 3.3. Energy Model

The power control model used in this research work is based on the concept that energy consumption is directly proportional to the transmission distance. Equation (1) below shows the node energy consumption for transmitting k bits of data for a distance of d meters. The energy consumed for receiving of k bits is given by (2) [81]: (1)
E
T
x
=
k
E
e
l
e
c
+
k
E
a
m
p
d
2
,
(2)
E
R
x
=
k
E
e
l
e
c
,where E
e
l
e
c is the electronics energy in transceiver and E
a
m
p is the amplifier energy.The minimum energy for a node to be able to participate in the coming round of routing (or it is the minimum energy to participate in next round) is given in (3) as E
t
h
r
e
s
h
o
l
d
m
i
n:(3)
E
t
h
r
e
s
h
o
l
d
m
i
n
=
k
E
e
l
e
c
+
k
E
a
m
p
d
2
+
8
k
E
e
l
e
c
.


## 3.4. Analysis of PRRP

This section presents a brief analysis of the energy utilization in terms of energy consumed by cluster head nodes and the leaf nodes that can be linked to the life span of the CH node. Consider a WSN comprising ofN wireless sensor nodes that are uniformly distributed within a grid of size m
×
m, and within each grid cell one of the nodes acts as the cluster head (CH).CH spends its life in three modes, namely, receiving data samples from member nodes, transmitting its own data (and/or member nodes’ data), and sleep mode. LetE
i
n, E
t
h, E
r, and E
t, respectively, denote the initial energy, threshold energy, energy consumed during reception, and energy consumed during transmission of one data sample. Further, we assume that each data sample has a fixed size; therefore the transmitting time and the receiving time for each data sample are the same, namely, T
s. During each sampling interval, a CH, with k member nodes, spends T
t time for transmission, k
T
t time for receiving samples, and remaining T
s
-
(
k
+
1
)
T
t time in sleep mode. The CH is assumed to have died when its residual energy falls below the threshold (E
t
h) necessary for a node to function. Therefore, the life of the CH can be calculated in terms of the number of sampling intervals, N
s, as (4)
N
s
=
E
i
n
-
E
t
h
E
t
+
k
E
r
+
T
s
-
k
+
1
T
t
P
s
.


## 3.5. Proposed Routing Protocol PRRP Description

After system modeling, suitable gateways are identified from each cluster as all nodes are aware of their respective location and the distance from the sink and from their neighboring nodes. The selection of the gateway is based on parameters such as the node distance, number of nodes close to a particular node, and the energy threshold level. The energy threshold level is more significant than others. On this note, PRRP is therefore aimed to minimize the distance between the nodes and the gateway to save energy during data transmission. PRRP assumes that node’s data acquisition is event driven. That is, the majority of nodes will remain in sleep mode to save energy. It is assumed that type of all the sensed data within one grid is the same, so data aggregation can be applied and nodes will transfer their sensed data on a fixed schedule based on TDMA principle. Each node in PRRP will transmit its data to its closest neighbor. This is to ensure its transmission distance is shortest and therefore less energy is consumed for data transmission. It is noted that tree routing is an energy efficient routing mechanism; thus this mechanism is adopted in the proposed PRRP. A tree is built starting from the leaf nodes to the sink. The sink is placed in the center of the network instead of on the one end as in LEACH and CELRP. It should be mentioned here that, in PRRP, any node on the network can be a gateway but selection of a gateway is based on three parameters as mentioned earlier. Under the PRRP scheme, a node can only be allowed to join a tree if its energy is sufficient to survive for a complete round.An efficient distributed TDMA scheduling is used in the proposed PRRP. In this scheduling the radio module of the nonleaf node will be turned ON only for the assigned time slots instead of being ON for all times such as in LEACH protocol. In PRRP the number of leaf nodes and the distance from the nonleaf node is less as compared to LEACH and CELRP. Consequently energy conservation can be optimized based on stated technique. The distributed TDMA scheduling in PRRP strongly supports energy efficiency and good data throughput in the proposed PRRP.


### 3.5.1. The Proposed PRRP Algorithm

In PRRP, each round of processing time consists of four phases:(
1
) gateway selection (GS), (
2
) tree building (TB), (
3
) schedule building (SB), and (
4
) transmission of data (TD) as shown in Figure 2. Processing rounds will continue till the routing tree is broken due to the energy level of the gateway dropping below the threshold level.Figure 2
PRRP phases.In the first phase, GS process is completed on the basis of its position, its residual energy level, and the number of neighboring nodes around it. This gateway will be responsible for transferring the aggregated/collected data from the neighboring nodes to the sink. This phase starts with the message initiated from the sink with energy threshold level ofE
0. In the second phase (TB), a routing tree rooted at the sink is built. The newly formed tree will be based on two types of the sensor node such as nonleaf nodes and leaf nodes. Leaf node transmits sensed data from the monitored area to its parent. The nonleaf nodes act as the intermediate nodes to transmit data from lower to upper level of the tree. Based on this tree, a Time Division Multiple Access (TDMA) schedule subsequently is built in phase-3 (SB) in a distributed manner. In the final phase (TD), the data are transmitted from nodes to the sink based on the schedule prepared in phase-3, that is, the distributed TDMA scheduling.The time required to forward all data packets in a single round is denoted as one data transmission period. That is, a data transmission period may consist of multiple TDs. The TDs may be repeated numerous times in a single round, depending on the energy level of the gateways as illustrated in Figure2. For instance, in the second round, it has more TDs than in the 1st round. On another note, the number of data transmission periods in a single round shall depend on the application and the periodic events of the sensor network data collection. The PRRP process flow is depicted in Figure 3. Always in case of tree rebuilt, different sensor nodes will take part in that process, which will become source of equal energy distribution in the network. The energy consumption for overall network will be distributed fairly among all nodes. The following sections describe all the phases.Figure 3
PRRP process flow.


### 3.5.2. Gateway Selection

In the first phase a few nodes will be selected as gateways in such a manner as to minimize overall energy consumption in the WSN. The network is assumed to be divided into different grid cells and the cells are further divided into a number of tiers, sayn, on both sides of the sink. Initially the nodes in tier D
0 will be considered as the potential gateway candidates based on their energy level e, the distance from the sink d, and the number of neighboring nodes n. Some of these nodes are allowed to advertise themselves as gateways. However priority will be based on the residual energy in a node. A potential gateway will act as a gateway until its residual energy drops below a threshold value E
t
h. Following this, new gateways will be selected from the nodes of tier D
1. Again, the new selected nodes will act as gateways until their residual energy drop below E
t
h, and so on. When all tiers are considered and no more nodes can be selected as gateways based on the current E
t
h, a new round will start with a new lower E
t
h. The flow chart for gateway selection is given in Figure 4.Figure 4
Gateway selection flowchart.This mechanism will continue until the last tier(
D
n
) and with the second cycle the same process will be continued. However, in this time E
t
h by the sink will be little reduced by factor (
e
). The same mechanism will be continued for all tiers and all cycles until the end. The sink and sensor nodes will exchange messages using the CSMA mechanism. The node will remain ON until it receives the ADV message from the sink and then it sends theJOIN message. Since the node does not need a confirmation from the sink, it will go to sleep immediately after sending theJOIN message. The gateway selection is based on three different parameters such as energy level, number of neighboring nodes, and position from the sink. After selecting the gateways, the next phase will start to build the tree. The gateway nodes will initiate the process of building the tree. For further clarification for the mechanism of gateway selection, the algorithm in pseudocode is given in Algorithm 1.Algorithm 1:Gateway selection algorithm.
Step A:
Wait for sink advertisement message
IF (gateway Election → Gateway)
Message advertise
Wait for members’ joining request till T1
IF (number of joining members=
= 0)
Go to Step C
Form TDMA schedule and announce to all members
Step B:
Wait for data as per TDMA schedule
Data received
Process data: aggregation
Data transmit to sink
While (Gateway EnergyE
c
>
E
t
h)
Repeat from Step B
Repeat from Step A
ELSE (gateway Election → Normal node)
Step C:
Wait for gateway advertisement message
Send joining request
Wait for TDMA schedule to receive
Step D:
Wait for allotted slot
IF Energy available to transmit data
Send data
While (Gateway EnergyE
c
>
E
t
h)
Listen Broadcast from sink to gateway
Repeat from Step D
Repeat from Step A
ELSE
Node died
END IF


### 3.5.3. Tree Building

Upon completing the gateway selection the tree building phase is initiated. A tree rooted at the sink is built by using a modified version of the algorithm proposed in [82]. A tree is built by the sink broadcasting a control message containing six fields, namely,sender, position, type, level, parent, and energy. For a sender nodev, t
y
p
e
v represents its status in which 0 is for undefined status, 1 is for leaf node, and 2 is for nonleaf node. L
e
v
e
l
v refers to the number of hops from v to the sink. P
a
r
e
n
t
v is the next hop ofv in the path to the sink, e
n
e
r
g
y
v is the residual energy E
v, and P
v denotes the position of the node from the sink.Initially each node has status 0, while sink always have status 2, implying that sink is a nonleaf node. The sink broadcasts the message (s, 2, 0,NULL, ∞, P
s), wheres is the identifier of sink, 2 is the status of the sink,NULL indicates that there is no parent of the sink, ∞ indicates that the sink is connected to a power source, and P
s is the position of the sink. When a nodev receives a message (u,2, l
e
v
e
l
u, p
a
r
e
n
t
u, E
u, P
u) from nodeu, it becomes a leaf node, senses the channel until the channel is idle, and then waits for T
v
2 time duration. If the channel is still idle,v will broadcast message (v, 1, l
e
v
e
l
u
+1, u, E
v, P
v). Ifv receives message (u,1, l
e
v
e
l
u, p
a
r
e
n
t
u, E
u, P
u) fromu, it will sense the channel until it is idle, and it waits for T
v
1 time duration. If the channel is still idle,v broadcasts message (v,2,
l
e
v
e
l
v, p
a
r
e
n
t
v, E
v, P
v). Then, it becomes nonleaf node. If nodev receives more than one message from different nodes before broadcasting its message, it will select the node with larger energy and with the nearest distance to it as its parent. If multiple nodes have the same energy and distance,v will select one of them randomly. If there is another node occupying the common channel before its time is out, the waiting node will go back to sensing state. If a nodev receives message (w,2, l
e
v
e
l
w
, v, E
w, P
w) from nodew indicating thatv is its parent,v will broadcast message (v,2, l
e
v
e
l
v, p
a
r
e
n
t
v, E
v, P
v) immediately after the channel is idle explain why. By this process, eventually all gateways will be able to build a routing tree from nodes to the sink as shown in Figure 5.Figure 5
Showing final routing trees built among the different regions.


### 3.5.4. Schedule Building

The schedule building is the third phase for building an effective distributed scheduling scheme using TDMA principle for data transmission. The schedule is built on the assumption that all the nodes which are connected with the same gateway will transfer their data using same frequency. This assumption implies that nodes connecting to different gateways are using different frequencies for data transmission therefore simultaneous data transmission is allowed among the different trees. We have identified two time constants: Time Ready to Receive (TRR) and Time Ready to Transmit (TRT).T
R
R
v and T
R
T
v represent two different time slots: T
R
R
v, indicates when a node v is ready to receive from its children nodes and T
R
T
v shows when a node v can transmit to its parent towards the sink. The node wakeup time, during which its transceiver will stay in theON state, can be calculated using the values of T
R
T
v and T
R
R
v. For the leaf node, transmission time T
R
T
v is equal to the width of one time slot denoted as t
0, while reception time T
R
R
v is zero since it does not have any children.On the other hand, for nonleaf nodev,(5)
T
R
R
v
=
m
a
x
T
R
T
i
,
w
h
e
r
e
i
=
1,2
,
3
,
…
,
n
v
c
,
T
R
T
v
=
T
R
R
v
+
n
v
c
T
t
.In the above equationi show an index for the children of v node, n
v
c represents the count of v’s children which represents one data packet transmit time. As we select max function, the parent node will stay in theON state only when all of its children are ready to transmit, which is better than switching its state repeatedly fromOFF toON and back. Once the received data from children are aggregated then the parent can transfer the data to the next node. Initially, each leaf node will transmit its TRT value to its parent. After receiving TRT values from all of its children, the parent will calculate its TRT and TRR using above equation and then build a schedule for its children as shown in Figure 6.Figure 6
Building TRT and TRR scheduling time.The flow chart for building the schedule as explained above is given in Figure7.Figure 7
Flow chart for building time schedule.


### 3.5.5. Transmission of Data

The data transmission phase can be repeated many times for a same round of schedule but node will require energy to be alive. Nonleaf node will remainON for more slots for having responsibility to collect the data from its child and then transfer it to its parent, while the leaf nodes will beON only for one slot, just to transfer the data to its parent. For each node, a time slot labeled by T represents a time slot at which a node transmits data and a time slot labeled by R represents time slot at which a node receives data as shown in Figure 8.Figure 8
Data transmission scheduling.As a summary, in PRRP the WSN is divided into grid and cells and then into different tiers. Meanwhile, sink is assumed to be placed in the center of the topology. The nodes are distributed in random fashion with an assumption that they are aware of their position/location through Global Positioning System (GPS) or any other local means. The gateways are the nodes that are close to the sink, normally witht
i
e
r
0. Furthermore, the gateways are selected with other tiers on the basis of node energy level, its position from the sink, and the number of nodes in its neighbor. PRRP operates in different phases starting from the gateway selection up to the data transfer. A tree rooted at the sink is formed and then data is collected using a TDMA scheduling technique. PRRP assumes that node can only join its neighbor which is available within the same tier. In such case, the minimum distance is ensured and so energy can be saved during data transfer, whereby each node will select a parent among its closest neighbors to avoid a long distance data transfer. Consequently, the transmission range for nodes is always short. Each node can listen to the transmission of the nodes close to it or available within the same tier. This technique guarantees the distance among communicating nodes is minimum for data transfer hence saving energy.


## 3.5.1. The Proposed PRRP Algorithm

In PRRP, each round of processing time consists of four phases:(
1
) gateway selection (GS), (
2
) tree building (TB), (
3
) schedule building (SB), and (
4
) transmission of data (TD) as shown in Figure 2. Processing rounds will continue till the routing tree is broken due to the energy level of the gateway dropping below the threshold level.Figure 2
PRRP phases.In the first phase, GS process is completed on the basis of its position, its residual energy level, and the number of neighboring nodes around it. This gateway will be responsible for transferring the aggregated/collected data from the neighboring nodes to the sink. This phase starts with the message initiated from the sink with energy threshold level ofE
0. In the second phase (TB), a routing tree rooted at the sink is built. The newly formed tree will be based on two types of the sensor node such as nonleaf nodes and leaf nodes. Leaf node transmits sensed data from the monitored area to its parent. The nonleaf nodes act as the intermediate nodes to transmit data from lower to upper level of the tree. Based on this tree, a Time Division Multiple Access (TDMA) schedule subsequently is built in phase-3 (SB) in a distributed manner. In the final phase (TD), the data are transmitted from nodes to the sink based on the schedule prepared in phase-3, that is, the distributed TDMA scheduling.The time required to forward all data packets in a single round is denoted as one data transmission period. That is, a data transmission period may consist of multiple TDs. The TDs may be repeated numerous times in a single round, depending on the energy level of the gateways as illustrated in Figure2. For instance, in the second round, it has more TDs than in the 1st round. On another note, the number of data transmission periods in a single round shall depend on the application and the periodic events of the sensor network data collection. The PRRP process flow is depicted in Figure 3. Always in case of tree rebuilt, different sensor nodes will take part in that process, which will become source of equal energy distribution in the network. The energy consumption for overall network will be distributed fairly among all nodes. The following sections describe all the phases.Figure 3
PRRP process flow.


## 3.5.2. Gateway Selection

In the first phase a few nodes will be selected as gateways in such a manner as to minimize overall energy consumption in the WSN. The network is assumed to be divided into different grid cells and the cells are further divided into a number of tiers, sayn, on both sides of the sink. Initially the nodes in tier D
0 will be considered as the potential gateway candidates based on their energy level e, the distance from the sink d, and the number of neighboring nodes n. Some of these nodes are allowed to advertise themselves as gateways. However priority will be based on the residual energy in a node. A potential gateway will act as a gateway until its residual energy drops below a threshold value E
t
h. Following this, new gateways will be selected from the nodes of tier D
1. Again, the new selected nodes will act as gateways until their residual energy drop below E
t
h, and so on. When all tiers are considered and no more nodes can be selected as gateways based on the current E
t
h, a new round will start with a new lower E
t
h. The flow chart for gateway selection is given in Figure 4.Figure 4
Gateway selection flowchart.This mechanism will continue until the last tier(
D
n
) and with the second cycle the same process will be continued. However, in this time E
t
h by the sink will be little reduced by factor (
e
). The same mechanism will be continued for all tiers and all cycles until the end. The sink and sensor nodes will exchange messages using the CSMA mechanism. The node will remain ON until it receives the ADV message from the sink and then it sends theJOIN message. Since the node does not need a confirmation from the sink, it will go to sleep immediately after sending theJOIN message. The gateway selection is based on three different parameters such as energy level, number of neighboring nodes, and position from the sink. After selecting the gateways, the next phase will start to build the tree. The gateway nodes will initiate the process of building the tree. For further clarification for the mechanism of gateway selection, the algorithm in pseudocode is given in Algorithm 1.Algorithm 1:Gateway selection algorithm.
Step A:
Wait for sink advertisement message
IF (gateway Election → Gateway)
Message advertise
Wait for members’ joining request till T1
IF (number of joining members=
= 0)
Go to Step C
Form TDMA schedule and announce to all members
Step B:
Wait for data as per TDMA schedule
Data received
Process data: aggregation
Data transmit to sink
While (Gateway EnergyE
c
>
E
t
h)
Repeat from Step B
Repeat from Step A
ELSE (gateway Election → Normal node)
Step C:
Wait for gateway advertisement message
Send joining request
Wait for TDMA schedule to receive
Step D:
Wait for allotted slot
IF Energy available to transmit data
Send data
While (Gateway EnergyE
c
>
E
t
h)
Listen Broadcast from sink to gateway
Repeat from Step D
Repeat from Step A
ELSE
Node died
END IF


## 3.5.3. Tree Building

Upon completing the gateway selection the tree building phase is initiated. A tree rooted at the sink is built by using a modified version of the algorithm proposed in [82]. A tree is built by the sink broadcasting a control message containing six fields, namely,sender, position, type, level, parent, and energy. For a sender nodev, t
y
p
e
v represents its status in which 0 is for undefined status, 1 is for leaf node, and 2 is for nonleaf node. L
e
v
e
l
v refers to the number of hops from v to the sink. P
a
r
e
n
t
v is the next hop ofv in the path to the sink, e
n
e
r
g
y
v is the residual energy E
v, and P
v denotes the position of the node from the sink.Initially each node has status 0, while sink always have status 2, implying that sink is a nonleaf node. The sink broadcasts the message (s, 2, 0,NULL, ∞, P
s), wheres is the identifier of sink, 2 is the status of the sink,NULL indicates that there is no parent of the sink, ∞ indicates that the sink is connected to a power source, and P
s is the position of the sink. When a nodev receives a message (u,2, l
e
v
e
l
u, p
a
r
e
n
t
u, E
u, P
u) from nodeu, it becomes a leaf node, senses the channel until the channel is idle, and then waits for T
v
2 time duration. If the channel is still idle,v will broadcast message (v, 1, l
e
v
e
l
u
+1, u, E
v, P
v). Ifv receives message (u,1, l
e
v
e
l
u, p
a
r
e
n
t
u, E
u, P
u) fromu, it will sense the channel until it is idle, and it waits for T
v
1 time duration. If the channel is still idle,v broadcasts message (v,2,
l
e
v
e
l
v, p
a
r
e
n
t
v, E
v, P
v). Then, it becomes nonleaf node. If nodev receives more than one message from different nodes before broadcasting its message, it will select the node with larger energy and with the nearest distance to it as its parent. If multiple nodes have the same energy and distance,v will select one of them randomly. If there is another node occupying the common channel before its time is out, the waiting node will go back to sensing state. If a nodev receives message (w,2, l
e
v
e
l
w
, v, E
w, P
w) from nodew indicating thatv is its parent,v will broadcast message (v,2, l
e
v
e
l
v, p
a
r
e
n
t
v, E
v, P
v) immediately after the channel is idle explain why. By this process, eventually all gateways will be able to build a routing tree from nodes to the sink as shown in Figure 5.Figure 5
Showing final routing trees built among the different regions.


## 3.5.4. Schedule Building

The schedule building is the third phase for building an effective distributed scheduling scheme using TDMA principle for data transmission. The schedule is built on the assumption that all the nodes which are connected with the same gateway will transfer their data using same frequency. This assumption implies that nodes connecting to different gateways are using different frequencies for data transmission therefore simultaneous data transmission is allowed among the different trees. We have identified two time constants: Time Ready to Receive (TRR) and Time Ready to Transmit (TRT).T
R
R
v and T
R
T
v represent two different time slots: T
R
R
v, indicates when a node v is ready to receive from its children nodes and T
R
T
v shows when a node v can transmit to its parent towards the sink. The node wakeup time, during which its transceiver will stay in theON state, can be calculated using the values of T
R
T
v and T
R
R
v. For the leaf node, transmission time T
R
T
v is equal to the width of one time slot denoted as t
0, while reception time T
R
R
v is zero since it does not have any children.On the other hand, for nonleaf nodev,(5)
T
R
R
v
=
m
a
x
T
R
T
i
,
w
h
e
r
e
i
=
1,2
,
3
,
…
,
n
v
c
,
T
R
T
v
=
T
R
R
v
+
n
v
c
T
t
.In the above equationi show an index for the children of v node, n
v
c represents the count of v’s children which represents one data packet transmit time. As we select max function, the parent node will stay in theON state only when all of its children are ready to transmit, which is better than switching its state repeatedly fromOFF toON and back. Once the received data from children are aggregated then the parent can transfer the data to the next node. Initially, each leaf node will transmit its TRT value to its parent. After receiving TRT values from all of its children, the parent will calculate its TRT and TRR using above equation and then build a schedule for its children as shown in Figure 6.Figure 6
Building TRT and TRR scheduling time.The flow chart for building the schedule as explained above is given in Figure7.Figure 7
Flow chart for building time schedule.


## 3.5.5. Transmission of Data

The data transmission phase can be repeated many times for a same round of schedule but node will require energy to be alive. Nonleaf node will remainON for more slots for having responsibility to collect the data from its child and then transfer it to its parent, while the leaf nodes will beON only for one slot, just to transfer the data to its parent. For each node, a time slot labeled by T represents a time slot at which a node transmits data and a time slot labeled by R represents time slot at which a node receives data as shown in Figure 8.Figure 8
Data transmission scheduling.As a summary, in PRRP the WSN is divided into grid and cells and then into different tiers. Meanwhile, sink is assumed to be placed in the center of the topology. The nodes are distributed in random fashion with an assumption that they are aware of their position/location through Global Positioning System (GPS) or any other local means. The gateways are the nodes that are close to the sink, normally witht
i
e
r
0. Furthermore, the gateways are selected with other tiers on the basis of node energy level, its position from the sink, and the number of nodes in its neighbor. PRRP operates in different phases starting from the gateway selection up to the data transfer. A tree rooted at the sink is formed and then data is collected using a TDMA scheduling technique. PRRP assumes that node can only join its neighbor which is available within the same tier. In such case, the minimum distance is ensured and so energy can be saved during data transfer, whereby each node will select a parent among its closest neighbors to avoid a long distance data transfer. Consequently, the transmission range for nodes is always short. Each node can listen to the transmission of the nodes close to it or available within the same tier. This technique guarantees the distance among communicating nodes is minimum for data transfer hence saving energy.


## 4. Performance Evaluations

### 4.1. Simulation Parameters

Simulation parameters are shown in Table1, while few assumptions were made on the basis widely available in literature review such as the fact that there will be no message loss as the physical channel will be reliable. The coverage of the radio is in circular direction and antenna is in omnidirection; nodes are distributed in open area [81, 82].Table 1
Simulation parameters.
Parameter
Value
Network area
200 m × 200 m or 400 m × 400 m
Number of sensors
200 or 400
Sensor distribution
Uniform random
Location of the sink
Center of the area
Radio range
50 m
MAC layer
IEEE 802.11
Unusual event sources
4
Routine data source probability
P
Failure rate
F
Time-out constant
1
/
r
Delay for retransmissionM
0.02 s
Maximum communication distance between two nodes (d)
√2 × 5 m
Electronics energy (E
e
l
e
c)
50 nJ/bit
Amplifier energy (E
a
m
p)
100 pJ/bit/m2
Initial energy in each node
2 J
Control packet size
48 bytes
Data packet size
100 bytes
E
t
h
r
e
s
h
o
l
d (single data transmission period)
4 × 10−4 J
E
t
h (initial)
1 J
e
0.5


### 4.2. Comparative Analysis between PRRP and LEACH

In this section, it is attempted to compare PRRP protocol with LEACH. Principally, PRRP is similar to LEACH protocol in which any node can communicate with the sink and the data collection or transmission mechanism is the time based schedule. The differences between them lie on several factors. Firstly, in LEACH the clusters and cluster heads are formed within each cluster for the data transmission. Those cluster heads normally are responsible for collecting the data from their related clusters and then transfer it to the sink. On the other hand, a tree in PRRP is constructed rooted to the sink and the gateways are responsible for transferring the data to the sink. Finally, the number of children is less in PRRP compared with LEACH. On comparing the performance evaluation among LEACH and PRRP on different aspects such as energy efficiency, number of live nodes, network throughput/goodput, and average consumed energy per packet for different data transmission periods, it is observed that, in LEACH, there are two types of sensor nodes such as nonhead node and cluster head while in PRRP there are three types of the sensor nodes such as gateway nodes, leaf nodes, and nonleaf nodes. Energy can be consumed in both protocols during transmitting, receiving, and idle listening state.While comparing both protocols after several periods of data transmission, PRRP showed significant improvement as illustrated in Figure9, collectively for all rounds together including 1, 5, and 10 rounds altogether. Simulation results illustrate that with PRRP nodes can stay longer and utilize their maximum possible energy for longer time period. For example, after a 10-round test run, the figure shows that the last node of the LEACH protocol dies after 275 seconds while PRRP nodes start dying after 350 seconds.Figure 9
Number of live nodes versus time (collectively for 1, 5, and 10 rounds).


#### 4.2.1. Comparative Analysis: Total Energy Consumed

In PRRP, during tree formation phase nodes can transmit signals with minimum energy level as closer node can be selected by the parent which saves the node energy by reducing distance. In PRRP, parent can be any node and can select the closer nodes to save its energy level. However, LEACH does not consider the location or the distance among nodes with an assumption that each node can hear all other nodes in the network. The transmission distance is shorter in PRRP. In LEACH, the main reasons for energy consumption are, for example, longer distance among the nodes and cluster head and that nodes randomly advertise themselves as cluster heads based on the energy level of the nodes. In LEACH, with most of the cases nominated cluster heads are at longer distance from the normal nodes which becomes one more reason for energy loss compared to PRRP. Furthermore, by comparing nonleaf node and the cluster head node of LEACH, it can be seen that nonleaf nodes in PRRP consume little energy due to the idle listening state while they wait to receive and transmit data at the specific time slots only, while LEACH has different approach completely. In addition each cluster head has more number of children compared to PRRP and cluster head requires more time to be in ON state which becomes one more reason for comparatively more energy loss than PRRP.Figure10 shows an illustration for different rounds among LEACH and PRRP; if compared with 10 data transmission periods at (t
=
150) seconds, total consumed energy is around 220 J in LEACH and 120 J in PRRP. The consumed energy is dropped which is quite significant, though PRRP shows significant improvement for overall energy consumed compared till the end of the network lifetime and higher throughput for the same initial energy level.Figure 10
Total consumed energy versus time (LEACH and PRRP).


#### 4.2.2. Comparative Analysis on per Packet Average Consumed Energy

When comparing PRRP with LEACH on the basis of average energy consumed per packet, it is found that PRRP consumes less energy as shown in Figure11. The observations show that, in PRRP with the initial data transmission periods, the average consumed energy is higher. On the other hand, when comparing PRRP and LEACH with more rounds of data transfer, it is found that PRRP is more efficient than LEACH. The reason for more average energy consumed in the initial round in PRRP protocol with single data transmission phase is that the initial setup cost is little higher and energy consumed in initial phases is considered to be overhead energy. However, PRRP outperforms LEACH for average per packet energy use after completing its entire round.Figure 11
Average consumed energy per packet (PRRP and LEACH).


#### 4.2.3. Comparative Analysis on the Basis of Throughput

Table2 describes the network throughput comparison between LEACH and PRRP in terms of the data packets delivery to the sink. Simulation results show significant improvement of network throughput for all rounds including 01, 05, and 10. PRRP saves a great amount of energy during data transmission phase for multiple periods. Overall significant performance improvement is seen based on several factors such as enhancement in the network life time, energy efficiency, and utilizing maximum possible energy of each individual sensor network node; with the increase in rounds, the network throughput even increases more.Table 2
A comparison between PRRP and LEACH in terms of throughput.
Periods
PRRP
LEACH
Improvement with PRRP in %
1 data transmission period
15834
3607
4.38 times
5 data transmission periods
53950
13045
4.13 times
10 data transmission periods
64100
25640
2.50 times


### 4.3. Comparative Analysis between PRRP and CELRP

This section is aimed at comparing PRRP and CELRP based on their operation and node types, as described earlier that in PRRP there are three types of the nodes including nonleaf node, leaf node, and gateway nodes, while in CELRP the situation is different where nodes are either cluster head or nonhead nodes while cluster head leader (CHL) can be chosen from available cluster heads. The sink in CELRP is placed outside of the network which increased the distance from among the cluster heads, cluster head leaders, and the sink, while the situation is different with PRRP where the sink is placed in the center of the network and all nodes are fairly distributed around it which becomes one of the main reasons for lower distance among the nodes and the sink. Figure12 shows a great difference among PRRP and CELRP for different periods such as 01, 05, and 10. PRRP outperforms CELRP with the increase of periods as it can be observed. PRRP allows any node to become gateway provided on its energy level, if it distributes fairly energy consumption for the entire network, while the situation is the different in CELRP.Figure 12
Number of live nodes versus time (PRRP and LEACH collectively).


#### 4.3.1. Comparative Analysis: Total Energy Consumed

Tree building, effective TDMA scheduling, and data transmission phases are the strength of PRRP; each phase has an edge over CELRP. In PRRP, during tree building nodes normally transmit signals with minimum energy level as closer nodes can be selected by the parents. This technique is ensuring to reduce the distance among the parent and child node as energy can be saved during data transmission. In addition with PRRP the sink is also placed in the center of the network to reduce the overall distance for each sensor node including leaf node, nonleaf node, and gateways. PRRP also has consideration for location of neighboring nodes in order to reduce the data transmitting distance. The situation is different with CELRP where nodes can act as normal nodes, cluster heads, and cluster head leaders while sink is placed outside the distance. Hence longer data transmission distances become one of the major reasons for more energy loss compared with PRRP. Figure13 shows significant difference among results for total consumed energy for different rounds such as 01, 05, and 10, respectively. In PRRP an effective TDMA schedule is also implemented for transmitting data on their respective times and in addition to keep nodesON only for required time slots which has great effects on overall energy efficiency of sensor network and can be observed through Figure 13.Figure 13
Total consumed energy versus time (CELRP and PRRP).As an illustration, we can compare results of PRRP and CELRP at any stage in Figure13; consider for 10 data transmission periods at (t
=
150) seconds consumed energy is 230 J in CELRP and 140 J in PRRP. The consumed energy is dropped which is quite significant. Overall performance of PRRP over CELRP is significant as can be noticed from Figure 13.


#### 4.3.2. Comparative Analysis: Per Packet Average Consumed Energy

In this analysis, PRRP and CELRP protocol are compared on the basis of the average consumed energy per packet as shown in Figure14. It is found from our observations that CELRP initially shows good performance for average energy per packet compared to PRRP. However, after a short span of time PRRP shows a significant improvement in it with the increased number of data periods.Figure 14
Average consumed energy per packet (PRRP and CLERP).On the other hand, when comparing PRRP and CELRP with more rounds of data transfer, it is found that PRRP is more efficient than CELRP. In PRRP, the reason for more average energy consumed at the initial round is that the three initial phases are for setup and there is no data transmission during this. So, the energy consumed in these initial phases is considered to be overhead energy, which is more than the energy saved in data transmission phase for first period. PRRP stands for high performance for average per packet energy use after completing its entire round and especially after continuing its several transmission periods with its initial build tree.


#### 4.3.3. Comparative Analysis on the Basis of Throughput

Following Table3 describes the network throughput comparison between PRRP and CELRP in term of the data packets delivery to the sink. Simulation results show significant improvement of network throughput for all rounds including 01, 05, and 10. PRRP saves a great amount of energy during data transmission phase for multiple periods. Overall significant performance improvement is seen based on several factors such as enhancement in the network life time, energy efficiency, and utilizing maximum possible energy of each individual sensor network node; with the increase in rounds, the network throughput even increases more.Table 3
A comparison between PRRP and CELRP in terms of throughput.
Periods
PRRP
CELRP
Improvement with PRRP%
1 data transmission period
16733
5950
2.81 times
5 data transmission periods
54555
19985
2.72 times
10 data transmission periods
65305
35710
1.82 times


## 4.1. Simulation Parameters

Simulation parameters are shown in Table1, while few assumptions were made on the basis widely available in literature review such as the fact that there will be no message loss as the physical channel will be reliable. The coverage of the radio is in circular direction and antenna is in omnidirection; nodes are distributed in open area [81, 82].Table 1
Simulation parameters.
Parameter
Value
Network area
200 m × 200 m or 400 m × 400 m
Number of sensors
200 or 400
Sensor distribution
Uniform random
Location of the sink
Center of the area
Radio range
50 m
MAC layer
IEEE 802.11
Unusual event sources
4
Routine data source probability
P
Failure rate
F
Time-out constant
1
/
r
Delay for retransmissionM
0.02 s
Maximum communication distance between two nodes (d)
√2 × 5 m
Electronics energy (E
e
l
e
c)
50 nJ/bit
Amplifier energy (E
a
m
p)
100 pJ/bit/m2
Initial energy in each node
2 J
Control packet size
48 bytes
Data packet size
100 bytes
E
t
h
r
e
s
h
o
l
d (single data transmission period)
4 × 10−4 J
E
t
h (initial)
1 J
e
0.5


## 4.2. Comparative Analysis between PRRP and LEACH

In this section, it is attempted to compare PRRP protocol with LEACH. Principally, PRRP is similar to LEACH protocol in which any node can communicate with the sink and the data collection or transmission mechanism is the time based schedule. The differences between them lie on several factors. Firstly, in LEACH the clusters and cluster heads are formed within each cluster for the data transmission. Those cluster heads normally are responsible for collecting the data from their related clusters and then transfer it to the sink. On the other hand, a tree in PRRP is constructed rooted to the sink and the gateways are responsible for transferring the data to the sink. Finally, the number of children is less in PRRP compared with LEACH. On comparing the performance evaluation among LEACH and PRRP on different aspects such as energy efficiency, number of live nodes, network throughput/goodput, and average consumed energy per packet for different data transmission periods, it is observed that, in LEACH, there are two types of sensor nodes such as nonhead node and cluster head while in PRRP there are three types of the sensor nodes such as gateway nodes, leaf nodes, and nonleaf nodes. Energy can be consumed in both protocols during transmitting, receiving, and idle listening state.While comparing both protocols after several periods of data transmission, PRRP showed significant improvement as illustrated in Figure9, collectively for all rounds together including 1, 5, and 10 rounds altogether. Simulation results illustrate that with PRRP nodes can stay longer and utilize their maximum possible energy for longer time period. For example, after a 10-round test run, the figure shows that the last node of the LEACH protocol dies after 275 seconds while PRRP nodes start dying after 350 seconds.Figure 9
Number of live nodes versus time (collectively for 1, 5, and 10 rounds).


### 4.2.1. Comparative Analysis: Total Energy Consumed

In PRRP, during tree formation phase nodes can transmit signals with minimum energy level as closer node can be selected by the parent which saves the node energy by reducing distance. In PRRP, parent can be any node and can select the closer nodes to save its energy level. However, LEACH does not consider the location or the distance among nodes with an assumption that each node can hear all other nodes in the network. The transmission distance is shorter in PRRP. In LEACH, the main reasons for energy consumption are, for example, longer distance among the nodes and cluster head and that nodes randomly advertise themselves as cluster heads based on the energy level of the nodes. In LEACH, with most of the cases nominated cluster heads are at longer distance from the normal nodes which becomes one more reason for energy loss compared to PRRP. Furthermore, by comparing nonleaf node and the cluster head node of LEACH, it can be seen that nonleaf nodes in PRRP consume little energy due to the idle listening state while they wait to receive and transmit data at the specific time slots only, while LEACH has different approach completely. In addition each cluster head has more number of children compared to PRRP and cluster head requires more time to be in ON state which becomes one more reason for comparatively more energy loss than PRRP.Figure10 shows an illustration for different rounds among LEACH and PRRP; if compared with 10 data transmission periods at (t
=
150) seconds, total consumed energy is around 220 J in LEACH and 120 J in PRRP. The consumed energy is dropped which is quite significant, though PRRP shows significant improvement for overall energy consumed compared till the end of the network lifetime and higher throughput for the same initial energy level.Figure 10
Total consumed energy versus time (LEACH and PRRP).


### 4.2.2. Comparative Analysis on per Packet Average Consumed Energy

When comparing PRRP with LEACH on the basis of average energy consumed per packet, it is found that PRRP consumes less energy as shown in Figure11. The observations show that, in PRRP with the initial data transmission periods, the average consumed energy is higher. On the other hand, when comparing PRRP and LEACH with more rounds of data transfer, it is found that PRRP is more efficient than LEACH. The reason for more average energy consumed in the initial round in PRRP protocol with single data transmission phase is that the initial setup cost is little higher and energy consumed in initial phases is considered to be overhead energy. However, PRRP outperforms LEACH for average per packet energy use after completing its entire round.Figure 11
Average consumed energy per packet (PRRP and LEACH).


### 4.2.3. Comparative Analysis on the Basis of Throughput

Table2 describes the network throughput comparison between LEACH and PRRP in terms of the data packets delivery to the sink. Simulation results show significant improvement of network throughput for all rounds including 01, 05, and 10. PRRP saves a great amount of energy during data transmission phase for multiple periods. Overall significant performance improvement is seen based on several factors such as enhancement in the network life time, energy efficiency, and utilizing maximum possible energy of each individual sensor network node; with the increase in rounds, the network throughput even increases more.Table 2
A comparison between PRRP and LEACH in terms of throughput.
Periods
PRRP
LEACH
Improvement with PRRP in %
1 data transmission period
15834
3607
4.38 times
5 data transmission periods
53950
13045
4.13 times
10 data transmission periods
64100
25640
2.50 times


## 4.2.1. Comparative Analysis: Total Energy Consumed

In PRRP, during tree formation phase nodes can transmit signals with minimum energy level as closer node can be selected by the parent which saves the node energy by reducing distance. In PRRP, parent can be any node and can select the closer nodes to save its energy level. However, LEACH does not consider the location or the distance among nodes with an assumption that each node can hear all other nodes in the network. The transmission distance is shorter in PRRP. In LEACH, the main reasons for energy consumption are, for example, longer distance among the nodes and cluster head and that nodes randomly advertise themselves as cluster heads based on the energy level of the nodes. In LEACH, with most of the cases nominated cluster heads are at longer distance from the normal nodes which becomes one more reason for energy loss compared to PRRP. Furthermore, by comparing nonleaf node and the cluster head node of LEACH, it can be seen that nonleaf nodes in PRRP consume little energy due to the idle listening state while they wait to receive and transmit data at the specific time slots only, while LEACH has different approach completely. In addition each cluster head has more number of children compared to PRRP and cluster head requires more time to be in ON state which becomes one more reason for comparatively more energy loss than PRRP.Figure10 shows an illustration for different rounds among LEACH and PRRP; if compared with 10 data transmission periods at (t
=
150) seconds, total consumed energy is around 220 J in LEACH and 120 J in PRRP. The consumed energy is dropped which is quite significant, though PRRP shows significant improvement for overall energy consumed compared till the end of the network lifetime and higher throughput for the same initial energy level.Figure 10
Total consumed energy versus time (LEACH and PRRP).


## 4.2.2. Comparative Analysis on per Packet Average Consumed Energy

When comparing PRRP with LEACH on the basis of average energy consumed per packet, it is found that PRRP consumes less energy as shown in Figure11. The observations show that, in PRRP with the initial data transmission periods, the average consumed energy is higher. On the other hand, when comparing PRRP and LEACH with more rounds of data transfer, it is found that PRRP is more efficient than LEACH. The reason for more average energy consumed in the initial round in PRRP protocol with single data transmission phase is that the initial setup cost is little higher and energy consumed in initial phases is considered to be overhead energy. However, PRRP outperforms LEACH for average per packet energy use after completing its entire round.Figure 11
Average consumed energy per packet (PRRP and LEACH).


## 4.2.3. Comparative Analysis on the Basis of Throughput

Table2 describes the network throughput comparison between LEACH and PRRP in terms of the data packets delivery to the sink. Simulation results show significant improvement of network throughput for all rounds including 01, 05, and 10. PRRP saves a great amount of energy during data transmission phase for multiple periods. Overall significant performance improvement is seen based on several factors such as enhancement in the network life time, energy efficiency, and utilizing maximum possible energy of each individual sensor network node; with the increase in rounds, the network throughput even increases more.Table 2
A comparison between PRRP and LEACH in terms of throughput.
Periods
PRRP
LEACH
Improvement with PRRP in %
1 data transmission period
15834
3607
4.38 times
5 data transmission periods
53950
13045
4.13 times
10 data transmission periods
64100
25640
2.50 times


## 4.3. Comparative Analysis between PRRP and CELRP

This section is aimed at comparing PRRP and CELRP based on their operation and node types, as described earlier that in PRRP there are three types of the nodes including nonleaf node, leaf node, and gateway nodes, while in CELRP the situation is different where nodes are either cluster head or nonhead nodes while cluster head leader (CHL) can be chosen from available cluster heads. The sink in CELRP is placed outside of the network which increased the distance from among the cluster heads, cluster head leaders, and the sink, while the situation is different with PRRP where the sink is placed in the center of the network and all nodes are fairly distributed around it which becomes one of the main reasons for lower distance among the nodes and the sink. Figure12 shows a great difference among PRRP and CELRP for different periods such as 01, 05, and 10. PRRP outperforms CELRP with the increase of periods as it can be observed. PRRP allows any node to become gateway provided on its energy level, if it distributes fairly energy consumption for the entire network, while the situation is the different in CELRP.Figure 12
Number of live nodes versus time (PRRP and LEACH collectively).


### 4.3.1. Comparative Analysis: Total Energy Consumed

Tree building, effective TDMA scheduling, and data transmission phases are the strength of PRRP; each phase has an edge over CELRP. In PRRP, during tree building nodes normally transmit signals with minimum energy level as closer nodes can be selected by the parents. This technique is ensuring to reduce the distance among the parent and child node as energy can be saved during data transmission. In addition with PRRP the sink is also placed in the center of the network to reduce the overall distance for each sensor node including leaf node, nonleaf node, and gateways. PRRP also has consideration for location of neighboring nodes in order to reduce the data transmitting distance. The situation is different with CELRP where nodes can act as normal nodes, cluster heads, and cluster head leaders while sink is placed outside the distance. Hence longer data transmission distances become one of the major reasons for more energy loss compared with PRRP. Figure13 shows significant difference among results for total consumed energy for different rounds such as 01, 05, and 10, respectively. In PRRP an effective TDMA schedule is also implemented for transmitting data on their respective times and in addition to keep nodesON only for required time slots which has great effects on overall energy efficiency of sensor network and can be observed through Figure 13.Figure 13
Total consumed energy versus time (CELRP and PRRP).As an illustration, we can compare results of PRRP and CELRP at any stage in Figure13; consider for 10 data transmission periods at (t
=
150) seconds consumed energy is 230 J in CELRP and 140 J in PRRP. The consumed energy is dropped which is quite significant. Overall performance of PRRP over CELRP is significant as can be noticed from Figure 13.


### 4.3.2. Comparative Analysis: Per Packet Average Consumed Energy

In this analysis, PRRP and CELRP protocol are compared on the basis of the average consumed energy per packet as shown in Figure14. It is found from our observations that CELRP initially shows good performance for average energy per packet compared to PRRP. However, after a short span of time PRRP shows a significant improvement in it with the increased number of data periods.Figure 14
Average consumed energy per packet (PRRP and CLERP).On the other hand, when comparing PRRP and CELRP with more rounds of data transfer, it is found that PRRP is more efficient than CELRP. In PRRP, the reason for more average energy consumed at the initial round is that the three initial phases are for setup and there is no data transmission during this. So, the energy consumed in these initial phases is considered to be overhead energy, which is more than the energy saved in data transmission phase for first period. PRRP stands for high performance for average per packet energy use after completing its entire round and especially after continuing its several transmission periods with its initial build tree.


### 4.3.3. Comparative Analysis on the Basis of Throughput

Following Table3 describes the network throughput comparison between PRRP and CELRP in term of the data packets delivery to the sink. Simulation results show significant improvement of network throughput for all rounds including 01, 05, and 10. PRRP saves a great amount of energy during data transmission phase for multiple periods. Overall significant performance improvement is seen based on several factors such as enhancement in the network life time, energy efficiency, and utilizing maximum possible energy of each individual sensor network node; with the increase in rounds, the network throughput even increases more.Table 3
A comparison between PRRP and CELRP in terms of throughput.
Periods
PRRP
CELRP
Improvement with PRRP%
1 data transmission period
16733
5950
2.81 times
5 data transmission periods
54555
19985
2.72 times
10 data transmission periods
65305
35710
1.82 times


## 4.3.1. Comparative Analysis: Total Energy Consumed

Tree building, effective TDMA scheduling, and data transmission phases are the strength of PRRP; each phase has an edge over CELRP. In PRRP, during tree building nodes normally transmit signals with minimum energy level as closer nodes can be selected by the parents. This technique is ensuring to reduce the distance among the parent and child node as energy can be saved during data transmission. In addition with PRRP the sink is also placed in the center of the network to reduce the overall distance for each sensor node including leaf node, nonleaf node, and gateways. PRRP also has consideration for location of neighboring nodes in order to reduce the data transmitting distance. The situation is different with CELRP where nodes can act as normal nodes, cluster heads, and cluster head leaders while sink is placed outside the distance. Hence longer data transmission distances become one of the major reasons for more energy loss compared with PRRP. Figure13 shows significant difference among results for total consumed energy for different rounds such as 01, 05, and 10, respectively. In PRRP an effective TDMA schedule is also implemented for transmitting data on their respective times and in addition to keep nodesON only for required time slots which has great effects on overall energy efficiency of sensor network and can be observed through Figure 13.Figure 13
Total consumed energy versus time (CELRP and PRRP).As an illustration, we can compare results of PRRP and CELRP at any stage in Figure13; consider for 10 data transmission periods at (t
=
150) seconds consumed energy is 230 J in CELRP and 140 J in PRRP. The consumed energy is dropped which is quite significant. Overall performance of PRRP over CELRP is significant as can be noticed from Figure 13.


## 4.3.2. Comparative Analysis: Per Packet Average Consumed Energy

In this analysis, PRRP and CELRP protocol are compared on the basis of the average consumed energy per packet as shown in Figure14. It is found from our observations that CELRP initially shows good performance for average energy per packet compared to PRRP. However, after a short span of time PRRP shows a significant improvement in it with the increased number of data periods.Figure 14
Average consumed energy per packet (PRRP and CLERP).On the other hand, when comparing PRRP and CELRP with more rounds of data transfer, it is found that PRRP is more efficient than CELRP. In PRRP, the reason for more average energy consumed at the initial round is that the three initial phases are for setup and there is no data transmission during this. So, the energy consumed in these initial phases is considered to be overhead energy, which is more than the energy saved in data transmission phase for first period. PRRP stands for high performance for average per packet energy use after completing its entire round and especially after continuing its several transmission periods with its initial build tree.


## 4.3.3. Comparative Analysis on the Basis of Throughput

Following Table3 describes the network throughput comparison between PRRP and CELRP in term of the data packets delivery to the sink. Simulation results show significant improvement of network throughput for all rounds including 01, 05, and 10. PRRP saves a great amount of energy during data transmission phase for multiple periods. Overall significant performance improvement is seen based on several factors such as enhancement in the network life time, energy efficiency, and utilizing maximum possible energy of each individual sensor network node; with the increase in rounds, the network throughput even increases more.Table 3
A comparison between PRRP and CELRP in terms of throughput.
Periods
PRRP
CELRP
Improvement with PRRP%
1 data transmission period
16733
5950
2.81 times
5 data transmission periods
54555
19985
2.72 times
10 data transmission periods
65305
35710
1.82 times


## 5. Conclusion

The performance of PRRP is evaluated on the basis of energy lifetime, average energy consumption of the network both individually and per packet basis, and the network throughput. The theme is to discuss the results of PRRP and its performance as compared to the existing routing protocols such as LEACH and CELRP. PRRP shows better results when compared with LEACH, where PRRP shows an impressive performance in the form of improving the network lifetime (by reducing the energy consumption) and the network throughput. The throughput is increased by 2.5 times and network lifetime is improved by more than 50% while the energy consumption per packet is reduced to less than 50%. The comparative analysis of PRRP against CELRP shows that PRRP increased the throughput of the network by 1.82 times, network lifetime is improved more than 35%, and the energy consumption is reduced by more than 35%.



---

*Source: 9278701-2016-06-26.xml*