Enhancement in Divide and Conquer Scheme To Increase Efficiency of The Networks
Enhancement in Divide and Conquer Scheme To Increase Efficiency of The Networks
Enhancement in Divide and Conquer Scheme To Increase Efficiency of The Networks
ABSTRACT
Wireless sensor network is application based network.
Wireless Sensor Network may consist of multiple sinks
which may be mobile or static. If any system has more
than one sink, then it can generate the same query into
the Wireless Sensor Network. There are many issues in
wireless sensor network like battery consumption,
deployment, security etc. Battery consumption is a major
issue which degrades the performance of the system. In
this paper we focused on the divide and conquer scheme
which help to reduce the battery consumption in the
network. To overcome this problem a novel technique
will be proposed. Experimental results show the energy
levels of all the regions and packet loss.
Keywords - battery consumption, divide and conquer
scheme, relay nodes, Sensor nodes.
I.
INTRODUCTION
Wireless sensor network (WSN) is a network of
small light weight wireless nodes which are highly
distributed and deployed in large numbers. Wireless
sensor networks monitor the system or
environment by measuring physical parameters such
as humidity, pressure and temperature [6]. Wireless
sensor networks provide an economic approach for
the deployment of the control devices and
distributed monitors and avoid the expensive wired
system. Sensor nodes carry limited power resources
that are irreplaceable therefore; there is a need to
design an energy efficient technique to increase the
life of wireless sensor networks. An inbuilt trade-off
mechanism should be made so that the end-user
www.ijsret.org
823
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 4, July 2014
II.
RELATED WORK
www.ijsret.org
824
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 4, July 2014
Tl(Is) = (Cp(x)d,Cp(y)+d)
(3)
Coordinates of bottom left corner of Is, Bl(Is)
Bl(Is) = (Cp(x)d,Cp(y)d)
(4)
Where, d is the factor of distance from center of network
to boundary of Is value of d for Ms and Os increases
with a multiple of 2 and 3 respectively. If there are n
number of concentric squares then the coordinates of nth
square can be found, Sn from the following equations.
Tr(Sn)
Br(Sn)
Tl(Sn)
Bl(Sn)
=
=
=
=
(Cp(x)+dn,Cp(y)+dn)
(Cp(x)+dn,Cp(y)dn)
(Cp(x)dn,Cp(y)+dn)
(Cp(x)dn,Cp(y)dn)
(5)
(6)
(7)
(8)
www.ijsret.org
825
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 4, July 2014
Protocol Operation
In setup phase BS divides the network field into small
regions, on the bases of their co-ordinates. Is nodes
sending data directly to BS. In each region one CH is
selected per round. CHs of Os regions, select front
neighboring CHs of Ms regions as their next hop CH.
Nodes of CR selects, BS or neighboring CHs as their
CH, based on minimum distance. If a tie is occurs, for a
node of CR, in selection of CH from its neighboring
regions than, it is resolved by selecting the CH with
greater residual energy. In steady state phase each node
sends its data to CH in its allocated time slot. Primary
level CHs send aggregated data to their respective
secondary level CHs. Secondary level CHs then,
aggregate all collected data and forward it to BS.
IV.
V.
EXPERIMENTAL RESULTS
PROPOSED METHODOLOGY
www.ijsret.org
826
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 4, July 2014
CONCLUSION
VII.
REFERENCES
Journal Papers:
[1] K.Maraiya, K. Kant, N. Gupta, Application based Study
on Wireless Sensor Network International Journal of
Computer Applications (0975 8887), Volume 21 No.8,
May 2011, 2006.
www.ijsret.org
827