Department of Electronics and Telecommunication Engineering

M.E. (First Year 2017-18)

Subject: Wireless Adhoc Networks

MODULE 5

Design Consideration of Sensor Network

Guided by
Prof. Dr. Saurabh Mehta

Presented by
Tanvi Gursale (17104A1007)
Smita Baikar (17104A1014)
Priyesh Shivkar (17104A1015)

1
 Contents
• Types of wireless sensor network
• Design Issues
• Medium access control layer
• Responsibility of MAC layer
• Characteristics of MAC Protocols in WSNs
• Major sources of energy waste
• Mac protocols
1. S-MAC
2. SMAC
3.EAR

2
• Direct Diffusion.
• Sequential Assignment Routing(SAR).
• Minimum Cost Forwarding Algorithm.
• Coherent And Non-Coherent Processing.
• Cluster Based Routing Protocol(CBRP).
• Low Energy Adaptive Clustering Hierarchy (LEACH).
• Threshold-Sensitive Energy Efficient(TEEN).
• SPIN(Sensor Protocol for Information via Negotiation-based
Adaptive Routing).
• Power-Efficient Gathering in Sensor Information System(PEGASIS).
• Negotiation-based Routing, Multipath-based Routing, Query based
routing and Location –Based Routing.
• High Level Application Layer Support Distributed Query Processing.
• Data Aggregation.

3
• Adapting to the Inherent Dynamic Nature of WSNs: Some important goals
that current research in this area.
• Role of The Scalable Coordination Architectures for Deeply Distributed
Systems (SCADDS).
• Cognitive Radio Wireless Sensor Network.
• Prospective capabilities of a wireless sensor with CR.
• Advantages , challenges and Potential Applications of CR in Wireless
sensor networks.
• Introduction to Nanosensor networks.
• Types of Nanosensors..
• manufacturing of nanosensors.
• Wireless nanosensor network architectures.
• Applications of wireless nanosensor networks.

4
Types of wireless sensor network
Depending on the environment, the types of networks are decided so that
those can be deployed underwater, underground, on land, and so on.
Different types of WSNs include:

• Terrestrial WSNs
• Underground WSNs
• Underwater WSNs
• Multimedia WSNs

5
Terrestrial Network Underground Network

Fig: 1 Fig: 2

6
Underwater Network Multimedia Network

Fig: 3 Fig: 4

7
Design Issues
Routing protocols designed for traditional sensor network cannot be used directly in
WSNs for the following reasons.

• WSNs are data centric network

• WSNs are application specific

• No need to have unique ID

• Position awareness is important.

8
Medium access
control layer
Introduction to the MAC layer.
 The MAC( Medium Access Control) is
a sublayer is a sub layer between
physical layer and data link layer.
 In most networks, multiple nodes
share a communication medium for
transmitting their data packets
 The medium access control (MAC)
protocol is primarily responsible for
regulating access to the shared
medium.

Fig: 5

9
Characteristics of MAC Protocols in WSNs
 Wireless nodes are mostly concerned with energy
consumption

 A MAC protocol directly controls the activities of the radio

 A MAC protocol helps to fulfill the important design objectives

of WSN by specifying how nodes employ the radio share
channels, avoid collision and survive for longer period.

10
Mac protocols
S-MAC(The Sensor-Mac)
• The Sensor- MAC (S-MAC) protocol explores design for energy
conservation in the MAC layer.
• It reduces energy consumption from the following sources:
Collision, overhearing unnecessary traffic, and idle listing.

11
Major sources of energy waste
1] Collision

Networ
Collisio
n
k

Fig: 6

Collision follow the retransmission of packet which increases

energy consumption. 12
2] Overhearing

B A

Fig: 7

13
3]Idle listening

• Nodes listen to channel for possible traffic. If

nothing is sensed then most of the time node is
idle
• Idle listing consumes 50-100% energy required to
receive packets.

14
Periodic listen and sleep in S-MAC

Every node sleeps for sometime and then wakes to see that if any other node
wants to talk to him

Wake-up Sleep Wake-up

Fig: 8

15
 Schedule
Maintenance

Node Schedule C Node Schedule

A t

A
t
t

Node Schedule
B
A t
Node Schedule

Fig: 9

16
Maintaining the Synchronisation

1. Schedule is periodically broadcast to the neighbor’s

2. Schedule are sent in Sync Packets
3. Listen time is divided in two portions, one for sync packet and
other for data packet.

Fig: 10

17
Sync or data sending

(a) (c)

(b) (d)

Fig: 11
18
 D Transmission
Overhearing problem will create a
collision on node
B

C A B D

Fig: 12

19
SMACS ( Self Organizing Mac) for WSN’s

• The Self-organizing Medium Access Control for Sensor

networks (SMACS) is an infrastructure building protocol
that forms a flat topology (as opposed to a cluster
hierarchy) for sensor networks.

• SMACS is a distributed protocol which enables a

collection of nodes to discover their neighbors and
establish transmission/reception schedules for
communicating with them without the need for any
local or global master nodes.

20
Network Topology

A
D

F
Fig: 12

21
Fig: 13
22
EAR ( Eaves-drop and register protocol)

• Mobility can be introduced in WSN as extension to the

stationary WSN
• Mobile connection are very useful to a WSN where small,
low bit rate data packets can be exchanged to relay SNs to
and from the SNs.
• Thus, the EAR protocol attempts to offer continuous service
to these mobile nodes under both mobile and stationary
node constraints.

23
ROUTING LAYER

24
Fig: 14
25
 Network Structure Based
• Flat Routing
All SNs play the same role.
• Hierarchical Routing
SNs plays different role.
• Adaptive Routing
Adapt to the current network conditions and
available energy levels.

26
Direct Diffusion

Fig: 15 27
• DD is very useful for application requiring
processing of queries.
• Bs and sensors creates gradients of
information in their respective
neighbourhoods.

28
 Sequential Assignment Routing(SAR)
• QOS involved
• The routing scheme in SAR is dependent on three
factors
• Energy Resources
• Qos on each path
• The primary level of each packet.
• To avoid single route failure, a multi-path with a tree
rooted at the source SN to the destination SNs coupled
with a localized path restoration scheme is employed.
• SAR minimized the average weighted Qos metric over
the life time of the network.

29
Sequential Assignment Routing(SAR)

30
Fig: 16
Advantages: -
• Less power consumption.
• Fault-tolerance and easy recovery.
• Minimize the average weighted QoS metric
throughout the lifetime of the network.
• SAR maintains multiple paths from nodes to BS.
Disadvantages: -
• The main disadvantage of this protocol is the
overhead involved in maintaining tables and
states at each node.
31
Minimum Cost Forwarding Algorithm
• Assume the direction of routing is always
known i.e. towards the fixed base station.
• No need for a node to have a unique ID or
routing table.
• Each node maintain the least cost estimate
from itself to BS.
• It broadcast message to neighbour and
neighbour check if it is on the least cost path
between source and BS then it rebroadcast.
32
Minimum Cost Forwarding Algorithm

Fig: 17

33
 Coherent And Non-Coherent
Processing
• In Non-coherent data processing routing, SNs
locally process the raw data before being sent
to other SNs for further processing.
• The SNs that perform further processing called
aggregators.
• In coherent routing the data is forwarded to
aggregators after minimum processing of time
stamping and duplicate suppression.

34
 Hierarchical Routing
• Hierarchical routing allows to partition the
network into autonomous routing domains.

Fig: 18
35
Cluster Based Routing Protocol(CBRP)
• In CBRP the nodes of a wireless network are
divided into clusters.
• The diameter of a cluster is only two hop and
clusters can be disjoint or overlapping.
• Each cluster elects node as clusterheads,
responsible for the routing process.
• Clusterheads communicate with each other
through gateway node.

36
Cluster Based Routing Protocol(CBRP)

Fig: 19
37
 Low Energy Adaptive Clustering
Hierarchy (LEACH)
• LEACH randomly selects a few SNs as CHs and
rotates this role amongst the cluster members
so as to evenly distribute the energy
dissipation.
• Set-up phase
• Steady phase

38
Low Energy Adaptive Clustering
Hierarchy (LEACH)

39
Fig: 20
Low Energy Adaptive Clustering
Hierarchy (LEACH)

Fig: 21

40
Advantages:-
• Completely distributed
• No global knowledge of the network
• Increases the lifetime of the network
Disadvantages:-
• It is not applicable to networks deployed in
large regions and no use of meta data.

41
 Threshold-Sensitive Energy
Efficient(TEEN)
• In TEEN SNs sense their environment
continuously, thereby making it appropriate
for real time application.

42
Fig: 22
 Threshold-Sensitive Energy
Efficient(TEEN)
• Hard Threshold(HT):This is a threshold value
for the sensed attribute.it is the absolute
value of the attribute beyond which, the SN
sensing this value must switch on its
transmitter and report to its CH.
• Soft Threshold(sT):This is a small change in the
value of the sensed attribute which triggers
the SN to switch on its transmitter and
transmit once the HT has been crossed.

43
 Adaptive Periodic TEEN(APTEEN)
• APTEEN combines the features of proactive
and reactive networks.

44
Fig: 23
Fig: 24 45
SPIN-based Adaptive Routing

Fig: 25 46
 Power-Efficient Gathering in Sensor
Information System(PEGASIS)
Advantages: -
• Extend network lifetime.
• Bandwidth consumed in communication is
reduced.
Disadvantages: -
• Delay incurred for packets during transmission to
the BS.
• To obtain a global knowledge is difficult.
• Very long delay.
47
 Negotiation-based Routing
• It uses high level data descriptors in order to
eliminate redundant data transmission.
• Communication decision are also made based
on the available resources.
• The main idea behind negotiation-based
routing in WSNs is to supress duplicate
information and prevent redundant data from
being sent to the next sensor or the BS.

48
 Multipath-based Routing
• Network performance and possibly lifetime, in
WSNs can be significantly improved if the routing
protocol is able to maintain multiple paths to a
destination.
• The path along the diagonal is shortest in length
and if this path is used all the time in responding
the persistent query, the energy of the sensors
lying on this path, could get depleted at a much
faster rate than rest of the network.

49
 Query based routing
• In this type of routing, the destination node
propagates a query for data from a node
throughout the network.
• A node having data matching the query send it
back to the node which requested it.
• In this routing, all the SNs have tables consisting
of the sensing tasks queries that they received,
and send back data matching these task
whenever they received it.
• Example: Direct Diffusion Routing.
50
 Location –Based Routing
• Sensor nodes are addressed based on their
location.
• It assumes that each node known about its
own location by using the GPS.
• Network divided into a zone.
• In order to conserve energy, some location
based schemes demand that SNs should go to
sleep if there is no activity.

51
High Level Application Layer Support
Distributed Query Processing
• The number of messages generated in
distributed query processing is several
magnitudes less than in centralized scheme.
• There are two approaches for processing
sensor queries:
1] Warehousing.
2]Distributed.

52
 Data Aggregation
• Data aggregation is any process in which
information is gathered and expressed in a
summary form, for purposes such as statistical
analysis.
• It reduces the number of transmission thereby
improving bandwidth and energy utilization in
WSN.

53
Fig: 26

54
Fig: 27
55
Adapting to the Inherent
Dynamic Nature of WSNs:

56
 Important goals that current
research in this area
• Exploit spatial diversity and density of
sensor/actuator nodes
• Spontaneously create and assemble
network
• Adaptability to drastic changes in the traffic
• Finer control over the precision and
coverage
57
 Role of The Scalable Coordination
Architectures for Deeply Distributed
Systems (SCADDS)
• Adaptive fidelity.
• Use additional sensors (redundancy) to
extend lifetime.
• Neighboring nodes are free to talk.
• Adaptive Self-Configuring Ensor Network
Topologies (Ascent) focuses on how to
decide which nodes should join the routing
infrastructure.
58
Cognitive Radio Wireless Sensor
Network

59
• Cognitive techniques have been used in wireless
networks to circumvent the limitations imposed
by conventional WSNs.
• The cognitive technique is the process of knowing
through perception, planning, reasoning, acting,
and continuously updating and upgrading with a
history of learning.
• CR has the ability to know the unutilized
spectrum in a license and unlicensed spectrum
band, and utilize the unused spectrum
opportunistically.

60
 Prospective capabilities of a wireless
sensor with CR.
• Spectrum sensing
• Spectrum sharing
• Prediction
• Fairness
• Routing
• Reconfiguration capability
• Environment sensing
• Trust and security
• Power control

61
CR-WSNs model

Fig: 28
62
 Advantages of Using CR in WSNs
• Efficient Spectrum Utilization
• Multiple Channels Utilization
• Energy Efficiency
• Global Operability
• Application Specific Spectrum Band Utilization
• Financial Advantages to the Incumbents by
Renting or Leasing
• Avoiding Attacks

63
 Challenges
• Detection, False Alarm, and Miss-Detection
Probability
• Hardware
• Topology Changes
• Fault Tolerance
• Manufacturing Costs
• Clustering
• Channel Selection

64
 Potential Application Areas of
CR-WSNs
• Military and Public Security Applications
• Health Care
• Home Appliances and Indoor Applications
• Bandwidth-Intensive Applications

65
NANO SENSOR NETWORKS

66
Fig: 29

67
Fig: 30 68
Fig: 31
69
Fig: 32

70
Fig: 33 71
Fig: 34 72
Fig: 35 73
Fig: 36
74
Fig: 37 75
References
1. http://ieeexplore.ieee.org/document/4469516/
2. https://www.isi.edu/scadds/projects/smac/
3. https://www.youtube.com/results?search_query=s+mac+protocol
4. https://ac.els-cdn.com/S1877050915029002/1-s2.0-S1877050915029002-
main.pdf?_tid=03f3d39c-147c-11e8-b572-
00000aacb360&acdnat=1518938531_b077d0979d40d087d5faf4235fdc1c
09
5. https://www3.nd.edu/~cpoellab/teaching/cse40815/Chapter6.pdf

76
Thank You…

77