Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

International Journal of Future Generation Communication and Networking
Vol
...
3 (2014), pp
...
doi
...
14257/ijfgcn
...
7
...
03

Performance Analysis of Flooding and SPIN in Wireless Sensor
Networks
Kalpana Sharma1, Neha Mittal2 and Priyanka Rathi3
1

Associate Professor, Department of Computer Science and Engineering
Sikkim Manipal Institute of Technology
Sikkim-737136, India
2
Department of Computer Science and Engineering
Sikkim Manipal Institute of Technology
Sikkim-737136, India
3
Department of Computer Science and Engineering
Sikkim Manipal Institute of Technology
Sikkim-737136, India
1
kalpanaiitkgp@yahoo
...
com,
3
priyanka
...
com
Abstract

Wireless Sensor Networks (WSNs) have many capabilities like wireless
communications, sensing and computation
...
One of the major challenges in WSN is
efficient data transmission and to achieve this many energy efficient routing protocols
have been proposed
...
However it suffers from many problems like implosion, overlap and resource
blindness [25]
...
One of the routing protocols employing this approach is Sensor Protocols for
Information via Negotiation (SPIN) protocol [2] which uses meta-data to eliminate the
transmission of redundant data throughout the network
...
In this paper a comparative study has
been done among flooding and the SPIN protocols
...
Introduction
Many small, lightweight wireless nodes called sensors [11] come together to monitor
large physical environments or system to form a wireless sensor network
...
Sensor
nodes communicate not only with each other but also with a Base Station (BS) using their
wireless radio
...
7, No
...
The sensor nodes may
be simple to monitor a single physical phenomenon or complex, which may combine
many different sensing techniques (e
...
, acoustic, optical, magnetic) [8]
...
They can greatly improve the accuracy of information obtained through
collaboration among sensor nodes and online processing of information
...
In
wireless sensor networks there are many challenges like energy constraint, design
constraint, self management, security, etc
...
Apart from sensing ability WSNs also
have many advantages like onboard processing, communication and storage capability
because of which it finds usage in many applications like environment monitoring, target
tracking, healthcare, transportation and many more
...


Figure 1
...
It suffers from
various obstacles arising from limited energy [5], computational power and
communication resources available to the sensors in the network
...
7, No
...
Different Routing Protocols
There are many ways to classify routing protocols
...
With respect to network organisation, there are three common classes of routing
protocols: Sensor Protocol for Information via Negotiation (SPIN) [1], Directed diffusion,
Rumor routing and Gradient Based Routing (GBR) are the examples of flat based routing
protocols which assigns equal role to all the nodes
...
This family consists of many
protocols some of which are Low Energy Adaptive Clustering Hierarchy (LEACH),
Power Efficient Gathering in Sensor Information Systems (PEGASIS), ThresholdSensitive Energy Efficient-Sensor Network (TEEN), and Self Organizing Protocol (SOP)
...
Some Location based routing protocols are Greedy Perimeter Stateless
Routing (GPSR), Geographic Adaptive Fidelity (GAF), Geographic and Energy Aware
Routing (GEAR)
...
The Hybrid routing protocols exhibit features of both
reactive and proactive protocols like Safari
...

The design of the routing protocol depends on the nature of the application
requirements
...
But this type of addressing scheme is not suitable for WSN,
because it is hard to identify the sensor nodes in the network
...
Data-centric routing is one of them [16]
...
It is based on certain attribute values like advertisement of
data or interest for data which is propagated throughout the network
...
There are

Copyright ⓒ 2014 SERSC

27

International Journal of Future Generation Communication and Networking
Vol
...
3 (2014)

two popular approaches in this context- SPIN [10, 9] family of negotiation protocol and
Directed Diffusion [9]
...
The use of SPIN protocol will result in less
amount of packet transmission which will gradually save a significant amount of energy
...
In Section 2, a description of flooding is
given
...
Related work has been discussed in
Section 4
...


2
...
It is an old and simple strategy to spread
information into a network or to reach a node at an unknown location by flooding the
entire network [23]
...
Flooding ensures that if there is a path to the
destination, it is guaranteed to receive the data
...
Therefore, measures
must be taken to ensure that packets do not travel throughout the network indefinitely
...
It should be large enough so that every intended receiver can be reached, but
also small enough to ensure that packets do not travel too long in the network
...
In this case whenever a
node receives a packet that it has already forwarded, it simply discards the duplicate
...



Implosion

In flooding, a node always sends data to its neighbor nodes even if the neighbor has
already received the data from another source
...
Here, node A starts by flooding data to its two neighbors, B
and C
...
The protocol, thus, wastes resources by sending two copies of the data to D
...
Implosion [25]

28

Copyright ⓒ 2014 SERSC

International Journal of Future Generation Communication and Networking
Vol
...
3 (2014)



Overlap

Sensor nodes often cover overlapping geographic areas due to which nodes gather
overlapping data
...
Similarly the
flooding algorithm in this case too, wastes energy and bandwidth by sending two copies
of a piece of data to the same node
...
Overlapping Problem: The Node C Receives the same Data Y by
both A and B [25]


Resource Blindness

The flooding algorithm completely ignores the resource constraints of individual
nodes
...
So the nodes with resource scarcity get destroyed easily
...
SPIN (Sensor Protocol for Information via Negotiation)
SPIN is a data-centric routing protocol [27]
...
Meta-data is used by sensor
nodes to give a complete description of the data that they collect and their size should be
less than the actual data in terms of bytes
...
The SPIN family is
designed to address the deficiencies of flooding
...
The advantage of this protocol is that each node needs to
know only its single-hop neighbours
...
However, SPIN’s data advertisement
mechanism does not always guarantee data delivery
...
These include SPIN-PP, SPIN-EC, SPIN-BC and SPINRL
...
Here two nodes can
communicate with each other without interfering with other nodes
...
7, No
...
When a SPIN
node receives a new data, it broadcasts an ADV message to its neighbour nodes, which
contains the meta-data
...
Hence the sender node can differentiate between lost ADV messages and ADV for
requested data
...
This
neighbour sensor node then repeats this process with its neighbours
...


Figure 5
...
[5]


SPIN- EC

Here the sensor nodes communicate using the same 3-way handshake protocol as in
case of SPIN-PP but there is energy conservation parameter added to it [26]
...

If it is above the energy threshold it will perform the operations similar to SPIN-PP
...



SPIN-BC

This protocol is designed for broadcast channels nodes where the networks
communicate using a single, shared channel [7]
...
If a node wishes to send
a message and senses that the channel is currently in use, it must wait for the channel to
become idle before attempting to send the message
...
However, the advantage of such networks is that when a single node sends a
message out to a broadcast address, this message can reach all of the node’s neighbours
using only one transmission
...



SPIN-RL

It is similar to SPIN-BC protocol but more reliable
...
Here each node keeps track of all the advertisements and
the nodes sending them
...
The nodes also have limited frequency with which

30

Copyright ⓒ 2014 SERSC

International Journal of Future Generation Communication and Networking
Vol
...
3 (2014)

they resend the data messages
...


Copyright ⓒ 2014 SERSC

31

International Journal of Future Generation Communication and Networking
Vol
...
3 (2014)

Table 1
...
Related Work
1
...

In this paper emphasis was given on one of the most challenging aspect of WSN i
...

Energy Efficiency
...
In this paper an algorithm M-SPIN has been proposed for
increasing the energy efficiency of routing protocol
...
To solve this issue, energy level
was used as a parameter
...

2
...

The aim was to compare the performance of two routing protocols – SPIN and LEACH
using data centric approach
...

The simulation was based on energy performance using Network Simulator 2
...
The
simulation was run for 2 minutes using 50 nodes for both protocols
...
Also the end to end
delay and dead nodes is more in case of LEACH but the packet delivery ratio is more in
case of LEACH as there is no time boundation
...
K
...
Kavitha [2013] proposed “Comparative Analysis of Data Centric
Routing Protocols for Wireless Sensor Networks” [13]
...
Based on this analysis M-SPIN performs better than other two
...
But one
major problem in M-SPIN is that few sensor nodes may be used several times and those
nodes may dissipate energy and may be destroyed earlier than other nodes in the network
...
The network
simulator version 2 was used for performances analysis
...
Parul Tyagi, Surabhi Jain [2012] proposed “Comparative Study of Routing Protocols
in Wireless Sensor Network” [19]
...

The three main categories on the basis of network structure are Flat, Hierarchical and
location based routing protocols
...
The advantages and
performance issues of each routing technique has been discussed
...
7, No
...
Performance Analysis
This section compares the two routing protocols – Flooding and SPIN
...
This process is repeated until all the nodes have received the
packets
...

However it encounters many problems like implosion, overlapping and resource blindness
which causes transmission of redundant data and wastage of energy and bandwidth [28]
...
Every node
uses meta-data to give description about the data it is going to send
...
Negotiation is done by sensor nodes before
sending data
...
Only
required data is sent to the neighbour nodes thus preventing duplicate packets and saving
energy [6]
...
After the
negotiation, the sender transmits the data to the receiver (DATA) only after receiving the
REQ message
...
To
solve this issue some changes can be done in the existing protocol by enhancing some of
its existing features
...
This analysis is based on various researches done in this field
...
Comparison Between Flooding and SPIN [10][21][22]
HEURISTICS
Network Topology
Data Delivery
Redundant Data
Energy Consumption
Latency
More number of nodes
Query Based
Throughput
Reliability
Lifetime of nodes
Energy Efficiency
Energy
Resource
Awareness

FLOODING
Information not required
Guaranteed
Present
High
High
Preferred
No
Low
Low
Low
Low
No

SPIN
Required
Not Guaranteed
Not Present
Low
Low
Not Preferred
Yes
High
High
High
High
Yes

6
...
However it suffers from many disadvantages like
implosion, overlapping and resource blindness
...
It is data centric and uses meta-data
negotiation before transmitting the actual data
...
It has been analysed that flooding can be used when there
are large number of nodes
...
So instead of
using flooding, SPIN can be used which will increase the throughput and reliability, while
reducing the latency
...
7, No
...
It is seen that SPIN-EC and SPIN-RL saves a large amount of
energy [10]
...
Though the SPIN protocol is energy efficient but it does not
guarantee data delivery
...
Furthermore there may be situations when few sensor nodes may be used
several times and those nodes may dissipate energy and may be destroyed earlier then
other nodes
...
So each time a node gets the ADV packet, it will check whether the
destination lies in the list of its neighbours
...
Then, depending
on the largest energy value, the data will be sent to the corresponding node
...
A lot of
study can be done in this field to overcome the issues of SPIN and make it a preferred
protocol for routing in WSN
...
We express our sincere thanks to Dr
...
She has been a source of inspiration for us that helped us and
motivated us throughout
...
Azni, M
...
Saudi, A
...
S Johari, “Performance Analysis of Routing Protocol for WSN
Using Data Centric Approach”, World Academy of Science, Engineering and Technology, vol
...

A
...
Szewzyk, J
...
Tygar, V
...
E
...
8, (2000), pp
...

C
...
Chong and P
...
28, (2005), pp
...

D
...
Sehrawat and Jyoti, “Energy Efficient M-SPIN Protocol”, International Journal of
Scientific & Engineering Research, vol
...
10, (2012) October
...
C
...
Varaiya
...
13, (2007), pp
...

Geetu and S
...
com), vol
...
5
...
Hassanein and J
...
54-64
...
F
...
Su, Y
...
Subramaniam and E
...

Netw
...
393–422
...
N
...
E
...
In:
IEEE Wireless Communications, vol
...
6, (2004), pp
...

J
...
R
...
Balakrishnan, “Negotiation–Based Protocols for Disseminating
Information in Wireless Sensor Networks”, In: Wireless Networks, vol 8, (2002), pp
...

K
...
Rahman, "A Survey on Sensor Network”, JCIT, ISSN 2078-5828 (PRINT), ISSN 2218-5224
(ONLINE), vol
...
01, MANUSCRIPT CODE: 100715, (2010)
...
Akkaya and M
...
3, (2005), pp
...

K
...
Kavitha, “Comparative Analysis of Data Centric Routing Protocols for Wireless
Sensor Networks”, International Journal of Scientific and Research Publications, vol
...
1, (2013)
January
...
7, No
...
Padmanabhan, “A Study on Energy Efficient Routing Protocols in Wireless Sensor Networks”,

[15]
[16]

[17]
[18]

[19]

[20]

[21]
[22]
[23]
[24]
[25]
[26]
[27]

[28]

[29]

European Journal of Scientific Research ISSN 1450-216X, Euro Journals Publishing, Inc, vol
...
4,
(2011), pp
...

R
...
Mudholkar, S
...
Sawant and V
...
Patil, “Classification and comparsion of routing protocols in
wireless sensor networks”, Ubicc journal, vol
...
704-711
...
Munish, D
...
Kotary and S
...
14, (2012), pp
...

K
...
Kamalakkannan, “A Study on Energy Efficient Routing Protocols in Wireless
Sensor Networks”, European Journal of Scientific Research, vol
...
4, (2011), pp
...

P
...
Bhattacharya, J
...
Rathi, “A Review on Routing Protocols for Application in
Wireless Sensor Networks”, International Journal of Distributed and Parallel Systems, vol
...
5,
(2012)
...

V
...
C
...
R
...
R
...

4, (2012), pp
...

Y
...
Shi, X
...
Ye and P
...
Liu, “Research status on wireless sensor networks”, Foreign Electronic
Measurement Technology, vol
...
1, (2005), pp
...

V
...
Saritha and T
...

Y
...
Fromherz, “A Robust and Efficient Flooding-Based Routing for Wireless Sensor
Networks,” Journal of Interconnection Networks, vol
...
4, (2006), pp
...

Z
...
Roy and N
...

D
...
168-172
...
Li and F
...
3,
(2007), pp
...

S
...
2, (1999), pp
...

C
...
B
...

W
...
Heinzelman, J
...
Balakrishnan, "Adaptive Protocols for Information Dissemination in
Wireless Sensor Networks," Proceedings of the 5th Annual ACM/IEEE Conference on Mobile
Computing and Networking, Seattle, Washington, United States, (1999) August 15-19, pp
...


Authors
Dr
...
Institute of Technology, Mazitar, Sikkim,
India since August, 1998
...
Tech from IIT Kharagpur, India
...
Her areas of research interest
are Wireless Sensor Networks, Steganography, Network & Information Security, Real
Time Systems and Software Engineering
...

She
can
be
reached
at
kalpanaiitkgp@yahoo
...


Neha Mittal- is a final year B
...
Her areas of interest are
Wireless Sensor Networks and Ad hoc Networks
...
com
...
7, No
...
Tech student of Computer Science and Engineering
Department at Sikkim Manipal Institute and Technology
...
She can be reached at
priyanka
...
com

---