ENERGY-EFFICIENT WAKE-UP

SCHEDULING FOR DATA

COLLECTION AND
AGGREGATION

Presented By Under the guidance of

Ankith V Hegde Ms. Reshma S
1ST12CS706 Asst. Prof
CSE, SAIT CSE, SAIT
AGENDA

ABSTRACT

INTRODUCTION

SYSTEM MODEL

FORMATION OF DATA GATHERING TREE

CONCLUSION
Abstract
 The Basic operation in WSN is the systematic gathering and transmitting of
sensed data to the base station.
 A key challenge in WSN is to schedule nodes` activities to reduce energy
consumption.
 The author of this paper has used TDMA as MAC layer protocol.
Introduction
 Wireless Sensors are often powered by batteries and have limited computing
and memory resources.
 A key challenging in WSNs is to schedule nodes` activities to reduce energy
consumption.
 A sensor in WSN using TDMA wakes up once to receive the data and turns off.
 The sensor consumes more energy during wakeup than in sleep.
 The main goal of this paper is to minimize the wake-up times in a scheduling
period, when the number of transmissions and receptions by a node is fixed.
 The author has proposed communication-efficient scheduling protocol that is
energy efficient.
 System Model
 The main energy consumption of
1. Network System Model a WSN is typically from:
transmitting, receiving, listening.
G = ( V,E )
Where,  We use a TDMA for scheduling
vv1
1
V = { v1,v2,v3,…,vn } node activities to reduce the
E = { E1,E2,E3,…En } energy consumption.
E1 = { l12 } =>v1v2
v3
v2

v5
v4
System Model Contd…
2. Energy-Efficient Scheduling
 A scheduling activities for all nodes is to assign each time slot 1<=t<=T to one of
the four possible states: transmitting, receiving, listening, and sleeping.
 If the synchronization is needed, nodes will also have additional state listening so
that adjacent nodes can synchronize their activities.

Fig 1. The synchronization between two nodes

System Model Contd…

Receiver

Sender
System Model Contd…
2. Data collection Tree construction

 A number of trees have been proposed for the data collection or data aggregation
for various purposes.
 The objective is to find a data collection tree T that should satisfy the data
requirements of all nodes.
Formation of Data Gathering Tree
 We would like to design a data gathering which is optimum.
 We construct a tree based on connected dominating set (CDS).
 First BFS tree is constructed, where the distance of the node is called its level,
then we construct CDS.
 Dominatees
Dominator

Dominatees
Dominator

First all nodes are set to

white
Conclusion

 The proposed scheduling algorithms remove unnecessary listening cost and also
reduce the energy cost for state switching and clock synchronization.
 In this protocol, every nodes needs only to wake up at most twice in once scheduling
period: one for receiving data from its children and one for sending data to its parent.
 The proposed method to construct energy-efficient data gathering tree whose energy
cost and timespan of scheduling is within constants time of the optimum.
THANK YOU