Microprocessors and Microsystems 74 (2020) 103034

Contents lists available at ScienceDirect

Microprocessors and Microsystems

journal homepage: www.elsevier.com/locate/micpro

Implementation of energy efficient circuit design using A∗ algorithm

in embedded network
G.L. Anil∗, J.L. Mazher Iqbal
Department of ECE, Veltech Rangarajan Dr Sagunthala R&D Institute of Science and Technology, Chennai, India

a r t i c l e i n f o a b s t r a c t

Article history: In wireless sensor network, the routing path plays a prominent role in network resource utilization. Since,
Received 5 December 2019 the nodes in network are open to physical abuse an effective routing protocol is necessary to improve
Revised 31 January 2020
data reliability in network and to overcome node data link disconnection. In this paper, we propose to
Accepted 10 February 2020
implement A∗ EEDDP (Energy Efficient Distributed Diffusion protocol) to improve data reliability and in-
Available online 13 February 2020
crease network lifetime. The A∗ algorithm determines the shortest routing path between source node and
Keywords: destination node. In addition, the routing path determine with respect to parameters such as energy con-
Shortest paths sumed for communication, residual energy of nodes and the time over which the nodes can support the
Hop count routing path. The combined A∗ EEDDP implement in testbed and performance evaluate interms of net-
Leach protocol work lifetime, throughput, packet delivery ratio, energy efficiency and end to end delay. The A∗ EEDDP
Throughput performs better compared to other algorithm and achieves higher packet delivery ratio of 97%.
Energy efficient
© 2020 Elsevier B.V. All rights reserved.

1. Introduction energy and designing an energy efficient routing protocol [2] is

crucial. The mobile sensor nodes are built with limited compu-
Wireless Sensor Networks (WSN) consists of a large number of tational capacity, small storage memory, and finite battery power
sensor nodes to collect data from various sensors and to trans- capacity.
fer it to the sink node [1]. Sensor nodes sense the ambient en- Sensor nodes with limited battery source cannot be replaced
vironment and convert them into electrical signal. All the sensor frequently as it is deployed in hostile environment. Hence, energy
nodes consists of some sensing mechanism to collect data from conservation plays a vital role in the design of WSN. The data reli-
surroundings environment using time driven approach or by event ability in WSN decrease when the first node goes to inactive state.
triggered approach. Many of the research focus on data collec- To avoid this scenario, all the nodes must remain in active state
tion and processing and in regulation and management of sensing throughout the period. Clustering, routing and data gathering can
activities. be done efficiently to minimize energy consumption and improve
Sensor nodes are generally designed with limitations such as network lifetime. The energy consumption, management may also
less memory storage and less battery power. However, nodes in result in reduction of energy resource of nodes near sink which is
transmit mode requires more energy and resources to remain in known as energy hole problem [3]. The proper selection of opti-
active state. In Wireless Sensor Network the energy efficiency is mal path and electron hole problem has an impact on the lifetime
taken into consideration while designing communication protocol. of network. The Lifetime of network improves with selection of ef-
Many research works addresses energy efficient communication ficient routing strategies for WSN.
protocol neglecting the amount of energy consumed inside the The energy efficient routing algorithms [4,5] design by mini-
node during data processing. Generally, data processing consumes mizing energy being transmitted from source node to destination
more energy for a longer time inside the node than for trans- node which enhances the lifetime [6] of network. The algorithm
mission, reception and transreceiving. Henceforth, optimum care selects multiple hops with respect to residual energy of node [7].
should be taken in designing communication protocol than in The routing nodes select based on factors such as node residual
processing and task scheduling. Data routing consumes more energy, frequent route failures (link quality) and restrained band-
width in wireless sensor networks. The conventional routing algo-
∗
rithm in WSN does not consider delay and traffic rate in network.
Corresponding author.
E-mail addresses: [email protected], [email protected] (G.L.
The shortcoming of such routing algorithms overcome by multi-
Anil), [email protected] (J.L. Mazher Iqbal). objective energy aware routing protocol. A fitness function is eval-

https://doi.org/10.1016/j.micpro.2020.103034
0141-9331/© 2020 Elsevier B.V. All rights reserved.
2 G.L. Anil and J.L. Mazher Iqbal / Microprocessors and Microsystems 74 (2020) 103034

uated based on delay, energy, traffic rate, cluster density and dis- quired for positioning sensor nodes. The sensor node depends on
tance. The optical cluster head is found based on fitness function localization algorithm to discover the sensor node own location.
for routing path identification. [24] The nodes with highest resid- Generally, the sensor node only have limited power source. The
ual energy prolongs the lifetime of network. ALWadHA (An efficient localization algorithm for Wireless ad hoc
Our aim is to design an energy efficient protocols to make sen- sensor networks with High Accuracy) is presented. The effect of
sor node communicate with other nodes in case of energy defi- following three techniques such as single-estimation technique, dy-
ciency and to improve data reliability. In addition, Non-uniform en- namic power control, incremental & exponential requesting rate
ergy drainage in network poses a major issue for designing reliable technique are analyzed by ALWadHA and enhances the ALWadHA
routing path. energy efficiency. [13]
In this paper, we propose Energy Efficient Distribution Diffu- J. W. Lee and J. J. Lee (2012) presents an efficient Transmission
sion protocol (EEDDP) to enhance lifetime of network using short- Strategy to enhance the network lifetime of wireless sensor net-
est path A∗ algorithm. Simulations were carried out using net- work. To enhance the network lifetime, optimum distance based
work simulator 2 (NS2) and compared with the existing tech- transmission strategy of ant colony optimization (ACO) is pre-
niques like EEDP [8], AODV [8], RIDSR [9]. The proposed algo- sented. The novel transmission strategy has three advantages. Ini-
rithm implement in hardware to evaluate network parameters tially, by using “most energy-balanced distance” and “most energy-
such as energy efficiency, network lifetime, running time and efficient distance”, the local optimal-distance mechanism is per-
throughput. formed for energy efficiency and energy balancing in WSN. Sec-
The rest of the paper is organized as follows: Section 2 presents ondly, by using network estimation approach, the optimal-distance
the related work on lifetime improvement. Section 3 explains system is improved to attain energy reduction. The energy reduc-
the proposed methodology. Section 4 gives out the simula- tion apply for sensor nodes throughout network. Finally, the trans-
tion parameters of EEDDP and its implementation in hardware. mission strategy is proved by simulations. [14]
Section 5 shows the hardware outputs from the test bed and com- R. Bordon et al. (2018) describes that in Wireless Sensor Net-
pares with existing techniques and finally the conclusion. works (WSN), the sensors work with energy sources. Normally,
the sensor energy resources are not possible to replace or recharge
2. Related work batteries during network operation. So that Efficient energy cov-
erage (EEC) is an important issue for wireless network. To solve
X. Liu et al. (2015) considers energy efficiency as the most sig- this issue, the Ant Colony Based scheduling Algorithm (ACB-SA) is
nificant factor in wireless sensor networks (WSNs). Joint network- presented. Also, the probability sensor discovered model is used
channel coding (JNCC) considerably enhances the efficiency and ro- in ACB-SA approach to heterogeneous sensor set that represents
bustness of communications in WSNs. The number of packets in realistic technique to solve EEC issues. [15]
network coding on the energy usage along with the JNCC model Q. Wang et al. (2019) introduces an energy efficient compres-
is analyzed. An optimization technique based on adaptive dynamic sive sensing based clustering algorithm (EECSR) based on the ad-
energy consumption (ADEC) is presented. Using this technique, the vantages of clustering protocols and compressive sensing protocols.
number of network coding packets are adjusted based on the bit The functions of EECSR is classified into three subdivisions. Initially
error rate’s feedback to reduce the total usage of energy and also the advantages of maintaining optimum size of the cluster, distri-
the threshold in bit error rate (BER) is calculated. [10] bution of cluster head and relationship between the adjacent lay-
J. S. Leu-et al. (2015) describes a technique to enhance the wire- ers were identified. Secondly to overcome the Hot spot problem
less sensor networks (WSNs) energy efficiency through grouping by randomly modify the functions of Cluster head and finally ini-
of sensor nodes. This grouping of sensor nodes is performed us- tialize the mechanism to convert cluster head into backup cluster
ing an appropriate clustering algorithm. But clustering needs extra head. The performance of the EECSR protocol is compared with the
overhead such as cluster formation and cluster head selection and conventional clustering protocols. [16]
assigning cluster head. A novel energy aware clustering technique T. Kaur and D. Kumar (2018) describes that in designing wire-
utilizing isolated nodes called Regional Energy Aware Clustering less sensor network maintaining higher energy efficiency is the key
with Isolated Nodes (REAC-IN) is presented. In REAC-IN, cluster factor to improve the life time of the network. In most of the ap-
heads are chosen with respect to weight. Weight is identified cor- plications the sensor nodes collect the sensed data and transmit to
responding to each sensor’s residual energy and all sensors’ re- the sink node in timely fashion. minimizing the transmission de-
gional average energy in every cluster. Distributed clustering tech- lay and power consumption in the network is the main objective in
niques which are not correctly designed causes the nodes to be developing the routing algorithm in wireless sensor network. A hy-
separated or isolated from cluster heads. These isolated nodes brid multi hop routing algorithm is introduced in wireless sensor
transmit data to the sink using more energy. The life time of the network. Initially cluster is created and cluster head select based
network is enhanced through finding whether the isolated node on the transmission delay and energy consumption as parameters.
forwards its data to a cluster head node or to the sink. through Routing algorithm is used to initiate low cost communication link
using regional average energy, distance among the sink and sensor between the cluster head and sink node. The performance of intro-
nodes. [11] duced hybrid energy efficient multi hop routing algorithm is com-
L. I. U. Danpu et al. (2013) describes the energy conservation in pared with the conventional algorithm. [17]
WSNs (Wireless Sensor Networks) as a critical issue. A transmis- S. Agarwal and S. De (2018) describes that communication
sion technique for energy-restricted WSNs is presented. The tech- range in the village areas are very low due to the sparsity of popu-
nique called MIHOP (MIMO and multi-hop) integrates the multi- lation and limited income by the peoples in villages. Thus cellular
hop and cluster dependent virtual MIMO technologies. The multi- network providers needs complex infrastructure to provide broad-
hop mode is utilized in transmission of data when the location of band connections in rural areas. To overcome this limitation cluster
sensors is within a particular hop count from the sink node. A con- based architecture and protocol is developed to improve the cover-
trollable mobile sink is used for data gathering and it reduces the age region in the rural regions. This framework requires only lim-
energy consumption when the sensor node is transmitting data. ited setup. Customer Premise equipment (CPE) is installed in rural
[12] regions which acts as a cluster heads and frame a cluster. It utilizes
A. M. Abu-Mahfouz and G. P. Hancke (2017) describes that Sev- the unused television channels to transfer the data packets to the
eral wireless sensor network algorithms and techniques are re- base station. Two-layer architecture is framed and the performance
 G.L. Anil and J.L. Mazher Iqbal / Microprocessors and Microsystems 74 (2020) 103034 3

of the protocol is measured based on the metrics like throughput path may be found by calculating residual energy, packet reception
and energy efficiency. [18] ratio (PRR) and node buffer state.
S. Sasirekha and S. Swamynathan (2017) describes that Data A∗ algorithm finds an optimal path from the source node to
aggregation is an important function to collect the sensed data’s sink node. In this paper, the shortest path is an optimization prob-
from sensor nodes in the network. This mechanism decreases the lem of finding minimum cost between any two node pairs with re-
amount of data packets transferred in the network. Various pro- spect to parameters such as node energy consumption, node resid-
tocols are introduced to perform data aggregation which depends ual energy and time over which route will be supported by nodes.
on the topology of the network. Cluster chain mobile agent rout- The computation results increases with number of nodes in net-
ing protocol (CCMAR) is developed by combining the advantages of work. The shortest path algorithm has an overview of network to
LEACH protocol and PEGASIS protocol. CCMAR protocol splits the reduce data communication complexity in network. More power is
network into smaller clusters and execute in two phases. The sim- consumed when a node sends a data to neighbor nodes for up-
ulation results shows that CCMAR protocol generates higher effi- dation of the network. Hence for a routing protocol, Energy Ef-
ciency than the LEACH and PEGASIS routing protocol. [19] ficient Distributed Diffusion Protocol (EEDDP) based A∗ algorithm
D. Kumar (2014) describes that the cluster based topolo- for identifying the shortest path with less power consumption.
gies functions are based on divide and conquer methodology. It
splits the network into several clusters and data aggregation is
3.2. Proposed energy-efficient routing algorithm
performed with in the clusters. This mechanism increases the
performance of the network and decreases the power consumed
The sink node updates the criteria of each node to find the
for data aggregation and transferring the aggregated data to the
optimal path. Initially, each node send its parameters to the sink
base station. Thus cluster based protocols are widely implemented
node. So, each time the sensor node appends its parameters along
in heterogeneous wireless sensor network. Two new clustering
with the data packet. Then, the sink node can easily decide and
protocols are introduced namely single hop energy efficiency clus-
broadcast the routing schedule to every sensor node in the net-
tering protocol (S-EECP) and multi hop energy efficiency clustering
work. Thus optimal path can be easily determined. But if the resid-
protocol (M-EECP). The S-EECP protocol is responsible to elect
ual energy of any node is less than the threshold value, then the
cluster head in the network. It elects the cluster head based on
particular node will not send its parameters to the base station ig-
available energy of network and residual energy of the node. The
noring its participation in the routing process. Load balancing of
node with higher residual energy was selected as cluster head.
the network can be achieved in regard to the threshold value and
Then M-EECP regulates the data transmission in multi hop mode
it improves the network lifetime.
to transfer data packets from cluster head to the base station. [20]
The A∗ algorithm estimates the optimal path from the source
node to destination node with regard to parameters of sensor
2.1. Energy efficient routing protocols
nodes such as residual energy, packet reception rate and node
buffer state. In order to calculate the optimal path, the sink node
Effective Energy consumption makes the network to remain in
should be aware of each node criteria. In EEDDP, at the initial
active state for a longer time and the efficiency is achieved by fo-
stage, each node forwards its previous parameters to the sink node.
cusing on energy consumption problem such as optimization of
When the residual energy of the sensor node goes below thresh-
data routing, reduction in data overhead, sleep/wakeup schemes,
old value, then the node does not send all its parameters to the
battery lifetime and energy efficient routing. Energy efficient rout-
base station and hence routing becomes incomplete. But, if the
ing can be designed on the basis of Cluster architecture. The selec-
threshold value becomes too low, none of the residual node en-
tion of cluster head (CH) helps in reduction of data overload and
ergy will be considered and the network lifetime will be enhanced
improves scalability resulting in enhanced energy efficiency; En-
using this shortest path algorithm. The overview of routing algo-
ergy as a routing metric – Selection of next hop by focusing on
rithm is shown in Fig. 1. The proposed algorithm transfer data to
its residual energy and shortest paths in deciding a routing algo-
next neighbor node with highest residual energy, buffer rata and
rithm; Multipath routing – Enables balanced energy among nodes
packet reception rate.
than in single hop routing which improves reliability and faster re-
The combined weight of a next neighbor node is the sum of
covery from failure; Relay node placement – optimal distribution
normalized weight of the routing metric [a∗ ]given as:
of nodes or inclusion of relay nodes improves capacity and ne-
      
glects sensor hot spots; Sink mobility – Mobile base station avoids Eres (n ) Nr (n ) B f (n )
overloading of sensors near base station as it forwards all traffic to g(n ) = Max α +β +δ (1)
Eini (n ) Nt (n ) Bini (n )
the sink. Henceforth to enhance network lifetime, balanced energy
consumption; equal distribution of load; shortest path selection, Where g(n) is the cost from source node to current node, Eres (n)
selection of optimal routing path and minimized overhead must and Eini (n) are residual energy and initial energy of node respec-
be taken into consideration. In this paper, Energy efficient routing tively. In addition Nt (n) and Nr (n) are the transmitted and received
protocol concentrates in minimizing the energy consumed and to packets respectively. Bf (n) and Bini (n) represent as a number of free
reduce the communication of more energy activities. and initial buffer of node n respectively. α , β and δ are the weight
parameters such as α + β + δ =1. We consider the three metrics
3. Proposed work are related to the node parameters. The first parameter represents
normalized residual energy which shows residual energy of next
3.1. Shortest path A∗ algorithm neighbor node, n. This parameter determines that the energy con-
sumptions are balanced. So, energy load is balanced among all the
Many routing algorithms exist in wireless sensor network. But, sensor nodes to enhance the lifetime of the network. The second
the shortest path algorithm finds a route from source node to sink parameter represents the normalized value of received packets in a
node over an optimal path of minimum cost. Generally, the pa- node n. This parameter can be maximized to improve packet trans-
rameters used for finding the shortest path may be based on hop mission efficiency. The third parameter represents the amount of
count, link cost or both of these. In Dynamic network, loop-free free buffer at the next neighboring node n and this plays a vital
routing algorithm easily update the shortest path and it is useful role in traffic distribution. The sink node updates its position to
in numerous applications. In an energy efficient network, shortest all sensor nodes in the network. EWMA is used to calculate packet
4 G.L. Anil and J.L. Mazher Iqbal / Microprocessors and Microsystems 74 (2020) 103034

be used to obtain the optimal path. The energy dissipation due to

communication between nodes are represented by Eq. (6).
 
ETi bti , di, j = a2 bti + bti dm i, j (6)
Where,
di,j represents distance between node i and node j. The transmit
energy represent by a2 and bti represents data transmitted from
one node to other node, m represets path loss and ETi represents
dissipation of transmitted energy.

4. Hardware setup

The Secure Energy Efficient Network Priority Routing Algorithm

which comprises of EEDD protocol with A∗ algorithm is used to
evaluate performance in test bed. The test bed implement with
PIC16F877A microcontroller and Tarang wireless transceiver mod-
ule. The module is built with 8-bit microcontroller, 9 V battery and
Tarang transreceiver. PIC microcontroller has 2k words of program
memory and 128 bytes of RAM. PIC 16F877a has a maximum oper-
ating frequency of 20 MHz to drive the microcontroller and to pro-
duce clock pulses which in turn is connected to the tarang transre-
ceiver through a Max232 level converter. Max232 makes TTL logic
connections between 16f877a and tarang module. Tarang modules
are designed with low to medium transmit power for wireless
nodes with high reliability. Modules need less power to deliver
data efficiently between devices. The interfaces between modules
are applicable in several industrial applications. The modules work
within the ISM 2.4–2.4835 GHz frequency band with IEEE 802.15.4
baseband.

4.1. Performance evaluation in testbed

The proposed technique named EEDD protocol was compared

with existing techniques such as EEDR protocol, DSDV protocol,
AODV protocol.

4.1.1. Energy efficiency

Energy is the major concern in the WSN, hence to improve the
energy efficiency it is necessary to find the energy consumed ac-
cording to the data transmission. The energy efficiency is improved
according to the data transmission and if sensor node is in sleep
Fig. 1. Flow diagram of proposed work.
mode it turns off the radios to save energy. The energy consump-
tion for each node occurs for every transmission and reception
reception rate as follows, made. Thus the probability of selecting same node as next hop is
  decreased. Furthermore, the A∗ algorithm selects routing path to
Nr (t + 1 )
P RR(t + 1 ) = θ (P RR(t ) ) + (1 − θ ) (2) destination node which requires minimal number of hop counts.
Nt (t + 1 ) Hence, the A∗ algorithm consumes less energy compared to exist-
Where, θ is waiting parameter and the value for h(n) function ing scheme as shown in Fig. 2.
can be calculated as:
4.1.2. Network lifetime
1 The data hopping technique in WSN prolongs lifetime of the
h (n ) = (3)
Min(hcns ) network. The nodes in network were connected to similar battery
Where, Min(hcns ) denoted as the minimum hop count from source with same energy. Initially, the data transmission range is
node n to the destination node. The hop count from node n to the fixed for nodes and later the transmission radius is varied based
sink node calculate via Euclidean distance formula as: on the protocol and algorithm. The A∗ EEDDP utilizes the energy
 uniformly. Fig. 3 Shows the achieved network lifetime compared
d (n, s ) = (xn − xs )2 + (yn − ys )2 (4) to other protocols. The occurrence of first dead node in network
takes longer for A∗ EEDDP whereas the dead node in DSDV after
Where, d(n,s) is equal to the Euclidean distance between the 35 s.
node n and sink nodes. The hop count from node n to the sink
node can be determined as follows: 4.1.3. Throughput
d (n, s ) In data transmission, network throughput is the amount of data
hcns = (5) transmitted successfully from sender node to receiver node in a
avg(d (n, j ) )
given time period. The proposed EEDDP achieves higher through-
The average distance between node n and its one hop neigh-
put than existing schemes has shown in Fig. 4. The throughput in-
boring nodes (j). Eqs. (1) and (5) can estimate the evaluation cost
crease since, the A∗ EEDDP finds shortest path for data transmission
function f(x) for selecting the optimal path. The value of f(x) can
to destination node.
 G.L. Anil and J.L. Mazher Iqbal / Microprocessors and Microsystems 74 (2020) 103034 5

Fig. 5. Packet delivery ratio comparison for A∗ EEDDP, AODV, DSDV and EEDR.
Fig. 2. Energy efficiency level comparison for A∗ EEDDP, EEDR [22], AODV [21] and
DSDV [23].

Fig. 6. End to End delay comparison for A∗ EEDDP, EEDR, AODV and DSDV.

Fig. 3. Network Lifetime comparison for A∗ EEDDP, EEDR, AODV and DSDV. 4.1.4. Packet delivery ratio
The Fig. 5 shows packet delivery ration comparison for differ-
ent algorithm such as AODV, DSDV, EEDR and EEDDP. The packet
delivery ratio increased linearly during network initialization. The
packet delivery reduces sharply due to computation of next node
for data transfer. On successful identification of next node for data
transfer the packet is successfully delivered to destination node.

4.1.5. End to end delay

The Fig. 6 shows end to end delay comparison for different
algorithms. The A∗ EEDDP has minimal delay compared to AODV
since, A∗ EEDDP finds shorts path from source to destination to de-
liver aggregated data. However, in AODV and DSDV initially the
route request packet is flooded to determine routing path. If the
routing path is found then aggregated data is transmitted to des-
tination node. The initial routing path determination increases the
delay for data transfer in network.
From the outcomes of hardware testbed, the parameters such
as energy efficiency, network lifetime, and throughput was calcu-
lated for different distance between nodes and results are shown
in Tables 1–4. The results shows that the proposed protocol was ef-
Fig. 4. Throughput comparison for A∗ EEDDP, EEDR, AODV and DSDV. ficient compared to other protocol. The Table 5 shows performance
of A∗ EEDDP algorithm evaluate for different number of nodes.
6 G.L. Anil and J.L. Mazher Iqbal / Microprocessors and Microsystems 74 (2020) 103034

Table 1
Comparison of Network lifetime, Energy efficiency, running time and throughput.

Sl. No Parameters A∗ EEDDP EEDR DSDV AODV

1 Battery 0.2465 1.9 0.2 0.1

2 First dead node (sec) 45 40 37 34
3 Response time (ms) 0.1268 0.248 0.315 0.346
4 Packet received (%) 97.26 96.52 95.16 95.49

Table 2
End to end delay comparison for different distances.

AODV DSDV EEDR A∗ EEDDP

Distance (meter) Delay (ms) Distance (meter) Delay (ms) Distance (meter) Delay (ms) Distance (meter) Delay (ms)

1 2.05323 1 3.87833 1 0.380228 1 0.13308

1.5 2.20532 1.5 4.03042 1.5 0.589354 1.5 0.247148
2 2.28137 2 4.08745 2 0.570342 2 0.228137
2.5 2.20532 2.5 4.10646 2.5 0.646388 2.5 0.304183
3 2.31939 3 4.12548 3 0.646388 3 0.26616
3.5 2.39544 3.5 4.18251 3.5 0.703422 3.5 0.190114
4 2.56654 4 4.14449 4 0.665399 4 0.323194
4.5 2.49049 4.5 4.31559 4.5 0.779468 4.5 0.380228
5 2.6616 5 4.3346 5 0.95057 5 0.532319

Table 3
Energy consumption comparison for different distances.

AODV DSDV EEDR A∗ EEDDP

Distance (meter) energy (mJ) Distance (meter) energy (mJ) Distance (meter) energy (mJ) Distance (meter) energy (mJ)

1 1.89474 1 3.77368 1 0.6 1 0.110526

1.5 1.98947 1.5 3.94737 1.5 0.726316 1.5 0.189474
2 2.03684 2 4.08947 2 0.789474 2 0.347368
2.5 2.14737 2.5 4.15263 2.5 0.915789 2.5 0.457895
3 2.21053 3 4.13684 3 0.947368 3 0.473684
3.5 2.22632 3.5 4.16842 3.5 1.05789 3.5 0.631579
4 2.22632 4 4.23158 4 1.10526 4 0.694737
4.5 2.28947 4.5 4.27895 4.5 1.07368 4.5 0.742105
5 2.35263 5 4.23158 5 1.10526 5 0.789474

Table 4
Throughput comparison for different distances.

AODV DSDV EEDR A∗ EEDDP

Distance (meter) Througput (Kbps) Distance (meter) Througput (Kbps) Distance (meter) Througput (Kbps) Distance (meter) Througput (Kbps)

1 87.02398 1 85.53654 1 92.97398 1 96.94796

1.5 83.7658 1.5 84.8178 1.5 92.7138 1.5 96.6357
2 82.6357 2 82.6877 2 92.0186 2 96.4015
2.5 81.8625 2.5 82.4275 2.5 91.2974 2.5 95.7323
3 79.2193 3 81.8625 3 91.524 3 95.394
3.5 79.985 3.5 80.2714 3.5 90.829 3.5 95.647
4 78.803 4 79.011 4 90.16 4 94.03
4.5 78.595 4.5 78.777 4.5 89.517 4.5 94.361
5 78.387 5 77.264 5 89.77 5 93.152

Table 5
Performance evaluation of A∗ EEDDP for different number of nodes.

Number of nodes Energy consumption (joules) Throughput (Kbps) End to end delay (ms)

10 8.75 385 160

30 16.36 687 208
50 24.35 842 234

5. Conclusion uation shows better performance in terms of network lifetime and

minimizing end to end delay between nodes in network. Further-
The paper focuses on energy efficiency by selecting routing path more, the occurrence of first dead node in network occurs at later
based on A∗ EEDDP algorithm. The nodes for routing path select stage compared to conventional algorithms.
based on factors such as energy required for communication, node
residual energy and time limit over which the routing path can be Ethical approval
supported by nodes. The nodes are selected by EEDD protocol and
the data transmit through nodes by A∗ algorithm. The A∗ EEDDP This article does not contain any studies with human partici-
algorithm performance evaluate in testbed. The performance eval- pants or animals performed by any of the authors.
 G.L. Anil and J.L. Mazher Iqbal / Microprocessors and Microsystems 74 (2020) 103034 7

Declaration of Competing Interest [17] T. Kaur, D. Kumar, Particle swarm optimization-based unequal and fault tol-
erant clustering protocol for wireless sensor networks, IEEE Sens. J. (2018)
4614–4622.
This paper has not communicated anywhere till this moment, [18] S. Agarwal, S. De, Rural broadband access via clustered collaborative commu-
now only it is communicated to your esteemed journal for the nication, in: IEEE/ACM Transactions on Networking, IEEE, 2018, pp. 2160–2173.
publication with the knowledge of all co-authors. [19] S. Selvakumar, S. Sankaranarayanan, ‘Cluster-chain mobile agent routing algo-
rithm for efficient data aggregation in wireless sensor network, J. Commun.
Netw. (2017) 392–401.
References [20] D. Kumar, Performance analysis of energy efficient clustering protocols for
maximising lifetime of wireless sensor networks, IET Wirel. Sens. Syst. (2014)
[1] S.A. Nikolidakis, D. Kandris, D.D. Vergados and C. Douligeris. Energy efficient 9–16.
routing in wireless sensor networks through balanced clustering. Vol. 6. PP- [21] J.J. Ferronato, M.A.S. Trentin, Analysis of routing protocols OLSR, AODV and ZRP
29–42. 2013. in real urban vehicular scenario with density variation, IEEE Lat. Am. Transact.
[2] M. Tong, M. Tang, LEACH-B: an improved leach protocol for wireless sen- (2017) 1727–1734.
sor network, in: Wireless Communications Networking and Mobile Computing [22] M.S. Pramod, S, Performance analysis of EEDR energy-efficient routing protocol
(WiCOM), 2010 6th International Conference on, IEEE, 2010, pp. 1–4. for wireless sensor networks, IET Wirel. Sens. Syst. (2017) 21–26.
[3] K. Rana, M. Zaveri, A-star algorithm for energy efficient routing in wireless [23] Z. Wang, Y. Chen, C. Li, PSR: a lightweight proactive source routing protocol for
sensor network, in: Trends in Network and Communications, Springer, 2011, mobile Ad Hoc networks, IEEE Transact. Veh. Technol. 63 (2) (2014) 859–868.
pp. 232–241. [24] R. Bhardwaj, D. Kumar, ‘MOFPL: multi-objective fractional particle lion algo-
[4] O. Demigha, W.K. Hidouci, T. Ahmed, On energy efficiency in collaborative tar- rithm for energy aware routing in the WSN, Pervasive Mob. Comput. 58 (1)
get tracking in wireless sensor network: a review, IEEE Commun. Surv. Tutor. (2019) 1–16.
(2013) 1210–1222.
[5] G.S Brar, et al., Energy efficient direction-based PDORP routing protocol for Anil G.L. is a Research Scholar in Electronics and Com-
WSN, IEEE Access (2016) 3182–3194. munication Engineering at Veltech Rangarajan Dr. Sagun-
[6] R. Bordon, et al., Energy efficient cooperation based on relay switching on-off thala R&D Institute of Science and Technology in Chennai.
probability for WSNs, IEEE Syst. J. (2018) 3369–3380. He received AMIE degree in Electronics and Communica-
[7] T.A. Alghamdi, Secure and energy efficient path optimization technique in tion Engineering from THE INSTITUITION OF ENGINEERS
wireless sensor networks using dh method, in: IEEE Access, IEEE, 2018, (INDIA), KOLKATTA in 2005 and a M.E degree in Applied
pp. 53576–53582. Electronics from Anna University, Chennai in 2010. He is
[8] M.S. Pramod, S. Shankar, Performance analysis of EEDR routing protocol for currently working in SOUTHERN RAILWAY, CHENNAI as a
wireless sensor networks, IET Wirel. Sens. Syst. 7 (2017) 21–26. SENIOR SECTION ENGINEER.
[9] C.-E. Weng, T.-W. Lai, An energy-efficient routing algorithm based on relative
identification and direction for wireless sensor networks, Wirel. Pers. Com-
mun. 69 (2013) 253–268.
[10] X. Liu, An optimal-distance-based transmission strategy for lifetime maximiza-
tion of wireless sensor networks, IEEE Sens. J. (2015) 3484–3491.
[11] J.S Leu, et al., Energy efficient clustering scheme for prolonging the lifetime J. L. Mazher Iqbal is a Research Professor in Electron-
of wireless sensor network with isolated nodes, IEEE Commun. Lett. (2015) ics and Communication Engineering at Veltech Rangarajan
259–262. Dr. Sagunthala R&D Institute of Science and Technology in
[12] L.I.U. Danpu, Z. Kailin, D. Jie, Energy-Efficient transmission scheme for mobile Chennai. He received B.E degree in Electronics and Com-
data gathering in wireless sensor networks, China Commun. (2013) 114–123. munication Engineering from Madurai Kamaraj University,
[13] A.M. Abu-Mahfouz, G.P. Hancke, ALWadHA localization algorithm: yet more en- Madurai in 1998 and a M.E degree in Applied Electronics
ergy efficient, IEEE Access (2017) 6661–6667. from Anna University, Chennai in 2005, and a Ph.D. de-
[14] J.W. Lee, J.J. Lee, Ant-colony-based scheduling algorithm for energy-efficient gree from Sri Venkateswara University, Tirupati in 2013.
coverage of WSN, IEEE Sens. J. (2012) 3036–3046.
[15] R Bordon, et al., Energy efficient cooperation based on relay switching on-off
probability for WSNs, IEEE Syst. J. (2018) 3369–3380.
[16] Q Wang, et al., An energy-efficient compressive sensing-based clustering rout-
ing protocol for WSNs, IEEE Sens. J. (2019) 3950–3960 IEEE.