Method & Implementation of Improving Network
Lifetime by Using Optimized Sleep Awake
Protocol in WSN
Amandeep Kaur
M. Tech Research Scholar,
Electronics & Communication Engg. Department
GGGI, Ambala
Abstract- This work proposes an optimal routing mechanism
under sleep scheduling in wireless sensor networks. Duty
cycling is a technique that increases energy efficiency by
allowing a node to turn off part or all of its systems for periods
of time. These sensor networks have certain characteristics
such as limited power and battery driven. In this work, an on
demand routing under asynchronous sleep scheduling is
proposed for each sensor. The aim of this work is to minimize
the energy consumption by nodes so that lifetime will improve.
The proposed mechanism is implemented with MATLAB. In
this, it provides a complete path from sender to receiver
without any packet loss. In this, it covers different scenarios
under sleep schedule. The main objective is to provide energy
efficiency in network & also reduce delay. In this, it presents a
multipath routing protocol for data transmission. All these are
useful for reducing the energy consumption and improve the
accuracy.
Keywords-Sleep Awake Cycle, shortest path in Networks,
wireless sensor networks, sleep scheduling.
I. INTRODUCTION
Wireless Sensor Network (WSN) has become an
important topic in the entrenched field. WSN is a term used
to initiate a class of embedded communication devices that
provide consistent wireless connections between sensors,
processors and actuators. This presents a brief introduction
about the Wireless Sensor Networks (WSNs) [1]. In
Wireless Sensor Network, there is hundreds or thousands of
sensor nodes. Sensing method is used for information
gathering about a physical object in which occurrence of
events include such as changes in state like drop in
temperature or pressure etc. Sensing task is performed by
Sensor. Likely, the human body is prepared with sensors
like eyes which are capable to capture optical content from
the atmosphere, acoustic data such as sounds and smells
capture by ears and nose respectively.
WSN are easily vulnerable to attacks. Providing
security solutions to these networks is difficult due to its
characteristics such as tiny nature and constraints in
resources. A lot of research efforts in the field of embedded
system, such as low-power design, dynamic power
management, and energy-aware routing algorithms have
been devoted to achieve lifetime maximization of WSNs.
With the advances in these technologies, more and more
applications based on WSN are mature and they are
1
Vikas Chawla
Assistant professor
Electronics & Communication Engg. Department
GGGI, Ambala
becoming an indispensable part of people’s life, and will
have a great impact on the future.
One of the most important issues regarding the
design of sensor networks is power consumption since these
networks consist of a large number of nodes and are usually
deployed in hazardous and remote areas where the
replacement of batteries is impossible. The second is
overhearing, which occurs when a node receives and
decodes packets that are not destined to it. The third, over-
emitting, occurs when the transmitter node transmits a
packet while the receiver node is not ready to receive it.
The main objective for WSN is to maximize the
network lifetime and minimize the energy consumption.
Sensor network should deployed with high densities to
improve the network reliability and improve its longevity.
However, if all sensor nodes operate at the same time in
such a dense deployment scenario, energy will be consumed
excessively. Packet collisions will increase due to the large
number of packets being forwarded in the network. In
addition, when node density is high most of the data in the
network will be surplus due to this sensing regions of the
nodes will overlap.
A sleep scheduling algorithm has to choose the
least number of active nodes to fulfill user defined
constraints. Non-sleeping nodes must be chosen for
providing minimum coverage of the network field that is
connected to the sink. Depending upon the application user
constraints may vary. The sleep scheduling method should
be simple, localized and distributed. It should be applicable
to different types of networks with some alterations. Using
only the local information, the sensor networks must be a
distributed approach. Location information is very costly so
it should be desirable not to require any location information
for a sensor network.
From literature survey, The main test in wireless
sensor networks is to decrease energy consumption and to
increase the throughput of sensor node for enhancing the
lifetime of sensor network. In this process, the data is to be
transmitted to the first node that wakes up and makes a
progress in the performance for minimizing the delay
policy. They demonstrated that the when nodes are densely
deployed in environment, the expected energy consumption
keeps close to the lower bound.
Since each node has limited energy, these nodes
are usually put to sleep to preserve energy, and this helps to
extend the network lifetime. Energy-efficiency is generally
achieved by duty-cycling the nodes, which makes nodes,
sleep most of the time and wake-up just when it is
necessary. Sleep scheduling method is always used to
reduce the energy consumption so that nodes will work for a
long time without recharging their batteries. There are two
major schemes for sleep scheduling of sensor nodes, (i)
random (ii) synchronized. Any sleep scheduling scheme has
to ensure that data can always be routed from source to sink
The paper is ordered as follows. In Section II, It
defines sleep scheduling in WSN. In section III, it describes
the proposed work related to sleep awake cycling in WSN.
In section IV, it provides the proposed results of system.
Finally, conclusion is explained in Section IV.
II. SLEEP & WAKEUP IN WSN
The general scheme for the sleep &wakeup
procedure is that each sensor node selects a starting time
between 0 and Tperiod randomly and each node follows its
own wakeup schedule for the succeeding periods. For ease
let’s assume that Tperiod is equal to 1. The duty cycle is
defined as the percentage of time a node is active compared
the time for one period Tperiod. The ratio between the
preamble lengths P over one period of time Tperiod is
denoted as p, since Tperiod is assumed equal to 1, therefore
p is equal to P in this work. The preamble length in this
work is expressed as "preamble p" due to the Tperiod equal
to 1.
The reachability is defined as the number of the
received packets by the sensor nodes Nr over the total
number of sensor nodes N within the area. Thus the
reachability is can be written as R =Nr/N. The number of the
received packets can be attained both directly via the source
node and indirectly via the retransmitting of other sensor
nodes in the area.
1. The On-demand Protocol
The on demand protocol is one of the types of
power management protocol. This protocol is based on the
fact that a sensing node should be in the sleep mode or off
when there is no data packet to transmit or receive. As soon
as there is a data packet that needs to be transmitted or
received the sensor node will become active and will be in
on state. In this way sensor nodes interchange between sleep
& active periods depending on network action. The outcome
is that sensor do not waste energy by unnecessary
transmissions and unnecessary sensing & hence the energy
consumption is minimized. But the main disadvantage of
this protocol is that it is hard to notify the sleeping nodes if
another sensor node wants to communicate with them. The
Scheduled 2.
2. Rendezvous Protocol
The second power management protocol is called
scheduled rendezvous protocol. It belongs to the
synchronous protocols since it requires all neighbouring
sensing nodes to wake up at the same time. In Figure, the
sleep scheduling of sensor nodes using a scheduled
rendezvous protocol is shown. In this approach sensor nodes
wake up according to a wakeup schedule and remain active
for a short time interval to communicate with their
neighbours. After the transmission of the data the senor
nodes will go to sleep until the next time. The main
advantage of this protocol is that it is definite that if a sensor
2
node is awake that all its neighbouring sensor nodes are
awake as well. It is very convenient for data aggregation and
allows sending broadcast messages to all neighbours.
3. The Asynchronous Protocol
In this, each node is allowed to wake up
independently of the others by providing assurance that
neighbouring sensor nodes always have overlapped active
periods of time within a specified number of cycles.
According to this figure only sensor node 1 and sensor node
3 can receive the transmitted packet. Since the active period
of the sensor nodes moderately overlap with the active
period of the source node. The main advantages of this
protocol are that a sensing node can wake up at anytime
when it wants to speak with its adjacent sensing nodes.
III. PROPOSED WORK
A sensor node consumes battery power in the
following four operations: sensing data, receiving data,
sending data, and processing data. Generally, the most
energy consuming component is the RF module that
provides wireless communications. Consequently, out of all
the sensor node operations, sending/receiving data
consumes more energy than any other operations. Sensor
nodes in a WSN have a limited amount of energy and if all
the sensor nodes would be active all the time the whole
network may collapse in a short time. This is due to the high
energy consumption of the sensor nodes. However it is not
necessary for all the sensor nodes to be active all the time,
they only need to become active when there is a need to
transmit and /or receive data. Therefore, sleep scheduling
can prolong the lifetime of a WSN significantly. Sleep
scheduling works by activation sensor nodes when there is a
need to transmit/receive data the remainder of the time the
sensor node sleeps. Sleep scheduling belongs to the category
of power management protocols which is one of the main
energy conservation techniques used for WSNs.
Firstly, the nodes’ wake interval is increased as the
distance of the node from the Base station decreases as such
nodes send their own data as well as act as relay nodes for
those away from the Base Station. Secondly, the wake
interval of nodes may also be increased due to their
topological significance. Sleep wake scheduling has been
used to save the energy and enlarge the network lifetime.
Energy efficiency has intrinsic trade-off with delay, thus,
normally in such sleep wake scheduling strategies,
maximization in network lifetime is achieved at the cost of
increase in delay. To achieve this, delay minimization at
three levels is observed and addressed: the delay occurred
because of traffic load at the nodes near the Base Station,
the delay occurred due to transfer load at the connectivity
dangerous node, and delay occurred while dealing with
traffic burst when an event occurs. To diminish the delay, a
heuristic which maximizes the wakeup-up time in a
scheduling period at three levels is used.
First of the power management protocol that is
introduced is the on-demand protocol. This protocol is based
on the idea that a sensor node should be in the sleep mode or
off when there is no data packet to transmit and/or receive.
As soon as there is a data packet that needs to be transmitted
and/or received the sensor node shall become active. In this
way sensor nodes alternate between active and sleep periods
depending on network activity. The consequence is that the
energy consumption is minimized since sensor do not waste
energy by unnecessary transmissions and unnecessary
sensing. But the main disadvantage of this protocol is that it
is difficult to inform the sleeping sensor nodes if another
sensor node wants to communicate with them.
The second power management protocol is called
scheduled protocol which belongs to the synchronous
protocols since it requires all neighbouring sensor nodes to
wake up at the same time. In Figure, the sleep scheduling of
sensor nodes using a scheduled rendezvous protocol is
shown. In this approach sensor nodes wake up according to
a wakeup schedule and remain active for a short time
interval to communicate with their neighbours. After the
transmission of the data the senor nodes will go to sleep
until the next rendezvous time.
The next algorithm that can be used is the
asynchronous protocol. The basic idea is that each node is
allowed to wake up independently of the others by
guaranteeing that neighbouring sensor nodes always have
overlapped active periods of time within a specified number
of cycles. One of the advantages of this protocol is that a
sensor node can wake up at anytime when it wants to
communicate with its neighbouring sensor nodes. Therefore,
in asynchronous protocols there is no need to exchange
extra synchronization information unlike in the synchronous
protocols so that the energy efficiency is improved. In
contrast with the scheduled rendezvous protocol, it is not
possible to broadcast a message to all neighbouring sensor
nodes in one period of time.
Figure 1: Proposed Flow Chart of System
3
In most of the WSN sleep/wake protocols, energy
awareness is considered as a key design issue to maximize
the network lifetime at the cost of latency, delay, and
throughput; thus making such design inapplicable in delay
sensitive applications. In this article, the delay-minimization
problem in sleep/wake scheduling is investigated for event-
driven sensor networks in delay-sensitive applications.
The problems of wastage energy in wireless sensor
networks resulting from duplication tasks and functions for
nodes in the same area coverage and re-send duplicate
messages. Energy wasted when exploit certain part of the
network where die half of the nodes, which in turn leads to
the suspension of the entire network. To reduce the
high-energy consumption they proposed the scheduling
system functions to facilitate the process of sending
reports from terminal nodes to the interested users or re-
broadcasting them to a higher level of the network.
1. Placement of Nodes
In above figure, the first step describes the sensors are being
deployed in an disaster area. Sensors are randomly spread
over the area. Each sensor has a sensor ID shown along with
it. It is used to address any sensor throughout the process.
Here it takes large number of sensors so that proposed
scheme will evaluate easily. No two nodes overlap each
other.
2. Discover a Topology
In typical usage scenario, the nodes are evenly distributed
over an outdoor environment. This distance between
adjacent nodes will be minimal yet the distance across the
entire network will be significant. They create a random
topology initially.
3. Provide Random Mobility
Then provide random mobility in nodes to show that all
nodes are dynamic in nature. All nodes move here & there
depends upon their speed. It can change the speed of nodes
manually.
4. Provide Head & Initiator
After the deployment of the sensor nodes, there is a Head
node selection by polling method. In a sensor network, the
basic sensors are simple and perform the sensing task, while
some other nodes, often called the heads, are more powerful
and focus on communications and computations.
5. Data Collection
All nodes are communicating with each other on the basis of
shortest path calculated. Then head check the status of each
node and collects the environmental data from sensor nodes.
All nodes collect data like temperature or any disaster affect
from environment.
6. Communication between Head & Nodes
For this, there is a direct communication between head &
nodes. Head asks the nodes about surrounding conditions,
and then nodes reply back to head about status. For this,
there is no loss of data because there is direct transfer of
packets from head & all nodes.
7. Proposed Protocol
All nodes are communicating to each other. This causes the
wastage of energy of network because all nodes are
consuming a lot of energy at a time. The proposed protocol
provides the concept of sleep scheduling in network.
Initially all nodes are in sleep state. After selecting sender
and receiver, the protocol predicts the shortest path without
usage of energy of nodes. After prediction of path, it uses receive and then transmit data could result in the total
the energy of only those nodes who are available for this energy consumption to be higher.
path, rest nodes are in sleep state. This helps to improve In this work, take the scenario for 50 nodes and
network lifetime by improving energy usage ratio of following result will show the information about the
network. placement of sensor nodes in an area. The simulation
environment is to randomly distribute 50 sensor nodes
Proposed Algorithm to an 25m*25m square. The initial energy of each node is
Input N: No. of Nodes provided. In each round, the sensor node will deliver a
Begin packet. All sensor nodes are stationary and homogenous.
Step 1: Provide N All sensor nodes can adjust their power levels based on
Step 2: Activate all N. distance.
Step 3: Communication with all N Nodes are in active state
25
Step 4: Set wake up time (t) 27
D
41
D

Step 5: 20
33

Case 1: If N is idle then 30 43

37 44
7
S
D 21
18
26
Put N in sleep state 15
49
12 23
10
S
D S
28 5

Case 2: Put half N in sleep and half N active

Y a x is
11 50
1
S
46 42
Provide routing in On state. 10 29 25
35
38
D S
4
2
S
D
36
D 31
Case 3: Initially all N in sleep 6
S 4016 22
34
D
32
17
Provide On demand Routing in them for 5 15 19 48
D 24
14S
energy efficiency.
13
8
D
47 45
20
3
S
End 0
0
9 39
S
5 10 15 20 25
X axis

Figure 3: Communication with Other Nodes

IV. SIMULATION RESULTS
Initially all nodes are in OFF State. If nodes want
25
placement of nodes in network
27
to communicate with each other, all nodes have a wakeup
41
time and they woke up all at a time i.e. they are synchronous
20
33 in nature. All nodes are ON & OFF synchronously. They
30 43
37 44
7 1821
provide communication by multi-hop routing technique.
26 49
12 23
10
28 5
When the distance between a sensor node and the base
15
station is large the data transmission from sensor node to
Y axis

11 50
35
38
46
4
1
42 base stations consumes more energy than in the case when
10 29 25
36
34
2
31 the distance is small. Hence the distance between sensor
6 4016 22
17
32 nodes among another and the distance from sensor nodes to
5 15 19 48 24 the base station impacts the lifetime of the WSNs.
1413
8
47
20
45 In a direct data transmission, each sensor node
0
0
9 39
5
3
10 15 20 25
collects and transmits the data to the base station directly,
X axis there do not exist any intermediate nodes for transmission,
the path which from sensor node to the BS can also be
Figure 2: Placement of 50 Nodes in Network called single-hop path. The advantage of direct
transmissions is that the data rate is higher and the
Sleep wake scheduling has been used to save the implementation is easier. Indirect transmission means that
energy and extend the network lifetime. Energy efficiency sensor nodes send their collected data to intermediate nodes
has inherent trade-off with delay, thus, generally in such also called relay nodes that are in the proximity of
sleep wake scheduling strategies, maximization in network themselves. This relay node will then forward the
lifetime is achieved at the expense of increase in delay. To aggregated data to the BS, the path from the sensor node to
achieve this, delay minimization at three levels is analyzed the BS is also called multi-hop path.
and addressed: the delay occurred because of traffic load at
the nodes near the BS, the delay occurred due to traffic load 25
Routing in network
27
at the connectivity critical node, and delay occurred while 41

dealing with traffic burst when an event occurs. 20

33

In minimum-energy routing protocol, nodes in a 30 43

37
D 44
7 21
18
26 49
network act as a router for other nodes. Transmission to the 15
12 23
10
28 5
Y a x is

base station from one node occurs through intermediate 46

11
1
50
35 42
nodes. The energy dissipation of the receiver is neglected in 10 29 25
38
36
4
2
31
some of the protocol [7] and only transmitter energy is 6
17
4016 22
34
32

taken. The selection of midway nodes is completed in 5

14S
15 19 48 24
13
8
such a manner that transmission energy is minimized. It 47
20
3
45

9 39
has been discussed whether this routing protocol perhaps 0
0 5 10 15 20 25
X axis
consumes more energy than direct routing algorithm. That
is, the energy consumed by each neighbour in order to
Figure 4: Shortest Path Routing in Synchronous Mode
4
 much more awake nodes closest to sink. All results are
25
energy efficient routing in this mode shown in figure 7 & 8:

Performance Comparison of Average Energy Consumption with Simulation Runs

20 0.7
proposed Algo
R Base paper [39]
0.6
15

#avg Energy Consumption)

Y axis

0.5
S
10
0.4

5
0.3

0 0.2
0 5 10 15 20 25
X axis
0.1

Figure 5: Energy Efficient Routing in Asynchronous Mode

0
1 2 3 4 5 6 7 8 9 10

In the proposed on demand case, all nodes are initially in #Simulation Runs

OFF State. As Sender node is chosen and he wants to send

data to a particular node. Then he finds initially all present Figure 8: Performance Comparison of Proposed with Actual Results in
terms of Average Energy Consumption
nodes location in the path and stores it. So, only those nodes
which are coming in the path gets wakeup call and they may
help the sender to communicate with destination. Table 1 shows the performance comparison of network
lifetime for various nodes from 100 to 1000 no. and results
Proposed On demand Event Driven mode
shows the proposed performance is better as compared to
25 1
16 18 actual one.
45 4
44 31 49
17 10 Table 1: Performance Comparison of Network Lifetime
20 37
14
47
25
21 5 Normalized Actual Results Proposed Results
8 39
15 13
22 35 Transmission Range (minutes) (Minutes)
11 48 12 0 150 680
Y axis

15 30
2
24
32 0.05 160 610
10 40 9 0.1 180 570
19 43
S 29 36
50
42 6 0.15 200 500
20
D 26
41 0.2 220 450
5 34 0.25 240 400
27 28 3 7 0.3 250 360
38
46 23 33 0.35 255 340
0
0 5 10 15 20 25
0.4 260 300
X axis 0.45 260 300

Figure 6: Proposed On Demand Routing Table 2: Performance Comparison of Average Energy Consumption

Performance Comparison of Average network lifetime with mobile sink Normalized Actual Results Proposed Results
700
proposed Algo Transmission Range (minutes) (Minutes)
Base paper [44] 1 0.05 0.02
600
2 0.15 0.05
#avg network lifetime (minute)

3 0.2 0.1
500 4 0.25 0.15
5 0.33 0.2
400
6 0.4 0.25
7 0.45 0.3
8 0.52 0.35
300 9 0.6 0.4
10 0.67 0.45
200

100
V. CONCLUSIONS
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45
#Normalized Transmission Range In this work, In WSN, all nodes consume energy while data
transmission. So, due to this mostly nodes gets dead after
Figure 7: Performance Comparison of Proposed Network Lifetime with some time and it causes less throughput and increase energy
Actual Results
wastage. So, there is a scope of energy efficiency under
The average length of the first transmission path & average sleep awake cycle in WSN. So, there is a need to develop
lifetime is explored by proposed work based WSNs with a improved on demand sleep scheduling routing algorithm for
mobile sink is also almost always shorter than that in actual energy conservation in WSN using MATLAB. Energy
work with a mobile sink. That is also due to that there are conservation makes sure that the lifetime of the network is

5
maximized. In this work, it presents the sleep scheduling of in WSN,” 2012 IEEE Students’ Conference on Electrical, Electronics
and Computer Science, pp.1-4.
nodes in WSN. In this, optimal path selection is based on [19] Chunsheng Zhu, Laurence T. Yang, Lei Shu, Trung Q. Duong,
shortest distance between nodes which is to be calculated. In Shojiro Nishio, 2012, “Secured Energy-aware Sleep Scheduling
this, it provides different scenarios under sleep awake. It Algorithm in Duty-cycled Sensor Networks, IEEE ICC 2012 -
presents synchronous and asynchronous way of Communication Software Services and Multimedia Applications
Symposium, pp.1953-1957.
communication between nodes. The main objective is to [20] K.P. Naveen, and Anurag Kumar, 2013, “Relay Selection for
provide energy efficiency in network & also reduce delay. Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor
So, to overcome this, it shows the on demand scheduled Networks,” IEEE Transactions on mobile computing, Vol 12, Issue.
routing. In this, only useful nodes are wake up by providing 3, pp-475-488.
[21] Rama Sundari Battula, and O. S. Khanna, 2013, “Geographic Routing
wakeup signal to those nodes and only those awake nodes Protocols for Wireless Sensor Networks: A Review,” International
participate in communication in network. The result shows Journal of Engineering and Innovative Technology, Vol. 2, Issue 12,
the improvement in network lifetime as compared to actual pp.39-42.
results. [22] H. Shih, J. Ho, B. Liao, 2013, “Fault Node Recovery Algorithm for a
Wireless Sensor Network” IEEE Sensors Journal, Vol. 13, No. 7.
[23] Prasenjit Chanak, Indrajit Banerjee, Hafizur Rahaman, 2013,
REFERENCES “Distributed Multipath Fault Tolerance Routing Scheme for Wireless
Sensor Networks”, IEEE Third International Conference on
[1] D. Linden and T. B. Reddy, 2002, Handbook of Batteries. McGraw- Advanced Computing & Communication Technologies.
Hill Professional: New York, 2002. [24] A. Abbasi, M. F. Younis, 2013, “Recovering From a Node Failure in
[2] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, 2002, Wireless Sensor-Actor Networks With Minimal Topology Changes”,
“Wireless sensor networks: a survey,” Journal of Computer IEEE Conference on Advanced Computing.
Networks, Vol 38, pp. 393–422. [25] K.Akkaya, I. F. Senturk, S.Vemulapalli, 2013, “Handling large-scale
[3] S. Davis, 2004, Basics of Design: Battery Power Management. node failures in mobile sensor/robot networks”, Elsevier pp. 1544-
Supplement to Electronic Design. 1550.
[4] T. Arampatzis, J. Lygeros, and S. Manesis, 2005, “A Survey of [26] N. Jabeur, N. Sahli, Ijaz M. Khan, 2013, “Survey on Sensor Holes: A
Applications of Wireless Sensors and Wireless Sensor Networks,” Cause-Effect-Solution Perspective”, Elsevier pp. 144-158.
Proceedings of IEEE International Symposium on, Mediterrean [27] Madhu. B.M, Abhilash C B, 2014, “Implementation of Improved
Conference on Control and Automation Intelligent Control., pp. 719– Robust Energy Efficient Routing Protocol”, IEEE Conference on
724. Advanced Computing.
[5] Kun Sun, 2006, “Secure and Resilient Clock Synchronization in [28] N. Gaur, A.Chakraborty, and B. S. Manoj, 2014, “Load-aware
Wireless Sensor Networks”, IEEE Journal on Selected Areas In Routing for Non-Persistent Small-World Wireless Mesh Networks”,
Communications, Vol. 24, No. 2, pp. 395-408. IEEE Conference on Systems and Informatics.
[6] G. Lukachan, 2006, “Scalable and Energy-efficient Routing for [29] Yunan Gu, Miao Pan and Wei Li, 2014, “Maximizing the Lifetime of
Large-scale Wireless Sensor Networks”, IEEE 6th International Delay-Sensitive Sensor Networks via Joint Routing and Sleep
Caribbean Conference on Devices, Circuits and Systems, pp. 267- scheduling,” International Conference on Computing, Networking
272. and Communications, pp.540-544.
[7] Konrad Lorincz, 2006, “Sensor Networks for Emergency Response: [30] WenHui Zhao, ZhiXin Qin, 2014, “Routing Algorithm for Wireless
Challenges and Opportunities”, IEEE Pervasive Computing, Vol. 3, Sensor Networks Based on Resistance Distance,” 2nd International
Issue 4, pp.16-23. Conference on Systems and Informatics (ICSAI 2014), pp.74-78.
[8] A. Swami, Qing Zhao, Yao-Win Hong and Lang Tong, 2007,
Wireless Sensor Networks: Signal Processing and Communications,
Wiley-Blackwell Publications.
[9] K. Sohraby Daniel Minoli Znati, 2007, Wireless Sensor Networks,
John Wiley & Sons.
[10] J. Yick, B. Mukherjee, and D. Ghosal, 2008, “Wireless sensor
network survey,” Computer Networks, Vol 52, pp. 2292–2330.
[11] Amulya Ratna Swain, R. C. Hansdah and Vinod Kumar Chouhan,
2010, “An Energy Aware Routing Protocol with Sleep Scheduling for
Wireless Sensor Networks, 24th IEEE International Conference on
Advanced Information Networking and Applications, pp.933-940.
[12] K.P. Naveen, and Anurag Kumar, 2010, “Tunable Locally-Optimal
Geographical Forwarding in Wireless Sensor Networks with Sleep-
Wake Cycling Nodes,” INFOCOM,2010 proceedings IEEE, pp.1-9.
[13] Kun Wang, Lei Wang, Can Ma, Lei Shuy, Joel Rodriguesz, 2010,
“Geographic Routing in Random Duty-cycled Wireless Multimedia
Sensor Networks,” IEEE Globecom Workshop on Advanced Sensor
Integration Technology, pp.230-234.
[14] Haibo Zhang and Hong Shen, 2010, “Energy-Efficient Beaconless
Geographic Routing in Wireless Sensor Networks, IEEE Transactions
On Parallel And Distributed Systems, Vol 21, Issue 6, pp.881-897.
[15] Chunsheng Zhu, Laurence T. Yang, Lei Shu, Lei Wan, Takahiro
Hara, 2011, “Sleep Scheduling Towards Geographic Routing in
Duty-Cycled Sensor Networks With A Mobile Sink, 2011 8th Annual
IEEE Communications Society Conference on Sensor, Mesh and Ad
Hoc Communications and Networks, pp.158-160.
[16] Chunsheng Zhu, Laurence T. Yang_, Lei Shu, Joel J. P. C. Rodrigues,
Takahiro Hara, 2011, “Sleep Scheduling Towards Geographic
Routing in Duty-Cycled Sensor Networks,” IEEE Transactions on
Industrial Electronics, pp.1-3.
[17] Kanika Sharma, 2012, “Comparative analysis of routing protocols in
Wireless sensor Network,” IRACST - International Journal of
Computer Science and Information Technology & Security, Vol 3,
Issue 1, pp.115-119.
[18] Poonam Lohan, and Rajni chauhan,2012, "Geography-Informed
Sleep Scheduled and Chaining Based Energy Efficient Data Routing
6