Throughput maximization technique in wireless sensor network

1. BY
J JENCY

2.  A wireless sensor network is a collection of nodes
organized into a cooperative network.
 WSN devices powered with small batteries are
deployed in the remote area, and it is not easy to
recharge or replace battery.
 The power for each sensor node is derived from the
electric utility or from a battery

3.  Limited Range
 Limited Power
 Limited Processing Power/Memory
 Large number of nodes
 Prone to failures
 Easy to be compromised
 Changing topology

4.  Habitant monitoring
 Building monitoring
 Health monitoring
 Military survivalance
 Target tracking

5.  Data aggregation is a widely used technique in wireless
sensor networks
 In data aggregation an intermediate node first collect
data from its children nodes, process the received data
to an aggregated value and then forward the aggregated
data to its parents nodes

6.  In TDMA based scheduling protocols make the nodes
to be in inactive mode, until their allocated time slots.
 The TDMA based protocols are designed such that the
shortest path for communication will be found out and
only a particular link will be in wake up mode for a
transmission.
 The TDMA based scheduling allocates separate time
slot for each node to access the medium to send the
sensed data or to forward the aggregated data.

7. LITERATURE SURVEY

8.  Scheduling was classified on the basics of energy
consumption, throughput maximization and minimize
latency.

10.  Contiguous link scheduling node can start up only once
for receiving or send data from its neighbors.

11. Contiguous Link Scheduling
Centralised scheduling Distributed scheduling

12.  Instead of scheduling a time slot individually for each
communication link, the links incident to a node are
scheduled consecutive time slots.
 Each node can start up only once to receive all the
data from its neighbors.
 The node which has more incident links is scheduled
earlier.

13. (a) Distributed scheduling

14. Advantages
 Reduce the energy consumption
 Reduce time overhead
Disadvantage
 Reduce throughput

15.  S-MAC protocol consist of three major components:
periodic listen and sleep, collision and overhearing
avoidance, and message passing.
 All nodes are free to choose their own listen/sleep
schedules.

16.  In channel signaling is used here to put each node to
sleep when its neighbor is transmitting to another node.
Thus this avoid overhearing problem
 In message passing fragment the long message into
many small fragments, and transmit them in burst.

17. Advantages
 Reduce energy consumption
 support self-configuration
 Collision will not occur
Disadvantages
 Latency is increased

18. Four possible states they are
 Transmitting
 Receiving
 listening
 sleeping

19.  when a sender wakes up, it will periodically send a
message SYN
 When the receiver wakes up , it will listen for the
message SYN and reply a message ACK if it gets one
completed SYN message
 After getting the correct ACK message, the sender
starts sending data.

20. Advantages
 Remove unnecessary listening cost
 Reduce the energy cost for state switching and clock
synchronization
Disadvantages
 Delay will occur

21.  The main goal of the algorithm is to reduce the sleep
mode delay in WSN.
 Energy saving is accomplished by turning off the
transceivers of every sensor in the network during the
idle operation and only periodically entering wake up
periods.

22.  If a sensor needs to transmit information to the
gateway, it transmits a WU message.
 The nodes that have received and forwarded the
wakeup message do not turn off their transceivers
during the following sleep-period, until the exchange of
information has been completed.

23. Advantages
 Reduces power consumption
 Reduces end to end delay
Disadvantages
 Introduces sleep related access delay
 Reduces power consumption only if the traffic rate is
low

24. Title Methods
used
Merits Demerits Performance
metrics
An Energy-
Efficient MAC
Protocol for
Wireless
Sensor
Networks
1)S-MAC
Protocol
1)Reduce
energy
consumption
2)support self-
configuration
3)Collision will
not occur
1)Latency is
increased
Reduce energy
consumption
Energy-
Efficient Wake-
Up Scheduling
for Data
Collection and
Aggregation
1)Centralized
Activity
Scheduling
2) Distributed
Activity
Scheduling
1)Remove
unnecessary
listening cost
2)Reduce the
energy cost for
state switching
and clock
synchronization
1)Delay will
occur
Energy
consumption
was low

25. Title Methods
used
Merits Demerits Performanc
e metrics
Link
Scheduling
in Sensor
Networks:
Distributed
Edge
Colouring
Revisited
1)Distributed
Edge
Colouring
Algorithm
1) Hidden
terminal
problem and
Exposed
terminal
problem are
avoided
1)Latency is
increased
TDMA
schedule can
be
constructed
using at most
2(ᵟ+ 1)
timeslots
Energy
Efficient
TDMA Sleep
Scheduling
in
Wireless
Sensor
Networks
1)Centralized
Scheduling
2)Distributed
Scheduling
,
1)Reduce
energy
consumption
2)Reduce
delay
1)Not
possible for
heterogeneou
s network
Efficiency
in terms of
the number
of state
transitions,
the number
of time slot
assigned, and
time delay.

26. Title Methods used Merits Demerits Performance
metrics
Efficient
Aggregation
Scheduling
in Multihop
Wireless Sensor
Networks with
SINR
Constraints
1)Distributed
Aggregation
Scheduling
2) Improved
Aggregation
Scheduling
1) Avoid
interference
Asymptotically
optimum on
delay in random
wireless sensor
networks
Distributed
Algorithms for
TDMA Link
Scheduling
in Sensor
Networks
1)DFS based
algorithm
1)Lower time
complexity
1)Topology
remains to be
unchanged
The effectiveness
of this approach
compared to the
best known
algorithms for
FDSLP problem

27. Title Methods used Merits Demerits Performance metrics
Data
Aggregation in
Wireless Sensor
Network
1)Centralized
approach
2)In-network
aggregation
3)Tree-based
approach
4)Cluster-based
approach
1)Energy
conservation
2)Remove
redundancy data
1)Affected by
node
mobility,obstacle
s and other
issues
Reduce transmission and
receiving power, the
energy consumption is low
as compared to that of
sending data
directly to sink
Energy
efficiency in
wireless sensor
networks using
sleep mode
TDMA
scheduling
1) TDMA
scheduling
algorithm
1)Reduces
power
consumption
2)Reduces end
to end delay
1)Introduces
sleep related
access delay
2)Reduces
power
consumption
only if the traffic
rate is low
Achieves the reduction of
the end-to-end delay
caused
by the sleep mode
operation while at the same
time it maximizes the
energy savings.

28. Title Methods used Merits Demerits Performance
metrics
MC-MLAS: Multi-
channel minimum
latency aggregation
scheduling in
wireless sensor
networks
1) MC-MLAS
algorithm
1)Reduce
aggregation delay
Reduce aggregation
latency efficiently,
An event-aware
MAC scheduling
for energy efficient
aggregation
in wireless sensor
networks
1) Event-aware
2)Energy-aware
routing protocol
3)Aggregation-
MAC protocol
1)Reduces energy
comsumption
2)Reduces data
aggregation rate
1)Increase latency The EA protocol
equivalent
or better
performance in
terms of latency,
aggregation and
rate
.

29. Title Methods used Merits Demerits Performance
metrics
Near optimal
scheduling of
data aggregation
in wireless
sensor networks
1)Peony-tree-
based Data
Aggregation
1)Minimize
latency of data
aggregation
Overall total
aggregation is
reduced
TDMA
scheduling for
event-triggered
data aggregation
in irregular
wireless sensor
networks
DATP protocol 1)Reduces the
amount of
interferences
Reduces the
spectral
efficiency, but
reduces the
amount of
interference and
the failure
probability

30. Title Methods used Merits Demerits Performance
metrics
Improving energy
efficiency in
wireless sensor
networks through
scheduling and
routing
1)Clustering 1)Reduce energy
consumption
Reduces the energy
consumption by
reducing the
number of time
wake up.
Energy efficient
data transmission in
automatic irrigation
system using
wireless sensor
networks
1)TDMA Based
method
1)Increase range of
the coverage area
2)Reduce the
energy consumption
of each sensor
nodes.
3)Increase
throughput
1) The major
disadvantage
in this approach was
that the node which
was far away
from the source will
always produce
minimum value.
13% of the increase
in the throughput

31. Title Methods used Merits Demerits Performance
metrics
Enhance
Throughput in
Wireless Sensor
Network Using
Topology Control
Approach
1)TOPOLOGY
CONTROL
APPROACH
1) Energy
consumption
2)Enhance
throughput
1)Increase latency Energy
consumption and
Enhance throughput
Dynamic Multilevel
Priority Packet
Scheduling Scheme
for Wireless Sensor
Network
Dynamic Multilevel
Priority
(DMP) packet
scheduling
1)Reduce end to
end delay
2)Reduce average
task waiting time.
1)possibility of
deadlock
DMP packet
scheduling scheme
has better
performance
in terms of the
average task
waiting time and
endto-

32. Title Methods used Merits Demerits Performance metrics
ETRI: A
Dynamic Packet
Scheduling
Algorithm for
Wireless Sensor
Network
ETRI packet-
scheduling
algorithm
1) Maximizing
total packet
number
2) Maximizing
system lifetime
1)Less
flexibility
Maximize total packet
number and maximize
system lifetime
Compressive
data gathering
using random
projection for
energy efficient
wireless sensor
networks
Minimum
Spanning Tree
Projection
(MSTP)
1) Increase the
network
lifetime,
1)Overall cost
is high
Decreasing the
communication cost
and distributing the
energy consumption
loads and hence
improving the overall
lifetime of the network

33. Title Methods used Merits Demerits Performance
metrics
EDGE: A routing
algorithm for
maximizing
throughput and
minimizing
delay in wireless
sensor networks
1) EDGE
algorithm
1)Maximize
throughput
2)Minimize delay.
1) quality of
service is low
Throughput
performance of
EDGE is on the
average 4 times
better than the
standard directed
diffusion
TRASA: TRaffic
Aware Slot
Assignment
Algorithm in
Wireless Sensor
Networks
Traffic Aware Slot
Assignment
(TRASA)algorith
m
1)Reduce energy
consumption
2)Maximize
throughput
Reduce energy
consumption and
maximize
throughput

34.  In an wireless sensor network nodes are battery
powered. One of scheduling method used in wireless
sensor network is TDMA based scheduling. This
method is based on allocating timeslots to each node to
transmit or receive data. If any node connect send the
data to the destination due to the battery drained before
the time slot allocated to it, throughput will reduce. To
maximize the throughput this technique is used.

35.  To maximize the throughput in wireless sensor network
using an enhanced distributed scheduling method
based on nodes energy .

36. Fig. Proposed architecture
Sensor node
dissemination
Selection of leader node
Node advertisement
Time slot allocation
Data transmission

37. In this method all nodes send its energy level to
base station. The base station will select one node as a
leader node in the network which have the highest
energy level.

38. Data transmission
The leader will assign time slot to every node that
gave the request to it based on their energy level. The
node having very lower energy level will scheduled first
to transmit the data. Based on the time slot each node
transmit its data to the leader node

39.  Reduce energy consumption
 Increase throughput

40.  Thus this method maximize the throughput in wireless
sensor network using data aggregation based on energy
level.
 Because this method using TDMA protocol the node
will wake up in particular time slot and send or receive
data. Thus this method also reduces the energy
consumption also.

41. [1] Contiguous Link Scheduling for Data Aggregation in Wireless Sensor Networks
Junchao Ma, Student Member, IEEE, Wei Lou, Member, IEEE, and Xiang-Yang Li, Senior
Member, IEEE. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
VOL. 25, NO. 7, JULY 2014
[2] W. Ye, J. Heidemann, and D. Estrin, ‘‘An Energy-Efficient MAC Protocol for Wireless
Sensor Networks,’’ in Proc. IEEE INFOCOM, 2002, pp. 1567-1576.
[3] Y.Wu, X.Y. Li, Y. Liu, and W. Lou, ‘‘Energy-Efficient Wake-Up Scheduling for Data
Collection and Aggregation,’’ IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 2, pp. 275-287,
Feb. 2010.
[4]S. Gandham, M. Dawande, and R. Prakash, ‘‘Link Scheduling in Sensor Networks:
Distributed Edge Coloring Revisited,’’ in Proc. IEEE INFOCOM, 2005, pp. 2492-2501
[5]J. Ma, W. Lou, Y. Wu, X.Y. Li, and G. Chen, ‘‘Energy Efficient TDMA Sleep Scheduling in
Wireless Sensor Networks,’’ in Proc. IEEE INFOCOM, 2009, pp. 630-638.


42.  [6] X. Xu, X.Y. Li, P.J. Wan, and M. Song, ‘‘Efficient Aggregation Scheduling in Multihop Wireless
Sensor Networks with SINR Constraints,’’ IEEE Trans. Mobile Comput., vol. 12, no. 12, pp. 2518-
2528, Dec. 2013.
 [7] T. Alsulaiman, S.K. Prasad, and A. Zelikovsky, ‘‘Distributed Algorithms for TDMA Link
Scheduling in Sensor Networks,’’ Int’l J. Netw. Comput., vol. 3, no. 1, pp. 55-74, 2013.
 [8]Data Aggregation in Wireless Sensor Network Nandini. S. Patil, Prof. P. R. Patil. 2010 IEEE
International Conference on Computational Intelligence and Computing Research
 [9] Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling Nikolaos A.
Pantazis a,d, Dimitrios J. Vergados b, Dimitrios D. Vergados a,c,, Christos Douligeris. Ad Hoc
Networks 7 (2009) 322–343.
 [10] MC-MLAS: Multi-channel minimum latency aggregation scheduling in wireless sensor
networks Fatemeh Ghods, Hamed Yousefi, Ali Mohammad Afshin Hemmatyar, Ali Movaghar.
Computer Networks 57 (2013) 3812–3825
 [11]An event-aware MAC scheduling for energy efficient aggregation in wireless sensor networks
Donggook Kim , Jaesub Kim 1, Kyu Ho Park. Computer Networks 55 (2011) 225–240

43.  [12])Near optimal scheduling of data aggregation in wireless sensor networks Pei Wang a,,Yuan He b,
Liusheng Huang
 [13] TDMA scheduling for event-triggered data aggregation in irregular wireless sensor networks qMario
Orne Díaz-Anadón , Kin K. Leung
 [14] Improving energy efficiency in wireless sensor networks through scheduling and
 Routing rathna. and sivasubramanian. International Journal Of Advanced Smart Sensor [Network Systems (
IJASSN ), Vol 2, No.1, January 2012
 [15] Energy efficient data transmission in automatic irrigation system using wireless sensor networks M.
Nesa Sudha a, M.L. Valarmathi b, Anni Susan Babu a. Computers and Electronics in Agriculture 78 (2011)
215–221
 16) Priority based Packet Scheduling Approach for Wireless Sensor Networks R.Karthikeyan1, R.Nandha
Kumar2,M.Ramesh3International Conference on Engineering Technology and Science-(ICETS’14).
 [17] EDGE: A routing algorithm for maximizing throughput and minimizing delay in wireless sensor
networks Shuang Li, Alvin Lim, Santosh Kulkarni and Cong Liu. 1-4244-1513-06/07/$25.00 (c)2007 IEEE

44.  [18] Enhance Throughput in Wireless Sensor Network Using Topology Control
Approach Parikha Chawla, Parmender Singh, Taruna Sikka. International Journal
of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-3,
July 2012
 [19] Dynamic Multilevel Priority Packet Scheduling Scheme for Wireless Sensor
Network Nidal Nasser, Lutful Karim, and Tarik Tale IEEE TRANSACTIONS ON
WIRELESS COMMUNICATIONS, VOL. 12, NO. 4, APRIL 2013b.
 [20] ETRI: A Dynamic Packet Scheduling Algorithm for Wireless Sensor Networks
Shu Lei, S.Y. Lee, Yang Jie
 [21] Compressive data gathering using random projection for energy efficient
wireless sensor networks Dariush Ebrahimi , Chadi Assi. Ad Hoc Networks 16
(2014) 105–119
 22) TRASA: TRaffic Aware Slot Assignment Algorithm in Wireless Sensor
Networks Ichrak Amdouni and Pascale. arXiv:1209.2806v1 [cs.NI] 13 Sep 2012


45. THANK YOU