Protocols For Data Propagation In Wireless Sensor Networks

Ali Ahmadi Ali.Ahmadi1@ymail.com

Presenter:

Topic Of Present:

Supervisor:

DR.Farshad Eshghi Esfahani

November 2013

IN THE NAME OF ALLAH1

AGENDA:

• A: WHAT IS WSN?2

12/22/2014

• B: WSN Application

• C: Routing In WSN

• C.1 Flooding

• C.2 Gossiping

• C.3 SPIN

• C.4 Directed Diffusion

• C.5 Comparison between spin & Directed Diffusion

• C.6 LEACH

• D: conclusions protocols

3 • A Network Compose Of Large Number Of Sensor Nodes Which Work AutonomouslyA

• Independed to human

WHAT IS WSN?

4BWSN Application

• Health

• …

• Environmental

• Military

• Home

• Industrial

5Routing In WSN

C

6

Flooding

• classic approach for dissemination

• source node sends data to all neighbors

• receiving node stores and sends data to all its neighbors

• requires no protocol state

• disseminate data quickly

A

B

D E

c

c1

7

Gossiping

• gossiping is an alternative to the classic flooding approach that randomization to

conserve energy

• only forward to one randomly selected neighbor, not to allA

B

C D

• slow distribution of data,slow dissipation of energy

• avoid implosion, but overlap problem still exist

c2

8

SPIN:

• Sensor Protcols For Information Via Negotiation

• Spin's message's:

• ADV

• REQ

• DATA

• Handshake

9

HAS DATA To disseminate

ADV

ADV

REQ

REQ

10

DATA

DATA

11

ADV

ADV

ADV

12

REQ

REQ

13

DATA

DATA

14

15

Directed Diffusion

• introduced by Intanagonwiwat, Govindan and Estrin in, is data-centric in its nature

• in the sense that all communication performed in the sensor network is for named data.

16

Comparison between spin & Directed Diffusion

• data centeric

spin Directed Diffusion

• data centeric

• energy-aware • energy-aware

• two-phase pull diffusion

17

• A Cluster-based Approach

LEACH

• Low-Energy Adaptive Clustering Hierarchy Protocol

• a routing protocol for sensor networks aiming at reducing energy dissipation and also increasing

the network’s lifetime, by evenly distribute energy consumption among the sensors in the network

• self-organizing scheme in the sense that the nodes in the network form (using randomization) local

clusters, with one sensor per cluster being a cluster-head.

• As opposed to conventional clustering techniques, cluster-heads are not fixed throughout the

network’s lifetime. Instead, cluster-head positions rotate in a randomized way among all sensors of

the network. This “load balancing” technique avoids exhausting the battery of a single sensor and

thus increases the lifetime of the network

18

LEACH

LEACH phase

19

• spin is simple to implement compared with other protocols.

• spin seem to be the best protocol. it is better than flooding because it overcome data

implosion and overlap.

• more energy-efficient than floding or gossiping while distributing data at the same

rateor faster than either of these protocols.

• these is no redundant data sent through the network

conclusions protocols:

20

• H. Qi, P. T. Kuruganti , Y. Xu “The Development of Localized Algorithms in Wireless Sensor Networks,” Sensors

2002, vol 2, pp 286-293

• J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Estrin, and D. Ganesan, “Building Efficient Wireless

Sensor Networks with Low-Level Naming,” In Proceedings of the Symposium on Operating Systems Principles,

p 146-159, October 2001

• Azzedine Boukerche,” Protocols For Data Propagation In Wireless Sensor Networks” ,School of

Information, Technology and Engineering (SITE) ,University of Ottawa. Ottawa, ONT, Canada

• C. Intanagonwiwat, R. Govindan and D. Estrin: Directed Diffusion: A Scalable and Robust ,Communication

Paradigm for Sensor,Networks. In Proc. 6th ACM/IEEE International Conference on Mobile Computing –

MOBICOM’2000

• Arash NasiriEghbali,"Protocols For Data Propagation In Wireless Sensor Networks f o ytisrevinu"

ribakrimA, Tehran. 1384

21

THANK'S FOR YOUR ATTENTION

22