SlideShare uma empresa Scribd logo
1 de 8
Baixar para ler offline
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
      Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                      Vol. 3, Issue 1, January -February 2013, pp.712-719
   Energy And Time Delay Efficient Wireless Sensor Network By
           Least Spanning Tree Algorithm: A Survey
        Priya1, Satyesh Sharan Singh2, Mukesh Kumar3, Rohini Saxena4,
                       1
                        PG Student ECE, SHIATS(Deemed-to-be-university), U.P., India,
                      2
                        PG Student ECE, SHIATS (Deemed-to-be-university), U.P., India,
                  3
                    Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India,
                  4
                    Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India,

Abstract
         In this paper we are going to survey the         use the available bandwidth and energy efficiently.
different type of topology and techniques for             Energy usage is an important issue in the design of
making an energy efficient WSN with least time            WSNs which typically depends on portable energy
delay approach .WSNs are used in defense field            sources like batteries for power .WSNs is large scale
where lest time delay and life of sensors are most        networks of small embedded devices, each with
important because the life of solider are depends         sensing,     computation      and      communication
on fast information transmission . Hence energy           capabilities. They have been widely discussed in
and time delay are very scarce resources for such         recent years. Coverage is one of the most important
sensor systems and has to be managed wisely in            challenges in the area of sensor networks. Since the
order to extend the life of the sensors and               energy of sensors are limited, it is vital to cover the
minimizing time delay for the duration of a               area with fewer sensors. Generally, coverage in
particular mission. In past a lot of cluster based        sensor networks is divided into area coverage, point
algorithm and techniques were used. In this               coverage, and boundary coverage subareas.
paper we also find out all type of algorithm,             Coverage does not ensure connectivity of nodes.. In
their application and limitation and present              WSNs the sensor
techniques to overcome the problems of low                nodes are often grouped into individual disjoint sets
energy and time delay of sensor and compare               called a cluster, clustering is used in WSNs, as it
them with least spanning tree based algorithms            provides network scalability, resource sharing and
and techniques .                                          efficient use of constrained resources that gives
                                                          network topology stability and energy saving
Keywords: Wireless sensor networks, energy                attributes. Clustering schemes offer reduced
efficient clustering, LEACH, energy efficient             communication overheads, and efficient resource
algorithms, least spanning tree algorithm.                allocations thus decreasing the overall energy
                                                          consumption and reducing the interferences among
1. INTRODUCTION                                           sensor nodes. A large number of clusters will
          Advances in sensor technology, low-power        congest the area with small size clusters and a very
electronics, and low-power radio frequency (RF)           small number of clusters will exhaust the cluster
design have enabled the development of small,             head with large amount of messages transmitted
relatively inexpensive and low-power sensors,             from cluster members. In this paper we are going to
called microsensors[1] The emerging of low power,         survey different types of energy efficient and
light weight, small size and wireless enabled sensors     coverage efficient wireless sensor network.
has encouraged tremendous growth of wireless
sensors for different application in diverse and          2. SURVEY
inaccessible areas, such as military, petroleum and       2.1 LEACH [Low Energy Adaptive Clustering
weather monitoring. These inexpensive sensors are         Hierarchy][4] and Its Descendant
equipped with limited battery power and therefore                  One of the well known clustering protocols
constrained in energy [4]. One of the fundamental         called LEACH[Low Energy Adaptive Clustering
problems in wireless sensor network is to maximize        Hierarchy][2]. LEACH is a cluster-based protocol
network lifetime and time delay in data                   that includes distributed cluster formation in which
transmission. Network lifetime is defined as the          the nodes elect themselves as cluster heads with
time when the first node is unable to send its data to    some probability. The algorithm is run periodically
base station. Data aggregation reduces data traffic       and the probability of becoming a cluster head for
and saves energy by combining multiple incoming           each period is chosen to ensure that every node
packets to single packet when sensed data are highly      becomes a cluster head at least once within 1/P
correlated. In a typical data gathering application,      rounds, where P is the predetermined percentage of
each node sends its data to the base station, that can    cluster heads. LEACH organizes its operation into
be connected via a wireless network. These                rounds, where each round consists of a setup phase
constraints require innovative design techniques to       where clusters are formed and a steady state phase



                                                                                                 712 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
      Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                      Vol. 3, Issue 1, January -February 2013, pp.712-719
that consists of data communication process.              determined. MS-Leach is based on the critical value.
LEACH provides significant energy savings and             Simulation results clearly show that MS-Leach
prolonged network lifetime over conventional              outperforms at most by 200% in term of network
multihop routing schemes, such as the Minimum             lifetime. It is proposed as future work its
Transmission Energy (MTE)[2] routing protocol.            relationship between multi-hop and single-hop
                                                          transmissions will be analyzed in-depth in various
2.1.1 LEACH-C [5]                                         protocols and new mechanisms of routing will be
          However, LEACH does not guarantee that          developed.
the desired number of cluster heads is selected and
cluster heads are not evenly positioned across the
network. A further improvement of this protocol           2.1.5 LEACH-Heterogeneous [7]
known as LEACH-C[4].                                                In this paper, LEACH-HPR introduced an
          In LEACH-C, the cluster formation is done       energy efficient cluster head election method and
at the beginning of each round using a centralized        using the improved Prim algorithm to construct an
algorithm by the base station. The base station uses      inter-cluster routing in the heterogeneous WSN.
the information received from each node during the        Simulation results show LEACH-HPR is more
setup phase to find a predetermined number of             efficient to reduce and balance energy consumption
cluster heads and configures the network into             and hence enhance the lifetime of WSN
clusters. The cluster groupings are then chosen to
minimize the energy required for non-cluster head         2.2 Power-Efficient Gathering in Sensor
nodes to transmit their data to their respective          Information Systems [PEGASIS][8]
cluster heads. Results in[4] have shown that the                   Another clustering protocol which aims to
overall performance of LEACH-C is better than             enhance the network lifetime is (PEGASIS)[5].
LEACH due to improved cluster formation by the            Power-Efficient Gathering in Sensor Information
base station. Moreover, the number of cluster heads       Systems (PEGASIS) uses a greedy algorithm to
in each round of LEACH-C is equal to the desired          organize nodes into a chain, so that each node
optimal value, whereas for LEACH the number of            transmits and receives from only one of its
cluster heads varies from round to round due to the       neighbors. In each round, a randomly chosen node
lack of global coordination among nodes.                  from the chain will transmit the aggregated data to
                                                          the base station and reduce the number of nodes that
2.1.2 LEACH-Fixed on of cluster[6]                        communicate directly with the base station.
          LEACH-F is an algorithm in which the
number of clusters will be fixed throughout the           2.3Hausdroff Clustering [16]
network lifetime and the cluster heads rotated within              Authors considered that, once cluster
its clusters. Long term phase of LEACH-F is               formations take place it’s remaining same
identical to that of LEACH. LEACH-F have some             throughout the network lifetime. This algorithm
limitation because it may or may not be provided          maximizes the lifetime of each cluster in order to
energy saving and this protocol does not provide the      increase the life time of the system. Cluster life time
flexibility to sensor nodes mobility or sensor nodes      can be enhanced by rotating the role of cluster heads
being removed or added from the sensor networks           (CHs) among the nodes in the cluster. Cluster heads
                                                          selection basically based on the residual energy of
2.1.3 LEACH-Energy Threshold [6]                          the sensor nodes and it also used the proximity of
          In this cluster will change only when one       neighbors as a secondary criterion for enhancing
of the following conditions is satisfied: first, Energy   energy efficiency and further prolong the network
consumed by anyone of the cluster head nodes              lifetime. The Hausdroff clustering algorithm is
(CHs) reach energy threshold (ET) in one round.           equally applicable for both uniform and nonuniform
Second, every sensor node should know the energy          sensor node initial energy distribution.
threshold (ET) value. If in initial phase, anyone of
the cluster head nodes dies. If any sensor node acts      2.4 PDCH: Pegasis Algorithm Improving Based
as a cluster head node (CHs) in a certain round, it       on Double Cluster Head [20]
should have the energy dissipated value and                        Authors proposed an algorithm based on
compares the dissipated value with the energy             hierarchical chain topology and this algorithm using
threshold (ET) value.                                     bottom level cluster head and super level cluster
                                                          head to improve the load balance. In the hierarchical
2.1.4 MS-LEACH [Multi-hop and Single hop-                 structure, base station (BS) is the center of a circle.
Low Energy Adaptive Clustering Hierarchy][6]              The BS will predefine the number of levels and
         In this paper the authors have analyzed the      every node's distance to BS decided the level which
problem of energy consumption of the single-hop           it belongs to. Every node receives the signal from
and multi-hop transmissions in a single cluster.          the BS, then according to the signal strength to
Finally a critical value of the cluster area size is      detect the distance to BS. PDCH outperform to



                                                                                                 713 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
      Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                      Vol. 3, Issue 1, January -February 2013, pp.712-719
PEGASIS algorithm and it is also useful for large
networks.

2.5 Base station Controlled Dynamic Protocol
[BCDCP][9]
        An approach called Base station Controlled
Dynamic Protocol (BCDCP)[7] is proposed which
produces clusters of equal size to avoid cluster head
overload and to ensure similar power dissipation of
nodes.

2.6 EECS: Energy Efficient Clustering Schemes
[12]
          Authors proposed an algorithm in which
cluster formation is different from LEACH protocol.
In LEACH protocol cluster formation takes place on
the basis of a minimum distance of nodes to their
corresponding cluster head. In EECS, dynamic
sizing of clusters takes place which is based on
cluster distance from the base station. The results
are an algorithm that addresses the problem that
clusters at a greater distance from the sink requires
more energy for transmission than those that are
closer. Ultimately it provides equal distribution of
energy in the networks, resulting in network
lifetime. Thus main advantage of this algorithm is
the full connectivity can be achieved for a longer
duration. So we can say it provides reliable sensing
capabilities at a larger range of networks for a
longer period of time. It provides a 35 percent
improvement in network life time over LEACH
algorithm.

2.7 EEUC: Energy Efficient Unequal Clustering
[14]
         This scheme is distance based scheme
similar to EECS and it also required that every node
has global identification such as its locations and
distances to the base station. Hotspot is the main
problem in WSNs because of multi hopping that
occurs when CHs closer to the sink tend to die faster
compare to another node in the WSNS, because they
relay much more traffic than remote nodes. This
algorithms partition the all nodes into clusters of
unequal size, and clusters closer to the sink have
smaller sizes than those farther away from the sink.
Thus cluster heads (CHs) closer to the sink can
conserved some energy for the inter-cluster data
forwarding. Energy consumed by cluster heads per
round in EEUC much lower than that of LEACH
standard but similar to HEED protocol.

2.8 BARC: Battery Aware Reliable Clustering
[15]                                                    Fig-1 Different types of cluster based technique
         In this clustering algorithm authors used
mathematical battery model for implementation in
WSNs. With this battery model authors proposed a
new Battery Aware Reliable Clustering (BARC)
algorithm for WSNs. It improves the performance
over other clustering algorithms by using Z-MAC



                                                                                              714 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
      Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                      Vol. 3, Issue 1, January -February 2013, pp.712-719
                                                           and least spanning tree for wireless sensor network
                                                           to prolong network lifetime and shorten path while
          and it rotates the cluster heads according to    emphasizing energy conservation at the same time.
battery recovery schemes. A BARC algorithm                 Clustering includes partitioning stage and choosing
consists of two stages per round for selection of          stage, namely, partitions the multi-hop network and
cluster heads: initialization or setup and steady state.   then chooses cluster-heads, cluster-head is
In this formation of cluster, take place by electing a     responsible for receiving, sending and maintaining
set of CHs. BARC enhances the network lifetime             information in its cluster. Then all cluster-heads will
greatly compare to other clustering algorithms.            construct a least spanning tree to prolong network
                                                           lifetime ,save energy and shorten path. Simulation
2.9 PSO-Clustering [22]                                    results show that the system’s performance have
         In this paper authors proposed PSO-               further improved by using clustering and least
clustering which have four variants of PSO: PSO-           spanning tree, It is a promising approach and
TVIW (PSO with time varying inertia weight),               deserves more future research.
PSO-TVAC (PSO with time varying acceleration
constants), HPSO-TVAC (hierarchical PSO-TVAC)              3. MAIN THEORY
and PSO-SSM (PSO with supervisor student mode)                        THE Minimum Spanning Tree (MST)
for energy aware clustering in WSNs. This                  method that is an important and commonly
algorithm is applicable only when each node has            occurring primitive in the design and operation of
fixed Omni-directional transmission range, the             data and communication networks. For instance, in
sensor field should be mapped into a 2-Dimensional         ad hoc sensor networks, MST is the optimal routing
space and nodes are randomly distributed. After            tree for data aggregation [2]. Traditionally, the
deployment of the nodes, the nodes are static and          efficiency of distributed algorithms is measured by
the positions of the nodes are known to the base           the running time and the number of messages
station. The base station runs the clustering              exchanged among the computing nodes, and a lot of
algorithm and updates nodes about their cluster-           research has gone into the design of algorithms that
head and all nodes should have same transmission           are optimal with respect to such criteria.
ranges and hardware configurations.                                   Cluster based spanning tree can improve
                                                           lifetime of the network and also gives the shortest
2.9.1 PSO-C: Centralized-PSO [23]                          path for minimum propagation delay. Clustering
         Authors      proposed      centralized-PSO        includes partitioning stage and choosing stage,
algorithms, in which the nodes which have energy           namely, partitions the multi-hop network and then
above average energy resource are elected as the           chooses cluster-heads, cluster-head is responsible
cluster heads. In this authors also compare this           for receiving , sending and maintaining information
algorithm with LEACH protocol and with LEACH-              in its cluster. Then all cluster-heads will construct a
C. Simulation results show that PSO outperform to          least spanning tree to prolong network lifetime ,save
LEACH and LEACH-C in term of network life time             energy and shorten path. Paper review results show
and throughput etc. It also outperforms GA and K-          that the system’s performance have further
means based clustering algorithms.                         improved by using clustering and least spanning
                                                           tree, It is a promising approach and deserves more
2.9.2 Distributed PSO[23]                                  future research. Sensors and cluster-heads are
         PSO control algorithm try to minimize             assumed to be stationary or limited moving inside
radio power while ensuring connectivity of the             clusters. Sensors receive commands from and send
network. In this paper author proposed an important        data to its cluster-head, which does pre-processing
metric for a sensor network topology that involve          for the data and forward them to other cluster-heads.
consideration of hidden nodes and asymmetric links.        A cluster-head is located within the communication
It minimizes the number of hidden nodes and                range of all the sensors of its cluster and can
asymmetric links at the expense of increasing the          communicate with its neighbour cluster-heads.
transmit power of a subset of the nodes may in fact        Since a cluster-head forwards traffic to other cluster-
increase the longevity of the sensor network. Author       heads with longer distance as compared to its
explores a distributed evolutionary approach to            sensing nodes, in some applications it is more
optimize this new metric. Author generates                 powerful than the sensing nodes in terms of energy,
topologies with fewer hidden nodes and asymmetric          bandwidth and memory [11,12], while others select
links than a comparable algorithm and presents             cluster–heads from the deployed sensors [13,14].
some results that indicate that his topologies deliver     When a cluster-head is under failure due to
more data and last longer.                                 insufficient power, another cluster-head will be
                                                           selected among the sensors(assume a sensor can
2.10. Least Spanning Tree based clustering[21]             adjust its transmission power to a larger value (for
        In this paper, Authors proposed an novel           relaying requirement) once it is selected as a cluster-
energy-efficient routing protocol based on clustering      head. The details on transmission power control



                                                                                                  715 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
       Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                       Vol. 3, Issue 1, January -February 2013, pp.712-719
issues are referenced in for example [15,16]). The
cluster-based architecture raises many interesting                                        2                     2
issues such as cluster formation, cluster-head            Where di ,j =         Xi − XJ       +       Yi − YJ
selection and cluster maintenances, which are
beyond the scope of this work. Here,                      The jth cluster-head as the receiver, the power
          we only focus on modelling the traffic          consumed by this communication is then simply as
behaviour along with the multi-hop cluster-heads by       the Eq (4)
least spanning tree. The system model consists of
five parts: (1) constructing cluster-head part, in each   Er (j , i) = er B Ai                    (4)
area dynamic constructing a cluster head according
to the remainder energy.(2) constructing least                      By combining Eq. (1) to Eq. (4) we can
spanning tree, according to the cluster-head, sink        make a cluster-based WSN model. We know the
will dynamic construct least spanning tree to             energy consumed at the cluster head is much larger
achieve maximum lifetime and prolong network              than that at individual sensing node. The reason is as
lifetime.(3)sensing part, the sensors around the          follows: (1) the cluster-head needs to relay all the
target area are responsible for probing the               traffic of the cluster; (2) for each data unit, the
target/event and send the collected data to their         cluster-head needs to transmit longer distance due to
cluster-head; (4) relaying part, the collected data are   transmission between clusters, while the sensing
relayed among the cluster-heads by least spanning         nodes just transmit data inside the cluster. In view of
tree until to the sink; (5) sink, the sink performs       this, let Ep and Ec be, respectively, the current
system-level data analysis and process for an overall     energy and clustering energy(Ec is fixed), after a
situation awareness.                                      period of time, the ith cluster-head has transmits
The energy model based on the given energy                information n1 times and has receives information
equation:                                                 n2 times before T1(suppose the energy of the ith
                                                          cluster-head is not lower than the threshold and the
Et (i) = (et + ed r n )B                     (1)          information unit is A Erlang ) .the remainder energy
                                                          of the ith cluster-head at T1 is then simply as the Eq
          Where et is the energy/bit consumed by the      (5) .
transmitter electronics (including energy costs of in
per strongly dominates other node functions such as                         n                     n
                                                          Ep (i)=Ep (i) – k=1 Et (i , k) - l=1 Et (i , l) - Ec
                                                                              1                  2
fact duty cycling due to finite start-up time), and ed    ×ni ..(5)
accounts for energy dissipated in the transmit op-
                                                          where i,j,k is respectively denote cluster-head, ni is
amp (including op-amp inefficiencies). Both et and        the clustering time in cluster i before T1
ed are properties of the transceiver used by the          By Ep(5),we can compute the remainder energy, if
nodes, r is the transmission range used. The              Ep(i) is lower than Ev, then modify the information
parameter n is the power index for the channel path       table of the ith cluster-head: set flag=0; broadcast
loss of the antenna. B is the bit rate of the radio and   information to it’s children, .also inform the
is a fixed Topology management provides the               neighbor jth cluster-head doesn’t transmits
distributed parameter in our study                        information to it, and let ith cluster-head i is in the
                                                          sleeping state; else the ith cluster-head may go along
         On the receiving side, a fixed amount of         the next clustering
power is required to capture the incoming radio           or transmitting or receiving. According to Prim
signal where er is the energy/bit consumed by the         algorithm, suppose undirected graph G (V,E,D)
receiver electronics used by the node. Typical            ,where V is the set of cluster-heads and the number
numbers for currently available radio transceivers        is N, E is the set of connections of cluster-head, and
are et= 50× 10-9J/bit, er=50×10-9 J/bit, ed=100×          D is the distance of cluster-heads, the process of
10-12J/bit/m (for n=2) and B=1 Mbit/s [18].               constructing least spanning tree as illustrated below:
                                                           Initializatio:V1=Sink, E′=null, ,and V2=V-V1.
Er (j) = er B                       (2)                   • Set a edge: which has minimum distance from
                                                          Sink to one cluster-head (suppose is Vi),where Vi is
         Now     let     us    consider      one-hop      directly connected to Sink, then set,V1={Sink,vi},
communication in a finite one dimensional network         E ′ ={(Sink,vi)} , V2=V2-V1.
from the ith cluster-head to the jth cluster-head         • For each cluster-head Vk in V1 do :select a
across a distance di,j. If the ith cluster-head will      minimum distance dk,j,which Vk∈V1,Vj∈ V2 and
generate A Erlang and the distance of the ith cluster-    e′=(Vk,Vj) ∈E ,but is not∈E′, then V1=V1∪Vj,
head and the jth cluster-head is dij,so the power         E′={(Vk,Vj)} ∪e′, V2=V2-Vj.
consumed by this communication is then simply as          • if V2 is empty then end, else go to (3).
the Eq. (3).

 Et (i , j) = (et + ed dnj ) B Ai
                        i                    (3)


                                                                                                      716 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
      Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                      Vol. 3, Issue 1, January -February 2013, pp.712-719


                         Sink                                  Sink




 (a)The least spanning tree before                         (b)The least spanning tree after
 Re-clustering                                             Re-clustering



Fig-2 The least Spanning Tree

When a cluster-head’s energy is lower than              REFERENCES
threshold, then first renewably select a node as new
cluster-head in the cluster, second renewably            [1]     I.F.     Akyildiz,     W.      Su,       Y.
execute constructing least spanning tree algorithm,              Sankarasubramaniam,(2000)                E.
so a new constructing least spanning tree has                    Cayirci,Wireless sensor networks: a
constructed, all sensing information can be send to              survey, Computer Networks 38 393–422.J.
Sink along the new least spanning tree, this                     Clerk Maxwell, A Treatise on Electricity
algorithm can efficient shorten path and prolong                 and Magnetism, 3rd ed., vol. 2. Oxford:
network lifetime. As illustrated in Fig.1. Fig.1(a)              Clarendon, 1892, pp.68–73.
show the initial least spanning tree, after some time    [2]     M. Ilyas, I. Mahgoub,(2000) Handbook of
,if the power of C1’s cluster head is lower threshold            Sensor Networks:Compact Wireless and
,nodes in C1 will execute re-clustering to choose a              Wired Sensing Systems, CRC Press,New
new cluster-head, this time system will execute                  York .
constructing least spanning tree algorithm, and make     [3]     W. Ye, J. Heidemann, D. Estrin,(2000)
a new least spanning tree as Fig.1(b).we can know                Medium access control with coordinated
the total-path of new least spanning tree is shorter             adaptive sleeping for wireless sensor
than old least spanning tree.                                    networks, IEEE/ACM Transactions on
                                                                 Networking 12 (3) 493–506.
3. CONCLUSION                                            [4]     W.B. Heinzelman, A. Chandrakasan, H.
                                                                 Balakrishnan,(2000)Energy          effcient
         From the literature review of cluster based             communication protocol for wireless
Minimum Spanning Tree and other cluster based                    microsensor networks, in: IEEE Hawaii Int.
algorithm we have a lot of advantages of cluster                 Conf. on System Science, Hawaii, USA,,
based Minimum Spanning Tree over other                           pp. 1–10.
algorithm. Since with cluster based Minimum              [5]     W. R Heinzelman, A. P Chandrakasan, and
Spanning Tree we can add more application of other               H.                   Balakrishnan,(2000),
algorithm such as power gathering and distributed                “Energyefficient communication protocol
least spanning tree. By these applications we can                for wireless microsensor networks,” in
improve the efficiency of WSN and also reduce the                Proceedings of the 33rd Hawaii
power delay of the information and increase the                  International Conference on System
range of sensor nodes.                                           Sciences.




                                                                                             717 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
       Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                       Vol. 3, Issue 1, January -February 2013, pp.712-719
[6]     I.     F.    Akyilldiz,    W.     Su,     Y.          Hawaii International Conference on System
        Sankarasubramaniam and E. Cayirci,                    Sciences.
        (2002), “A survey on sensor networks,”         [17]   S.Lindsey,C.S.Raghavendra,           (2004)
        IEEE Communications Magazine, pp.                     PEGASIS:power efficient gathering in
        102−114.                                              sensor information systems, in: Proc. of the
[7]     W. B Heinzelman, A. P Chandrakasan, and               IEEE Aerospace Conference, Big Sky,
        H. Balakrishnan,(2002), “An application-              Montana .
        specific protocol architecture for wireless    [18]   M. Kubisch, H. Karl, A. Wolisz, L. Zhong,
        microsensor networks,” IEEE Transactions              J. Rabaey,(2004) Distributed algorithms for
        on Wireless Communications, vol. 1, no. 4,            transmission power control in wireless
        pp. 660-70.                                           sensor networks, in: IEEE Wireless
[8]     S. Lindsey, C.S. Raghavendra,(2001)                   Communications        and       Networking
        PEGASIS: power efficient gatheringin                  Conference (WCNC04), New Orleans .
        sensorinformationsystems,in:                   [19]   V. Kawadia, P.R. Kumar, (2004)Principles
        IEEEAerospace Conf., Montana, Canada,                 and protocols for power control in ad hoc
        pp. 1–6.                                              networks, IEEE J. Select. Areas Commun.
[9]     S.J. Baek, G. Veciana, X. Su,(2002)                   23 (1)76–88.
        Minimizing energy consumption in               [20]   J. Haapola, Z. Shelby, C.A. Pomalaza-
        largescale sensor networks through                    Ra′ez, P. Ma¨ho¨nen,(2005) Cross layer
        distributed     data     compression    and           energy analysis of multi-hop wireless
        hierarchical aggregation, IEEE Journal on             sensor networks, in:Proceedings of the
        Selected Area in Communications 22 (6)                European Workshop on Wireless Sensor
        1130–1140.                                            Networks, Istanbul, Turkey.
[10]    Wei-Tsung Su , Ko-Ming Chang, Yau-             [21]   Q.Gao,K.J.Blow,D.J.Holding        et,(2007)
        Hwang         Kuo,      (2002)eHIP:      An           Radio range adjustment for energy efficient
        energyefficient hybrid intrusion prohibition          wireless     sensor     networks[EB/OL].
        system for cluster-based wireless sensor              www.elsevier.com /locate/adhoc, in: Ad
        networks, Computer Networks 51 1151–                  Hoc Networks 42006,75–82.
        1168.                                          [22]   J. Kennedy and R. C. Eberhart, “Particle
[11]    A. Manjeshwar, D.P. Agrawal,(2002)                    swarm optimization, (1995),” IEEE
        TEEN: a routing protocol or enhanced                  International Conference on Neural
        efficiency in wireless sensor networks, in:           Networks, vol.4, pp. 1942-1948, Perth,
        15th IEEE Parallel and Distributed                    Australia.
        Processing Symposium, San Francisco,           [23]   X. Co, H. Zhang, J. Shi, and G.Cui
        USA, pp. 2009–2015.                                   “Cluster heads election analysis for multi-
[12]    Jain-Shing Liu , Chun-Hung Richard Lin,               hop wireless sensor networks based on
        (2002)        Energy-efficiency clustering            weighted graph and particle swarm
        protocol in wireless sensor networks. Ad              optimization”. In IEEE fourth International
        Hoc Networks 3 371– 388.                              Conference on computing, 7, 599–603.
[13]    Shensheng Tang, Wei Li,(2002) QoS
        supporting and optimal energy allocation
        for a cluster based wireless sensor network.
        Computer Communications , pp:2569–
        2577.
[14]    M. Younis, M. Youssef, K. Arisha,(2002)
        Energy-aware routing in clusterbased
        sensor networks, in: Proc. of the 10th
        IEEE/ACM Sym. onModeling, Analysis
        and Simulation of Computer and
        TelecomSystems (MASCOTS’02), Fort
        Worth, TX.
[15]    L. Subramanian, R.H. Katz,(2004) An
        architecture for building self configurable
        systems, in: Proc. of IEEE/ACM Workshop
        on Mobile Ad Hoc Networking and
        Computing, Boston, MA.
[16]    W.R. Heinzelman, A. Chandrakasan, H.
        Balakrishnan,(2004)         Energy-efficient
        communication protocol for wireless
        sensor networks, in Proc. of the 33rd



                                                                                           718 | P a g e
Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
      Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                      Vol. 3, Issue 1, January -February 2013, pp.712-719
BIOGRAPHIES

                 Priya is PG Student in the
                 Department of Electronics &
                 Communication Engineering in
                 SHIATS, Allahabad. She received
                 her B.Tech. Degree in Electronics
                 Communication              System
                 Engineering from SIET, Greater
Noida in 2007. She is pursuing M.Tech in Wireless
communication Engineering in SHIATS, Allahabad.
Her research is focused on Wireless Sensor Network
and Computer Networks.


                 Satyesh Sharan Singh is PG
                 Student in the Department of
                 Electronics & Communication
                 Engineering      in     SHIATS,
                 Allahabad. He received his
                 B.Tech. Degree in Electronics and
                 Communication Engineering from
                 SIET, Greater Noida in 2007.He
has three year industrial experience in navigation
field. He is pursuing M.Tech in Wireless
Communication      Engineering     in    SHIATS,
Allahabad. His research is focused on Wireless
Sensor Network and Computer Networks.


                   Mukesh Kumar is working as a
                   Asst. Prof. in the Department of
                   Electronics & Communication
                   Engineering      in     SHIATS,
                   Allahabad. He received his
                   M.Tech. Degree in Advanced
                   Communication            System
Engineering from SHIATS, Allahabad in 2010. His
research is focused on Wireless Sensor Network and
Computer Networks Microwave Engineering, as
well as Optical fiber communication.




                Rohini Saxena is working as a
                Asst. Prof. in the Department of
                Electronics & Communication
                Engineering      in     SHIATS,
Allahabad. She received her M.Tech. Degree in
Advanced Communication System Engineering
from SHIATS, Allahabad in 2009. Her research is
focused on Microwave Engineering, Wireless
Sensor Network and Computer Networks and
Mobile communication.




                                                                               719 | P a g e

Mais conteúdo relacionado

Mais procurados

SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKSIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
 
Routing protocolsin Wireless sensor network
Routing protocolsin Wireless sensor network Routing protocolsin Wireless sensor network
Routing protocolsin Wireless sensor network dilip pareek
 
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
 
Energy efficient cluster head selection in LEACH protocol
Energy efficient cluster head selection in LEACH protocolEnergy efficient cluster head selection in LEACH protocol
Energy efficient cluster head selection in LEACH protocolARUNP116
 
BeeSensor routing protocol for wireless sensor network
BeeSensor routing protocol for wireless sensor networkBeeSensor routing protocol for wireless sensor network
BeeSensor routing protocol for wireless sensor networkSonam Jain
 
Uniform Distribution Technique of Cluster Heads in LEACH Protocol
Uniform Distribution Technique of Cluster Heads in LEACH ProtocolUniform Distribution Technique of Cluster Heads in LEACH Protocol
Uniform Distribution Technique of Cluster Heads in LEACH Protocolidescitation
 
Routing protocol on wireless sensor network
Routing protocol on wireless sensor networkRouting protocol on wireless sensor network
Routing protocol on wireless sensor networkshashankcsnits
 
Data-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyData-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
 
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...IRJET Journal
 
Wireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEECWireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEECYogesh Fulara
 
A review of routing protocols in wsn
A review of routing protocols in wsnA review of routing protocols in wsn
A review of routing protocols in wsnAyman Adel
 
Energy efficient routing in wireless sensor networks
Energy efficient routing in wireless sensor networksEnergy efficient routing in wireless sensor networks
Energy efficient routing in wireless sensor networksSpandan Spandy
 
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
 
Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...
Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...
Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...divya_prabha
 
Review of Various Enhancements of Modified LEACH for Wireless Sensor Network
Review of Various Enhancements of Modified LEACH for Wireless Sensor NetworkReview of Various Enhancements of Modified LEACH for Wireless Sensor Network
Review of Various Enhancements of Modified LEACH for Wireless Sensor Networkijsrd.com
 

Mais procurados (20)

Jm2416491652
Jm2416491652Jm2416491652
Jm2416491652
 
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKSIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK
 
Routing protocolsin Wireless sensor network
Routing protocolsin Wireless sensor network Routing protocolsin Wireless sensor network
Routing protocolsin Wireless sensor network
 
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
 
Leach
Leach Leach
Leach
 
Energy efficient cluster head selection in LEACH protocol
Energy efficient cluster head selection in LEACH protocolEnergy efficient cluster head selection in LEACH protocol
Energy efficient cluster head selection in LEACH protocol
 
Kianoosh&sajjad
Kianoosh&sajjadKianoosh&sajjad
Kianoosh&sajjad
 
BeeSensor routing protocol for wireless sensor network
BeeSensor routing protocol for wireless sensor networkBeeSensor routing protocol for wireless sensor network
BeeSensor routing protocol for wireless sensor network
 
Uniform Distribution Technique of Cluster Heads in LEACH Protocol
Uniform Distribution Technique of Cluster Heads in LEACH ProtocolUniform Distribution Technique of Cluster Heads in LEACH Protocol
Uniform Distribution Technique of Cluster Heads in LEACH Protocol
 
Routing protocol on wireless sensor network
Routing protocol on wireless sensor networkRouting protocol on wireless sensor network
Routing protocol on wireless sensor network
 
Data-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyData-Centric Routing Protocols in Wireless Sensor Network: A survey
Data-Centric Routing Protocols in Wireless Sensor Network: A survey
 
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...
 
Wireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEECWireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEEC
 
A review of routing protocols in wsn
A review of routing protocols in wsnA review of routing protocols in wsn
A review of routing protocols in wsn
 
Energy efficient routing in wireless sensor networks
Energy efficient routing in wireless sensor networksEnergy efficient routing in wireless sensor networks
Energy efficient routing in wireless sensor networks
 
Leach
LeachLeach
Leach
 
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
 
Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...
Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...
Report on I-LEACH: An Energy Efficient Routing Protocol in Wireless Sensor Ne...
 
Leach & Pegasis
Leach & PegasisLeach & Pegasis
Leach & Pegasis
 
Review of Various Enhancements of Modified LEACH for Wireless Sensor Network
Review of Various Enhancements of Modified LEACH for Wireless Sensor NetworkReview of Various Enhancements of Modified LEACH for Wireless Sensor Network
Review of Various Enhancements of Modified LEACH for Wireless Sensor Network
 

Destaque

Curriculum largo 2008
Curriculum largo 2008Curriculum largo 2008
Curriculum largo 2008denegocio
 
Curriculum 2010
Curriculum 2010Curriculum 2010
Curriculum 2010denegocio
 
Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...
Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...
Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...CO2.cr
 
Reflection 漫畫
Reflection  漫畫Reflection  漫畫
Reflection 漫畫兔 功夫
 
Padrao respostas discursivas_agronomia_2010
Padrao respostas discursivas_agronomia_2010Padrao respostas discursivas_agronomia_2010
Padrao respostas discursivas_agronomia_2010Rogger Wins
 
Semana Cultural Científica
Semana Cultural CientíficaSemana Cultural Científica
Semana Cultural CientíficaJeniferRibeiiro
 
Propuesta de planificación
Propuesta de  planificaciónPropuesta de  planificación
Propuesta de planificacióngeesvava
 
Menúmediterràneo
MenúmediterràneoMenúmediterràneo
Menúmediterràneoadrianavas
 
Seguridad industrial-presentacion-1227472023349971-9
Seguridad industrial-presentacion-1227472023349971-9Seguridad industrial-presentacion-1227472023349971-9
Seguridad industrial-presentacion-1227472023349971-9salud2011
 
Presentación1
Presentación1Presentación1
Presentación1Kelly Soto
 
Trabajo de las fuentes de alimentacion
Trabajo de las fuentes de alimentacionTrabajo de las fuentes de alimentacion
Trabajo de las fuentes de alimentacionKelly Soto
 

Destaque (20)

Bn26425431
Bn26425431Bn26425431
Bn26425431
 
Dp31778783
Dp31778783Dp31778783
Dp31778783
 
Iq2616601665
Iq2616601665Iq2616601665
Iq2616601665
 
Equação2grau
Equação2grauEquação2grau
Equação2grau
 
Curriculum largo 2008
Curriculum largo 2008Curriculum largo 2008
Curriculum largo 2008
 
Curriculum 2010
Curriculum 2010Curriculum 2010
Curriculum 2010
 
Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...
Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...
Visión de Jóvenes Costarricenses sobre Posicionamiento Centroamericano en Cam...
 
1402NA057
1402NA0571402NA057
1402NA057
 
Reflection 漫畫
Reflection  漫畫Reflection  漫畫
Reflection 漫畫
 
Padrao respostas discursivas_agronomia_2010
Padrao respostas discursivas_agronomia_2010Padrao respostas discursivas_agronomia_2010
Padrao respostas discursivas_agronomia_2010
 
Slide Alexsandra
Slide   AlexsandraSlide   Alexsandra
Slide Alexsandra
 
Semana Cultural Científica
Semana Cultural CientíficaSemana Cultural Científica
Semana Cultural Científica
 
Propuesta de planificación
Propuesta de  planificaciónPropuesta de  planificación
Propuesta de planificación
 
Estrategiaempresarial bl
Estrategiaempresarial blEstrategiaempresarial bl
Estrategiaempresarial bl
 
Menúmediterràneo
MenúmediterràneoMenúmediterràneo
Menúmediterràneo
 
Seguridad industrial-presentacion-1227472023349971-9
Seguridad industrial-presentacion-1227472023349971-9Seguridad industrial-presentacion-1227472023349971-9
Seguridad industrial-presentacion-1227472023349971-9
 
Presentación1
Presentación1Presentación1
Presentación1
 
172
172172
172
 
Trabajo de las fuentes de alimentacion
Trabajo de las fuentes de alimentacionTrabajo de las fuentes de alimentacion
Trabajo de las fuentes de alimentacion
 
Manual bioseg-lab-oms
Manual bioseg-lab-omsManual bioseg-lab-oms
Manual bioseg-lab-oms
 

Semelhante a Dc31712719

Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
 
Energy efficient data communication approach in wireless sensor networks
Energy efficient data communication approach in wireless sensor networksEnergy efficient data communication approach in wireless sensor networks
Energy efficient data communication approach in wireless sensor networksijassn
 
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKS
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKS
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
 
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Survey
Energy Efficient Data Aggregation in Wireless Sensor Networks: A SurveyEnergy Efficient Data Aggregation in Wireless Sensor Networks: A Survey
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
 
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...chokrio
 
Enhanced Hybrid Clustering Scheme for Dense Wireless Sensor Networks
Enhanced Hybrid Clustering Scheme for Dense Wireless Sensor NetworksEnhanced Hybrid Clustering Scheme for Dense Wireless Sensor Networks
Enhanced Hybrid Clustering Scheme for Dense Wireless Sensor NetworksAssociate Professor in VSB Coimbatore
 
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...IJSRED
 
Energy Optimization in Heterogeneous Clustered Wireless Sensor Networks
Energy Optimization in Heterogeneous Clustered Wireless Sensor NetworksEnergy Optimization in Heterogeneous Clustered Wireless Sensor Networks
Energy Optimization in Heterogeneous Clustered Wireless Sensor NetworksIRJET Journal
 
A review on energy efficient clustering routing
A review on energy efficient clustering routingA review on energy efficient clustering routing
A review on energy efficient clustering routingeSAT Publishing House
 
Data Collection Method to Improve Energy Efficiency in Wireless Sensor Network
Data Collection Method to Improve Energy Efficiency in Wireless Sensor NetworkData Collection Method to Improve Energy Efficiency in Wireless Sensor Network
Data Collection Method to Improve Energy Efficiency in Wireless Sensor NetworkKhushbooGupta145
 
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH Protocol
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH ProtocolAnalysis of Packet Loss Rate in Wireless Sensor Network using LEACH Protocol
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH ProtocolIJTET Journal
 
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksHierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
 
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...IJCNCJournal
 
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
 

Semelhante a Dc31712719 (20)

Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...
 
Energy efficient data communication approach in wireless sensor networks
Energy efficient data communication approach in wireless sensor networksEnergy efficient data communication approach in wireless sensor networks
Energy efficient data communication approach in wireless sensor networks
 
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKS
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKS
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKS
 
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Survey
Energy Efficient Data Aggregation in Wireless Sensor Networks: A SurveyEnergy Efficient Data Aggregation in Wireless Sensor Networks: A Survey
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Survey
 
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...
 
B045070510
B045070510B045070510
B045070510
 
F04623943
F04623943F04623943
F04623943
 
Enhanced Hybrid Clustering Scheme for Dense Wireless Sensor Networks
Enhanced Hybrid Clustering Scheme for Dense Wireless Sensor NetworksEnhanced Hybrid Clustering Scheme for Dense Wireless Sensor Networks
Enhanced Hybrid Clustering Scheme for Dense Wireless Sensor Networks
 
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...
 
15 ijcse-01236
15 ijcse-0123615 ijcse-01236
15 ijcse-01236
 
Energy Optimization in Heterogeneous Clustered Wireless Sensor Networks
Energy Optimization in Heterogeneous Clustered Wireless Sensor NetworksEnergy Optimization in Heterogeneous Clustered Wireless Sensor Networks
Energy Optimization in Heterogeneous Clustered Wireless Sensor Networks
 
Ed33777782
Ed33777782Ed33777782
Ed33777782
 
Ed33777782
Ed33777782Ed33777782
Ed33777782
 
B0330811
B0330811B0330811
B0330811
 
A review on energy efficient clustering routing
A review on energy efficient clustering routingA review on energy efficient clustering routing
A review on energy efficient clustering routing
 
Data Collection Method to Improve Energy Efficiency in Wireless Sensor Network
Data Collection Method to Improve Energy Efficiency in Wireless Sensor NetworkData Collection Method to Improve Energy Efficiency in Wireless Sensor Network
Data Collection Method to Improve Energy Efficiency in Wireless Sensor Network
 
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH Protocol
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH ProtocolAnalysis of Packet Loss Rate in Wireless Sensor Network using LEACH Protocol
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH Protocol
 
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksHierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks
 
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...
 
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...
 

Último

How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?IES VE
 
100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimization100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimizationarrow10202532yuvraj
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxMatsuo Lab
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-pyJamie (Taka) Wang
 
UiPath Studio Web workshop series - Day 5
UiPath Studio Web workshop series - Day 5UiPath Studio Web workshop series - Day 5
UiPath Studio Web workshop series - Day 5DianaGray10
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostKubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostMatt Ray
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7DianaGray10
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IES VE
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...
All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...
All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...Daniel Zivkovic
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"DianaGray10
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Brian Pichman
 

Último (20)

How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?
 
100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimization100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimization
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptx
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-py
 
UiPath Studio Web workshop series - Day 5
UiPath Studio Web workshop series - Day 5UiPath Studio Web workshop series - Day 5
UiPath Studio Web workshop series - Day 5
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostKubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...
All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...
All in AI: LLM Landscape & RAG in 2024 with Mark Ryan (Google) & Jerry Liu (L...
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )
 

Dc31712719

  • 1. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 Energy And Time Delay Efficient Wireless Sensor Network By Least Spanning Tree Algorithm: A Survey Priya1, Satyesh Sharan Singh2, Mukesh Kumar3, Rohini Saxena4, 1 PG Student ECE, SHIATS(Deemed-to-be-university), U.P., India, 2 PG Student ECE, SHIATS (Deemed-to-be-university), U.P., India, 3 Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India, 4 Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India, Abstract In this paper we are going to survey the use the available bandwidth and energy efficiently. different type of topology and techniques for Energy usage is an important issue in the design of making an energy efficient WSN with least time WSNs which typically depends on portable energy delay approach .WSNs are used in defense field sources like batteries for power .WSNs is large scale where lest time delay and life of sensors are most networks of small embedded devices, each with important because the life of solider are depends sensing, computation and communication on fast information transmission . Hence energy capabilities. They have been widely discussed in and time delay are very scarce resources for such recent years. Coverage is one of the most important sensor systems and has to be managed wisely in challenges in the area of sensor networks. Since the order to extend the life of the sensors and energy of sensors are limited, it is vital to cover the minimizing time delay for the duration of a area with fewer sensors. Generally, coverage in particular mission. In past a lot of cluster based sensor networks is divided into area coverage, point algorithm and techniques were used. In this coverage, and boundary coverage subareas. paper we also find out all type of algorithm, Coverage does not ensure connectivity of nodes.. In their application and limitation and present WSNs the sensor techniques to overcome the problems of low nodes are often grouped into individual disjoint sets energy and time delay of sensor and compare called a cluster, clustering is used in WSNs, as it them with least spanning tree based algorithms provides network scalability, resource sharing and and techniques . efficient use of constrained resources that gives network topology stability and energy saving Keywords: Wireless sensor networks, energy attributes. Clustering schemes offer reduced efficient clustering, LEACH, energy efficient communication overheads, and efficient resource algorithms, least spanning tree algorithm. allocations thus decreasing the overall energy consumption and reducing the interferences among 1. INTRODUCTION sensor nodes. A large number of clusters will Advances in sensor technology, low-power congest the area with small size clusters and a very electronics, and low-power radio frequency (RF) small number of clusters will exhaust the cluster design have enabled the development of small, head with large amount of messages transmitted relatively inexpensive and low-power sensors, from cluster members. In this paper we are going to called microsensors[1] The emerging of low power, survey different types of energy efficient and light weight, small size and wireless enabled sensors coverage efficient wireless sensor network. has encouraged tremendous growth of wireless sensors for different application in diverse and 2. SURVEY inaccessible areas, such as military, petroleum and 2.1 LEACH [Low Energy Adaptive Clustering weather monitoring. These inexpensive sensors are Hierarchy][4] and Its Descendant equipped with limited battery power and therefore One of the well known clustering protocols constrained in energy [4]. One of the fundamental called LEACH[Low Energy Adaptive Clustering problems in wireless sensor network is to maximize Hierarchy][2]. LEACH is a cluster-based protocol network lifetime and time delay in data that includes distributed cluster formation in which transmission. Network lifetime is defined as the the nodes elect themselves as cluster heads with time when the first node is unable to send its data to some probability. The algorithm is run periodically base station. Data aggregation reduces data traffic and the probability of becoming a cluster head for and saves energy by combining multiple incoming each period is chosen to ensure that every node packets to single packet when sensed data are highly becomes a cluster head at least once within 1/P correlated. In a typical data gathering application, rounds, where P is the predetermined percentage of each node sends its data to the base station, that can cluster heads. LEACH organizes its operation into be connected via a wireless network. These rounds, where each round consists of a setup phase constraints require innovative design techniques to where clusters are formed and a steady state phase 712 | P a g e
  • 2. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 that consists of data communication process. determined. MS-Leach is based on the critical value. LEACH provides significant energy savings and Simulation results clearly show that MS-Leach prolonged network lifetime over conventional outperforms at most by 200% in term of network multihop routing schemes, such as the Minimum lifetime. It is proposed as future work its Transmission Energy (MTE)[2] routing protocol. relationship between multi-hop and single-hop transmissions will be analyzed in-depth in various 2.1.1 LEACH-C [5] protocols and new mechanisms of routing will be However, LEACH does not guarantee that developed. the desired number of cluster heads is selected and cluster heads are not evenly positioned across the network. A further improvement of this protocol 2.1.5 LEACH-Heterogeneous [7] known as LEACH-C[4]. In this paper, LEACH-HPR introduced an In LEACH-C, the cluster formation is done energy efficient cluster head election method and at the beginning of each round using a centralized using the improved Prim algorithm to construct an algorithm by the base station. The base station uses inter-cluster routing in the heterogeneous WSN. the information received from each node during the Simulation results show LEACH-HPR is more setup phase to find a predetermined number of efficient to reduce and balance energy consumption cluster heads and configures the network into and hence enhance the lifetime of WSN clusters. The cluster groupings are then chosen to minimize the energy required for non-cluster head 2.2 Power-Efficient Gathering in Sensor nodes to transmit their data to their respective Information Systems [PEGASIS][8] cluster heads. Results in[4] have shown that the Another clustering protocol which aims to overall performance of LEACH-C is better than enhance the network lifetime is (PEGASIS)[5]. LEACH due to improved cluster formation by the Power-Efficient Gathering in Sensor Information base station. Moreover, the number of cluster heads Systems (PEGASIS) uses a greedy algorithm to in each round of LEACH-C is equal to the desired organize nodes into a chain, so that each node optimal value, whereas for LEACH the number of transmits and receives from only one of its cluster heads varies from round to round due to the neighbors. In each round, a randomly chosen node lack of global coordination among nodes. from the chain will transmit the aggregated data to the base station and reduce the number of nodes that 2.1.2 LEACH-Fixed on of cluster[6] communicate directly with the base station. LEACH-F is an algorithm in which the number of clusters will be fixed throughout the 2.3Hausdroff Clustering [16] network lifetime and the cluster heads rotated within Authors considered that, once cluster its clusters. Long term phase of LEACH-F is formations take place it’s remaining same identical to that of LEACH. LEACH-F have some throughout the network lifetime. This algorithm limitation because it may or may not be provided maximizes the lifetime of each cluster in order to energy saving and this protocol does not provide the increase the life time of the system. Cluster life time flexibility to sensor nodes mobility or sensor nodes can be enhanced by rotating the role of cluster heads being removed or added from the sensor networks (CHs) among the nodes in the cluster. Cluster heads selection basically based on the residual energy of 2.1.3 LEACH-Energy Threshold [6] the sensor nodes and it also used the proximity of In this cluster will change only when one neighbors as a secondary criterion for enhancing of the following conditions is satisfied: first, Energy energy efficiency and further prolong the network consumed by anyone of the cluster head nodes lifetime. The Hausdroff clustering algorithm is (CHs) reach energy threshold (ET) in one round. equally applicable for both uniform and nonuniform Second, every sensor node should know the energy sensor node initial energy distribution. threshold (ET) value. If in initial phase, anyone of the cluster head nodes dies. If any sensor node acts 2.4 PDCH: Pegasis Algorithm Improving Based as a cluster head node (CHs) in a certain round, it on Double Cluster Head [20] should have the energy dissipated value and Authors proposed an algorithm based on compares the dissipated value with the energy hierarchical chain topology and this algorithm using threshold (ET) value. bottom level cluster head and super level cluster head to improve the load balance. In the hierarchical 2.1.4 MS-LEACH [Multi-hop and Single hop- structure, base station (BS) is the center of a circle. Low Energy Adaptive Clustering Hierarchy][6] The BS will predefine the number of levels and In this paper the authors have analyzed the every node's distance to BS decided the level which problem of energy consumption of the single-hop it belongs to. Every node receives the signal from and multi-hop transmissions in a single cluster. the BS, then according to the signal strength to Finally a critical value of the cluster area size is detect the distance to BS. PDCH outperform to 713 | P a g e
  • 3. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 PEGASIS algorithm and it is also useful for large networks. 2.5 Base station Controlled Dynamic Protocol [BCDCP][9] An approach called Base station Controlled Dynamic Protocol (BCDCP)[7] is proposed which produces clusters of equal size to avoid cluster head overload and to ensure similar power dissipation of nodes. 2.6 EECS: Energy Efficient Clustering Schemes [12] Authors proposed an algorithm in which cluster formation is different from LEACH protocol. In LEACH protocol cluster formation takes place on the basis of a minimum distance of nodes to their corresponding cluster head. In EECS, dynamic sizing of clusters takes place which is based on cluster distance from the base station. The results are an algorithm that addresses the problem that clusters at a greater distance from the sink requires more energy for transmission than those that are closer. Ultimately it provides equal distribution of energy in the networks, resulting in network lifetime. Thus main advantage of this algorithm is the full connectivity can be achieved for a longer duration. So we can say it provides reliable sensing capabilities at a larger range of networks for a longer period of time. It provides a 35 percent improvement in network life time over LEACH algorithm. 2.7 EEUC: Energy Efficient Unequal Clustering [14] This scheme is distance based scheme similar to EECS and it also required that every node has global identification such as its locations and distances to the base station. Hotspot is the main problem in WSNs because of multi hopping that occurs when CHs closer to the sink tend to die faster compare to another node in the WSNS, because they relay much more traffic than remote nodes. This algorithms partition the all nodes into clusters of unequal size, and clusters closer to the sink have smaller sizes than those farther away from the sink. Thus cluster heads (CHs) closer to the sink can conserved some energy for the inter-cluster data forwarding. Energy consumed by cluster heads per round in EEUC much lower than that of LEACH standard but similar to HEED protocol. 2.8 BARC: Battery Aware Reliable Clustering [15] Fig-1 Different types of cluster based technique In this clustering algorithm authors used mathematical battery model for implementation in WSNs. With this battery model authors proposed a new Battery Aware Reliable Clustering (BARC) algorithm for WSNs. It improves the performance over other clustering algorithms by using Z-MAC 714 | P a g e
  • 4. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 and least spanning tree for wireless sensor network to prolong network lifetime and shorten path while and it rotates the cluster heads according to emphasizing energy conservation at the same time. battery recovery schemes. A BARC algorithm Clustering includes partitioning stage and choosing consists of two stages per round for selection of stage, namely, partitions the multi-hop network and cluster heads: initialization or setup and steady state. then chooses cluster-heads, cluster-head is In this formation of cluster, take place by electing a responsible for receiving, sending and maintaining set of CHs. BARC enhances the network lifetime information in its cluster. Then all cluster-heads will greatly compare to other clustering algorithms. construct a least spanning tree to prolong network lifetime ,save energy and shorten path. Simulation 2.9 PSO-Clustering [22] results show that the system’s performance have In this paper authors proposed PSO- further improved by using clustering and least clustering which have four variants of PSO: PSO- spanning tree, It is a promising approach and TVIW (PSO with time varying inertia weight), deserves more future research. PSO-TVAC (PSO with time varying acceleration constants), HPSO-TVAC (hierarchical PSO-TVAC) 3. MAIN THEORY and PSO-SSM (PSO with supervisor student mode) THE Minimum Spanning Tree (MST) for energy aware clustering in WSNs. This method that is an important and commonly algorithm is applicable only when each node has occurring primitive in the design and operation of fixed Omni-directional transmission range, the data and communication networks. For instance, in sensor field should be mapped into a 2-Dimensional ad hoc sensor networks, MST is the optimal routing space and nodes are randomly distributed. After tree for data aggregation [2]. Traditionally, the deployment of the nodes, the nodes are static and efficiency of distributed algorithms is measured by the positions of the nodes are known to the base the running time and the number of messages station. The base station runs the clustering exchanged among the computing nodes, and a lot of algorithm and updates nodes about their cluster- research has gone into the design of algorithms that head and all nodes should have same transmission are optimal with respect to such criteria. ranges and hardware configurations. Cluster based spanning tree can improve lifetime of the network and also gives the shortest 2.9.1 PSO-C: Centralized-PSO [23] path for minimum propagation delay. Clustering Authors proposed centralized-PSO includes partitioning stage and choosing stage, algorithms, in which the nodes which have energy namely, partitions the multi-hop network and then above average energy resource are elected as the chooses cluster-heads, cluster-head is responsible cluster heads. In this authors also compare this for receiving , sending and maintaining information algorithm with LEACH protocol and with LEACH- in its cluster. Then all cluster-heads will construct a C. Simulation results show that PSO outperform to least spanning tree to prolong network lifetime ,save LEACH and LEACH-C in term of network life time energy and shorten path. Paper review results show and throughput etc. It also outperforms GA and K- that the system’s performance have further means based clustering algorithms. improved by using clustering and least spanning tree, It is a promising approach and deserves more 2.9.2 Distributed PSO[23] future research. Sensors and cluster-heads are PSO control algorithm try to minimize assumed to be stationary or limited moving inside radio power while ensuring connectivity of the clusters. Sensors receive commands from and send network. In this paper author proposed an important data to its cluster-head, which does pre-processing metric for a sensor network topology that involve for the data and forward them to other cluster-heads. consideration of hidden nodes and asymmetric links. A cluster-head is located within the communication It minimizes the number of hidden nodes and range of all the sensors of its cluster and can asymmetric links at the expense of increasing the communicate with its neighbour cluster-heads. transmit power of a subset of the nodes may in fact Since a cluster-head forwards traffic to other cluster- increase the longevity of the sensor network. Author heads with longer distance as compared to its explores a distributed evolutionary approach to sensing nodes, in some applications it is more optimize this new metric. Author generates powerful than the sensing nodes in terms of energy, topologies with fewer hidden nodes and asymmetric bandwidth and memory [11,12], while others select links than a comparable algorithm and presents cluster–heads from the deployed sensors [13,14]. some results that indicate that his topologies deliver When a cluster-head is under failure due to more data and last longer. insufficient power, another cluster-head will be selected among the sensors(assume a sensor can 2.10. Least Spanning Tree based clustering[21] adjust its transmission power to a larger value (for In this paper, Authors proposed an novel relaying requirement) once it is selected as a cluster- energy-efficient routing protocol based on clustering head. The details on transmission power control 715 | P a g e
  • 5. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 issues are referenced in for example [15,16]). The cluster-based architecture raises many interesting 2 2 issues such as cluster formation, cluster-head Where di ,j = Xi − XJ + Yi − YJ selection and cluster maintenances, which are beyond the scope of this work. Here, The jth cluster-head as the receiver, the power we only focus on modelling the traffic consumed by this communication is then simply as behaviour along with the multi-hop cluster-heads by the Eq (4) least spanning tree. The system model consists of five parts: (1) constructing cluster-head part, in each Er (j , i) = er B Ai (4) area dynamic constructing a cluster head according to the remainder energy.(2) constructing least By combining Eq. (1) to Eq. (4) we can spanning tree, according to the cluster-head, sink make a cluster-based WSN model. We know the will dynamic construct least spanning tree to energy consumed at the cluster head is much larger achieve maximum lifetime and prolong network than that at individual sensing node. The reason is as lifetime.(3)sensing part, the sensors around the follows: (1) the cluster-head needs to relay all the target area are responsible for probing the traffic of the cluster; (2) for each data unit, the target/event and send the collected data to their cluster-head needs to transmit longer distance due to cluster-head; (4) relaying part, the collected data are transmission between clusters, while the sensing relayed among the cluster-heads by least spanning nodes just transmit data inside the cluster. In view of tree until to the sink; (5) sink, the sink performs this, let Ep and Ec be, respectively, the current system-level data analysis and process for an overall energy and clustering energy(Ec is fixed), after a situation awareness. period of time, the ith cluster-head has transmits The energy model based on the given energy information n1 times and has receives information equation: n2 times before T1(suppose the energy of the ith cluster-head is not lower than the threshold and the Et (i) = (et + ed r n )B (1) information unit is A Erlang ) .the remainder energy of the ith cluster-head at T1 is then simply as the Eq Where et is the energy/bit consumed by the (5) . transmitter electronics (including energy costs of in per strongly dominates other node functions such as n n Ep (i)=Ep (i) – k=1 Et (i , k) - l=1 Et (i , l) - Ec 1 2 fact duty cycling due to finite start-up time), and ed ×ni ..(5) accounts for energy dissipated in the transmit op- where i,j,k is respectively denote cluster-head, ni is amp (including op-amp inefficiencies). Both et and the clustering time in cluster i before T1 ed are properties of the transceiver used by the By Ep(5),we can compute the remainder energy, if nodes, r is the transmission range used. The Ep(i) is lower than Ev, then modify the information parameter n is the power index for the channel path table of the ith cluster-head: set flag=0; broadcast loss of the antenna. B is the bit rate of the radio and information to it’s children, .also inform the is a fixed Topology management provides the neighbor jth cluster-head doesn’t transmits distributed parameter in our study information to it, and let ith cluster-head i is in the sleeping state; else the ith cluster-head may go along On the receiving side, a fixed amount of the next clustering power is required to capture the incoming radio or transmitting or receiving. According to Prim signal where er is the energy/bit consumed by the algorithm, suppose undirected graph G (V,E,D) receiver electronics used by the node. Typical ,where V is the set of cluster-heads and the number numbers for currently available radio transceivers is N, E is the set of connections of cluster-head, and are et= 50× 10-9J/bit, er=50×10-9 J/bit, ed=100× D is the distance of cluster-heads, the process of 10-12J/bit/m (for n=2) and B=1 Mbit/s [18]. constructing least spanning tree as illustrated below:  Initializatio:V1=Sink, E′=null, ,and V2=V-V1. Er (j) = er B (2) • Set a edge: which has minimum distance from Sink to one cluster-head (suppose is Vi),where Vi is Now let us consider one-hop directly connected to Sink, then set,V1={Sink,vi}, communication in a finite one dimensional network E ′ ={(Sink,vi)} , V2=V2-V1. from the ith cluster-head to the jth cluster-head • For each cluster-head Vk in V1 do :select a across a distance di,j. If the ith cluster-head will minimum distance dk,j,which Vk∈V1,Vj∈ V2 and generate A Erlang and the distance of the ith cluster- e′=(Vk,Vj) ∈E ,but is not∈E′, then V1=V1∪Vj, head and the jth cluster-head is dij,so the power E′={(Vk,Vj)} ∪e′, V2=V2-Vj. consumed by this communication is then simply as • if V2 is empty then end, else go to (3). the Eq. (3). Et (i , j) = (et + ed dnj ) B Ai i (3) 716 | P a g e
  • 6. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 Sink Sink (a)The least spanning tree before (b)The least spanning tree after Re-clustering Re-clustering Fig-2 The least Spanning Tree When a cluster-head’s energy is lower than REFERENCES threshold, then first renewably select a node as new cluster-head in the cluster, second renewably [1] I.F. Akyildiz, W. Su, Y. execute constructing least spanning tree algorithm, Sankarasubramaniam,(2000) E. so a new constructing least spanning tree has Cayirci,Wireless sensor networks: a constructed, all sensing information can be send to survey, Computer Networks 38 393–422.J. Sink along the new least spanning tree, this Clerk Maxwell, A Treatise on Electricity algorithm can efficient shorten path and prolong and Magnetism, 3rd ed., vol. 2. Oxford: network lifetime. As illustrated in Fig.1. Fig.1(a) Clarendon, 1892, pp.68–73. show the initial least spanning tree, after some time [2] M. Ilyas, I. Mahgoub,(2000) Handbook of ,if the power of C1’s cluster head is lower threshold Sensor Networks:Compact Wireless and ,nodes in C1 will execute re-clustering to choose a Wired Sensing Systems, CRC Press,New new cluster-head, this time system will execute York . constructing least spanning tree algorithm, and make [3] W. Ye, J. Heidemann, D. Estrin,(2000) a new least spanning tree as Fig.1(b).we can know Medium access control with coordinated the total-path of new least spanning tree is shorter adaptive sleeping for wireless sensor than old least spanning tree. networks, IEEE/ACM Transactions on Networking 12 (3) 493–506. 3. CONCLUSION [4] W.B. Heinzelman, A. Chandrakasan, H. Balakrishnan,(2000)Energy effcient From the literature review of cluster based communication protocol for wireless Minimum Spanning Tree and other cluster based microsensor networks, in: IEEE Hawaii Int. algorithm we have a lot of advantages of cluster Conf. on System Science, Hawaii, USA,, based Minimum Spanning Tree over other pp. 1–10. algorithm. Since with cluster based Minimum [5] W. R Heinzelman, A. P Chandrakasan, and Spanning Tree we can add more application of other H. Balakrishnan,(2000), algorithm such as power gathering and distributed “Energyefficient communication protocol least spanning tree. By these applications we can for wireless microsensor networks,” in improve the efficiency of WSN and also reduce the Proceedings of the 33rd Hawaii power delay of the information and increase the International Conference on System range of sensor nodes. Sciences. 717 | P a g e
  • 7. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 [6] I. F. Akyilldiz, W. Su, Y. Hawaii International Conference on System Sankarasubramaniam and E. Cayirci, Sciences. (2002), “A survey on sensor networks,” [17] S.Lindsey,C.S.Raghavendra, (2004) IEEE Communications Magazine, pp. PEGASIS:power efficient gathering in 102−114. sensor information systems, in: Proc. of the [7] W. B Heinzelman, A. P Chandrakasan, and IEEE Aerospace Conference, Big Sky, H. Balakrishnan,(2002), “An application- Montana . specific protocol architecture for wireless [18] M. Kubisch, H. Karl, A. Wolisz, L. Zhong, microsensor networks,” IEEE Transactions J. Rabaey,(2004) Distributed algorithms for on Wireless Communications, vol. 1, no. 4, transmission power control in wireless pp. 660-70. sensor networks, in: IEEE Wireless [8] S. Lindsey, C.S. Raghavendra,(2001) Communications and Networking PEGASIS: power efficient gatheringin Conference (WCNC04), New Orleans . sensorinformationsystems,in: [19] V. Kawadia, P.R. Kumar, (2004)Principles IEEEAerospace Conf., Montana, Canada, and protocols for power control in ad hoc pp. 1–6. networks, IEEE J. Select. Areas Commun. [9] S.J. Baek, G. Veciana, X. Su,(2002) 23 (1)76–88. Minimizing energy consumption in [20] J. Haapola, Z. Shelby, C.A. Pomalaza- largescale sensor networks through Ra′ez, P. Ma¨ho¨nen,(2005) Cross layer distributed data compression and energy analysis of multi-hop wireless hierarchical aggregation, IEEE Journal on sensor networks, in:Proceedings of the Selected Area in Communications 22 (6) European Workshop on Wireless Sensor 1130–1140. Networks, Istanbul, Turkey. [10] Wei-Tsung Su , Ko-Ming Chang, Yau- [21] Q.Gao,K.J.Blow,D.J.Holding et,(2007) Hwang Kuo, (2002)eHIP: An Radio range adjustment for energy efficient energyefficient hybrid intrusion prohibition wireless sensor networks[EB/OL]. system for cluster-based wireless sensor www.elsevier.com /locate/adhoc, in: Ad networks, Computer Networks 51 1151– Hoc Networks 42006,75–82. 1168. [22] J. Kennedy and R. C. Eberhart, “Particle [11] A. Manjeshwar, D.P. Agrawal,(2002) swarm optimization, (1995),” IEEE TEEN: a routing protocol or enhanced International Conference on Neural efficiency in wireless sensor networks, in: Networks, vol.4, pp. 1942-1948, Perth, 15th IEEE Parallel and Distributed Australia. Processing Symposium, San Francisco, [23] X. Co, H. Zhang, J. Shi, and G.Cui USA, pp. 2009–2015. “Cluster heads election analysis for multi- [12] Jain-Shing Liu , Chun-Hung Richard Lin, hop wireless sensor networks based on (2002) Energy-efficiency clustering weighted graph and particle swarm protocol in wireless sensor networks. Ad optimization”. In IEEE fourth International Hoc Networks 3 371– 388. Conference on computing, 7, 599–603. [13] Shensheng Tang, Wei Li,(2002) QoS supporting and optimal energy allocation for a cluster based wireless sensor network. Computer Communications , pp:2569– 2577. [14] M. Younis, M. Youssef, K. Arisha,(2002) Energy-aware routing in clusterbased sensor networks, in: Proc. of the 10th IEEE/ACM Sym. onModeling, Analysis and Simulation of Computer and TelecomSystems (MASCOTS’02), Fort Worth, TX. [15] L. Subramanian, R.H. Katz,(2004) An architecture for building self configurable systems, in: Proc. of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing, Boston, MA. [16] W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan,(2004) Energy-efficient communication protocol for wireless sensor networks, in Proc. of the 33rd 718 | P a g e
  • 8. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3, Issue 1, January -February 2013, pp.712-719 BIOGRAPHIES Priya is PG Student in the Department of Electronics & Communication Engineering in SHIATS, Allahabad. She received her B.Tech. Degree in Electronics Communication System Engineering from SIET, Greater Noida in 2007. She is pursuing M.Tech in Wireless communication Engineering in SHIATS, Allahabad. Her research is focused on Wireless Sensor Network and Computer Networks. Satyesh Sharan Singh is PG Student in the Department of Electronics & Communication Engineering in SHIATS, Allahabad. He received his B.Tech. Degree in Electronics and Communication Engineering from SIET, Greater Noida in 2007.He has three year industrial experience in navigation field. He is pursuing M.Tech in Wireless Communication Engineering in SHIATS, Allahabad. His research is focused on Wireless Sensor Network and Computer Networks. Mukesh Kumar is working as a Asst. Prof. in the Department of Electronics & Communication Engineering in SHIATS, Allahabad. He received his M.Tech. Degree in Advanced Communication System Engineering from SHIATS, Allahabad in 2010. His research is focused on Wireless Sensor Network and Computer Networks Microwave Engineering, as well as Optical fiber communication. Rohini Saxena is working as a Asst. Prof. in the Department of Electronics & Communication Engineering in SHIATS, Allahabad. She received her M.Tech. Degree in Advanced Communication System Engineering from SHIATS, Allahabad in 2009. Her research is focused on Microwave Engineering, Wireless Sensor Network and Computer Networks and Mobile communication. 719 | P a g e