SlideShare a Scribd company logo
1 of 16
Download to read offline
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013

     EFFECT OF DUTY CYCLE ON ENERGY
 CONSUMPTION IN WIRELESS SENSOR NETWORKS

                    Jyoti Saraswat1, and Partha Pratim Bhattacharya2
                Department of Electronics and Communication Engineering
                          Faculty of Engineering and Technology
               Mody Institute of Technology & Science (Deemed University)
                          Lakshmangarh, Dist. Sikar, Rajasthan,
                                    Pin – 332311, India.
                                1
                                jyotisaraswat.mit@gmail.com
                                  2
                                   hereispartha@gmail.com


ABSTRACT
Most studies define a common duty cycle value throughout the wireless sensor networks (WSNs) to
achieve synchronization among the nodes. On the other hand, a few studies proposed adaptation of the
duty cycle according to uniform traffic conditions to decrease the energy consumption and latency. In
this paper, the lifetime of the nodes based on overall energy consumption are estimated and the effect of
duty cycle on expected energy consumption is studied. The proposed scheme is compared with a standard
scheme and is shown to perform significantly better for sufficient node density.

KEYWORDS
Wireless sensor network, Sensor nodes, Battery lifetime, Energy efficiency, Power management
strategies, Low power listening, Node density, Lifetime prediction


1. INTRODUCTION
The multi functional sensor nodes that are small in size and communicate unbounded in short
distances have been developed due to the recent advances in microelectronic fabrication and
wireless communication technologies. Wireless sensor networks [1] consist of a large amount
of small sensor nodes. These small sensors have the ability of data processing, sensing and
communicating with each other and to the outside world through the external base station.
These sensor nodes are widely used in residential, medical, commercial, industrial, and military
applications [2]. Wireless sensor network devices have limited energy to complete large tasks.
So, one of the challenging issues in wireless sensor networks is designing an energy efficient
network.
Sensor node is a microelectronic device which can only be equipped with a limited power
source [3]. Many techniques have been proposed in recent years for estimating and enhancing
battery lifetime [4]. A variety of strategies is used to exploit battery characteristics for
designing more “battery friendly” systems and communication. To maximize the operating life
of battery-powered systems such as sensor nodes, it is important to discharge the battery in such
a way so that it maximizes the amount of charge extracted from it [5]. Optimal resource
management is an important challenge for maximizing the battery operation lifetime and its
DOI : 10.5121/ijcnc.2013.5109                                                                        125
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
success requires methodical modeling of the factors contributing to the overall power
consumption. Therefore, it is necessary to study the discharge rate of battery taking into
consideration the battery type, capacity, discharge pattern and other physical parameters. Many
researchers have proved that the only way a node can save substantial energy is to power off
the radio, since transmitting, receiving and listening to an idle channel are functions which
require roughly the same amount of power. One of the basic and most commonly used power
management techniques is Duty Cycling. Duty cycling is a technique where a node is
periodically placed into the sleep mode which is an effective method of reducing energy
dissipation in wireless sensor networks (WSNs).
The traffic load in typical wireless sensor networks is relatively low (0.01 to 10 packets/second)
and packets are relatively short (less than 500 bits). The nodes spend most of their time idle for
monitoring the channels. By introducing heavy duty cycling in each node the advantage of low
activity rate can be taken. In duty cycled operation [6], a node follows a sleep-wake up-sample-
compute-communicate cycle in which majority of the cycle spend their time in low power sleep
state. As the duty cycle increases, the nodes can sleep longer and more energy will be saved,
whereas few of the nodes are available to participate in data routing, which will decrease the
throughput and increase transmission latency. To reduce the duty cycle, we should decrease the
active time of the node as much as possible taking into account some limitations. Duty-cycled
does not require continuous sampling or communication which makes its operation possible in
WSNs.
The rest of the paper is organized as follows: we briefly described related work in Section 2.
Our proposed model is presented in Section 3. Results and discussion are reported in Section 4
followed by conclusion in Section 5.


2. RELATED WORKS
Energy is a very sparse resource for sensor systems and has to be managed sensibly in order to
extend the life of the sensor nodes. Many works have been done to reduce the power
consumption and lifetime of wireless sensor networks. In general two main enabling techniques
are identified i.e. duty cycling and data- driven approaches. Duty cycling [6] is the most
effective energy-conserving operation in which whenever the communication is not required,
the radio transceiver is placed in the sleep mode.
To increase the energy efficiency of the sensor nodes many related works have been done.
Honghai Zhang et. al [7] derived an algorithm based on the derived upper bound, an algorithm
that sub optimally schedules node activities to maximize the ߙ-lifetime of a sensor network. In
[7], the node locations and two upper bounds of the ߙ-lifetime are allocated. Based on the
derived upper bound, an algorithm that sub optimally schedules node activities to maximize
the ߙ -lifetime of a sensor network is designed. Simulation results show that the proposed
algorithm achieves around 90% of the derived upper bound. MS Pawar et. al [8] discussed the
effect on lifetime, and energy consumption during listen (with different data packet size),
transmission, idle and sleep states. The energy consumption of WSN node is measured in
different operational states, e.g., idle, sleep, listen and transmit. These results are used to
calculate the WSN node lifetime with variable duty cycle for sleep time. They concluded that
sleep current is an important parameter to predict the life time of WSN node. Almost 79.84% to
83.86% of total energy is consumed in sleep state. Reduction of WSN node sleep state current
Iୱ୪ୣୣ୮ from 64µA to 9µA has shown improvement in lifetime by 193 days for the 3.3V, 130mAh
                                                                                              126
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
battery. It is also analyzed that the WSN node lifetime also depends on the packet size of data.
Data packet size is inversely proportional to the life time of the node. As data packet size is
increased, the lifetime of the battery is decreased. Yuqun Zhang et. al [9] proposed an
adaptation method for the derived distance-based duty cycle which is based on local observed
traffic. In this paper, the Packet Delivery Ratio (PDR) values are achieved by three methods.
According to their simulation, in all the three methods the PDR results are very close and
higher than 97% for light traffic loads. With an increase in traffic load, the constant duty cycle
method performs the best because its higher duty cycle can provide more awake nodes to
participate in data routing. The slightly worse performance of TDDCA (Traffic- Adaptive
Distance-based Duty Cycle Assignment) compared to the constant duty cycle method indicates
that the fixed increments and decrements in duty cycle is not efficient in terms of PDR.
TDDCA and DDCA (Distance-based Duty Cycle Assignment) are more energy-efficient than
the constant duty cycle method, and that DDCA performs better than TDDCA. DDCA reduces
energy dissipation between 21% and 32% compared to the constant duty cycle method, while
TDDCA reduces energy dissipation between 12% and 19% compared to the constant duty cycle
method. Muralidhar Medidi and Yuanyuan Zhou [10] provided a differential duty cycle
approach that is designed based on energy consumed by both traffic and idle listening. It
assigns different duty cycles for nodes at different distances from the base station to address the
energy hole problem, improve network lifetime, and also to maintain network performance. In
[11], Francesco Zorzi et. al analyzed the impact of node density on the energy consumption in
transmission, reception and idle–listening in a network where nodes follow a duty cycle
scheme. They considered the energy performance of the network for different scenarios, where
a different number of nodes and different values of the duty cycle are taken into account. In
[12], Joseph Polastre et. al proposed B-MAC i.e. a carrier sense media access protocol for
wireless sensor networks, that provides a flexible interface to obtain ultra low power operation,
high channel utilization and effective collision avoidance. B-MAC employs an adaptive
preamble sampling scheme to reduce duty cycle and minimize idle listening to achieve low
power operation. They compared B-MAC to conventional 802.11- inspired protocols,
specifically S-MAC. B-MAC’s flexibility results in improved packet delivery rates, latency,
throughput, and energy consumption than S-MAC.


3. PROPOSED MODEL
In this proposed model, the lifetime of the node based on overall energy consumption is
evaluated. The total energy consumption of the nodes consists of the energy consumed by
listening, receiving, transmitting, sampling data and sleeping. Effect of duty cycle on the
energy consumed by the nodes is also evaluated, based on the observations the optimum value
of the duty cycle can be chosen. The proposed model is compared with a standard protocol
STEM (Sparse Topology and Energy Management). STEM provides a way to establish
communications in the presence of sleeping nodes. Each sleeping node wakes up periodically to
listen. If a node wants to establish communications, it starts sending out beacons polling a
specific user. Within a bounded time, the polled node will wake up and receive the poll, after
which the two nodes are able to communicate. An interesting feature of STEM is that a dual
radio setup is envisioned, with separate frequencies used for wakeup and actual data
transmission. Our proposed model performs significantly better than STEM.



                                                                                               127
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013

3.1. Evaluation of Lifetime of the Node Based on Overall Energy Consumption
The lifetime of the nodes is evaluated by the overall energy consumption of the nodes such as
in [12]. If the energy consumption decreases, then the lifetime of the nodes is increased. The
total energy concumed by the nodes consists of the energy consumed for receiving ሺE୰୶ ሻ,
transmitting ሺE୲୶ ሻ, listening for messages on the radio channel (E୪୧ୱ୲ୣ୬ ሻ, sampling data (Eୢ ሻ and
sleeping (Eୱ୪ୣୣ୮ ሻ. The notations and values listed in Table 1 and Table 2 are used throughout
the paper. Total energy consumed is given by

                   E ൌ E୰୶ ൅ E୲୶ ൅ E୪୧ୱ୲ୣ୬ ൅ Eୢ ൅ Eୱ୪ୣୣ୮                                           (1)

The energy associated with sampling data Eୢ , is
                                    Eୢ ൌ t ୢ Cୢୟ୲ୟ V                                                 (2)
where,                                   t ୢ ൌ t ୢୟ୲ୟ ൈ r
td being the time of sampling data, tdata is the sample sensors, r is the sample rate (packets/s),
Cdata is the current of sample sensors (mA), V is the voltage.
The energy consumed by transmitting (Etx) is the length of the packet with the preamble times
the packets rates,
                                E୲୶ ൌ t ୲୶ C୲୶ୠ V                                         (3)

where,                                t ୲୶ ൌ r ൈ ൫L୮୰ୣୟ୫ୠ୪ୣ ൅ L୮ୟୡ୩ୣ୲ ൯t ୲୶ୠ
ttx is the time to switch the transmitter, Lpreamble is the preamble length (bytes), Lpacket is the
packet length (bytes), ttxb is the time (s) to transmit 1 byte, Ctxb is the current required to
transmit 1 byte, V is the supply voltage.

The density of neighbors surrounding a node is referred to as the neighborhood size of the
node. Receiving data from neighbors shortens a node’s lifetime. The total energy consumed by
receiving data (Erx) is given by
                                  E୰୶ ൌ t ୰୶ C୰୶ୠ V                                                  (4)

where,                             t ୰୶ ൑ nr൫L୮୰ୣୟ୫ୠ୪ୣ ൅ L୮ୟୡ୩ୣ୲ ൯t ୰୶ୠ

trx is the time (s) to switch the receiver, n is the neighborhood size of the node, trxb is the time (s)
to receive 1 byte data, Crxb is the current required to receive 1 byte data.

                        Table 1.Time and current consumption parameters


                          Operation                   Time (s)                I (mA)
                      Initialize radio(b)         350E-6    t ୰୧୬୧୲       6       c୰୧୬୧୲
                      Turn on radio (c)           1.5E-3     t ୰୭୬        1       c୰୭୬
                    Switch to RX/TX (d)           250E-6      t ୰୶/୲୶     15      c୰୶/୲୶
                  Time to sample radio (e)        350E-6        t ୱ୰      15       cୱ୰

                                                                                                     128
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
                   Evaluate radio sample (f)          100E-6        t ୣ୴        6       cୣ୴
                         Receive 1 byte               416E-6        t ୰୶ୠ      15       c୰୶ୠ
                         Transmit 1 byte              416E-6        t ୲୶ୠ      20       c୲୶ୠ
                         Sample sensors                 1.1        t ୢୟ୲ୟ      20      cୢୟ୲ୟ



                               Table 2. Parameters used in Calculations

                        Notation                     Parameter                      Default
                         Cୱ୪ୣୣ୮                 Sleep Current (mA)                   0.030
                          Cୠୟ୲୲              Capacity of battery (mAh)               2500
                            V                         Voltage                           3
                        L୮୰ୣୟ୫ୠ୪ୣ             Preamble Length (bytes)                 271
                         L୮ୟୡ୩ୣ୲               Packet Length (bytes)                   36
                            t୧               Radio Sampling Interval (s)            100E-3
                            R                 Sample Rate (packets/s)                1/300
                            L                  Expected Lifetime (s)                    -

In order to reliably receive packets, the low power listening (LPL) check interval, ti, must be
less than the time of the preamble,

                                     L୮୰ୣୟ୫ୠ୪ୣ ൒ ሾt ୧ /t ୰୶ୠ ሿ
 The power consumption of a single LPL radio sample is considered as 17.3µJ [12]. The total
energy spent listening to the channel is the energy of a single channel sample times the channel
                                      sampling frequency.

                                             Eୱୟ୫୮୪ୣ ൌ 17.3µJ
                                                                                        ଵ
                                      t ୪୧ୱ୲ୣ୬ ൌ ሺ t ୰୧୬୧୲ ൅ t ୰୭୬ ൅ t ୰୶/୲୶ ൅ t ୱ୰ ሻ ൈ ୲
                                                                                        ౟
                                                              ଵ
                                      E୪୧ୱ୲ୣ୬ ൑ Eୱୟ୫୮୪ୣ ൈ ୲                                              (5)
                                                               ౟


where, trinit is the initialize radio time, tron is the turn in radio time, trx/tx is switch to rx/tx time, tsr
is the time to sample radio.
The node must sleep for the rest of the time, so the sleep time t ୱ୪ୣୣ୮, is given by

                                  t ୱ୪ୣୣ୮ ൌ 1 െ t ୰୶ െ t ୲୶ െ t ୢ െ t ୪୧ୱ୲ୣ୬
                            and Eୱ୪ୣୣ୮ ൌ t ୱ୪ୣୣ୮ Cୱ୪ୣୣ୮ V                                                 ሺ6ሻ

The lifetime of the node (L) depends on the capacity of the battery (Cbatt) and the total energy
consumed by the battery (E) and given by
                                                    େౘ౗౪౪ ൈ୚
                                             Lൌ                                                            (7)
                                                         ୉
                                                                                                           129
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
The lifetime of the node is also depended on the duty cycle (d) and the transmission energy
(E୲୶ ሻ, as the duty cycle increases the lifetime of the battery decreases. Lifetime (in seconds)
may be given as

                                                    ሺେౘ౗౪౪ ൈଷ଺଴଴ሻ
                                            Lൌ                                                     (8)
                                                       ሺ୉౪౮ ൈୢሻ

3.2. Effect of Duty Cycle on Expected Energy Consumption
The traffic relayed at a node is related to its distance to the sink, the packet traffic generated by
each source node, the number of source nodes in the network and the node density. The time
required for a transmission and the energy efficiency of the network is closely related to the
duty cycle values used. Higher values of duty cycle provide more nodes available for data
routing and thereby energy consumption of the nodes increases.
In [9], a circle area is assumed with the sink located in the center and the nodes including the
sources which are uniformly randomly allocated as illustrated in Figure 1, where r୘ is the
transmission range. The nth ring is defined as the ring whose inner circle is (n−1)r୘ away from
the sink with width r୘.
N୬ nodes are considered in this ring. The average traffic that must be relayed by all of the
nodes located in the nth ring per unit time, Γ୬ , is the summation of the traffic generated by the
source nodes in the nth ring and within the rings outside of the nth ring per unit time, i.e.,
                           Γ୬ ൌ λ୥ ρୱ πሺRଶ െ ሾሺn െ 1ሻr୘ ሿଶ )                                       (9)
where, λ୥ is the average traffic generation rate of the source nodes, ρୱ is the density of source
node, R is the radius of the network area, r୘ is the transmission range.
The traffic relayed at a node is depended on the node distance from the sink, the node density,
the radius of the network area, and the transmission range. The average traffic rate of a node at
distance r, λ୰ , is
                                                                         మ
                                                           ౨
                                     ஛ౝ ஡౩ ஠ሼୖమ ି൤൬඄           ඈିଵ൰୰౐ ൨ ሽ
                                                          ౨౐
                         λ୰ ൌ                ౨
                                                      మ
                                                                 ౨
                                                                             మ                 (10)
                                 ஡౨ ஠ሼ൤൬඄        ඈ൰୰౐ ൨ ି ൤൬඄        ඈିଵ൰୰౐ ൨ ሽ
                                            ౨౐                  ౨౐

The relay region [13] (locations with geographic advancement to the sink) is divided into N୮
priority regions, and each region is assigned a contention slot such that priority region i is
assigned the ith slot in the contention window. We assign each priority region N୰ [9] CTS
contention slots, such that priority region i is assigned the slotsሺሺN୧ െ 1ሻ ൈ N୰ , N୧ ൈ N୰ െ 1ሻ.
This reduces CTS collisions, as all nodes in priority region i can select one of the N୰ CTS
contention slots to send their CTS packet.
The following analysis of the duty cycle is based on the idea that the expected energy
consumption of a sensor node is proportional to the total awake time, t1, of the node because the
radio idle listening power is same as the transmission and reception power in WSNs. Hence a
constant power P is assumed for idle listening, reception and transmission.



                                                                                                   130
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013

                           Source
                           Sink




                                                               r୘
                                                   2r୘




                                   Figure 1. Sample Network Topology

Assuming a uniform packet generation rate, the average traffic rate of a node follows the
Poisson distribution. The probability that a node detects no traffic can be calculated is eିλ౨ ୒୘ై ,
where T୐ its listen period at each cycle is and λ୰ N is the average packet arrival rate within its
transmission range. Thus, the probability that a node detects any ongoing traffic is p଴ ൌ 1 െ
eିλ౨ ୒୘ై , p଴ ξ is the probability of a node detecting ongoing traffic and residing in the relay
region of that traffic. When a node has a packet to send, it sends an RTS packet and keeps
retransmitting the RTS packet until receiving a CTS packet as shown in Figure 2. The expected
number of RTS transmissions needed before the first successful RTS/CTS handshake is
                               ∞                       1 െ pଵ
                           ෍        iሺ1 െ pଵ ሻ୧ pଵ ൌ          ൌ ሺeξୢ୒ െ 1ሻିଵ
                               ୧ୀଵ                       pଵ
                   ିξୢ୒
where, pଵ ൌ 1 െ e     is the probability that at least once node replies to the RTS packet. The
expected time needed before the first successful RTS/CTS handshake, t ୌ , is then
                           t ୌ ൌ ሺeξୢ୒ െ 1ሻିଵ ሺTୖ୘ୗ ൅ N୮ N୰ Tେ୘ୗ ሻ                             (11)
where, Tୖ୘ୗ and Tେ୘ୗ are the transmission delays for RTS and CTS packets, respectively.

                tୌ
                                                            xTେ୘ୗ



       RTS           RTS             RTS                                 CTS   DATA   ACK

                                                                    ‫ݐ‬௖


                                                       t୲

                     Figure 2. Representation of packet exchange durations


                                                                                                131
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
Here, a constant power P is assumed for idle listening, reception and transmission. The
expected total time for the complete RTS, CTS, DATA, and ACK packet communication is
given by

                             t ୡ ൌ t ୖ୘ୗ ൅ xt େ୘ୗ ൅ t ୈ୅୘୅ ൅ t ୅େ୏                          (12)

                                ഥ
The expected energy consumption P is defined as:
             ഥ ൌ P ሼd ൅ λ୰ ቂ൫eஞୢ୒ െ 1൯ିଵ N୮ N୰ t େ୘୐ ൅ 2t ୈ୅୘୅ ቃሽ
             P                                                                              (13)

where, P is the constant power, d is the duty cycle, λ୰ is the average traffic rate of a node at
distance r, ξ is the ratio of the relay region, N denote the average number of nodes within a
node’s transmission range, t ୖ୘ୗ ؆ t େ୘ୗ ؆ t ୅େ୏ ൌ t େ୘୐ and it is the total expected time for a
complete RTS, CTS, DATA and ACK packet communication. The values used in calculation
are listed in Table 3.

                            Table 3. Parameters used for calculation

                       Notation                      Parameter             Values
                        Power                             P                 40E-6
           Average traffic rate of the node              λ୰                  0.1
                   Priority Regions                      N୮                   4
                 CTS contention slots                    N୰                   4
               Ratio of the relay region                  ξ                  0.4
         Total expected time for transmission           t େ୘୐             1*exp(-6)
        Expected time for transmission of data          t ୢୟ୲ୟ               1.1


4.RESULTS AND DISCUSSION
The main objective of this simulation study was to evaluate the lifetime of the battery sensor
nodes and dependency of energy consumption of the nodes on duty cycle. The simulations have
been performed using MATLAB 7.13 software.
The node’s lifetime is determined by its overall energy consumption. If the lifetime is
maximized, then the energy consumption is minimized. The lifetime of the sensor node is
inversely proportional to the duty cycle. Figure 3 shows the relation between energy
consumption and duty cycle. It is concluded from the simulation results that for duty cycle
which is less than 0.01%, the energy consumed by the nodes decreases curvy linearly and for
duty cycle beyond 0.01% the energy consumed by the sensor nodes increases linearly.




                                                                                             132
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
                                                              -5
                                                          x 10                 Energy Consumed v/s Duty Cycle
                                                   1.35

                                                    1.3


                                                   1.25
                 Energy Consumed(Joules)
                                                    1.2

                                                   1.15

                                                    1.1


                                                   1.05

                                                     1

                                                   0.95

                                                    0.9
                                                          0      0.01   0.02   0.03    0.04 0.05 0.06            0.07   0.08   0.09   0.1
                                                                                         Duty Cycle (%)


                                                                 Figure 3. Energy consumed vs Duty cycle

Figure 4 shows the relation between lifetime of the node and the duty cycle (10%-100%) and it
is concluded from the simulation result that as the duty cycle increases, the lifetime of the node
decreases.
                                                                                      Lifetime v/s Duty cycle
                                                    60



                                                    50



                                                    40
                                 Lifetime(hours)




                                                    30



                                                    20



                                                    10



                                                     0
                                                      10           20     30      40       50      60           70      80     90     100
                                                                                          Duty Cycle(%)


                                                                        Figure 4. Lifetime vs Duty cycle

As the duty cycle increases the energy consumption of the nodes also increases, so for the
optimum power management of the sensor nodes the duty cycle must be reduced. Figure 5(a)
shows that for denser network, if the duty cycle is less than 0.01%, energy consumption
decreases. For other networks with lower density, same is true for duty cycle value of less than
0.02%. Then the energy consumption increases linearly. It is also evident from the Figure that
minimum energy consumption is also achievable even for a denser network. In Figures 5(b)-
5(e), as the duty cycle increases beyond 0.1% the energy consumption by the nodes become
                                                                                                                                            133
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
congruent even if the traffic rate and the density of node increases. Thus, based on the
observations, the optimum value for the duty cycle can be chosen.


                                                                                 -5
                                                                        x 10                           Energy consumed Vs Duty Cycle
                                             1.35

                                              1.3


                                             1.25
                   Energy Consumed(Joules)




                                              1.2

                                             1.15

                                              1.1

                                             1.05

                                                                    1

                                             0.95

                                              0.9
                                                                        0         0.01        0.02    0.03      0.04 0.05 0.06          0.07     0.08     0.09         0.1
                                                                                                                  Duty cycle (%)


                                                                                                                     (a)
                                                                                      -5
                                                                                x 10                       Energy consumed Vs Duty Cycle
                                                                            3

                                                                        2.8

                                                                        2.6
                                              Energy Consumed(Joules)




                                                                        2.4

                                                                        2.2

                                                                            2

                                                                        1.8

                                                                        1.6

                                                                        1.4

                                                                        1.2
                                                                          0.1              0.15      0.2       0.25      0.3     0.35      0.4     0.45          0.5
                                                                                                                   Duty cycle (%)


                                                                                                                     (b)




                                                                                                                                                                             134
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
                                                                                       -5
                                                                               x 10                              Energy consumed Vs Duty Cycle
                                                                           5
                                                                                                                                                                           n=25
                                                                                                                                                                           n=50
                                                                                                                                                                           n=75
                                                         4.5
                                                                                                                                                                           n=100
                                                                                                                                                                           n=125




                    Energy Consumed(Joules)
                                                                                                                                                                           n=150
                                                                           4




                                                         3.5




                                                                           3




                                                         2.5
                                                           0.5                          0.55          0.6        0.65       0.7    0.75   0.8       0.85        0.9       0.95        1
                                                                                                                              Duty cycle(%)


                                                                                                                                (c)
                                                                                            -4
                                                                                   x 10                           Energy consumed Vs Duty Cycle
                                                                           4.5
                                                                                                                                                                       n=25
                                                                               4                                                                                       n=50
                                                                                                                                                                       n=75
                                                                           3.5                                                                                         n=100
                                                                                                                                                                       n=125
                                                 Energy Consumed(Joules)




                                                                               3                                                                                       n=150


                                                                           2.5

                                                                               2

                                                                           1.5

                                                                               1

                                                                           0.5

                                                                               0
                                                                                   1             2          3           4      5        6       7          8          9          10
                                                                                                                             Duty cycle (%)



                                                                                                                                (d)
                                                                                            -3
                                                                                   x 10                           Energy consumed Vs Duty Cycle
                                                                               4
                                                                                                                                                                       n=25
                                                                           3.5                                                                                         n=50
                                                                                                                                                                       n=75
                                                                                                                                                                       n=100
                                                                               3
                                                                                                                                                                       n=125
                                              Energy Consumed(Joules)




                                                                                                                                                                       n=150
                                                                           2.5


                                                                               2


                                                                           1.5


                                                                               1


                                                                           0.5


                                                                               0
                                                                                10               20         30      40         50       60      70         80         90         100
                                                                                                                              Duty cycle(%)



                                                                                                                                (e)

                                                                                                                                                                                          135
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
  Figure 5. Energy consumed vs duty cycle for (a) d=0.01%-0.1%, (b) d=0.1%-0.5%, (c) d=
                                                                0.5%-1%,
                                                   (d) d= 1%-10%, (e) d=10%-100%


The relation between number of nodes and energy consumption is estimated & shown in Figure
6. The energy consumed by the nodes is directly proportional to the number of nodes. It is seen
from the result that with the increase in number of nodes energy consumption of the nodes
increases.


                                                       Energy Consumed Vs Number of nodes
                                         8


                                         7


                                         6
                   Energy(nano Joules)




                                         5


                                         4


                                         3


                                         2


                                         1
                                         20       40     60      80        100      120     140   160
                                                                Number of nodes


                                             Figure 6. Energy Consumed vs Number of nodes



In Figure 7 it is shown that as we increase the number of the nodes the lifetime of the battery
decreases, here CC1000 transceiver is considered and the capacity of the battery is taken as
2500mAh [12].




                                                                                                        136
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
                                                                 Lifetime vs Number of nodes
                                            6

                                           5.5

                                            5

                Expected Lifetime(hours)
                                           4.5

                                            4

                                           3.5

                                            3

                                           2.5

                                            2

                                           1.5

                                            1
                                             20   40        60         80        100           120   140   160
                                                                      Number of nodes


                                                  Figure 7. Lifetime vs Number of nodes

5. COMPARISON WITH A STANDARD MODEL
In this section, a comparison between standard model [14] and the proposed model is done.
STEM-B is chosen as the standard model.
The total average energy consumption in STEM can be calculated as
                                                                          ୉౪౥౪
                                                              φୱ ൌ                                               (14)
                                                                          ୔‫୲כ‬
The total average energy consumed during a long time interval of duration t, can be expressed
as follows:
                                                       E୲୭୲ ൌ N୘ E୘ ൅ N୪ E୪ ൅ Tୱ Pୱ                              (15)
Where, N୘ and N୪ are the average number of times (during t) the node transmits a packet and
wakes up to listen respectively, while E୘ , E୪ are the average amount of energy consumed in
transmission and listening respectively, Tୱ is the total amount of time the two radios remain off,
Ps is the power consumed when both radios are off.
The parameters used are given below:
λൌ0.4, Pൌ40*ሺ10^-4ሻ, t ୘ ൌ1.5*ሺ10^-6ሻ,tൌ1.1,Nൌ150, P௦ ൌ400*ሺ10^-8ሻ.
where, λ is the packet arrival rate at each node, P is the power consumed by an active radio
regardless of its being in transmit, receive or listen mode, t ୘ is the total time when the
transmitting node radio is on, t is the time interval of long duration, N is the number of nodes,
P௦ is the power consumed when both radios are off.




                                                                                                                  137
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013


                                                                        Energy consumed Vs Duty Cycle
                                                  8
                                                                                                                 n=25
                                                  7                                                              n=50
                                                                                                                 n=75
                                                                                                                 n=100
                   Energy Consumed(milliJoules)   6
                                                                                                                 n=125
                                                                                                                 n=150
                                                  5


                                                  4


                                                  3


                                                  2


                                                  1


                                                  0
                                                      0   0.01   0.02   0.03   0.04 0.05 0.06     0.07   0.08   0.09     0.1
                                                                                 Duty cycle (%)

                                             Figure 8. Energy Consumption vs Duty cycle for STEM


Figure 8 shows the variation of energy consumption with duty cycle for different values of
number of nodes. The simulation results show that energy consumption increases with duty
cycle linearly. It is also evident from the figure that denser is the network, higher is the energy
consumption while Figure 5(a) - 5(e) show that for denser network, if the duty cycle is less than
0.01%, energy consumption decreases. For other networks with lower density, same is true for
duty cycle value which is less than 0.02%. Then the energy consumption increases linearly.
From the study it is clear that energy consumption is lower in our proposed model. As the duty
cycle increases beyond 0.1% the energy consumption by the nodes become congruent even if
the traffic rate and the density of node increase. The simulation result shows that the proposed
model performed significantly better than existing model.


5. CONCLUSIONS
In this paper, the lifetime of the node based on overall energy consumption and effect of duty
cycle on expected energy consumption are discussed and evaluated. Simulation results show
that for denser network, if the duty cycle is less than 0.01%, energy consumption decreases. For
other networks same is true for duty cycle value of less than 0.02%. Otherwise, energy
consumption increases with duty cycle. This study will, therefore, help in assigning a proper
duty cycle value for WSNs based on node density. The proposed model was compared with an
existing model (STEM) and performs significantly better for sufficient node density. Scope for
future research includes a more detailed analysis, comparison with other proposed schemes and
optimization of the parameters.




                                                                                                                               138
International Journal of Computer Networks & Communications (IJCNC) Vol. No.1, January 2013
      rnational                                                       Vol.5,

REFERENCES
[1]      Jamal N.Al-Karaki and Ahmed E. Kamal, “Routing techniques in wireless sensor networks: a
                     Karaki
       survey”, wireless communications, IEEE vol. 11, pp. 6-28, Dec. 2004.
                                         IEEE,
[2]     Y. A. Malkani, A. Keerio, J. A. Mahar, G. A. Memon and H. Keeriom, (2012) “ Localization,
       Routing and Data Gathering in Wireless Sensor Networks (WSNs) Sindh Univ. Res. Jour. (Sci.
                                                              (WSNs)”,
       Ser.), Vol. 44, pp. 15-22.
[3]      Tokuya Inagaki and Susumu Ishihara, “HGAF: A power saving scheme for wireless sensor
       network”, Journal of Information Processing, vol. 17, pp. 255-266, Oct. 2009.
[4] Fotis Kerasiotis, Aggeliki Prayati, Christos Antonopoulos, George Papadopoulos, (2010) “Battery
                                                                                    (2010) “
    Lifetime Prediction Model for a WSN Platform”, pp. 525 – 530.
[5] Chulsung Park, Kanishka Lahiri and Anand Raghunathan, (2005) “Battery Discharge Characteristics
    of Wireless Sensor Nodes”, An Experimental Analysis”, IEEE SECON 2005, pp. 430 – 440.
[6]     E. Y. A. Lin, J. M. Rabaey, and A. Wolisz, “Power
                                                       “Power-efficient Rendez-vous schemes for dense
                                                                               vous
       wireless sensor networks,” Proceedings of the IEEE International Conference on Communications
                                                                                      Communications,
       pp. 3769–3776, June 2004.
[7] Honghai Zhang and Jennifer C. Hou, Maximizing -Lifetime for Wireless Sensor Networks, IJSNet
                                                   Lifetime                     Networks
    1(1/2), 2006, pp. 64-71.
[8]     MS Pawar, JA Manore, MM Kuber, ‘Life Time Prediction of Battery Operated Node for Energy
       Efficient WSN Applications’, IJCST Vol. 2, Iss ue 4, Oct . - Dec. 2011.
[9] Yuqun Zhang, Chen-Hsiang Feng Ilker Demirkol, Wendi Rabiner Heinzelman: Energy-Efficient
                       Hsiang Feng,                                             : Energy
    Duty Cycle Assignment for Receiver Based Convergecast in Wireless Sensor Networks, pp: 1-5.
                              Receiver-Based                                               1
[10]    Muralidhar Medidi, Yuanyuan Zhou, ‘Extending Lifetime with Differential Duty Cycles in
       Wireless Sensor Networks’, IEEE Communications Socie subject publication, May 7, 2009.
                                                      Society                  ,
[11] Francesco Zorzi, Milica Stojanovic and Michele Zorzi, ‘On the Effects of Node Density and Duty
    Cycle on Energy Efficiency in Underwater Networks’, Conference Europe, 2010.
[12] Joseph Polastre, Jason Hill, David Culler, ‘Versatile Low Power Media Access for Wireless Sensor
                                                ‘Versatile
    Networks’, November 3–5, 2004.
                             5,
[13] M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks:
    Energy and latency performance,” IEEE Transactions on Mobile Computing, vol. 2, no. 4, pp. 349–
                                                                           ,                   349
    365, 2003.
[14] Curt Schurgers, Vlasios Tsiatsis, Saurabh Ganeriwal, Mani Srivastava, “Optimizing sensor networks
    in the energy-latency-density design space,” IEEE Trans. on Mobile Computing, vol. 1, Jan
                           density                                                             Jan-Mar
    2002, p. 70-80.



Authors
Jyoti Saraswat was born in India on November 26, 1987. She received her
B.Tech degree in Electronics and Communication Engineering from Modi
Institute of Engineering and Technology, Rajasthan University, India in 2010
and currently is a M. Tech (Signal Processing) student in Mody Institute of
Technology and Science (Deemed University), Rajasthan, India. Her research
interest lies in Wireless Sensor Networks.


                                                                                                  139
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013
Dr. Partha Pratim Bhattacharya was born in India on January 3, 1971. He has 16
years of experience in teaching and research. He served many reputed
educational Institutes in India in various positions. At present he is working as
Professor in Department of Electronics and Communication Engineering in the
Faculty of Engineering and Technology, Mody Institute of Technology and
Science (Deemed University), Rajasthan, India. He worked on Microwave
devices and systems and mobile cellular communication systems. He has
published 80 papers in refereed journals and conferences. His present research
interest includes mobile cellular communication, wireless sensor network and
cognitive radio.
Dr. Bhattacharya is a member of The Institution of Electronics and Telecommunication Engineers, India
and The Institution of Engineers, India. He is the recipient of Young Scientist Award from International
Union of Radio Science in 2005. He is working as the chief editor, editorial board member and reviewer
in many reputed journals.




                                                                                                    140

More Related Content

What's hot

Load Balancing for Achieving the Network Lifetime in WSN-A Survey
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyLoad Balancing for Achieving the Network Lifetime in WSN-A Survey
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyAM Publications
 
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
 
Paper id 28201419
Paper id 28201419Paper id 28201419
Paper id 28201419IJRAT
 
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Editor IJCATR
 
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...ijwmn
 
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
 
Block diagonalization precoding and power allocation for clustering small-cel...
Block diagonalization precoding and power allocation for clustering small-cel...Block diagonalization precoding and power allocation for clustering small-cel...
Block diagonalization precoding and power allocation for clustering small-cel...journalBEEI
 
Qos group based optimal retransmission medium access protocol for wireless se...
Qos group based optimal retransmission medium access protocol for wireless se...Qos group based optimal retransmission medium access protocol for wireless se...
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
 
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
 
Survey: energy efficient protocols using radio scheduling in wireless sensor ...
Survey: energy efficient protocols using radio scheduling in wireless sensor ...Survey: energy efficient protocols using radio scheduling in wireless sensor ...
Survey: energy efficient protocols using radio scheduling in wireless sensor ...IJECEIAES
 
11.comparative analysis of qo s aware routing protocols for
11.comparative analysis of qo s aware routing protocols for11.comparative analysis of qo s aware routing protocols for
11.comparative analysis of qo s aware routing protocols forAlexander Decker
 
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios  Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios IJECEIAES
 
BEE BASED ROUTING PROTOCOL FOR MANET
BEE BASED ROUTING PROTOCOL FOR MANETBEE BASED ROUTING PROTOCOL FOR MANET
BEE BASED ROUTING PROTOCOL FOR MANETEditor IJCTER
 
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...IJEEE
 
11.[1 5]comparative analysis of qo s-aware routing protocols for
11.[1 5]comparative analysis of qo s-aware routing protocols for11.[1 5]comparative analysis of qo s-aware routing protocols for
11.[1 5]comparative analysis of qo s-aware routing protocols forAlexander Decker
 

What's hot (16)

Load Balancing for Achieving the Network Lifetime in WSN-A Survey
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyLoad Balancing for Achieving the Network Lifetime in WSN-A Survey
Load Balancing for Achieving the Network Lifetime in WSN-A Survey
 
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
 
Ijetr021229
Ijetr021229Ijetr021229
Ijetr021229
 
Paper id 28201419
Paper id 28201419Paper id 28201419
Paper id 28201419
 
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
 
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
 
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...
 
Block diagonalization precoding and power allocation for clustering small-cel...
Block diagonalization precoding and power allocation for clustering small-cel...Block diagonalization precoding and power allocation for clustering small-cel...
Block diagonalization precoding and power allocation for clustering small-cel...
 
Qos group based optimal retransmission medium access protocol for wireless se...
Qos group based optimal retransmission medium access protocol for wireless se...Qos group based optimal retransmission medium access protocol for wireless se...
Qos group based optimal retransmission medium access protocol for wireless se...
 
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...
 
Survey: energy efficient protocols using radio scheduling in wireless sensor ...
Survey: energy efficient protocols using radio scheduling in wireless sensor ...Survey: energy efficient protocols using radio scheduling in wireless sensor ...
Survey: energy efficient protocols using radio scheduling in wireless sensor ...
 
11.comparative analysis of qo s aware routing protocols for
11.comparative analysis of qo s aware routing protocols for11.comparative analysis of qo s aware routing protocols for
11.comparative analysis of qo s aware routing protocols for
 
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios  Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios
 
BEE BASED ROUTING PROTOCOL FOR MANET
BEE BASED ROUTING PROTOCOL FOR MANETBEE BASED ROUTING PROTOCOL FOR MANET
BEE BASED ROUTING PROTOCOL FOR MANET
 
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...
 
11.[1 5]comparative analysis of qo s-aware routing protocols for
11.[1 5]comparative analysis of qo s-aware routing protocols for11.[1 5]comparative analysis of qo s-aware routing protocols for
11.[1 5]comparative analysis of qo s-aware routing protocols for
 

Viewers also liked

Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...
Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...
Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...divya_prabha
 
A Review of Network Layer Attacks and Countermeasures in WSN
A Review of Network Layer Attacks and Countermeasures in WSNA Review of Network Layer Attacks and Countermeasures in WSN
A Review of Network Layer Attacks and Countermeasures in WSNiosrjce
 
Wireless Sensor Networks (WSN)
Wireless Sensor Networks (WSN)Wireless Sensor Networks (WSN)
Wireless Sensor Networks (WSN)M.k. Praveen
 
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...Wireless sensor networks, clustering, Energy efficient protocols, Particles S...
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
 
Overview of Wireless Sensor Networks
Overview of Wireless Sensor NetworksOverview of Wireless Sensor Networks
Overview of Wireless Sensor NetworksDuncan Purves
 
Ppt on low power wireless sensor network 5th sem
Ppt on low power wireless sensor network 5th semPpt on low power wireless sensor network 5th sem
Ppt on low power wireless sensor network 5th semshikhathegreat
 
Routing in Wireless Sensor Networks
Routing in Wireless Sensor NetworksRouting in Wireless Sensor Networks
Routing in Wireless Sensor Networkssashar86
 
Wireless Sensor Network Routing Protocols
Wireless Sensor Network Routing ProtocolsWireless Sensor Network Routing Protocols
Wireless Sensor Network Routing ProtocolsVirendra Thakur
 
Seminar report on WSN technology
Seminar report on WSN technologySeminar report on WSN technology
Seminar report on WSN technologyKapil Dev
 
smart antennas ppt
smart antennas pptsmart antennas ppt
smart antennas pptsanthu652
 
Seminar on smart antenna systems
Seminar on smart antenna systemsSeminar on smart antenna systems
Seminar on smart antenna systemsAshok Behuria
 
Wireless sensor networks communication energy efficient paradigm
Wireless sensor networks communication energy efficient paradigmWireless sensor networks communication energy efficient paradigm
Wireless sensor networks communication energy efficient paradigmeSAT Publishing House
 
Basics of Wireless sensor networks
Basics of Wireless sensor networksBasics of Wireless sensor networks
Basics of Wireless sensor networksRushin Shah
 
Wireless Sensor Networks
Wireless Sensor NetworksWireless Sensor Networks
Wireless Sensor NetworksKarthik
 
Power Saving in Wireless Sensor Networks
Power Saving in Wireless Sensor NetworksPower Saving in Wireless Sensor Networks
Power Saving in Wireless Sensor NetworksMshari Alabdulkarim
 

Viewers also liked (20)

Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...
Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...
Project report on An Energy Efficient Routing Protocol in Wireless Sensor Net...
 
A Review of Network Layer Attacks and Countermeasures in WSN
A Review of Network Layer Attacks and Countermeasures in WSNA Review of Network Layer Attacks and Countermeasures in WSN
A Review of Network Layer Attacks and Countermeasures in WSN
 
Wireless Sensor Networks (WSN)
Wireless Sensor Networks (WSN)Wireless Sensor Networks (WSN)
Wireless Sensor Networks (WSN)
 
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...Wireless sensor networks, clustering, Energy efficient protocols, Particles S...
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...
 
Overview of Wireless Sensor Networks
Overview of Wireless Sensor NetworksOverview of Wireless Sensor Networks
Overview of Wireless Sensor Networks
 
Mathematical Modelling of Wireless sensor Network and new energy Aware Routing
Mathematical Modelling of Wireless sensor Network and new energy Aware Routing Mathematical Modelling of Wireless sensor Network and new energy Aware Routing
Mathematical Modelling of Wireless sensor Network and new energy Aware Routing
 
Ppt on low power wireless sensor network 5th sem
Ppt on low power wireless sensor network 5th semPpt on low power wireless sensor network 5th sem
Ppt on low power wireless sensor network 5th sem
 
Data Science Case Study: Wireless sensor network mathematical Models
Data Science Case Study: Wireless sensor network mathematical ModelsData Science Case Study: Wireless sensor network mathematical Models
Data Science Case Study: Wireless sensor network mathematical Models
 
WSN Routing Protocols
WSN Routing ProtocolsWSN Routing Protocols
WSN Routing Protocols
 
Routing in Wireless Sensor Networks
Routing in Wireless Sensor NetworksRouting in Wireless Sensor Networks
Routing in Wireless Sensor Networks
 
Wireless Sensor Network Routing Protocols
Wireless Sensor Network Routing ProtocolsWireless Sensor Network Routing Protocols
Wireless Sensor Network Routing Protocols
 
Seminar report on WSN technology
Seminar report on WSN technologySeminar report on WSN technology
Seminar report on WSN technology
 
smart antennas ppt
smart antennas pptsmart antennas ppt
smart antennas ppt
 
Routing Protocols in WSN
Routing Protocols in WSNRouting Protocols in WSN
Routing Protocols in WSN
 
Seminar on smart antenna systems
Seminar on smart antenna systemsSeminar on smart antenna systems
Seminar on smart antenna systems
 
Wsn ppt original
Wsn ppt originalWsn ppt original
Wsn ppt original
 
Wireless sensor networks communication energy efficient paradigm
Wireless sensor networks communication energy efficient paradigmWireless sensor networks communication energy efficient paradigm
Wireless sensor networks communication energy efficient paradigm
 
Basics of Wireless sensor networks
Basics of Wireless sensor networksBasics of Wireless sensor networks
Basics of Wireless sensor networks
 
Wireless Sensor Networks
Wireless Sensor NetworksWireless Sensor Networks
Wireless Sensor Networks
 
Power Saving in Wireless Sensor Networks
Power Saving in Wireless Sensor NetworksPower Saving in Wireless Sensor Networks
Power Saving in Wireless Sensor Networks
 

Similar to EFFECT OF DUTY CYCLE ON ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS

CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
 
An energy aware scheme for layered chain in underwater wireless sensor networ...
An energy aware scheme for layered chain in underwater wireless sensor networ...An energy aware scheme for layered chain in underwater wireless sensor networ...
An energy aware scheme for layered chain in underwater wireless sensor networ...IJECEIAES
 
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...ijmnct
 
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOS
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOS
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSIAEME Publication
 
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...IJCNCJournal
 
Routing Optimization with Load Balancing: an Energy Efficient Approach
Routing Optimization with Load Balancing: an Energy Efficient ApproachRouting Optimization with Load Balancing: an Energy Efficient Approach
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
 
Throughput analysis of energy aware routing protocol
Throughput analysis of energy aware routing protocolThroughput analysis of energy aware routing protocol
Throughput analysis of energy aware routing protocoleSAT Publishing House
 
Throughput analysis of energy aware routing protocol for real time load distr...
Throughput analysis of energy aware routing protocol for real time load distr...Throughput analysis of energy aware routing protocol for real time load distr...
Throughput analysis of energy aware routing protocol for real time load distr...eSAT Journals
 
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSNBottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSNjosephjonse
 
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSNBottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSNjosephjonse
 
Energy Conservation in Wireless Sensor Networks: A Review
Energy Conservation in Wireless Sensor Networks: A ReviewEnergy Conservation in Wireless Sensor Networks: A Review
Energy Conservation in Wireless Sensor Networks: A ReviewIOSR Journals
 
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
 
Optimized Projected Strategy for Enhancement of WSN Using Genetic Algorithms
Optimized Projected Strategy for Enhancement of WSN Using  Genetic AlgorithmsOptimized Projected Strategy for Enhancement of WSN Using  Genetic Algorithms
Optimized Projected Strategy for Enhancement of WSN Using Genetic AlgorithmsIJMER
 
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless Networks
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksEnhancing Survivability, Lifetime, and Energy Efficiency of Wireless Networks
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
 
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...
E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...IJCI JOURNAL
 
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...ijmnct
 
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEY
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYDATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEY
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
 
3. journal paper nov 10, 2017 ( dhyan)
3. journal paper nov 10, 2017 ( dhyan)3. journal paper nov 10, 2017 ( dhyan)
3. journal paper nov 10, 2017 ( dhyan)IAESIJEECS
 
A multi-hop routing protocol for an energy-efficient in wireless sensor network
A multi-hop routing protocol for an energy-efficient in wireless sensor networkA multi-hop routing protocol for an energy-efficient in wireless sensor network
A multi-hop routing protocol for an energy-efficient in wireless sensor networkIJECEIAES
 

Similar to EFFECT OF DUTY CYCLE ON ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS (20)

CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...
 
An energy aware scheme for layered chain in underwater wireless sensor networ...
An energy aware scheme for layered chain in underwater wireless sensor networ...An energy aware scheme for layered chain in underwater wireless sensor networ...
An energy aware scheme for layered chain in underwater wireless sensor networ...
 
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
 
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOS
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOS
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOS
 
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...
 
M0111397100
M0111397100M0111397100
M0111397100
 
Routing Optimization with Load Balancing: an Energy Efficient Approach
Routing Optimization with Load Balancing: an Energy Efficient ApproachRouting Optimization with Load Balancing: an Energy Efficient Approach
Routing Optimization with Load Balancing: an Energy Efficient Approach
 
Throughput analysis of energy aware routing protocol
Throughput analysis of energy aware routing protocolThroughput analysis of energy aware routing protocol
Throughput analysis of energy aware routing protocol
 
Throughput analysis of energy aware routing protocol for real time load distr...
Throughput analysis of energy aware routing protocol for real time load distr...Throughput analysis of energy aware routing protocol for real time load distr...
Throughput analysis of energy aware routing protocol for real time load distr...
 
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSNBottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
 
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSNBottleneck Detection Algorithm to Enhance Lifetime of WSN
Bottleneck Detection Algorithm to Enhance Lifetime of WSN
 
Energy Conservation in Wireless Sensor Networks: A Review
Energy Conservation in Wireless Sensor Networks: A ReviewEnergy Conservation in Wireless Sensor Networks: A Review
Energy Conservation in Wireless Sensor Networks: A Review
 
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...
 
Optimized Projected Strategy for Enhancement of WSN Using Genetic Algorithms
Optimized Projected Strategy for Enhancement of WSN Using  Genetic AlgorithmsOptimized Projected Strategy for Enhancement of WSN Using  Genetic Algorithms
Optimized Projected Strategy for Enhancement of WSN Using Genetic Algorithms
 
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless Networks
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksEnhancing Survivability, Lifetime, and Energy Efficiency of Wireless Networks
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless Networks
 
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...
E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...
 
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...
 
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEY
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYDATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEY
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEY
 
3. journal paper nov 10, 2017 ( dhyan)
3. journal paper nov 10, 2017 ( dhyan)3. journal paper nov 10, 2017 ( dhyan)
3. journal paper nov 10, 2017 ( dhyan)
 
A multi-hop routing protocol for an energy-efficient in wireless sensor network
A multi-hop routing protocol for an energy-efficient in wireless sensor networkA multi-hop routing protocol for an energy-efficient in wireless sensor network
A multi-hop routing protocol for an energy-efficient in wireless sensor network
 

More from IJCNC

A USER PROFILE BASED ACCESS CONTROL MODEL AND ARCHITECTURE
A USER PROFILE BASED ACCESS CONTROL MODEL  AND ARCHITECTUREA USER PROFILE BASED ACCESS CONTROL MODEL  AND ARCHITECTURE
A USER PROFILE BASED ACCESS CONTROL MODEL AND ARCHITECTUREIJCNC
 
AUTOCONFIGURATION ALGORITHM FOR A MULTIPLE INTERFACES ADHOC NETWORK RUNNING...
AUTOCONFIGURATION ALGORITHM FOR A  MULTIPLE INTERFACES ADHOC NETWORK  RUNNING...AUTOCONFIGURATION ALGORITHM FOR A  MULTIPLE INTERFACES ADHOC NETWORK  RUNNING...
AUTOCONFIGURATION ALGORITHM FOR A MULTIPLE INTERFACES ADHOC NETWORK RUNNING...IJCNC
 
PREDICTING COMMUNICATION DELAY AND ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...
PREDICTING COMMUNICATION DELAY AND  ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...PREDICTING COMMUNICATION DELAY AND  ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...
PREDICTING COMMUNICATION DELAY AND ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...IJCNC
 
8The Affects of Different Queuing Algorithms within the Router on QoS VoIP a...
8The Affects of Different Queuing Algorithms  within the Router on QoS VoIP a...8The Affects of Different Queuing Algorithms  within the Router on QoS VoIP a...
8The Affects of Different Queuing Algorithms within the Router on QoS VoIP a...IJCNC
 
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNSA NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNSIJCNC
 
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNSA NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNSIJCNC
 
A New Improved Storage Model of Wireless Devices using the Cloud
A New Improved Storage Model of  Wireless  Devices using the CloudA New Improved Storage Model of  Wireless  Devices using the Cloud
A New Improved Storage Model of Wireless Devices using the CloudIJCNC
 
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONS
A MALICIOUS USERS DETECTING MODEL BASED  ON FEEDBACK CORRELATIONSA MALICIOUS USERS DETECTING MODEL BASED  ON FEEDBACK CORRELATIONS
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
 
Improving Quality of Service and Reducing Power Consumption with WAN accele...
Improving Quality of  Service and Reducing  Power Consumption with WAN accele...Improving Quality of  Service and Reducing  Power Consumption with WAN accele...
Improving Quality of Service and Reducing Power Consumption with WAN accele...IJCNC
 
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...IJCNC
 
Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...
Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...
Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...IJCNC
 

More from IJCNC (11)

A USER PROFILE BASED ACCESS CONTROL MODEL AND ARCHITECTURE
A USER PROFILE BASED ACCESS CONTROL MODEL  AND ARCHITECTUREA USER PROFILE BASED ACCESS CONTROL MODEL  AND ARCHITECTURE
A USER PROFILE BASED ACCESS CONTROL MODEL AND ARCHITECTURE
 
AUTOCONFIGURATION ALGORITHM FOR A MULTIPLE INTERFACES ADHOC NETWORK RUNNING...
AUTOCONFIGURATION ALGORITHM FOR A  MULTIPLE INTERFACES ADHOC NETWORK  RUNNING...AUTOCONFIGURATION ALGORITHM FOR A  MULTIPLE INTERFACES ADHOC NETWORK  RUNNING...
AUTOCONFIGURATION ALGORITHM FOR A MULTIPLE INTERFACES ADHOC NETWORK RUNNING...
 
PREDICTING COMMUNICATION DELAY AND ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...
PREDICTING COMMUNICATION DELAY AND  ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...PREDICTING COMMUNICATION DELAY AND  ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...
PREDICTING COMMUNICATION DELAY AND ENERGY CONSUMPTION FOR IEEE 802.15.4/ZIGB...
 
8The Affects of Different Queuing Algorithms within the Router on QoS VoIP a...
8The Affects of Different Queuing Algorithms  within the Router on QoS VoIP a...8The Affects of Different Queuing Algorithms  within the Router on QoS VoIP a...
8The Affects of Different Queuing Algorithms within the Router on QoS VoIP a...
 
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNSA NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNS
 
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNSA NOVEL TWO-STAGE ALGORITHM PROTECTING  INTERNAL ATTACK FROM WSNS
A NOVEL TWO-STAGE ALGORITHM PROTECTING INTERNAL ATTACK FROM WSNS
 
A New Improved Storage Model of Wireless Devices using the Cloud
A New Improved Storage Model of  Wireless  Devices using the CloudA New Improved Storage Model of  Wireless  Devices using the Cloud
A New Improved Storage Model of Wireless Devices using the Cloud
 
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONS
A MALICIOUS USERS DETECTING MODEL BASED  ON FEEDBACK CORRELATIONSA MALICIOUS USERS DETECTING MODEL BASED  ON FEEDBACK CORRELATIONS
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONS
 
Improving Quality of Service and Reducing Power Consumption with WAN accele...
Improving Quality of  Service and Reducing  Power Consumption with WAN accele...Improving Quality of  Service and Reducing  Power Consumption with WAN accele...
Improving Quality of Service and Reducing Power Consumption with WAN accele...
 
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
 
Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...
Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...
Finite horizon adaptive optimal distributed Power Allocation for Enhanced Cog...
 

Recently uploaded

Integration and Automation in Practice: CI/CD in Mule Integration and Automat...
Integration and Automation in Practice: CI/CD in Mule Integration and Automat...Integration and Automation in Practice: CI/CD in Mule Integration and Automat...
Integration and Automation in Practice: CI/CD in Mule Integration and Automat...Patryk Bandurski
 
My Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationMy Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationRidwan Fadjar
 
Artificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraArtificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraDeakin University
 
Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfAlex Barbosa Coqueiro
 
Key Features Of Token Development (1).pptx
Key  Features Of Token  Development (1).pptxKey  Features Of Token  Development (1).pptx
Key Features Of Token Development (1).pptxLBM Solutions
 
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks..."LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...Fwdays
 
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmaticsKotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmaticscarlostorres15106
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Enterprise Knowledge
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...shyamraj55
 
Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024Neo4j
 
Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Commit University
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Mark Simos
 
costume and set research powerpoint presentation
costume and set research powerpoint presentationcostume and set research powerpoint presentation
costume and set research powerpoint presentationphoebematthew05
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationSlibray Presentation
 
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 3652toLead Limited
 
APIForce Zurich 5 April Automation LPDG
APIForce Zurich 5 April  Automation LPDGAPIForce Zurich 5 April  Automation LPDG
APIForce Zurich 5 April Automation LPDGMarianaLemus7
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions
 
Benefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other FrameworksBenefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other FrameworksSoftradix Technologies
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupFlorian Wilhelm
 

Recently uploaded (20)

Integration and Automation in Practice: CI/CD in Mule Integration and Automat...
Integration and Automation in Practice: CI/CD in Mule Integration and Automat...Integration and Automation in Practice: CI/CD in Mule Integration and Automat...
Integration and Automation in Practice: CI/CD in Mule Integration and Automat...
 
Hot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort Service
Hot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort ServiceHot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort Service
Hot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort Service
 
My Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationMy Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 Presentation
 
Artificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraArtificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning era
 
Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdf
 
Key Features Of Token Development (1).pptx
Key  Features Of Token  Development (1).pptxKey  Features Of Token  Development (1).pptx
Key Features Of Token Development (1).pptx
 
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks..."LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
 
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmaticsKotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
 
Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024
 
Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
 
costume and set research powerpoint presentation
costume and set research powerpoint presentationcostume and set research powerpoint presentation
costume and set research powerpoint presentation
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck Presentation
 
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
 
APIForce Zurich 5 April Automation LPDG
APIForce Zurich 5 April  Automation LPDGAPIForce Zurich 5 April  Automation LPDG
APIForce Zurich 5 April Automation LPDG
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping Elbows
 
Benefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other FrameworksBenefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other Frameworks
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project Setup
 

EFFECT OF DUTY CYCLE ON ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS

  • 1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 EFFECT OF DUTY CYCLE ON ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS Jyoti Saraswat1, and Partha Pratim Bhattacharya2 Department of Electronics and Communication Engineering Faculty of Engineering and Technology Mody Institute of Technology & Science (Deemed University) Lakshmangarh, Dist. Sikar, Rajasthan, Pin – 332311, India. 1 jyotisaraswat.mit@gmail.com 2 hereispartha@gmail.com ABSTRACT Most studies define a common duty cycle value throughout the wireless sensor networks (WSNs) to achieve synchronization among the nodes. On the other hand, a few studies proposed adaptation of the duty cycle according to uniform traffic conditions to decrease the energy consumption and latency. In this paper, the lifetime of the nodes based on overall energy consumption are estimated and the effect of duty cycle on expected energy consumption is studied. The proposed scheme is compared with a standard scheme and is shown to perform significantly better for sufficient node density. KEYWORDS Wireless sensor network, Sensor nodes, Battery lifetime, Energy efficiency, Power management strategies, Low power listening, Node density, Lifetime prediction 1. INTRODUCTION The multi functional sensor nodes that are small in size and communicate unbounded in short distances have been developed due to the recent advances in microelectronic fabrication and wireless communication technologies. Wireless sensor networks [1] consist of a large amount of small sensor nodes. These small sensors have the ability of data processing, sensing and communicating with each other and to the outside world through the external base station. These sensor nodes are widely used in residential, medical, commercial, industrial, and military applications [2]. Wireless sensor network devices have limited energy to complete large tasks. So, one of the challenging issues in wireless sensor networks is designing an energy efficient network. Sensor node is a microelectronic device which can only be equipped with a limited power source [3]. Many techniques have been proposed in recent years for estimating and enhancing battery lifetime [4]. A variety of strategies is used to exploit battery characteristics for designing more “battery friendly” systems and communication. To maximize the operating life of battery-powered systems such as sensor nodes, it is important to discharge the battery in such a way so that it maximizes the amount of charge extracted from it [5]. Optimal resource management is an important challenge for maximizing the battery operation lifetime and its DOI : 10.5121/ijcnc.2013.5109 125
  • 2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 success requires methodical modeling of the factors contributing to the overall power consumption. Therefore, it is necessary to study the discharge rate of battery taking into consideration the battery type, capacity, discharge pattern and other physical parameters. Many researchers have proved that the only way a node can save substantial energy is to power off the radio, since transmitting, receiving and listening to an idle channel are functions which require roughly the same amount of power. One of the basic and most commonly used power management techniques is Duty Cycling. Duty cycling is a technique where a node is periodically placed into the sleep mode which is an effective method of reducing energy dissipation in wireless sensor networks (WSNs). The traffic load in typical wireless sensor networks is relatively low (0.01 to 10 packets/second) and packets are relatively short (less than 500 bits). The nodes spend most of their time idle for monitoring the channels. By introducing heavy duty cycling in each node the advantage of low activity rate can be taken. In duty cycled operation [6], a node follows a sleep-wake up-sample- compute-communicate cycle in which majority of the cycle spend their time in low power sleep state. As the duty cycle increases, the nodes can sleep longer and more energy will be saved, whereas few of the nodes are available to participate in data routing, which will decrease the throughput and increase transmission latency. To reduce the duty cycle, we should decrease the active time of the node as much as possible taking into account some limitations. Duty-cycled does not require continuous sampling or communication which makes its operation possible in WSNs. The rest of the paper is organized as follows: we briefly described related work in Section 2. Our proposed model is presented in Section 3. Results and discussion are reported in Section 4 followed by conclusion in Section 5. 2. RELATED WORKS Energy is a very sparse resource for sensor systems and has to be managed sensibly in order to extend the life of the sensor nodes. Many works have been done to reduce the power consumption and lifetime of wireless sensor networks. In general two main enabling techniques are identified i.e. duty cycling and data- driven approaches. Duty cycling [6] is the most effective energy-conserving operation in which whenever the communication is not required, the radio transceiver is placed in the sleep mode. To increase the energy efficiency of the sensor nodes many related works have been done. Honghai Zhang et. al [7] derived an algorithm based on the derived upper bound, an algorithm that sub optimally schedules node activities to maximize the ߙ-lifetime of a sensor network. In [7], the node locations and two upper bounds of the ߙ-lifetime are allocated. Based on the derived upper bound, an algorithm that sub optimally schedules node activities to maximize the ߙ -lifetime of a sensor network is designed. Simulation results show that the proposed algorithm achieves around 90% of the derived upper bound. MS Pawar et. al [8] discussed the effect on lifetime, and energy consumption during listen (with different data packet size), transmission, idle and sleep states. The energy consumption of WSN node is measured in different operational states, e.g., idle, sleep, listen and transmit. These results are used to calculate the WSN node lifetime with variable duty cycle for sleep time. They concluded that sleep current is an important parameter to predict the life time of WSN node. Almost 79.84% to 83.86% of total energy is consumed in sleep state. Reduction of WSN node sleep state current Iୱ୪ୣୣ୮ from 64µA to 9µA has shown improvement in lifetime by 193 days for the 3.3V, 130mAh 126
  • 3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 battery. It is also analyzed that the WSN node lifetime also depends on the packet size of data. Data packet size is inversely proportional to the life time of the node. As data packet size is increased, the lifetime of the battery is decreased. Yuqun Zhang et. al [9] proposed an adaptation method for the derived distance-based duty cycle which is based on local observed traffic. In this paper, the Packet Delivery Ratio (PDR) values are achieved by three methods. According to their simulation, in all the three methods the PDR results are very close and higher than 97% for light traffic loads. With an increase in traffic load, the constant duty cycle method performs the best because its higher duty cycle can provide more awake nodes to participate in data routing. The slightly worse performance of TDDCA (Traffic- Adaptive Distance-based Duty Cycle Assignment) compared to the constant duty cycle method indicates that the fixed increments and decrements in duty cycle is not efficient in terms of PDR. TDDCA and DDCA (Distance-based Duty Cycle Assignment) are more energy-efficient than the constant duty cycle method, and that DDCA performs better than TDDCA. DDCA reduces energy dissipation between 21% and 32% compared to the constant duty cycle method, while TDDCA reduces energy dissipation between 12% and 19% compared to the constant duty cycle method. Muralidhar Medidi and Yuanyuan Zhou [10] provided a differential duty cycle approach that is designed based on energy consumed by both traffic and idle listening. It assigns different duty cycles for nodes at different distances from the base station to address the energy hole problem, improve network lifetime, and also to maintain network performance. In [11], Francesco Zorzi et. al analyzed the impact of node density on the energy consumption in transmission, reception and idle–listening in a network where nodes follow a duty cycle scheme. They considered the energy performance of the network for different scenarios, where a different number of nodes and different values of the duty cycle are taken into account. In [12], Joseph Polastre et. al proposed B-MAC i.e. a carrier sense media access protocol for wireless sensor networks, that provides a flexible interface to obtain ultra low power operation, high channel utilization and effective collision avoidance. B-MAC employs an adaptive preamble sampling scheme to reduce duty cycle and minimize idle listening to achieve low power operation. They compared B-MAC to conventional 802.11- inspired protocols, specifically S-MAC. B-MAC’s flexibility results in improved packet delivery rates, latency, throughput, and energy consumption than S-MAC. 3. PROPOSED MODEL In this proposed model, the lifetime of the node based on overall energy consumption is evaluated. The total energy consumption of the nodes consists of the energy consumed by listening, receiving, transmitting, sampling data and sleeping. Effect of duty cycle on the energy consumed by the nodes is also evaluated, based on the observations the optimum value of the duty cycle can be chosen. The proposed model is compared with a standard protocol STEM (Sparse Topology and Energy Management). STEM provides a way to establish communications in the presence of sleeping nodes. Each sleeping node wakes up periodically to listen. If a node wants to establish communications, it starts sending out beacons polling a specific user. Within a bounded time, the polled node will wake up and receive the poll, after which the two nodes are able to communicate. An interesting feature of STEM is that a dual radio setup is envisioned, with separate frequencies used for wakeup and actual data transmission. Our proposed model performs significantly better than STEM. 127
  • 4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 3.1. Evaluation of Lifetime of the Node Based on Overall Energy Consumption The lifetime of the nodes is evaluated by the overall energy consumption of the nodes such as in [12]. If the energy consumption decreases, then the lifetime of the nodes is increased. The total energy concumed by the nodes consists of the energy consumed for receiving ሺE୰୶ ሻ, transmitting ሺE୲୶ ሻ, listening for messages on the radio channel (E୪୧ୱ୲ୣ୬ ሻ, sampling data (Eୢ ሻ and sleeping (Eୱ୪ୣୣ୮ ሻ. The notations and values listed in Table 1 and Table 2 are used throughout the paper. Total energy consumed is given by E ൌ E୰୶ ൅ E୲୶ ൅ E୪୧ୱ୲ୣ୬ ൅ Eୢ ൅ Eୱ୪ୣୣ୮ (1) The energy associated with sampling data Eୢ , is Eୢ ൌ t ୢ Cୢୟ୲ୟ V (2) where, t ୢ ൌ t ୢୟ୲ୟ ൈ r td being the time of sampling data, tdata is the sample sensors, r is the sample rate (packets/s), Cdata is the current of sample sensors (mA), V is the voltage. The energy consumed by transmitting (Etx) is the length of the packet with the preamble times the packets rates, E୲୶ ൌ t ୲୶ C୲୶ୠ V (3) where, t ୲୶ ൌ r ൈ ൫L୮୰ୣୟ୫ୠ୪ୣ ൅ L୮ୟୡ୩ୣ୲ ൯t ୲୶ୠ ttx is the time to switch the transmitter, Lpreamble is the preamble length (bytes), Lpacket is the packet length (bytes), ttxb is the time (s) to transmit 1 byte, Ctxb is the current required to transmit 1 byte, V is the supply voltage. The density of neighbors surrounding a node is referred to as the neighborhood size of the node. Receiving data from neighbors shortens a node’s lifetime. The total energy consumed by receiving data (Erx) is given by E୰୶ ൌ t ୰୶ C୰୶ୠ V (4) where, t ୰୶ ൑ nr൫L୮୰ୣୟ୫ୠ୪ୣ ൅ L୮ୟୡ୩ୣ୲ ൯t ୰୶ୠ trx is the time (s) to switch the receiver, n is the neighborhood size of the node, trxb is the time (s) to receive 1 byte data, Crxb is the current required to receive 1 byte data. Table 1.Time and current consumption parameters Operation Time (s) I (mA) Initialize radio(b) 350E-6 t ୰୧୬୧୲ 6 c୰୧୬୧୲ Turn on radio (c) 1.5E-3 t ୰୭୬ 1 c୰୭୬ Switch to RX/TX (d) 250E-6 t ୰୶/୲୶ 15 c୰୶/୲୶ Time to sample radio (e) 350E-6 t ୱ୰ 15 cୱ୰ 128
  • 5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Evaluate radio sample (f) 100E-6 t ୣ୴ 6 cୣ୴ Receive 1 byte 416E-6 t ୰୶ୠ 15 c୰୶ୠ Transmit 1 byte 416E-6 t ୲୶ୠ 20 c୲୶ୠ Sample sensors 1.1 t ୢୟ୲ୟ 20 cୢୟ୲ୟ Table 2. Parameters used in Calculations Notation Parameter Default Cୱ୪ୣୣ୮ Sleep Current (mA) 0.030 Cୠୟ୲୲ Capacity of battery (mAh) 2500 V Voltage 3 L୮୰ୣୟ୫ୠ୪ୣ Preamble Length (bytes) 271 L୮ୟୡ୩ୣ୲ Packet Length (bytes) 36 t୧ Radio Sampling Interval (s) 100E-3 R Sample Rate (packets/s) 1/300 L Expected Lifetime (s) - In order to reliably receive packets, the low power listening (LPL) check interval, ti, must be less than the time of the preamble, L୮୰ୣୟ୫ୠ୪ୣ ൒ ሾt ୧ /t ୰୶ୠ ሿ The power consumption of a single LPL radio sample is considered as 17.3µJ [12]. The total energy spent listening to the channel is the energy of a single channel sample times the channel sampling frequency. Eୱୟ୫୮୪ୣ ൌ 17.3µJ ଵ t ୪୧ୱ୲ୣ୬ ൌ ሺ t ୰୧୬୧୲ ൅ t ୰୭୬ ൅ t ୰୶/୲୶ ൅ t ୱ୰ ሻ ൈ ୲ ౟ ଵ E୪୧ୱ୲ୣ୬ ൑ Eୱୟ୫୮୪ୣ ൈ ୲ (5) ౟ where, trinit is the initialize radio time, tron is the turn in radio time, trx/tx is switch to rx/tx time, tsr is the time to sample radio. The node must sleep for the rest of the time, so the sleep time t ୱ୪ୣୣ୮, is given by t ୱ୪ୣୣ୮ ൌ 1 െ t ୰୶ െ t ୲୶ െ t ୢ െ t ୪୧ୱ୲ୣ୬ and Eୱ୪ୣୣ୮ ൌ t ୱ୪ୣୣ୮ Cୱ୪ୣୣ୮ V ሺ6ሻ The lifetime of the node (L) depends on the capacity of the battery (Cbatt) and the total energy consumed by the battery (E) and given by େౘ౗౪౪ ൈ୚ Lൌ (7) ୉ 129
  • 6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 The lifetime of the node is also depended on the duty cycle (d) and the transmission energy (E୲୶ ሻ, as the duty cycle increases the lifetime of the battery decreases. Lifetime (in seconds) may be given as ሺେౘ౗౪౪ ൈଷ଺଴଴ሻ Lൌ (8) ሺ୉౪౮ ൈୢሻ 3.2. Effect of Duty Cycle on Expected Energy Consumption The traffic relayed at a node is related to its distance to the sink, the packet traffic generated by each source node, the number of source nodes in the network and the node density. The time required for a transmission and the energy efficiency of the network is closely related to the duty cycle values used. Higher values of duty cycle provide more nodes available for data routing and thereby energy consumption of the nodes increases. In [9], a circle area is assumed with the sink located in the center and the nodes including the sources which are uniformly randomly allocated as illustrated in Figure 1, where r୘ is the transmission range. The nth ring is defined as the ring whose inner circle is (n−1)r୘ away from the sink with width r୘. N୬ nodes are considered in this ring. The average traffic that must be relayed by all of the nodes located in the nth ring per unit time, Γ୬ , is the summation of the traffic generated by the source nodes in the nth ring and within the rings outside of the nth ring per unit time, i.e., Γ୬ ൌ λ୥ ρୱ πሺRଶ െ ሾሺn െ 1ሻr୘ ሿଶ ) (9) where, λ୥ is the average traffic generation rate of the source nodes, ρୱ is the density of source node, R is the radius of the network area, r୘ is the transmission range. The traffic relayed at a node is depended on the node distance from the sink, the node density, the radius of the network area, and the transmission range. The average traffic rate of a node at distance r, λ୰ , is మ ౨ ஛ౝ ஡౩ ஠ሼୖమ ି൤൬඄ ඈିଵ൰୰౐ ൨ ሽ ౨౐ λ୰ ൌ ౨ మ ౨ మ (10) ஡౨ ஠ሼ൤൬඄ ඈ൰୰౐ ൨ ି ൤൬඄ ඈିଵ൰୰౐ ൨ ሽ ౨౐ ౨౐ The relay region [13] (locations with geographic advancement to the sink) is divided into N୮ priority regions, and each region is assigned a contention slot such that priority region i is assigned the ith slot in the contention window. We assign each priority region N୰ [9] CTS contention slots, such that priority region i is assigned the slotsሺሺN୧ െ 1ሻ ൈ N୰ , N୧ ൈ N୰ െ 1ሻ. This reduces CTS collisions, as all nodes in priority region i can select one of the N୰ CTS contention slots to send their CTS packet. The following analysis of the duty cycle is based on the idea that the expected energy consumption of a sensor node is proportional to the total awake time, t1, of the node because the radio idle listening power is same as the transmission and reception power in WSNs. Hence a constant power P is assumed for idle listening, reception and transmission. 130
  • 7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Source Sink r୘ 2r୘ Figure 1. Sample Network Topology Assuming a uniform packet generation rate, the average traffic rate of a node follows the Poisson distribution. The probability that a node detects no traffic can be calculated is eିλ౨ ୒୘ై , where T୐ its listen period at each cycle is and λ୰ N is the average packet arrival rate within its transmission range. Thus, the probability that a node detects any ongoing traffic is p଴ ൌ 1 െ eିλ౨ ୒୘ై , p଴ ξ is the probability of a node detecting ongoing traffic and residing in the relay region of that traffic. When a node has a packet to send, it sends an RTS packet and keeps retransmitting the RTS packet until receiving a CTS packet as shown in Figure 2. The expected number of RTS transmissions needed before the first successful RTS/CTS handshake is ∞ 1 െ pଵ ෍ iሺ1 െ pଵ ሻ୧ pଵ ൌ ൌ ሺeξୢ୒ െ 1ሻିଵ ୧ୀଵ pଵ ିξୢ୒ where, pଵ ൌ 1 െ e is the probability that at least once node replies to the RTS packet. The expected time needed before the first successful RTS/CTS handshake, t ୌ , is then t ୌ ൌ ሺeξୢ୒ െ 1ሻିଵ ሺTୖ୘ୗ ൅ N୮ N୰ Tେ୘ୗ ሻ (11) where, Tୖ୘ୗ and Tେ୘ୗ are the transmission delays for RTS and CTS packets, respectively. tୌ xTେ୘ୗ RTS RTS RTS CTS DATA ACK ‫ݐ‬௖ t୲ Figure 2. Representation of packet exchange durations 131
  • 8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Here, a constant power P is assumed for idle listening, reception and transmission. The expected total time for the complete RTS, CTS, DATA, and ACK packet communication is given by t ୡ ൌ t ୖ୘ୗ ൅ xt େ୘ୗ ൅ t ୈ୅୘୅ ൅ t ୅େ୏ (12) ഥ The expected energy consumption P is defined as: ഥ ൌ P ሼd ൅ λ୰ ቂ൫eஞୢ୒ െ 1൯ିଵ N୮ N୰ t େ୘୐ ൅ 2t ୈ୅୘୅ ቃሽ P (13) where, P is the constant power, d is the duty cycle, λ୰ is the average traffic rate of a node at distance r, ξ is the ratio of the relay region, N denote the average number of nodes within a node’s transmission range, t ୖ୘ୗ ؆ t େ୘ୗ ؆ t ୅େ୏ ൌ t େ୘୐ and it is the total expected time for a complete RTS, CTS, DATA and ACK packet communication. The values used in calculation are listed in Table 3. Table 3. Parameters used for calculation Notation Parameter Values Power P 40E-6 Average traffic rate of the node λ୰ 0.1 Priority Regions N୮ 4 CTS contention slots N୰ 4 Ratio of the relay region ξ 0.4 Total expected time for transmission t େ୘୐ 1*exp(-6) Expected time for transmission of data t ୢୟ୲ୟ 1.1 4.RESULTS AND DISCUSSION The main objective of this simulation study was to evaluate the lifetime of the battery sensor nodes and dependency of energy consumption of the nodes on duty cycle. The simulations have been performed using MATLAB 7.13 software. The node’s lifetime is determined by its overall energy consumption. If the lifetime is maximized, then the energy consumption is minimized. The lifetime of the sensor node is inversely proportional to the duty cycle. Figure 3 shows the relation between energy consumption and duty cycle. It is concluded from the simulation results that for duty cycle which is less than 0.01%, the energy consumed by the nodes decreases curvy linearly and for duty cycle beyond 0.01% the energy consumed by the sensor nodes increases linearly. 132
  • 9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 -5 x 10 Energy Consumed v/s Duty Cycle 1.35 1.3 1.25 Energy Consumed(Joules) 1.2 1.15 1.1 1.05 1 0.95 0.9 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1 Duty Cycle (%) Figure 3. Energy consumed vs Duty cycle Figure 4 shows the relation between lifetime of the node and the duty cycle (10%-100%) and it is concluded from the simulation result that as the duty cycle increases, the lifetime of the node decreases. Lifetime v/s Duty cycle 60 50 40 Lifetime(hours) 30 20 10 0 10 20 30 40 50 60 70 80 90 100 Duty Cycle(%) Figure 4. Lifetime vs Duty cycle As the duty cycle increases the energy consumption of the nodes also increases, so for the optimum power management of the sensor nodes the duty cycle must be reduced. Figure 5(a) shows that for denser network, if the duty cycle is less than 0.01%, energy consumption decreases. For other networks with lower density, same is true for duty cycle value of less than 0.02%. Then the energy consumption increases linearly. It is also evident from the Figure that minimum energy consumption is also achievable even for a denser network. In Figures 5(b)- 5(e), as the duty cycle increases beyond 0.1% the energy consumption by the nodes become 133
  • 10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 congruent even if the traffic rate and the density of node increases. Thus, based on the observations, the optimum value for the duty cycle can be chosen. -5 x 10 Energy consumed Vs Duty Cycle 1.35 1.3 1.25 Energy Consumed(Joules) 1.2 1.15 1.1 1.05 1 0.95 0.9 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1 Duty cycle (%) (a) -5 x 10 Energy consumed Vs Duty Cycle 3 2.8 2.6 Energy Consumed(Joules) 2.4 2.2 2 1.8 1.6 1.4 1.2 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 0.5 Duty cycle (%) (b) 134
  • 11. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 -5 x 10 Energy consumed Vs Duty Cycle 5 n=25 n=50 n=75 4.5 n=100 n=125 Energy Consumed(Joules) n=150 4 3.5 3 2.5 0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1 Duty cycle(%) (c) -4 x 10 Energy consumed Vs Duty Cycle 4.5 n=25 4 n=50 n=75 3.5 n=100 n=125 Energy Consumed(Joules) 3 n=150 2.5 2 1.5 1 0.5 0 1 2 3 4 5 6 7 8 9 10 Duty cycle (%) (d) -3 x 10 Energy consumed Vs Duty Cycle 4 n=25 3.5 n=50 n=75 n=100 3 n=125 Energy Consumed(Joules) n=150 2.5 2 1.5 1 0.5 0 10 20 30 40 50 60 70 80 90 100 Duty cycle(%) (e) 135
  • 12. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Figure 5. Energy consumed vs duty cycle for (a) d=0.01%-0.1%, (b) d=0.1%-0.5%, (c) d= 0.5%-1%, (d) d= 1%-10%, (e) d=10%-100% The relation between number of nodes and energy consumption is estimated & shown in Figure 6. The energy consumed by the nodes is directly proportional to the number of nodes. It is seen from the result that with the increase in number of nodes energy consumption of the nodes increases. Energy Consumed Vs Number of nodes 8 7 6 Energy(nano Joules) 5 4 3 2 1 20 40 60 80 100 120 140 160 Number of nodes Figure 6. Energy Consumed vs Number of nodes In Figure 7 it is shown that as we increase the number of the nodes the lifetime of the battery decreases, here CC1000 transceiver is considered and the capacity of the battery is taken as 2500mAh [12]. 136
  • 13. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Lifetime vs Number of nodes 6 5.5 5 Expected Lifetime(hours) 4.5 4 3.5 3 2.5 2 1.5 1 20 40 60 80 100 120 140 160 Number of nodes Figure 7. Lifetime vs Number of nodes 5. COMPARISON WITH A STANDARD MODEL In this section, a comparison between standard model [14] and the proposed model is done. STEM-B is chosen as the standard model. The total average energy consumption in STEM can be calculated as ୉౪౥౪ φୱ ൌ (14) ୔‫୲כ‬ The total average energy consumed during a long time interval of duration t, can be expressed as follows: E୲୭୲ ൌ N୘ E୘ ൅ N୪ E୪ ൅ Tୱ Pୱ (15) Where, N୘ and N୪ are the average number of times (during t) the node transmits a packet and wakes up to listen respectively, while E୘ , E୪ are the average amount of energy consumed in transmission and listening respectively, Tୱ is the total amount of time the two radios remain off, Ps is the power consumed when both radios are off. The parameters used are given below: λൌ0.4, Pൌ40*ሺ10^-4ሻ, t ୘ ൌ1.5*ሺ10^-6ሻ,tൌ1.1,Nൌ150, P௦ ൌ400*ሺ10^-8ሻ. where, λ is the packet arrival rate at each node, P is the power consumed by an active radio regardless of its being in transmit, receive or listen mode, t ୘ is the total time when the transmitting node radio is on, t is the time interval of long duration, N is the number of nodes, P௦ is the power consumed when both radios are off. 137
  • 14. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Energy consumed Vs Duty Cycle 8 n=25 7 n=50 n=75 n=100 Energy Consumed(milliJoules) 6 n=125 n=150 5 4 3 2 1 0 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1 Duty cycle (%) Figure 8. Energy Consumption vs Duty cycle for STEM Figure 8 shows the variation of energy consumption with duty cycle for different values of number of nodes. The simulation results show that energy consumption increases with duty cycle linearly. It is also evident from the figure that denser is the network, higher is the energy consumption while Figure 5(a) - 5(e) show that for denser network, if the duty cycle is less than 0.01%, energy consumption decreases. For other networks with lower density, same is true for duty cycle value which is less than 0.02%. Then the energy consumption increases linearly. From the study it is clear that energy consumption is lower in our proposed model. As the duty cycle increases beyond 0.1% the energy consumption by the nodes become congruent even if the traffic rate and the density of node increase. The simulation result shows that the proposed model performed significantly better than existing model. 5. CONCLUSIONS In this paper, the lifetime of the node based on overall energy consumption and effect of duty cycle on expected energy consumption are discussed and evaluated. Simulation results show that for denser network, if the duty cycle is less than 0.01%, energy consumption decreases. For other networks same is true for duty cycle value of less than 0.02%. Otherwise, energy consumption increases with duty cycle. This study will, therefore, help in assigning a proper duty cycle value for WSNs based on node density. The proposed model was compared with an existing model (STEM) and performs significantly better for sufficient node density. Scope for future research includes a more detailed analysis, comparison with other proposed schemes and optimization of the parameters. 138
  • 15. International Journal of Computer Networks & Communications (IJCNC) Vol. No.1, January 2013 rnational Vol.5, REFERENCES [1] Jamal N.Al-Karaki and Ahmed E. Kamal, “Routing techniques in wireless sensor networks: a Karaki survey”, wireless communications, IEEE vol. 11, pp. 6-28, Dec. 2004. IEEE, [2] Y. A. Malkani, A. Keerio, J. A. Mahar, G. A. Memon and H. Keeriom, (2012) “ Localization, Routing and Data Gathering in Wireless Sensor Networks (WSNs) Sindh Univ. Res. Jour. (Sci. (WSNs)”, Ser.), Vol. 44, pp. 15-22. [3] Tokuya Inagaki and Susumu Ishihara, “HGAF: A power saving scheme for wireless sensor network”, Journal of Information Processing, vol. 17, pp. 255-266, Oct. 2009. [4] Fotis Kerasiotis, Aggeliki Prayati, Christos Antonopoulos, George Papadopoulos, (2010) “Battery (2010) “ Lifetime Prediction Model for a WSN Platform”, pp. 525 – 530. [5] Chulsung Park, Kanishka Lahiri and Anand Raghunathan, (2005) “Battery Discharge Characteristics of Wireless Sensor Nodes”, An Experimental Analysis”, IEEE SECON 2005, pp. 430 – 440. [6] E. Y. A. Lin, J. M. Rabaey, and A. Wolisz, “Power “Power-efficient Rendez-vous schemes for dense vous wireless sensor networks,” Proceedings of the IEEE International Conference on Communications Communications, pp. 3769–3776, June 2004. [7] Honghai Zhang and Jennifer C. Hou, Maximizing -Lifetime for Wireless Sensor Networks, IJSNet Lifetime Networks 1(1/2), 2006, pp. 64-71. [8] MS Pawar, JA Manore, MM Kuber, ‘Life Time Prediction of Battery Operated Node for Energy Efficient WSN Applications’, IJCST Vol. 2, Iss ue 4, Oct . - Dec. 2011. [9] Yuqun Zhang, Chen-Hsiang Feng Ilker Demirkol, Wendi Rabiner Heinzelman: Energy-Efficient Hsiang Feng, : Energy Duty Cycle Assignment for Receiver Based Convergecast in Wireless Sensor Networks, pp: 1-5. Receiver-Based 1 [10] Muralidhar Medidi, Yuanyuan Zhou, ‘Extending Lifetime with Differential Duty Cycles in Wireless Sensor Networks’, IEEE Communications Socie subject publication, May 7, 2009. Society , [11] Francesco Zorzi, Milica Stojanovic and Michele Zorzi, ‘On the Effects of Node Density and Duty Cycle on Energy Efficiency in Underwater Networks’, Conference Europe, 2010. [12] Joseph Polastre, Jason Hill, David Culler, ‘Versatile Low Power Media Access for Wireless Sensor ‘Versatile Networks’, November 3–5, 2004. 5, [13] M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance,” IEEE Transactions on Mobile Computing, vol. 2, no. 4, pp. 349– , 349 365, 2003. [14] Curt Schurgers, Vlasios Tsiatsis, Saurabh Ganeriwal, Mani Srivastava, “Optimizing sensor networks in the energy-latency-density design space,” IEEE Trans. on Mobile Computing, vol. 1, Jan density Jan-Mar 2002, p. 70-80. Authors Jyoti Saraswat was born in India on November 26, 1987. She received her B.Tech degree in Electronics and Communication Engineering from Modi Institute of Engineering and Technology, Rajasthan University, India in 2010 and currently is a M. Tech (Signal Processing) student in Mody Institute of Technology and Science (Deemed University), Rajasthan, India. Her research interest lies in Wireless Sensor Networks. 139
  • 16. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.1, January 2013 Dr. Partha Pratim Bhattacharya was born in India on January 3, 1971. He has 16 years of experience in teaching and research. He served many reputed educational Institutes in India in various positions. At present he is working as Professor in Department of Electronics and Communication Engineering in the Faculty of Engineering and Technology, Mody Institute of Technology and Science (Deemed University), Rajasthan, India. He worked on Microwave devices and systems and mobile cellular communication systems. He has published 80 papers in refereed journals and conferences. His present research interest includes mobile cellular communication, wireless sensor network and cognitive radio. Dr. Bhattacharya is a member of The Institution of Electronics and Telecommunication Engineers, India and The Institution of Engineers, India. He is the recipient of Young Scientist Award from International Union of Radio Science in 2005. He is working as the chief editor, editorial board member and reviewer in many reputed journals. 140