International Journal of Engineering Research

Volume No.5, Issue No.7, pp : 599-601

ISSN:2319-6890)(online),2347-5013(print)
1 July 2016

Algorithm to Increase Energy Efficiency and Coverage for Wireless Sensor

Network
Aphrin S.Pathan
Student at G.H.Raisoni college of Engineering and management wagholi,pune
aphrin.pathan@gmail.com
Abstract: Our proposed coverage and energy conscious
network grounded on energy well organized routing in the
WSN with aim of making the most of networks lifespan. In
suggested system, difficulty is formulated linear
programmings (LP) with coverage, energy and the
connectivity constraints. Cluster heads choice is projected
using Learning in networks followed by the coverage,
connectivity routing with packet transmissions. The
projected system is equated with present systems with
parameters like number of live nodes, packet delivery, and
node energy. The energy systems for sensor network which is
not do efficiently for heterogeneous networks. So Energy
effective cluster protocol is design for heterogeneous sensor
networks. Here energy efficient cluster protocols for
heterogeneous networks and likens protocols on points as
location cognizance, cluster methods, heterogeneity and
clustering Points.)
Keyword: clustering, Coverage, energy, power
consumption.

II.I SYSTEM ARCHITECTURE

I. Introduction
Wireless network are networks which are having group of
nodes rooted with simplest process, less memory, minute
sensing, and the energy inadequate battery. The correctness
of information is determined by coverage in observing
region. In other case cause of energy limitation there should
be optimum energy consumption while improving coverage
efficiency. A lot much attention has drawn towards two basic
problems in WSN namely power balancing and coverage
efficiency. There are so many coverage based routing
algorithms designed to face outdated problems of energy
preservation in the WSN. Coverage and energy are also
prime factors in WSN with the energy preservation. For
acceptable coverage is major question in WSNs. Also cause
of energy constrain environment so many tasks to face to
improve coverage. Efficient methods for coverage are
enhanced coverage with balancing of power intake amongst
nodes. Nodes in WSN are considered by partial power and
capabilities and predictable to functions for prolonged
periods with negligible intervention.

II. Material and Methodology

Literature survey:-

IJER@2016

The energy and the coverage conserving system is extension of

the LEACH. Also it adjusts unique nodes arrangement system
tracked by clusters creation and stable state. It also checks
coverage preservations in the round by analysis by
convergence.

Cluster head selection

1. Node carries energy levels and degree of neighbor to base
stations.
2. Base station chooses node with maximum energy and
optimal degree of cluster heads. It uses topographical info
obtainable with this.
3. Base station multicast information for the CH to the other
node.

Energy Model
The scheduling system save energy and increasing lifetime by
likening energy feeding per node in unique and the novel
LEACH. If costing of scheduling of nodes dominates energy
consumptions in every round, its improved protocol, energy is
spent in following parts: transmission of data for cluster form
(Ec) and data gather (Eg). In LEACH, additional energy
needed for node arrangement phase. The similar energy
parameter and the radio, which shows that energy
consumptions is transmitter disperses ETx (l, d) J energy for
running nodes and the power amplifiers. To calculate
transmission costing for l-bit packet and distance d which
shown below: In above equation l is nothing but message
length in bits; Eelec represents electronic energy. The factor d
is distance between source and destination.

doi : 10.17950/ijer/v5s7/711

Page 599

International Journal of Engineering Research

Volume No.5, Issue No.7, pp : 599-601

ISSN:2319-6890)(online),2347-5013(print)
1 July 2016

Coverage preserving node scheduling

To improve LEACH with scheduling of nodes scheme, the
way is to insertion the self-scheduling. Phase of proposed
system before LEACH clusters set up. In beginning of every
round all nodes self-determining either to go off or stay On
and off duty nodes wont contribute in clustering starting and
steady state followed. The improvement of timeline is our
node schedule system is surrounded into LEACH without
having modifications in original.

We can equate proposed systems time with minimum handing

time and existing time. Fig3 displays evaluation on nodes as
inputs i.e. nodes with time require for minimum
process,present scheme time and proposed system with unlike
value.

III. Results and Tables

Figure 1
II.II EVALUTION
Experimentations done on unlike clusters completed of node
namely N1, N2, N3 to N10 which are having energy of
nodes which provides result in handling times compulsory for
unlike nodes and clusters creations founded on nodes which
are having higher energy will be clusters head CH. This
experimentation results as shown in table.
Node
Energy
N1
10
N2
5
N3
3
N4
2
N5
6
N6
4
N7
4
N8
8
N9
5
N10
5
Fig. Table 1: Node Energy.

Fig3: Comparison for Time Constraints on Node

ACKNOWLEDGMENT
I take this golden opportunity to own my deep sense of
gratitude to my project guide Miss Shabda Dongavkar for his
instinct help and valuable guidance with a lot of
encouragement thought this project work, right from selection
of topic up to its completions.
My sincere thanks to H.O.D of computer engineering
Prof. Poonam Gupta who continuously motivated and guided
us for completion of this project. I am also thankful to our P.G
co-ordinator Prof. Vidya Dhamdhare all teaching and non
teaching staff members, for there valuable suggestion and
valuable co-operation for completion of this project.I specially
thanks to those who helped us directly or indirectly in
completion of this work successfully.

IV. Conclusion
Numerous investigators introduce routing methods as debated
above to enhancement in unlike parameters related to network
node for example Delay, Throughput, Energy, Transmission
time, Bandwidths. Routing through energy consciousness is
modern subject in investigation to upsurge network life and
performances. Network cant accept only protocol universally
so that it needs to project protocols which satisfy all
circumstances and parameter.
For future to advance Routing with bearing in mind power
conscious for example delay, cost,transmission link, energy
time, and aware parameter to increase nodes era, consistency
of information,increasing throughput, packets delivery ratio.

Fig. Node Energy

IJER@2016

doi : 10.17950/ijer/v5s7/711

Page 600

International Journal of Engineering Research

Volume No.5, Issue No.7, pp : 599-601

ISSN:2319-6890)(online),2347-5013(print)
1 July 2016

References
i.
R. Velmani and B. Kaarthick, An Efficient
Cluster-Tree Based Data Collection Scheme for Large Mobile
Wireless Sensor Networks,page no. 2377, IEEE Sensors Journal, Vol.
15, no. 4, April 2015.
ii.
C. Tunca, S. Isik, M. Donmez, and C. Ersoy,
Ring Routing: An Energy-Efficient Routing Protocol for WSNs with a
Mobile Sink,page no.1947, IEEE Transactions on mobile computing,
Volume 14, No. 9,Sept 2014.
iii.
M. Arifuzzaman, M. Matsumoto and T. Sato, An
IH-MAC With Traffic-Differentiation-Based QoS for WSNs, IEEE
Sensors Journal, Vol. 13, No. 6,June 2013.
iv.
K. Kr. Gola, B. Gupta, Z. Iqbal, An Energy
Efficient Cross-Layer Network Operation Model for IEEE 802.15.4
Based MWSNs, IEEE 2014.
v.
M. Abo-Zahhad, S. M. Ahmed, N. Sabor and S.
Sasaki, Mobile Sink Based Adaptive Immune Energy Efficient
Clustering Protocol for Improving Lifetime and Stability Period of
WSNs, IEEE Sensors Journal, Vol. 15, No. 8, August 2015.

IJER@2016

vi.
Y. Yao, Q. Cao and A. V. Vasilakos, EDAL:
Energy Efficient Delay Aware and Lifetime Balancing Data
Collection Protocol for Heterogeneous WSNs. IEEE 810 IEEE/ACM
Transactions on Networking, Vol. 23, No. 3, June 2015.
vii.
J. Leu, T. H. Chiang, M. Yu, and K. Su, An
Energy Efficient Clustering Scheme for Prolonging the Lifetime of
WSN With Isolated Nodes, IEEE Communication Letters, Vol. 19, No.
2, Feb.2015.
viii.
J. Long, M. Dong, K. Ota, A. Liu and S. Hai,
Reliability Guaranteed Efficient Data Gathering in Wireless Sensor
Network,Digital Object Identifier 10.1109/ACCESS.2015.2426794, 28
April 2015.
ix.
A. Arya, J. Singh, Comparative Study of AODV,
DSDV and DSR, Routing Protocols in WSN Using NS-2 Simulator,
IJCSIT, Vol. 5 (4) , 2014, 5053-5056.
x.
K. Kr. Gola, B. Gupta, Z. Iqbal, High Speed Data
Collection in Wireless Sensor Network, IJARI, Vol. 2, Issue 3 618622, ISSN 2347 3258, August 2014.

doi : 10.17950/ijer/v5s7/711

Page 601