# AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

Authors: Farzad Kiani
Journal: Journal of Sensors
 (2016)

---

## Abstract

Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase), the sensors are placed into virtual layers. The second phase (data transmission) is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.


---

## Body

## 1. Introduction

Wireless ad hoc networks are considered a great development in the autonomous systems technology. They are divided into two big general categories so one of them is wireless sensor networks (WSNs). These networks have played an important role in the development of intelligent systems because they are cheap, scalable, and flexible. These networks include large numbers of inexpensive, small-size sensor nodes and a few base stations (BS) or sinks so the sensor nodes have limited battery, throughput, and memory [1] and sensitive channel controls [2]. These nodes with low-powered sensing devices equipped for mobilization are deployed on animals, birds, plants, or humans to achieve better targeting and data fidelity. They form a wireless network by creating a communication system amongst themselves. Then, the sensor nodes sense and process a phenomenon and send their results to the BS or sink. WSNs can be used in different applications such as military applications, forests, monitoring systems, agriculture, and medicine. Despite the various applications of these networks, they suffer from resource constraints as energy and memory. Therefore, researchers focus more on the constraints and balancing between resources and goals of system issues when they want to design any model for WSNs applications. One of the most important constraints is energy matter [3]. There are two types of energy consumption between sensor nodes. The first is energy consumption in communications and the second is consumption in computations. Obviously, communications consume more energy according to consumption computations. Therefore, minimizing communication costs is an important issue. Researchers propose different approaches to this goal such as energy efficiency by routing techniques, data aggregation, and duty cycle techniques. Sometimes, there are conflicts between some system targets such as reliability and energy saving. If the system designer wants high reliability performance, the sensor nodes will waste more energy. Therefore, designers must be careful about the balancing issue in the network [3].The communication architecture and stack protocol of WSN have five layers and three planes [1, 4]. These layers are physical layer, data link layer, network layer, transport layer, and application layer. The planes are power management plane, mobility management plane, and task management plane. One important layer is the network layer. The network layer handles collected data from source node to destination node. Routing protocols in WSNs are different than traditional routing protocols in several respects. For example, they do not use ID-addresses or fix routes schemas in the routing processes. Therefore, the IP-based routing protocols cannot be used in the WSNs. A routing protocol should be attending to the limitations of network resources as energy, communication bandwidth, memory, and computational capabilities. Proper management of these limitations can increase the network lifetime. Additionally, a routing protocol can consider faulting tolerance, latency, data aggregation, energy efficiency, and providing internetworking with external networks-gateway principles [3, 6]. It should be noted that the data link layer handles how two nodes talk to each other and the network layer is responsible for deciding which node talks [4].Many tasks of the above layers can be achieved by designing an aware-routing protocol and considering the importance of the balance issue between system goals and resources. In this paper, we proposed a new aware-routing protocol based on recursive searching method and implemented it for monitoring agriculture and university environments. One of the important goals in the routing algorithms is energy efficiency where the selective paths can increase network lifetime. In most applications, sensor nodes can aggregate data and send reached packets to the BS/sink. In the multihop networks, some of the sensor nodes are intermediate nodes for data transmission between two nodes. Figure1 shows a sample of data forwarding in the cluster-based network. These collaborator nodes are called intermediate nodes. The method of finding optimized paths and selection of the intermediate nodes are the major tasks of routing protocols.Figure 1
Data transmission view in WSN [4].The rest of the paper is organized as follows. Section2 describes related works in routing protocols on wireless sensor networks. Section 3 details the structure of the proposed protocol. In Section 4, we listed the simulation parameters and analysis of the results. Finally, conclusion is given in Section 5.


## 2. Relative Works

Many current algorithms and routing protocols can be classified into three groups as shown in Figure2.Figure 2
Routing protocols classification for WSNs [4].In the flat-based routing, the nodes forward self-data to the other nodes or BS/sink by single or multihop methods. Each sensor node has the same role in the network. As mentioned, ID is not used in the WSN structures because they consist of large numbers of nodes. Therefore, BS/sink will wait for receiving an answer from the sensor nodes when it broadcasts any query to all or selected regions of the network [8]. Accordingly, redundancy in the whole network is high and it causes more consumption of energy. This problem can be solved by data aggregation technique [1]. The flat-based routing study case is proposed in many protocols such as SPIN [9], Directed Diffusion (DD) [5], EAD [10], and GBR [11].The flat-based routing protocols are most suitable for specific applications such as event detection. If this type of routing protocol is applied in the monitoring-based applications, then accuracy of the data is somewhat doubtful and it does not represent a real condition of the environment in transmission data packets. This problem or transmission delays in the large-scale networks are not acceptable. Hence, the flat-based routing protocols consume significant energy because a large number of nodes participate in the data transmission phase and any node has the same role in the network. In Figure3, we presented the three models of routing techniques. In model A, each node sends its sensed data to the sink directly without intermediate nodes. This position causes wasting energy in the whole network. Model B is the improvement of flat-based routing techniques that uses multihop method for sending data or responding to requested queries. This model reduces energy consumption significantly but, in the general case, it cannot reach energy efficiency yet. Researchers work on the energy efficiency factor in the hierarchically based routing protocols more than other protocols. They offered a new model for network configuration and named it hierarchical-based routing algorithms. This paper proposes an aware-routing protocol based on the hierarchical method. The basis of our approach is to cluster and use CH nodes as an interface between the clusters. CH nodes can communicate with other CHs or sink except for the nodes that are in the same cluster. Hence, sensor nodes are not involved in retention of routes between source nodes and sink. Generally, CHs use a CSMA MAC method and each node chooses a cluster to which it will belong and it is calculated based on the received signal strength or its distance to the CH node. Under the same conditions, a node randomly selects a CH node and cluster. CH nodes compute a TDMA schedule for data transmission in clusters. After that, each node will know how and when it can send its data to other members. The schedule is broadcast to all nodes in the cluster except the CH node. The sensor nodes will send their data packets to CH nodes after formation clusters and allocation schedule mechanisms [6]. The network lifetime is increased and the routing protocols are converted to energy efficiency methods in the WSNs. Many protocols are proposed in the category such as HEED-NPF [12], Improved-LEACH [13], FTIEE [3], New-LEACH [14], EE-LEACH [15], and SALMA [16].Figure 3
Models of routing and data transmission protocols [5].
(a)
Single hopping (b)
Multihopping (c)
Hierarchical-based routingIn the WSNs, almost every routing protocol needs the location information of sensor nodes. It is calculable from the distance between two special nodes. Coordinates of neighboring nodes were obtained using exchanges of some information between neighbors. If addressing scheme for a sensor network is not known, an energy efficient routing protocol can be accessible. Almost, the location-based routing protocols are proposed in the MANET [17]. However, they are also well applicable to WSNs where there is less or no mobility. The location of nodes can be reachable by communicating with a GPS or satellite directly but they are not inexpensive. More energy saving in the location-based protocols can be obtained by maintaining more nodes in sleep mode. The problem of scheduling of sleep period designing for each node in a localized manner was addressed in [6]. Many protocols are proposed in this category such as GAF [18], GEAR [19], and EEAR [20].


## 3. Designing Aware-Routing Protocol Based on Recursive Best-First Search Algorithm (AR-RBFS)

In the proposed protocol, data transmission is based on hybrid model and routes discovery is based on query model [6]. The paths which have been found by the protocol are related to destination nodes that are selected via the sink. Then, data can be collected by time-driven, query-based, or event-based methods. Additionally, a hybrid model is possible. For example, the time-driven methods in surveillance application, the event-based methods in target tracking in army applications, and the query-driven methods in habitat monitoring applications can be used. In the time-based approach, every node sends data packets periodically. In the event- and query-based approaches, if an event happens or a query is sent via the BS/sink to all sensor nodes, data transmission will be realized in the network. Data delivery is one of the important parameters in routing algorithms. The proposed protocol is implemented in two phases and discussed below.


### 3.1. Network Deployment Phase

Communications between sensor nodes must be clear in the network after completing the distribution of sensors in an environment. In the first phase, the sensor nodes will be deployed in the environment and they will be run in the whole network. In the second phase, condition-based environments may require the redeployment of nodes due to a high likelihood of continuous changes of network structures, topologies, and redeployment issue. The network structure is cluster-based and it will be shown as grid. Deployment of the network is done according to the following method. This method is valid and it is the same for both case studies of environments. Sink broadcasts interest message packet to the sensor nodes after deployment of the sensor nodes in the environment. This packet includes the interest hop field that has a default value of zero. The sensor nodes receive the packet and then each node adds one unit to interest hop value and saves this value as self-interest hop. Nodes that have the same interest hop value will be placed in the same layer. When the sink broadcasts the packet, it is only received by neighbors of the sink and then these neighbors broadcast it to their neighbors. This process is to be continued until all sensor nodes receive the packet. If the sensor nodes with interest hop value get any interest packet again, they remove the packet. Figure4 shows the first phase of the proposed protocol. The nodes placement in the virtual layers is based on the closeness to the sink and number of hops. The first phase is finished in step d so all layers were created in the network. The pseudocode of network deployment is shown in Algorithm 1.Algorithm 1:Pseudocode of network deployment.
(1)  Sink broadcast interest-message to all nodes (2) The nodes receive the message (3)  For all nodes (4)   If message = not repeat (5)    Interest hop = interest hop + 1 (6)   Else go to (7). (7)  For all nodes (8)   If interest hop’s nodes are same (9)    They are in a same layer (10) For all layers (11)  While (duty-task-message ≤ our limited number) (12)  Send duty-task-message from any node to self-neighbors (13)   If receive-answer-count = our limited number (14)   While (Time is true) (15)    Node is sleep mode (16)   Go to (12).Figure 4
The network deployment.
(a) (b) (c) (d)


### 3.2. Data Transmission Phase

Our proposed protocol (AR-RBFS) uses data-centric routing schema to flow data packets through multiple layers to the sink with route discovery. It is based on aware searching algorithm. Suppose we deployed our network and destination node is G as shown in Figure5. This node is chosen via sink and is informed to network nodes based on a query. In this case, heuristic value (hn) is calculated to all nodes and is saved for each node routing table as temporary. Each query message packet has certain lifetime that is assigned by the sink. This technique can avoid loops and energy and bandwidth wasting. Heuristic values are calculated based on direct distance costs per node to destination nodes.Figure 5
Routing and data transmission.This phase of the AR-RBFS has two different versions. One of them is applicable in chargeable environments. It is shown in (1). It creates a tree based on recursive search method for finding the best route between sink and destination node. It has similarity to deep search algorithms. The aim of the phase is to find the best neighbors and routes to destination nodes. If the application environment has electrical installations, we do not have an energy problem. In this case, our algorithm is run on first scenario as described in (1). In this scenario, the recursive algorithm is used in the protocol that allows the sensors to keep optimizing by using self-memory. Our algorithm selects a better route in each step and also maintains the second best route (not all routes). A sample of all steps of the route discovery algorithm are shown in Figure 6. The steps are the same in the two versions and only the heuristic values of the calculations are different from each other. Calculation of the heuristic value for the second scenario is based on (2). Consider the following: (1)fni=hni+gni,where h(n) is for heuristic costs and g(n) is for path costs used. For example, in Figure 5, g(n) is 6 between 1-B and 2-H and heuristic cost from B to destination node (G) is 11.3.Figure 6
AR-RBFS algorithm steps.If the heuristic value is admissible, this proposed algorithm will be robust. However, it still has a problem in the over node regeneration because it has limited memory. Classic-RBFS [7] algorithm expands nodes in the best-first order even with a nonmonotonic cost function. The Classic-RBFS is a recursive algorithm that uses the heuristic and g(n) values. g(n) is the cost of path from root to “n.” The Classic-RBFS is better than similar methods. Pseudocode is shown in Algorithm 2.Algorithm 2:Pseudocode of general RBFS algorithm [7].
RBFS(n, B) (1) ifn is a goal (2)  solution← n; exit() (3)C  ← expand(n) (4) ifC is empty, return ∞ (5) for each childni in C (6)  iff(n)<F(n) then F(ni)  ← max⁡(F(n),f(ni)) (7)  elseF(ni)  ← f(ni) (8) (n1, n2)  ← bestF(C) (9) while (F(n1) ≤ B and F(n1) < ∞) (10)F(n1)  ← RBFS(n1, min⁡(B,Fn2)) (11)  (n1, n2) ← bestF(C) (12) returnF(n1)When the application environment does not have an energy problem, we can use the Classic-RBFS algorithm in routes discovery with some modification as described [7]. But it cannot be used in the environments that have energy problems. Therefore, we need another approach for routes discovery. In this case, our algorithm uses intermediate nodes by new f function given in (2). In this equation, we must consider the energy level of each sensor node (E(ni)). Consider the following:(2)fni=hni+gniEni.Moreover, nodes have to be of a certain amount of energy to communicate. For example, if energy of any node is more than 1 nW, then the node can communicate with its neighbors based on (2). Otherwise, the nodes cannot collaborate in the routes searching process. Therefore, the energy issue is important in the environments that are difficult to charge. Energy saving of the AR-RBFS protocol is based on duty cycle approaches. In this state, all nodes of each virtual layer can be modeled as a random graph [21]. This approach is based on duty cycle methods. The concept of the duty cycle methods is the maintenance of minimum active nodes for energy efficiency [22]. In fact, duty cycling methods focus on the networking subsystem. A good way for energy saving is to use the sleep (low-power) mode for idle sensor nodes. The proposed protocol creates a full connection topology for all active nodes in every layer. This protocol uses a virtual layers structure and it attempts to keep the network connections by maintaining enough number of sensor nodes in active mode in each layer as delegate nodes. These active nodes will have communication with their sleep neighbor nodes in the same layer. In accordance with this purpose, the protocol uses two parameters. One of them is T that shows period times of duty cycling. Another variable is C and it defines the internal communications degree. Each node can go to sleep mode when it receives C numbers of task change messages from its active neighbors. The proposed approach in the paper is based on topology control technique and it uses some parameters for efficient data transmission.Numbers of active nodes and communications in the network are increased with increasing the value ofC parameter. In order to do so, each node spot considers time periods with duration T. Any node is waiting during tv times and it is in sleep mode in this time. tv is distributed uniformly and its value is in the range [0,T). After this time, the node converts to active mode and sends HELLO message to self-neighbor. It goes into sleep mode again upon receiving the responses from the neighbors. The responses are based on C value and time is different to nodes. The C and T parameters guarantee connectivity of the network. Each active sensor node sends HELLO message packets to its sleep neighbors (Figure 7). Then, it listens to HELLO messages sent by other nodes. Assuming that the value of C parameter is three, we illustrate the operating style of the algorithm in Figure 8. The values of C and T are related to our environment conditions and parameters and also our system goals. In fact, a node will be in the sleep mode after receiving an answer from the three neighboring nodes in the same layer.Figure 7
The selected node sends HELLO message to self-layer members.Figure 8
The received HELLO packets illustrate activation of other nodes (in this example,C is given the value 3).Each node has waiting time (tv) and period time (T). When it receives the activation HELLO message from its neighbors, it converts its mode to active. The active nodes will be in the activation mode for T time. The activation message numbers are reached from C parameter. For example, in Figure 8, value of C is “3.” Indeed, each node after publishing its activity sends its own HELLO packet and then goes to sleep mode after finishing its periods.In this scenario, sleep nodes cannot be in the route discovery process by AR-RBFS algorithm but these nodes can send received packets to their neighbors active nodes when they become active. The received mode of sensor nodes is active any time even when the node is in the sleep mode. The scenario is shown in Figure9.Figure 9
Packet routing in sleeping nodes.


## 3.1. Network Deployment Phase

Communications between sensor nodes must be clear in the network after completing the distribution of sensors in an environment. In the first phase, the sensor nodes will be deployed in the environment and they will be run in the whole network. In the second phase, condition-based environments may require the redeployment of nodes due to a high likelihood of continuous changes of network structures, topologies, and redeployment issue. The network structure is cluster-based and it will be shown as grid. Deployment of the network is done according to the following method. This method is valid and it is the same for both case studies of environments. Sink broadcasts interest message packet to the sensor nodes after deployment of the sensor nodes in the environment. This packet includes the interest hop field that has a default value of zero. The sensor nodes receive the packet and then each node adds one unit to interest hop value and saves this value as self-interest hop. Nodes that have the same interest hop value will be placed in the same layer. When the sink broadcasts the packet, it is only received by neighbors of the sink and then these neighbors broadcast it to their neighbors. This process is to be continued until all sensor nodes receive the packet. If the sensor nodes with interest hop value get any interest packet again, they remove the packet. Figure4 shows the first phase of the proposed protocol. The nodes placement in the virtual layers is based on the closeness to the sink and number of hops. The first phase is finished in step d so all layers were created in the network. The pseudocode of network deployment is shown in Algorithm 1.Algorithm 1:Pseudocode of network deployment.
(1)  Sink broadcast interest-message to all nodes (2) The nodes receive the message (3)  For all nodes (4)   If message = not repeat (5)    Interest hop = interest hop + 1 (6)   Else go to (7). (7)  For all nodes (8)   If interest hop’s nodes are same (9)    They are in a same layer (10) For all layers (11)  While (duty-task-message ≤ our limited number) (12)  Send duty-task-message from any node to self-neighbors (13)   If receive-answer-count = our limited number (14)   While (Time is true) (15)    Node is sleep mode (16)   Go to (12).Figure 4
The network deployment.
(a) (b) (c) (d)


## 3.2. Data Transmission Phase

Our proposed protocol (AR-RBFS) uses data-centric routing schema to flow data packets through multiple layers to the sink with route discovery. It is based on aware searching algorithm. Suppose we deployed our network and destination node is G as shown in Figure5. This node is chosen via sink and is informed to network nodes based on a query. In this case, heuristic value (hn) is calculated to all nodes and is saved for each node routing table as temporary. Each query message packet has certain lifetime that is assigned by the sink. This technique can avoid loops and energy and bandwidth wasting. Heuristic values are calculated based on direct distance costs per node to destination nodes.Figure 5
Routing and data transmission.This phase of the AR-RBFS has two different versions. One of them is applicable in chargeable environments. It is shown in (1). It creates a tree based on recursive search method for finding the best route between sink and destination node. It has similarity to deep search algorithms. The aim of the phase is to find the best neighbors and routes to destination nodes. If the application environment has electrical installations, we do not have an energy problem. In this case, our algorithm is run on first scenario as described in (1). In this scenario, the recursive algorithm is used in the protocol that allows the sensors to keep optimizing by using self-memory. Our algorithm selects a better route in each step and also maintains the second best route (not all routes). A sample of all steps of the route discovery algorithm are shown in Figure 6. The steps are the same in the two versions and only the heuristic values of the calculations are different from each other. Calculation of the heuristic value for the second scenario is based on (2). Consider the following: (1)fni=hni+gni,where h(n) is for heuristic costs and g(n) is for path costs used. For example, in Figure 5, g(n) is 6 between 1-B and 2-H and heuristic cost from B to destination node (G) is 11.3.Figure 6
AR-RBFS algorithm steps.If the heuristic value is admissible, this proposed algorithm will be robust. However, it still has a problem in the over node regeneration because it has limited memory. Classic-RBFS [7] algorithm expands nodes in the best-first order even with a nonmonotonic cost function. The Classic-RBFS is a recursive algorithm that uses the heuristic and g(n) values. g(n) is the cost of path from root to “n.” The Classic-RBFS is better than similar methods. Pseudocode is shown in Algorithm 2.Algorithm 2:Pseudocode of general RBFS algorithm [7].
RBFS(n, B) (1) ifn is a goal (2)  solution← n; exit() (3)C  ← expand(n) (4) ifC is empty, return ∞ (5) for each childni in C (6)  iff(n)<F(n) then F(ni)  ← max⁡(F(n),f(ni)) (7)  elseF(ni)  ← f(ni) (8) (n1, n2)  ← bestF(C) (9) while (F(n1) ≤ B and F(n1) < ∞) (10)F(n1)  ← RBFS(n1, min⁡(B,Fn2)) (11)  (n1, n2) ← bestF(C) (12) returnF(n1)When the application environment does not have an energy problem, we can use the Classic-RBFS algorithm in routes discovery with some modification as described [7]. But it cannot be used in the environments that have energy problems. Therefore, we need another approach for routes discovery. In this case, our algorithm uses intermediate nodes by new f function given in (2). In this equation, we must consider the energy level of each sensor node (E(ni)). Consider the following:(2)fni=hni+gniEni.Moreover, nodes have to be of a certain amount of energy to communicate. For example, if energy of any node is more than 1 nW, then the node can communicate with its neighbors based on (2). Otherwise, the nodes cannot collaborate in the routes searching process. Therefore, the energy issue is important in the environments that are difficult to charge. Energy saving of the AR-RBFS protocol is based on duty cycle approaches. In this state, all nodes of each virtual layer can be modeled as a random graph [21]. This approach is based on duty cycle methods. The concept of the duty cycle methods is the maintenance of minimum active nodes for energy efficiency [22]. In fact, duty cycling methods focus on the networking subsystem. A good way for energy saving is to use the sleep (low-power) mode for idle sensor nodes. The proposed protocol creates a full connection topology for all active nodes in every layer. This protocol uses a virtual layers structure and it attempts to keep the network connections by maintaining enough number of sensor nodes in active mode in each layer as delegate nodes. These active nodes will have communication with their sleep neighbor nodes in the same layer. In accordance with this purpose, the protocol uses two parameters. One of them is T that shows period times of duty cycling. Another variable is C and it defines the internal communications degree. Each node can go to sleep mode when it receives C numbers of task change messages from its active neighbors. The proposed approach in the paper is based on topology control technique and it uses some parameters for efficient data transmission.Numbers of active nodes and communications in the network are increased with increasing the value ofC parameter. In order to do so, each node spot considers time periods with duration T. Any node is waiting during tv times and it is in sleep mode in this time. tv is distributed uniformly and its value is in the range [0,T). After this time, the node converts to active mode and sends HELLO message to self-neighbor. It goes into sleep mode again upon receiving the responses from the neighbors. The responses are based on C value and time is different to nodes. The C and T parameters guarantee connectivity of the network. Each active sensor node sends HELLO message packets to its sleep neighbors (Figure 7). Then, it listens to HELLO messages sent by other nodes. Assuming that the value of C parameter is three, we illustrate the operating style of the algorithm in Figure 8. The values of C and T are related to our environment conditions and parameters and also our system goals. In fact, a node will be in the sleep mode after receiving an answer from the three neighboring nodes in the same layer.Figure 7
The selected node sends HELLO message to self-layer members.Figure 8
The received HELLO packets illustrate activation of other nodes (in this example,C is given the value 3).Each node has waiting time (tv) and period time (T). When it receives the activation HELLO message from its neighbors, it converts its mode to active. The active nodes will be in the activation mode for T time. The activation message numbers are reached from C parameter. For example, in Figure 8, value of C is “3.” Indeed, each node after publishing its activity sends its own HELLO packet and then goes to sleep mode after finishing its periods.In this scenario, sleep nodes cannot be in the route discovery process by AR-RBFS algorithm but these nodes can send received packets to their neighbors active nodes when they become active. The received mode of sensor nodes is active any time even when the node is in the sleep mode. The scenario is shown in Figure9.Figure 9
Packet routing in sleeping nodes.


## 4. Simulation

In the simulation of AR-RBFS protocol, AR-RBFS protocol results are compared with HEED-NF, EE-LEACH, and SALMA protocols. The output parameters are network lifetime and average packet delivery. Also, the input parameters are initial energy of each sensor node, radio and sensor energy consumption, transmit and receive/sense process costs, and buffer size (Table1). In the simulation scenario, the sensor nodes are not mobile and they have similar architecture and design fundamental. The sensor nodes collect sensing phenomena and forward them toward BS/sink via intermediate nodes as multihopping method. A snapshot of AR-RFBS is shown in Figure 10. In this figure, the virtual layer approach can appear. The proposed protocol can be available in areas such as border security.Table 1
Values of input parameters.
Initial (max) energy 0.7 J/bit Receive buffer size 10000 bytes Radio/sensor energy consumption 40 nJ/bit Send buffer size 10000 bytes Transmit process cost 40 nJ/bit Deployment area size (600 × 600) m Receive/sense process cost 10 nJ/bit Send/receive buffer counts 20 Data packet size 500 bytes Sink position (600 × 300) m Sensing radius 7.5 m Transmission radius 15 mFigure 10
A snapshot of basic network topology in AR-RBFS protocol.The simulations are based on two different scenarios. The first scenario is developed for the nodes that have an unlimited energy source or easy-to-recharge batteries. They are charged by the environment energy source such as electrical installations. Another scenario is for low-power energy source environments.The results show that AR-RBFS has a good performance in the network lifetime and average packet delivery rate. It can increase the energy saving factor using data aggregation, topology control, and sleep/wake-up methods. Network lifetime is directly related to the number of nodes. The network lifetime will be better when we use more sensor nodes. We can say that, with the increasing number of nodes, the number of received packets is increased but packet delivery rate is almost reduced because some of the factors such as increasing density of nodes, hop counts, and node failure probability are effective. Figures11 and 12 show simulation results on three protocols and proposed two scenario-based protocols.Figure 11
Network lifetimes in AR-RBFS (2 scenarios), HEED-NF, EE-LEACH, and SALMA.Figure 12
Average packet delivery rates in AR-RBFS (2 scenarios), HEED-NF, EE-LEACH, and SALMA.


## 5. Conclusion

This paper proposed the design of an AR-RBFS based routing protocol in two different scenarios on WSN. It is used to evaluate the power consumption and packet delivery rate of wireless sensor nodes. The algorithm computes an optimized path to route the packets from the sink to the destination node. The cluster-based structure and using the new duty cycle based energy saving technique help the network have a good performance in the output parameters (network lifetime and average packet delivery rate). Since the packets are routed through an optimized path, the energy required for transmission will be decreased; thus, the lifetime of the system is increased. Simulation results show that the proposed AR-RBFS based approach for improving the energy saving in the WSN is better than the SALMA, EE-LEACH, and HEEP-NF routing algorithms. Hence, the proposed algorithm is better than the existing algorithms. The proposed protocol for both environments can be implementable on various applications such as agriculture.



---

*Source: 8743927-2016-08-09.xml*