2021 6th International Conference for Convergence in Technology (I2CT)
Pune, India. Apr 02-04, 2021
Innovative Approach to Enhance the Lifespan of
Wireless Sensor Networks
Raju M.Sairise
Faculty of Engineering Pacific Academy of Faculty of Engineering Pacific Academy of
Higher Education and Research University Higher Education and Research University
rsairise566@gmail.com raju.swami040@gmail.com
Abstract: This paper presents lifetime maximization of
Wireless Sensor Networks (WSNs). Wireless Sensor Networks
2021 6th International Conference for Convergence in Technology (I2CT) | 978-1-7281-8876-8/21/$31.00 ©2021 IEEE | DOI: 10.1109/I2CT51068.2021.9418162
has gained interest among the researchers despite of its limits.
The most common issues in WSNs are the constraints on the
energy. The performance of the deployed sensor nodes have also
depends on the lifetime of the networks and thus, the scope for
improving the lifetime of the WSNs has become a challenging
task. Improvement of a WSN lifetime is a significant and
challenging task since the sensor nodes of the WSN are
constrained by limited energy. Energy efficient routing is one of
the solutions to this, since it maximizes the overall performance
of the nodes. In this paper the lifespan maximization of the WSNs
is done using Prim’s algorithm and genetic algorithms. The
simulated results have demonstrated the improved efficiency of
the network systems by minimizing the communication iteration
and optimizing the intermediate node's usage.
Keywords: Wireless sensor network, Prim’s algorithm, Genetic
algorithm, Network lifetime, Routing.
I. INTRODUCTION
Wireless sensor network (WSN) technology abides with the
low-power, low-cost and energy-constrained sensors that are
accountable for monitoring physical circumstances and
communicates to access point which enables the end user to
access the data. It comprises an extensive number of sensor
nodes that respond to one (or) more stimulations and uses radio
frequency and laser based approach for transmitting and
processing data [1]. WSNs are popular because of inventive
and compelling applications in almost all fields ranging from
environmental monitoring to battlefield scenario remotely in
geographical areas where human intervention is not possible
[2]; these are basically used to gather data (or) information for
smart environments.However, it is helpful in unattended
circumstances where territory, atmosphere and other ecological
requirements are an obstacle in deploying wired/conventional
networks.
Unlike traditional networks, these sensor networks do not
have a continuous power supply at their disposal. Rather the
individual sensors are battery operated and the lifetime of the
individual sensors and thus the overall network depend heavily
on the duty cycle of these sensors [3].WSNs face a major issue
is the design challenge, in which the longevity (or) the lifetime
of the network that is intended for outdoor operation during
long periods of time is a major research area. Large-scale
wireless sensor networks (WSN) present important design
challenges. Among them, network lifetime is a major topic of
research, because this kind of network is usually intended for
978-1-7281-8876-8/21/$31.00 ©2021 IEEE
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 06:02:29 UTC from IEEE Xplore. Restrictions apply.
Raju Kumar Swami Atul S.Joshi
Faculty of Engineering Pacific Academy of
Higher Education and Research University
atuljoshi1974@gmail.com
outdoor operation during long periods of time. Moreover,
suitable planning before deployment is a fundamental task,
albeit extremely complex, due to the many configurations that
can be established [4]. Metaheuristic algorithms are widely
explored in supervisingthe performance of networking field. It
performs a trial and error process, so as to find the feasible
solutions for the complex issues. It not only helps in issuing the
best solutions but also provide it with optimal time. In spite of
the different operators, the role of meta-heuristic operators [7]
intends to work on the local minimum values. In the
perspective of WSNs, the meta-heuristics approach is
employed for the cluster head selection by populating the set of
deployed sensor nodes. It is assessed by the fitness function of
the network performance.
This paper highlights the lifetime of the sensor nodes using
genetic algorithm and the prim algorithm. The connectivity
between the sensor nodes has improved by prim algorithm
which helps to extend the network lifetime by reducing the
communication iterations. Also, the number of intermediate
nodes is reduced to a large extent which is the major cause for
maximization of the network lifetime.
Hence, in this work, the main objective is an investigation
of the need of increasing the lifetime of the WSNs, develop an
improved method for increasing the lifetime by framing the
connectivity between the sensors and further comparison has
been compared based on the efficiency of the proposed method
with the existing techniques [5].For increasing the lifetime of
the sensor nodes energy-efficient routing is one solution which
minimizes maintenance cost and maximizes the overall
performance of the nodes [6].
Hence, this research work presents a novel method using a
prim algorithm and genetic algorithm which will increase the
lifetime of the WSN.
II. LITERATURE REVIEW
This section presents the existing techniques suggested to
find issues in enhancing the lifetime of the wireless sensor
nodes. Dunuka and Para, (2014) [8] has addressed about
extending the network lifetime by using two approaches: (1)
relay nodes to mitigate network geometric deficiencies and
using particle swarm optimization algorithm to find an optimal
sink position to make network energy efficient. (2) EBTAWSN
(Energy Balanced Transmission Algorithm for Wireless Sensor
Networks). The proposed approach can sense an element of
computation and communication, it also acts as an
1
administrator to measure, reach and observe events in the
transmission energy in a specific environment. In each of the
transmission rounds nodes with remaining energy higher than
threshold relays addition nodes and this distribution of energy
load improves lifetime.
Papadimitriou and Georgiadis, (2005) [9] have studied
about the sink capabilities at different locations while using
multiple hops for various energy requirements during the
network operations tends to increase the network lifetime.Two
joint problems, routing problem and scheduling problem
reduce the networks’’ lifetime, so using formulation in novel
linear program rectifies these two problems. For achieving the
network lifetime solutions the sojourn times and sink
movement should be in focus and the linear programming
formulation is taken outside of routing problem.Balancing of
the depletion in energy in sensor nodes and measuring the new
heuristics order by real practical system implantation helps in
increased in network size providing the prolong in a sensor
network lifetime.
Noori and Ardakani, (2007) [10] found that using a
probability model the WSNs lifetime can enhance such the
nodes are randomly distributed in some specific area. The
increase in the lifetime of the WSN is assumed by the Poisson
distribution where the packet is generated by the probability
model of the complementary cumulative density function.The
longevity can be predicted with the probability of the network
if sensors with the decaying of error exist in large numbers.
And this has been verified using computer simulation where
desired lifetime can be achieved using single, multiple hop and
the packet generation of the node with the parameters such as
initial energy, data rate and node density.
Kim, et al (2008) [11] has presented a work to minimize the
delay and maximize the lifetime of a WSN. Even though sleep-
wake schedule is an effective mechanism that increases the
lifetime of the network, the transmitting node has to wait until
the next relay node wakes up.Hence, in this work “anycast”
based packet forwarding scheme is proposed which reduces the
delay caused by sleep-wake mechanism. The “anycast”
technique among different candidate nodes practically
forwards the packet to the nearest node which wakes up. On
the basis of the result obtained, an answer for the joint control
issue of how to ideally control the framework parameters of the
sleep-wake scheduling protocol and the “anycast” packet-
forwarding protocol to maximize the network lifetime, subject
to a constraint on the expected end to end packet-delivery
delay is provided.Thus the scheduling policy of sleep, wake up
protocol and ‘anycast’ can maximize network's lifetime along
with practical scenarios proposed prior to heuristic solutions to
break the obstruction of the delay and extend the lifetime
through a process of non-Poisson wake up.
Dietrich and Dressler, (2009) [12] have depicted the key
qualities for increasing the life time of Wireless Sensor
Network would be obtained from availability, sensor inclusion
and nodes accessibility.The level of the consistence can be
evaluated; however the smooth corruption concept in view of
uses prerequisites of WSN. The new metric investigations with
sensor organize combination, associated coverage; service
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 06:02:29 UTC from IEEE Xplore. Restrictions apply.
disruption tolerance and time integration with a few algorithms
develop the Wireless Sensor Network lifetime.
Padmavathy and Chitra, (2010) [13] have examined about
the Wireless Sensor Network, which is constantly observed to
be deployed in conditions based on remote sensing, broadening
the lifetime of system alongside the enhancing of little size,
cost proficiency, constrained power supply, and low power
gadget.So, the basic factor of planning a system with a better
battery life of nodes is straightforwardly corresponding to
enhancing system lifetime. This should be possible by making
redundant nodes to rest mode, which preserves vitality, though
the dynamic node gives the k-coverage needs to extemporizing
the adaptation to non-critical failure. Hubs by scheduling the
redundant nodes to turn off, which are implemented on the
schemes based on centralization and localization based on the
threshold value of the network with algorithms, the WSN
lifetime, can be extended further.
Mariya, et al (2012) [15] has discussed about the
omnipresent computing stage being loaded with mobile ad-hoc
and the key of this innovation being the Wireless Sensor
Network, the life of these systems are less, so the utilization of
clustering methods make it conceivable to spare enough
vitality. The power conservation is restricted to the
accumulation of information effectively and utilization of
altered Tabu search system helps in energy utilization. This
methodology can maintain a strategic distance from wastage in
energy while transmission of hubs and expanding sensor
system's life.The advancement of disseminated organize
alongside the utilization of Maximizing Network Lifetime
algorithms (MNL) draws out the existence time of the system
in Wireless Sensor Network.
Khedikar, et al (2011) [14] identified the increase in
demand for the Wireless Sensor Network make it crucial for
the limitation to save energy and maximize the lifetime of
networks.The two functionalities of single Wireless Sensor
Network are detecting and correspondence the taking break
hubs can be augmented in both the area by the minimization of
utilization in vitality. The system topology will be changed
after the limited batteries vitality exhaustion yet arrange
lifetime augmenting is imperative, as it can't be extended if
constrained supply.So to address these issues WSN plans for
primary heads like extraction of books, exercises, utilizing
various techniques and fortify lifetime calculation by mixture
hereditary calculations, mix of execution parameters and
improving the inclusion procedure, and upgrading lifetime by
ideal planning calculations.
Jain, et al (2012) [17] has presented the proficient method
for devouring energy and boosting Wireless Sensor Network
with routing algorithms to expand the node lifetime.This
energy efficient algorithm based on routing selects the nodes at
best path with limited amount of energy for transmission of
data and less energy consumption at different rates.
The insatiable heuristic procedure is utilized in expending
less power, the best case scenario way to send additional power
to draw out the lifetime of nodes with cast links.To develop
and build an efficient way for energy at every node, and as the
adjusted energy expands lifetime of a system with Demand
Distance Vector Routing Algorithms, though Energy Efficient
Maximum Lifetime Routing Algorithm has higher, adjusting in
energy utilization and the convention premise has more
prominent packet delivery ratio, end to end delay, throughput
node of energy and routing overhead making it best choice for
increasing the lifetime of Wireless Sensor Network.
III. RESEARCH METHODOLOGY
The objective of this research is to maximize the lifetime of
a wireless sensor network by rearranging the connectivity
between sensors. The process involves three major phases as
shown in figure1 namely construction of trees, Identifying
critical tree using Prim’s algorithm and maximization of a
lifetime of WSN using genetic algorithm through connecting
networks.
Fig. 1. Phase involve in Proposed Methodology
The proposed work is implemented using MATLAB. The
number of nodes is defined and created in the network in a
random fashion. The edges between the nodes are created such
that every other node is connected to each other via a different
node with optimized distance.The next process is to create a
spanning tree. The critical tree identified and a spanning tree is
created using the Prim’s algorithm. A prim’s algorithm is a
kind of greedy algorithm. It starts with an empty spanning tree.
The idea is to maintain the linearity on two sets of vertices. The
first set contains the vertices already included in the MST; the
other set contains the vertices not yet included. At every step, it
considers all the edges that connect the two sets and picks the
minimum weighted edge from these edges. After picking the
edge, it moves the other endpoint of the edge to the set
containing MST.The Prim’s algorithm combines edge with
least weight into spanning-tree every time. So it can get
spanning tree with least weight, namely MST. The algorithm
allows finding the shortest path between the nodes, such that
the data can be transferred from the source node to the
destination node in less time and in an effective manner.
Every node is WSN is battery-powered hence; an efficient
algorithm is required, such that the lifetime of the nodes can be
increased. Hence, for increasing the lifetime of the nodes,
Genetic algorithm is implemented to reduce the distance
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 06:02:29 UTC from IEEE Xplore. Restrictions apply.
between the nodes such that only nearest neighbour with
improved lifetime can communicate with each other.
Following are the details of the proposed method.
A. Construction of Tree
After the implementation, construction of tree processes
will begin automatically. The base station sends to its
neighbours the identification parent and profounder. Every
neighbour penetrates in the recursive schedule as well as
identified its neighbours; suppose any neighbour does not have
profound and origin of identification, but it does not belong to
the neighbour of the base station, then neighbour penetrates in
a schedule.
B. Identify the critical tree
The data accumulated by the sensor nodes gives the prior
knowledge of the wireless environment. The energy between
the sensors nodes is calculated by the cost of
communications.Information acquired from the base station is
eventually monitored with high amount of energy. When the
tree’s construction is completed; next processes begin naturally
for identifying the critical tree that denotes a minimum ST
(spanning tree) by adopting a greedy algorithm such as a
Prim’s algorithm.The advantages of using Prim’s algorithm are
that the algorithm is relatively simpler and this algorithm is
considerably faster in the limit when there exist a dense graph
with more number of edges than vertices. In summary, Prim’s
algorithm operates in the following manner:
(1) Choose any starting vertex.
(2) Look at all edges connecting to the vertex and choose
the one with the lowest weight and add this to the
tree.
(3) Look at all edges connected to the tree that do not
have both vertices in the tree.
(4) Choose the one with the lowest weight and add it to
the tree.
(5) Repeat step 2 until all vertices are in the tree.
C. Maximization of a lifetime
The node lifetime can be enhanced using an appropriate
algorithm called a genetic algorithm. Following are the steps in
the genetic algorithm.
1. Generation of Random values Based on available
resource boundaries
2. Random generation depends on the minimum and
maximum values of resources of WSN. Following
Equation is employed.
I=min_val+ (max_val-min_val)*rand ……. (1)
3. The initial size (I) is depends on Population size
considered.
4. We need to pass all these values of objective functions.
Objective function: Lifetime of WSN.
5. Select one best value from Fitness function for a best
Maximum Lifetime of WSN.
6. Update the Initial Random values by integrating the
algorithm Parameters, i.e. constrained values will be
updated based on selected best fitness values.
7. Selection of optimum value, repeat the same process until
the completion of number iterations. Selection of a
number of iterations based on the required accuracy level.
Fig. 2. Flow chart of the genetic algorithm
The distance between the nodes after implementing the
prism algorithm is taken as the crossover operator in GA. The
maximum number of iterations is 100. Hence, depending on
the crossover operator, GA helps to find an optimal path,
reducing the distance between the nodes such that the lifetime
of the nodes in communication in WSN can be increased.
IV. DATA ANALYSIS AND INTERPRETATION
A. Evaluation boundaries
Assessment boundaries considered in this exploration for
tidy's calculation such Lifetime of sensor organizations, power
utilization, information rate, hub thickness, zone inclusion,
throughput, bundle conveyance proportion (PDR),
transmission scope of hubs, rest alert cycle, buffering
component, announcing energy, diminishing help quality and
assessment of organization lifetime.
1) Lifetime of sensor organizations
The lifetime of a specific hub or the sensor has been a
fundamental boundary to be resolved since the lifetime of a
hub will be utilized for deciding the security and dependability
of the sensor organizations and furthermore it manages the
foundation of the correspondence between the hubs and the
arrangements of the organization.
2) Power utilization
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 06:02:29 UTC from IEEE Xplore. Restrictions apply.
The numerical elements, for example, mean and change is
utilized for computing an arbitrary incentive alongside the
ordinary circulation, which establishes the force utilization by
the sensor hubs in remote organizations.It ought to be noticed
that the capacity, typical () is related to the CPN instrument
library and the produced esteem is then added to the variable
(energy_app) utilized for putting away the energy utilization by
various applications. The capacity ‘cal’ time is equivalent to
that of including energy. Be that as it may, it delivers an
irregular incentive for each change.
3) Data rate
Information rate is characterized as the speed at which
information is moved inside the sensor or between sensors.
Information rate is figured in bytes every second. Though the
exchange rate and space or time is characterized as the speed at
which sound and video records are encoded (packed) and are
estimated in bits every second.
4) Node Density
Hub thickness is resolved in this examination for breaking
down the bit of the expected associations in an organization
that is real associations where the hubs idle state for the
specific lifetime of the conveyed network.
5) Area inclusion
The inclusion region of the hub will consolidate the
incorporating climate. This zone covers the advancement of the
organization in the sensor hubs.
6) Throughput
The throughput of an organization is characterized as the
measure of information moved from source for objective inside
a specified measure of time in remote organization and it is
principally utilized for assessing the significant information
moved utilizing the sensor hubs in the organization.
7) Packet Delivery Ratio (PDR)
The bundle conveyance proportion is characterized as the
proportion of absolute numbers of parcels, conveyed to the
complete number of bundles sent from source hub to an
objective hub in WSNs. PDR in this investigation is assessed
for assessing the life expectancy of the information network
through which the information will be coordinated with the
improvement of the specific hub.
8) Transmission scope of hubs
Transmission scope of the hubs in a WSN is characterized
as the specific reach till where the hub is dynamic and the
scope of the organization which decides the hub arrangement
will be assessed in this examination.
9) Sleep wakeful cycle
Rest cognizant cycle is portrayed as the cycle in which each
hub presents inside the work will control the time of rest to
diminish the energy admission without trading off the inertness
of the data. Inside the rest cognizant cycle, each individual hub
will choose whether or not to stir for a chose cycle or no more.
They show that the sink inside the work which gets the data
(get-away spot sink) and the age of the information (flexibly
hub) might be grown principally dependent on the innovation
of the work.
 10) Buffering instrument The next step is the node deployment where the input nodes
Buffering instrument is characterized as the capacity of the are deployed randomly and then each of the nodes are assigned
hub to get the information on which the incorporation of the to node number. This process is illustrated in figure 4. The
sending of the work in the sensor of the hubs. Buffering time alive nodes are taken to find the closet of vertices. At each
will be distinctive for various hubs in the organization. round, the residual energy of the sensor nodes is monitored.
Since the main intention is to extend the lifetime of the sensor
11) Evaluation of Network Lifetime nodes, the local values of the sensor nodes are extracted in
To assess the lifetime of the WSN, this examination utilizes terms of residual energy.
a system created utilizing Prim's calculation and Genetic
calculation. For getting the example information for
reproduction investigation, a work of 100 locator hubs was
situated in a locale of 300 * 300 m2 utilizing aOMNeT++
reenactment instrument. The indicator in the remote
organization uses the energy or force for interfacing with
different hubs, for moving the information and for detecting.
The measure of intensity utilization is assessed by thinking
about the estimations on Mica2 hubs. In this exploration, two
various types of sensors were actualized on the hubs. Out of
100 hubs, 75 hubs were furnished with a low-esteem sensor
(the estimation of the sensor was assessed depending on the
energy utilization).Estimation esteems from these sensors were
gathered for like clockwork and these qualities will be sent to Fig. 4. Node Deployment
the focal station utilizing one little bundle. The remainder of
the hubs (25 hubs) is outfitted with a higher estimation of The next stage is the edge formation between the nodes, i.e.
energy utilization with an inspecting pace of 60 seconds. the connectivity between the nodes is established using the
The data from the 25 hubs is sent to the base station the technique of edge formation. With the help of a prim’s
utilization of 3 enormous bundles. For comprehension the algorithm, the nearest nodes are obtained by estimating the
multi-bounce discussion toward the sink, the hubs are provided residual energy.The evaluated fitness function determines the
by a convention stack, which comprises of 802.11 substantial stability of sensor nodes participating in the networks.
layers and make layers and the DYMO steering convention.
The sensor hub incorporates a totally little force gracefully unit
available to them, which hyperlinks the serious case lifetime
(the disappointing season of the rest of the hub) of the work for
a surmised season of 40 mins. For showing the portability
results, the proposed strategy is reproduced utilizing two
uncommon circumstances: (a) one with static hubs best (b) one
with 10% cell or enthusiastic hubs.
V. RESULTS AND DISCUSSION
In the network initialization phase, the inputs are provided
at the run time, which is the number of nodes to be considered
by the network, Source and destination. The simulation setup
of the wireless environment is given as, 20 number of nodes.
Initially, the node number 2 is taken as source node and the
node number 18 is taken as destination node which is shown in
fig. 3.

Fig. 5. Edge Formation

The prim’s algorithm is employed for determining the

shortest path between the source and destination nodes with
minimum hops. The shortest distance was found to be 30.5768.

Fig. 3. Network initialization

Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 06:02:29 UTC from IEEE Xplore. Restrictions apply.

Fig. 6. Application of Prim’s algorithm
Genetic Algorithm is employed for optimizing the lifetime.
The utilization of genetic algorithm helps in achieving the
maximum fitness is with the least number of iterations. It is
observed that fitness achieved saturation value in very less
time, due to the minimum number of intermediate nodes
between the source and destination.
Fig. 7. . Lifetime optimization
VI. CONCLUSION
The main aim of this study is to maximize the lifetime of a
WSN by rearrangement of the connectivity between sensors
using an improved genetic algorithm. Initially, the connectivity
of the sensor nodes is discovered by prim algorithm. The
process involved three major stages, namely tree construction,
Identification of critical tree using Prim’s algorithm and
lifetime maximization of WSN using genetic algorithm
through connecting networks. The mutation and crossover
operators of genetic algorithm have paved the way to extend
the lifetime of the networks by optimizing the communication
iteration among neighboring nodes.From the obtained results, it
is observed that hop length and fitness values are obtained in
less span of time. From the correlational study, it can be
inferred that applying a lesser number of nodes employed
consumed lesser amount of energy as compared to the higher
number of nodes. Also, the number of intermediate nodes has
been reduced to a large extent which is the major cause for
maximization of the network lifetime.
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on November 12,2022 at 06:02:29 UTC from IEEE Xplore. Restrictions apply.
REFERENCE
[1] Hussain, M.Z., Singh, M.P. and Singh, R.K., 2013. Analysis of lifetime
of wireless sensor network. International Journal of Advanced Science
and Technology, 53, pp.117-126.
[2] Lee, M.H. and Choi, Y.H., 2008. Fault detection of wireless sensor
networks. Computer Communications, 31(14), pp.3469-3475.
[3] Bari, A., Jaekel, A., Jiang, J. and Xu, Y., 2012. Design of fault tolerant
wireless sensor networks satisfying survivability and lifetime
requirements. Computer Communications, 35(3), pp.320-333.
[4] Challal, Y., Ouadjaout, A., Lasla, N., Bagaa, M. and Hadjidj, A., 2011.
Secure and efficient disjoint multipath construction for fault tolerant
routing in wireless sensor networks. Journal of network and computer
applications, 34(4), pp.1380-139.
[5] Halawani, S. and Khan, A.W., 2010. Sensors lifetime enhancement
techniques in wireless sensor networks-a survey.arXiv preprint
arXiv:1005.4013.
[6] Asorey-Cacheda, R., García-Sánchez, A.J., García-Sánchez, F., García-
Haro, J. and González-Castano, F.J., 2013. On maximizing the lifetime
of wireless sensor networks by optimally assigning energy supplies.
Sensors, 13(8), pp.10219-10244.
[7] Saraswat, J., Rathi, N. and Bhattacharya, P.P., 2012. Techniques to
enhance lifetime of wireless sensor networks: A survey. Global Journal
of Computer Science and Technology.
[8] Dunuka. C and Para. U, (2014), Maximizing Lifetime For Wireless
Sensor Network Using Swarm Optimization And Energy-Balanced
Nodes, International Journal of Scientific Research Engineering &
Technology (IJSRET), 3(6), pp. 1022-1027.
[9] Papadimitriou. I and Georgiadis. L, (2005), Energy-Aware Routing To
Maximize Lifetime In Wireless Sensor Network With Mobile Sink,
International Conference On Software, Telecommunication And
Computer Networks', pp. 1-26.
[10] Noori. M and Ardakani. M, (2007), a Probability Model for Lifetime of
Wireless Sensor Networks, University Of Alberta, Canada, pp. 1-9.
[11] Kim. J, et al (2008), Minimizing Delay and Maximizing Lifetime for
Wireless Sensor Network with Anycast, pp. 1-14.
[12] Dietrich. I and Dressler. F, (2009), on the lifetime of wireless sensor
networks. ACM Transmission Sensor Network 5(1), pp. 1-38.
[13] Padmavathy. T and Chitra. M, (2010), Extending the Network Lifetime
of Wireless Sensor Network Using Residual Energy Extraction—Hybrid
Scheduling Algorithm, Int. J. Communications, Network and System
Sciences, 3, pp. 98-106.
[14] Khedikar. R, et al (2011), maximizes a Lifetime of Wireless Sensor
Network by Scheduling, International Journal of Computer Science and
Telecommunications, 2(8), pp. 1-6.
[15] Mariya. E, et al (2012), Efficient Energy Saving And Maximizing
Network Lifetime In Wireless Sensor Network, International Journal of
Computer Science & Communication Networks, 2(6), pp. 636-640.
[16] Lakshmi. J and Neelima. M, (2012), Maximizing Wireless sensor
Network lifetime through cluster head selection using Hit sets, IJCSI
International Journal of Computer Science Issues, 9 ( 2,/3), pp. 328-
331.
[17] Jain. S, et al (2012), Energy Efficient Maximum Lifetime Routing For
Wireless Sensor Network, International Journal Of Advanced Smart
Sensor Network Systems ( IJASSN ), 2(1), pp. 1-11.