SlideShare a Scribd company logo
1 of 7
Download to read offline
IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 4, Ver. II (July – Aug. 2015), PP 29-35
www.iosrjournals.org
DOI: 10.9790/0661-17422935 www.iosrjournals.org 29 | Page
Performance Analysis of Three Hop Reliability Model for
Wireless Sensor Networks in Nuclear Power Plants
S.Lavanya1
, Dr. S. Prakasam2
1
(Research Scholar, Dept of CSA, SCSVMV University, Kancheepuram, India
2
(Asst.Professor and Head, Dept. of CSA, SCSVMV University, Kancheepuram, India)
Abstract: Wireless sensor networks(WSN) are a good choice for Nuclear Power Plants because of low cost
and flexibility. Reliability is a crucial factor for WSN in Nuclear Power Plants since all the data collected are
time critical information that should be delivered on time otherwise a huge loss could incur in terms of money,
resource or even human lives. So it is a challenging task to design a routing protocol for sensor used in such
harsh environments. In Three hop reliability model (3H-ACK), three copies of the same data are maintained
without imposing extra cost on the network. This model works best using zone routing protocol .Compared to
the models used earlier, this 3H-ACK performs well in terms of delivery ratio, throughput and avoids packet
loss as far as possible.
Keywords: Acknowledgment, Nuclear Power Plants, Reliability, Sensor Networks,
I. Introduction
Wireless Sensor Networks (WSN) are used nowadays in Nuclear Power Plants (NPP). Sensors can be
used to monitor the current state of the plant including emission of radioactive particles to air and water. Other
parameters include neutron flux, monitoring pressure, temperature and water levels in circuits. If these levels
exceed a particular threshold levels alarm is raised and information is passed on to the alerting unit whenever
necessary. Daily more than 7, 00,000 data are to be collected and send to the base station. Manual maintenance
of such data is a tedious task. The challenges posed by WSN in NPP are EMI/RFI, compatibility of WSN in
harsh nuclear environment, energy concerns, security and reliability. From authors[1-4] it has been proven that
WSN does not pose a threat to EMI/RFI. Moreover suitable test from [1] shows that WSN can withstand harsh
conditions in nuclear environments.
Fig. 1 Technical Components used in Nuclear Power Stations
There are lots of factors that are to be considered when deploying a WSN for a Nuclear Power Plant
[4]. First it is necessary to understand the measurement requirement. The purpose for which sensors are used
should be known very clearly. Secondly appropriate wireless protocol such as IEEE 802.11 or IEEE 802.15
should be chosen. The chosen protocol must co-exist with other protocols. Finally, deployment of sensor nodes
is yet another important issue that is to be considered properly.
In this paper, Section II explains the reliability issues in Sensor Networks. Hop- by-Hop and 2H-ACK
models are described. Section III explains 3H-ACK model. The architecture and algorithms are used explained.
Section IV explains the simulation parameters and section V gives the conclusion.
II. Reliability In Sensor Networks
Reliability is a key aspect in wireless sensor networks. Reliability is the ratio of number of bits in error
to the total number of bits transmitted. Bit error rate should be minimal in such applications. It has been shown
that Transport Control Protocol does not work very well with sensors since the three -way handshake procedure
causes overhead. TCP relies on end – end acknowledgment whereas wireless sensor networks use multi-hop
Alarm Systems
Central Database (Sink)
Communication Server
Nuclear Power Plant Client systems
Performance Analysis of Three Hop Reliability Model for Wireless…
DOI: 10.9790/0661-17422935 www.iosrjournals.org 30 | Page
Node ID HopID
Node ID HopID Buffer Size Battery level
approach that relies on hop-hop reliability that lessens congestion and is more efficient in terms of energy
savings [5].
Reliability also depends on other parameters like congestion, energy, throughput and delay. TCP
provides good congestion control mechanism. On the other hand, UDP does not provide flow or error control.
Packet size is another important factor that affects reliability as larger packets are subjected to loss whereas
short packets suffer from overhead. So in many situations dynamic packet size is the best one. [6-8]. Packet size
can be chosen depending on the link quality. If the chosen route is optimal then larger packet size can be chosen
which will be free from packet loss. If the route is not optimal, then smaller packet size can be chosen so as to
avoid packet loss. In case of lost packets, retransmission is the best method but it can cause delay.
2.1 Dynamic addressing scheme for wireless sensor networks
Author [6] states very clearly that in Hop – by – Hop dynamic addressing based routing protocol,
unique address namely HopID is assigned to every node based on its hop count from the sink. Thus the node
that is closer to the sink is assigned smaller HopID and is used frequently to forward the data. In order to know
the status of congestion and energy level, Inquiry Request and Inquiry response messages are used. The format
is as follows:
Fig. 2 Format of Inquiry Request
Fig. 3 Format of Inquiry Reply
2.2 Single Hop Reliability Model
Hop-by-Hop ACK(HbH-ACK) is most suitable only for stable environments. In this method, only two
nodes are involved namely the source and the destination. The source node sends a data packet to the
destination. On the receipt of data, the destination sends out an acknowledgment (ACK) to the source. Once the
source receives the ACK, it discards the data packet. Now the current node holding the data packet is
responsible for sending the data to the destination. It has to find the next suitable hop that will deliver the data
along the path to the destination. Sometimes due to dynamic node movement, the current node may not find the
next suitable hop or may die due to energy loss. In such case the actual data is lost since no other node maintains
these backup copies. From the simulation conducted by the author [7 ] it is clear that there are no duplicate
packets since only one node maintains the data copy, but the rate of packet loss was very high.
2.3 Two Hop Reliability Model
From authors [8-10], Two Hop Acknowledgment (2H-ACK) provides a guaranteed delivery scheme. In
this approach, two nodes maintain the copy of the same packet. The procedure is as follows:
The source node that wants to send the data packet will send an Inquiry request message to all its
neighbors using gossiping method. The neighbors will compare their hop id with the sender node‟s hop id and
the node with the smallest hop id will respond with the Inquiry response method. Then the packet is transferred
to the node with the smallest HopID. After receiving the data packet the receiving node does not immediately
send an ACK to the source node. It will try to find the next hop node on the way to the destination and the same
procedure is repeated. After the third node receives the data packet, it sends an ACK to the intermediate node.
The intermediate node sends the ACK to the source node thereby the source node will delete the data packet as
two copies of the data packet now exist. The same procedure is repeated till the data reaches the destination. The
use of Inquiry request and Inquiry response packet solves the problem of congestion and energy usage. The
nodes that are free from congestion and that have sufficient energy only replies with the Inquiry reply packet.
From the simulation results conducted by the author [8], it is clear that duplicate data packets and packet losses
are less in 2H-ACK.
III. Three Hop Reliability Model
From authors [11-12], it is clear that 3H-ACK is the most suitable for most time critical applications
used nowadays in industries. 2H-ACK still suffers from packet loss because the intermediate node can die
before it can send an ACK to the source node. The source node does not know whether the packet is on the way
to its destination. It cannot delete the original data packet and it leads to buffer overflow. If after a stipulated
amount of time, the source node once again finds a neighbor to deliver the same data packet, then replication
occurs as the data packet has reached another node, but the source node is unaware of this happening since ACK
Performance Analysis of Three Hop Reliability Model for Wireless…
DOI: 10.9790/0661-17422935 www.iosrjournals.org 31 | Page
from the intermediate node was lost. In this model three nodes will keep the copy of the same data packet. Here
every node carries a step field along with the data. The step field will be incremented at every intermediate node
until the value of step becomes three. This 3H-ACK is best implemented with zone routing protocol.
Fig. 4 Three-Hop Reliability Model
In this model, node A4 wants to send the data packet to the destination. It sends a Hello Packet to all
the nodes within the zone. A3 is the next hop with smallest Id. So it responds with the Hello reply. The data
packet is sent to node A3 and the step value is incremented from 0 to 1. Now the same procedure is repeated and
the data packet is sent to node A2. The value of step now becomes 2. When the data packet reaches A1 then the
value of step becomes 3. Now the copy of data packet is available in node A1, A2 and A3. When the value of
step becomes 3, the original copy of data packet is removed from A4.
Fig. 5 Architecture of 3H-ACK
Performance Analysis of Three Hop Reliability Model for Wireless…
DOI: 10.9790/0661-17422935 www.iosrjournals.org 32 | Page
Node ID ClusterID
Cluster IDNodeID Energy Level Priority Buffer Size
Fig 6. Format of Hello Request
Fig 7. Format of Hello Response
Fig 8. Three Hop Final Message format
Algorithm for 3 H-ACK Model:
1. Initialize the value of step = 0
2. Define the Zone limit
3. Send Hello Packet to find the nearest node
4. If Hello Packet is received then
a. Send the data packet to the nearest node
b. Save a copy of the data packet in the buffer
5. If the value of step <3 then
a) Increment the value of step by 1else
b) Set the value of step by 0 and send the final message to the third hop
6. If the final message reaches is received at the third node then
a) Delete the copy of the saved message else
b) Repeat from step 4 to 6
7. Stop
By using zone routing protocol, the nodes inside the zone alone participates in packet forwarding. The
rest of the nodes may remain to be inactive thereby saving energy. Though three copies of the data packet might
exist leading to redundancy a times, loss of packet is avoided which in turn reduces retransmission which is very
costly compared to this reduced redundancy. Moreover Inquiry reply packet guarantees no congestion and the
energy level of node. Therefore problem of congestion and energy are alleviated. Every sensor node can hold 50
packets. The packet size specified by IEEE 802.11 can be upto 1000 byte long. But from author [7], it can be
proven that the optimal packet size can be from 128 to 256 bytes. From the simulation results, it is very clear
that 3H-ACK guarantees 90% of delivery ratios at various time intervals. The probability of duplication in 3H-
ACK is very low compared to the packet loss.
IV. Simulation Results
The proposed algorithm is implemented using NS-2 simulator. Simulation is performed using Cygwin.
Cygwin is free software that provides a Unix-like environment. NAM Editor is used to perform simulation
operation. The scripting language used is TCL.
Fig 6. Creation of Nodes
Source Node ID First Forwarder
ID
N
Second
Forwarded ID
Step value
Performance Analysis of Three Hop Reliability Model for Wireless…
DOI: 10.9790/0661-17422935 www.iosrjournals.org 33 | Page
The output produced by NAM simulator is analyzed. The metrics used to measure the performance of
the networks are Packet delivery ratio, Packet drop rate and Throughput.
Fig 7. Source and Destination Nodes are selected to deliver messages
Initially 15 nodes are created using NAM editor (Fig 6). The source and destination nodes are selected. The
node with the shortest HOPID is selected and the data is delivered to the node. The same procedure is repeated
until all three nodes have received the data. Then the data is delivered to the destination and after receiving an
ACK, the data is removed from source node.
Fig 8. Data is sent to different nodes with smallest HOPID
Fig 9. Implementing 3 Hop Reliability Model
Performance Analysis of Three Hop Reliability Model for Wireless…
DOI: 10.9790/0661-17422935 www.iosrjournals.org 34 | Page
Packet Delivery Ratio:
Packet delivery ratio is the ratio of number of packets received at destination node to that of number of
packets sent by source node. From the simulation results of author [ 9 ], It is shown that Packet delivery ratio
and loss in packet for 2H-ACK is better than HbH-ACK. Here 3H-ACK shows the best delivery ratio of 90%
thereby avoiding loss in packet.
Fig 10. Packet Delivery Ratio of 3H-ACK Model
Fig 11. Packet Loss Ratio in 3H-ACK
Throughput:
Network throughput is the amount of data that is received. Though there is a chance that multiple
copies of the same data packet can be received at the sink nodes, the probability is very low compared to packet
loss.
Fig 12. Throughput of 3H-ACK Model
Performance Analysis of Three Hop Reliability Model for Wireless…
DOI: 10.9790/0661-17422935 www.iosrjournals.org 35 | Page
V. Conclusion
Sensors are resource constrained and the harsh environments in which they operate make them die very
soon because energy gets replenished very easily. Congestion and weak link are also the main cause of loss in
packets. From the studies it is clear that compared to Hop-by-Hop and 2H-ACK, 3H-ACK yields better results.
It may be sometimes a time-consuming task or may be considered costly since it involves three copies of the
data packets to be transferred between the source and destination, but reliability is sometimes given top priority
when compared to cost involved in sending three copies of the packets. Energy consumption through various
energy harvesting techniques could be considered as a future work.
References
[1]. L. Li*a, Q. Wangb, A. Barib, C. Dengc, D. Chenc, J. Jiangb, Q. Alexandera, and B. Sura , Field Test of Wireless Sensor Network in
the Nuclear Environment, Atomic Energy of Canada Limited, Chalk River, ON K0J 1J0, Canada.
[2]. H.M. Hashemian, 2011, Nuclear Power Plant Instrumentation and Control -In Nuclear Power – Control, Reliability and Human
Factors, InTech, Chapter 3, pp. 49–66, Available from URL: 1051/InTech uclear_power_plant_instrumentation_and_control.pdf.
[3]. A Kadri, R.K. Rao and J. Jiang, 2009, “Low-Power Chirp Spread SpectrumSignals for Wireless Communication within Nuclear
Power Plants”, Nuclear Technology, 166(2), pp. 156–169.
[4]. Muhammad Adeel Mahmood and Winston Seah, “Reliability in Wireless Sensor Networks: Survey and Challenges Ahead”
Published in Elsevier February 8, 2012.
[5]. Joseph V. Cordaro, Davis Shull, Mark Farrar, and George Reeve, Ultra Secure High Reliability Wireless Radiation Monitoring
System, IEEE 2012.
[6]. M Ayaz, M., Abdullah, A Hop-by-Hop Dynamic Addressing Based (H2-DAB) Routing Protocol for Underwater Wireless Sensor
Networks. International Conference on Information and Multimedia Technology, 2009. ICIMT „09. vol., no., pp. 436–441, 16–18.
[7]. P.R. Pereira, A.G., End-To-End Reliability in Wireless Sensor Networks, Survey and Research Challenges, In Euro FGI Workshop
on IP Qos and Traffic Control 2007.
[8]. Ayaz, M., Abdullah, A., Faye, I, . Hop-by-hop reliable data deliveries for underwater wireless sensor networks. In: Broadband,
Wireless Computing, Communication and Applications (BWCCA), 2010 International Conference.
[9]. S. Basagni, C. Petrioli, R. Petroccia, M. Stojanovic, Choosing the Packet Size in Multi-hop Underwater Networks , Northern
University, Boston, MA, USA (2009).
[10]. Ayaz, M, et al, Reliable data deliveries using packet optimization in multi-hop sensor networks , Journal of King Saud Univrsity –
Computer and Information Sciences, 2012 . Pg 41-48.
[11]. Praful P. Maktedar , Vivek S. Deshpande , J. B. Helonde, V.M. Wadha, Performance Analysis of Reliability in Wireless Sensor
Network, International Journal of Innovative Technology and Exploring Engineering (IJITEE ), ISSN: 2278 - 3075, Volume 2 ,
Issue 4 March 2013.
[12]. Ali T, Low Tang Jung , Faye, I., Three hop reliability model for Underwater Wireless Sensor Network, International Conference on
Computer and Information Sciences (ICCOINS), 3-5 June 2014 , Kuala lampur.

More Related Content

What's hot

Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
 
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
 
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and ScienceResearch Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Scienceinventy
 
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
 
Wireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEECWireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEECYogesh Fulara
 
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN A General Self Organized Tree Based Energy Balance Routing Protocol for WSN
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN Sathish Silence
 
Leach-Protocol
Leach-ProtocolLeach-Protocol
Leach-Protocolzhendong
 
Universal Network Coding-Based Opportunistic Routing for Unicast
Universal Network Coding-Based Opportunistic Routing for UnicastUniversal Network Coding-Based Opportunistic Routing for Unicast
Universal Network Coding-Based Opportunistic Routing for Unicast1crore projects
 
Energy efficient routing_in_wireless_sensor_networks
Energy efficient routing_in_wireless_sensor_networksEnergy efficient routing_in_wireless_sensor_networks
Energy efficient routing_in_wireless_sensor_networksGr Patel
 
Energy efficient communication techniques for wireless micro sensor networks
Energy efficient communication techniques for wireless micro sensor networksEnergy efficient communication techniques for wireless micro sensor networks
Energy efficient communication techniques for wireless micro sensor networksPushpita Biswas
 
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNPROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
 
Analysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor networkAnalysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor networkeSAT Journals
 
Analysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor networkAnalysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor networkeSAT Publishing House
 
Universal network coding based opportunistic routing for unicast
Universal network coding based opportunistic routing for unicastUniversal network coding based opportunistic routing for unicast
Universal network coding based opportunistic routing for unicastPvrtechnologies Nellore
 
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
 
IRJET- Enhancing Data Transmission and Protection in Wireless Sensor Node
IRJET- Enhancing Data Transmission and Protection in Wireless Sensor NodeIRJET- Enhancing Data Transmission and Protection in Wireless Sensor Node
IRJET- Enhancing Data Transmission and Protection in Wireless Sensor NodeIRJET Journal
 
Performance evaluation of tcp sack1 in wimax network asymmetry
Performance evaluation of tcp sack1 in wimax network asymmetryPerformance evaluation of tcp sack1 in wimax network asymmetry
Performance evaluation of tcp sack1 in wimax network asymmetryeSAT Journals
 

What's hot (20)

Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...
 
Thesis-Final-slide
Thesis-Final-slideThesis-Final-slide
Thesis-Final-slide
 
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...
 
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and ScienceResearch Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science
 
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...
 
Bn36386389
Bn36386389Bn36386389
Bn36386389
 
Wireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEECWireless Sensor Networks LEACH & EDEEC
Wireless Sensor Networks LEACH & EDEEC
 
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN A General Self Organized Tree Based Energy Balance Routing Protocol for WSN
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN
 
Leach-Protocol
Leach-ProtocolLeach-Protocol
Leach-Protocol
 
Universal Network Coding-Based Opportunistic Routing for Unicast
Universal Network Coding-Based Opportunistic Routing for UnicastUniversal Network Coding-Based Opportunistic Routing for Unicast
Universal Network Coding-Based Opportunistic Routing for Unicast
 
Bn25384390
Bn25384390Bn25384390
Bn25384390
 
Energy efficient routing_in_wireless_sensor_networks
Energy efficient routing_in_wireless_sensor_networksEnergy efficient routing_in_wireless_sensor_networks
Energy efficient routing_in_wireless_sensor_networks
 
Energy efficient communication techniques for wireless micro sensor networks
Energy efficient communication techniques for wireless micro sensor networksEnergy efficient communication techniques for wireless micro sensor networks
Energy efficient communication techniques for wireless micro sensor networks
 
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNPROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN
 
Analysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor networkAnalysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor network
 
Analysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor networkAnalysis of different hierarchical routing protocols of wireless sensor network
Analysis of different hierarchical routing protocols of wireless sensor network
 
Universal network coding based opportunistic routing for unicast
Universal network coding based opportunistic routing for unicastUniversal network coding based opportunistic routing for unicast
Universal network coding based opportunistic routing for unicast
 
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...
 
IRJET- Enhancing Data Transmission and Protection in Wireless Sensor Node
IRJET- Enhancing Data Transmission and Protection in Wireless Sensor NodeIRJET- Enhancing Data Transmission and Protection in Wireless Sensor Node
IRJET- Enhancing Data Transmission and Protection in Wireless Sensor Node
 
Performance evaluation of tcp sack1 in wimax network asymmetry
Performance evaluation of tcp sack1 in wimax network asymmetryPerformance evaluation of tcp sack1 in wimax network asymmetry
Performance evaluation of tcp sack1 in wimax network asymmetry
 

Viewers also liked

Viewers also liked (20)

Brochure of Progressive Education Network
Brochure of Progressive Education NetworkBrochure of Progressive Education Network
Brochure of Progressive Education Network
 
C017431730
C017431730C017431730
C017431730
 
M0174491101
M0174491101M0174491101
M0174491101
 
J010137377
J010137377J010137377
J010137377
 
One shoulder bridesmaid dresses gudeer.com
One shoulder bridesmaid dresses   gudeer.comOne shoulder bridesmaid dresses   gudeer.com
One shoulder bridesmaid dresses gudeer.com
 
E010143037
E010143037E010143037
E010143037
 
E010612734
E010612734E010612734
E010612734
 
Jeshua february2016
Jeshua february2016Jeshua february2016
Jeshua february2016
 
A012230108
A012230108A012230108
A012230108
 
Technology Commercialization Center of UNN (English presentation)
Technology Commercialization Center of UNN (English presentation)Technology Commercialization Center of UNN (English presentation)
Technology Commercialization Center of UNN (English presentation)
 
Pengurusan Dokumen Penanaman Modal Asing (PMA)
Pengurusan Dokumen Penanaman Modal Asing (PMA)Pengurusan Dokumen Penanaman Modal Asing (PMA)
Pengurusan Dokumen Penanaman Modal Asing (PMA)
 
Best Approximation in Real Linear 2-Normed Spaces
Best Approximation in Real Linear 2-Normed SpacesBest Approximation in Real Linear 2-Normed Spaces
Best Approximation in Real Linear 2-Normed Spaces
 
F017313341
F017313341F017313341
F017313341
 
Digital Implementation of Fuzzy Logic Controller for Real Time Position Contr...
Digital Implementation of Fuzzy Logic Controller for Real Time Position Contr...Digital Implementation of Fuzzy Logic Controller for Real Time Position Contr...
Digital Implementation of Fuzzy Logic Controller for Real Time Position Contr...
 
R01741124127
R01741124127R01741124127
R01741124127
 
Atrai o meu coração-Filhos do Homem
Atrai o meu coração-Filhos do HomemAtrai o meu coração-Filhos do Homem
Atrai o meu coração-Filhos do Homem
 
A012270104
A012270104A012270104
A012270104
 
B010421824
B010421824B010421824
B010421824
 
E010323842
E010323842E010323842
E010323842
 
E1103013743
E1103013743E1103013743
E1103013743
 

Similar to E017422935

Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETS
Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETSEfficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETS
Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETSijircee
 
Analysis of multi hop relay algorithm for efficient broadcasting in manets
Analysis of multi hop relay algorithm for efficient broadcasting in manetsAnalysis of multi hop relay algorithm for efficient broadcasting in manets
Analysis of multi hop relay algorithm for efficient broadcasting in manetseSAT Publishing House
 
IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...
IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...
IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...IRJET Journal
 
“Optimizing the data transmission between multiple nodes during link failure ...
“Optimizing the data transmission between multiple nodes during link failure ...“Optimizing the data transmission between multiple nodes during link failure ...
“Optimizing the data transmission between multiple nodes during link failure ...eSAT Publishing House
 
Implementation and analysis of multiple criteria decision routing algorithm f...
Implementation and analysis of multiple criteria decision routing algorithm f...Implementation and analysis of multiple criteria decision routing algorithm f...
Implementation and analysis of multiple criteria decision routing algorithm f...prjpublications
 
Energy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networksEnergy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networkscsandit
 
Shortest path algorithm for data transmission in wireless ad hoc sensor networks
Shortest path algorithm for data transmission in wireless ad hoc sensor networksShortest path algorithm for data transmission in wireless ad hoc sensor networks
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
 
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...paperpublications3
 
Mobile Ad hoc networking
Mobile Ad hoc networkingMobile Ad hoc networking
Mobile Ad hoc networkingHizbul Bahar
 
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
 
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKF
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKFFAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKF
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKFprj_publication
 
Faulty node recovery and replacement algorithm for wireless sensor network
Faulty node recovery and replacement algorithm for wireless sensor networkFaulty node recovery and replacement algorithm for wireless sensor network
Faulty node recovery and replacement algorithm for wireless sensor networkprjpublications
 
Paper id 23201411
Paper id 23201411Paper id 23201411
Paper id 23201411IJRAT
 
Comparison of energy efficient data transmission approaches for flat wireless...
Comparison of energy efficient data transmission approaches for flat wireless...Comparison of energy efficient data transmission approaches for flat wireless...
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
 
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...ijassn
 

Similar to E017422935 (20)

i2ct_submission_105
i2ct_submission_105i2ct_submission_105
i2ct_submission_105
 
Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETS
Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETSEfficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETS
Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETS
 
Analysis of multi hop relay algorithm for efficient broadcasting in manets
Analysis of multi hop relay algorithm for efficient broadcasting in manetsAnalysis of multi hop relay algorithm for efficient broadcasting in manets
Analysis of multi hop relay algorithm for efficient broadcasting in manets
 
IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...
IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...
IRJET- Comparison of ATTEMPT and SIMPLE Protocols for Wireless Body Area Netw...
 
M017358794
M017358794M017358794
M017358794
 
“Optimizing the data transmission between multiple nodes during link failure ...
“Optimizing the data transmission between multiple nodes during link failure ...“Optimizing the data transmission between multiple nodes during link failure ...
“Optimizing the data transmission between multiple nodes during link failure ...
 
Implementation and analysis of multiple criteria decision routing algorithm f...
Implementation and analysis of multiple criteria decision routing algorithm f...Implementation and analysis of multiple criteria decision routing algorithm f...
Implementation and analysis of multiple criteria decision routing algorithm f...
 
Energy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networksEnergy efficient neighbour selection for flat wireless sensor networks
Energy efficient neighbour selection for flat wireless sensor networks
 
Ba25315321
Ba25315321Ba25315321
Ba25315321
 
550 537-546
550 537-546550 537-546
550 537-546
 
Shortest path algorithm for data transmission in wireless ad hoc sensor networks
Shortest path algorithm for data transmission in wireless ad hoc sensor networksShortest path algorithm for data transmission in wireless ad hoc sensor networks
Shortest path algorithm for data transmission in wireless ad hoc sensor networks
 
B010340611
B010340611B010340611
B010340611
 
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...
 
Mobile Ad hoc networking
Mobile Ad hoc networkingMobile Ad hoc networking
Mobile Ad hoc networking
 
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...
 
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKF
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKFFAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKF
FAULTY NODE RECOVERY AND REPLACEMENT ALGORITHM FOR WIRELESS SENSOR NETWORKF
 
Faulty node recovery and replacement algorithm for wireless sensor network
Faulty node recovery and replacement algorithm for wireless sensor networkFaulty node recovery and replacement algorithm for wireless sensor network
Faulty node recovery and replacement algorithm for wireless sensor network
 
Paper id 23201411
Paper id 23201411Paper id 23201411
Paper id 23201411
 
Comparison of energy efficient data transmission approaches for flat wireless...
Comparison of energy efficient data transmission approaches for flat wireless...Comparison of energy efficient data transmission approaches for flat wireless...
Comparison of energy efficient data transmission approaches for flat wireless...
 
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...
 

More from IOSR Journals (20)

A011140104
A011140104A011140104
A011140104
 
M0111397100
M0111397100M0111397100
M0111397100
 
L011138596
L011138596L011138596
L011138596
 
K011138084
K011138084K011138084
K011138084
 
J011137479
J011137479J011137479
J011137479
 
I011136673
I011136673I011136673
I011136673
 
G011134454
G011134454G011134454
G011134454
 
H011135565
H011135565H011135565
H011135565
 
F011134043
F011134043F011134043
F011134043
 
E011133639
E011133639E011133639
E011133639
 
D011132635
D011132635D011132635
D011132635
 
C011131925
C011131925C011131925
C011131925
 
B011130918
B011130918B011130918
B011130918
 
A011130108
A011130108A011130108
A011130108
 
I011125160
I011125160I011125160
I011125160
 
H011124050
H011124050H011124050
H011124050
 
G011123539
G011123539G011123539
G011123539
 
F011123134
F011123134F011123134
F011123134
 
E011122530
E011122530E011122530
E011122530
 
D011121524
D011121524D011121524
D011121524
 

Recently uploaded

Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreternaman860154
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesSinan KOZAK
 
My Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationMy Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationRidwan Fadjar
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationSlibray Presentation
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Enterprise Knowledge
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...shyamraj55
 
Scanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL CertsScanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL CertsRizwan Syed
 
New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024BookNet Canada
 
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationSafe Software
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking MenDelhi Call girls
 
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphSIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphNeo4j
 
Unlocking the Potential of the Cloud for IBM Power Systems
Unlocking the Potential of the Cloud for IBM Power SystemsUnlocking the Potential of the Cloud for IBM Power Systems
Unlocking the Potential of the Cloud for IBM Power SystemsPrecisely
 
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Alan Dix
 
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks..."LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...Fwdays
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupFlorian Wilhelm
 
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024Scott Keck-Warren
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Scott Keck-Warren
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
Key Features Of Token Development (1).pptx
Key  Features Of Token  Development (1).pptxKey  Features Of Token  Development (1).pptx
Key Features Of Token Development (1).pptxLBM Solutions
 
Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024BookNet Canada
 

Recently uploaded (20)

Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreter
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
 
My Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 PresentationMy Hashitalk Indonesia April 2024 Presentation
My Hashitalk Indonesia April 2024 Presentation
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck Presentation
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
 
Scanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL CertsScanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL Certs
 
New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
 
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
 
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphSIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
 
Unlocking the Potential of the Cloud for IBM Power Systems
Unlocking the Potential of the Cloud for IBM Power SystemsUnlocking the Potential of the Cloud for IBM Power Systems
Unlocking the Potential of the Cloud for IBM Power Systems
 
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
 
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks..."LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project Setup
 
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
Key Features Of Token Development (1).pptx
Key  Features Of Token  Development (1).pptxKey  Features Of Token  Development (1).pptx
Key Features Of Token Development (1).pptx
 
Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC BiblioShare - Tech Forum 2024
 

E017422935

  • 1. IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 4, Ver. II (July – Aug. 2015), PP 29-35 www.iosrjournals.org DOI: 10.9790/0661-17422935 www.iosrjournals.org 29 | Page Performance Analysis of Three Hop Reliability Model for Wireless Sensor Networks in Nuclear Power Plants S.Lavanya1 , Dr. S. Prakasam2 1 (Research Scholar, Dept of CSA, SCSVMV University, Kancheepuram, India 2 (Asst.Professor and Head, Dept. of CSA, SCSVMV University, Kancheepuram, India) Abstract: Wireless sensor networks(WSN) are a good choice for Nuclear Power Plants because of low cost and flexibility. Reliability is a crucial factor for WSN in Nuclear Power Plants since all the data collected are time critical information that should be delivered on time otherwise a huge loss could incur in terms of money, resource or even human lives. So it is a challenging task to design a routing protocol for sensor used in such harsh environments. In Three hop reliability model (3H-ACK), three copies of the same data are maintained without imposing extra cost on the network. This model works best using zone routing protocol .Compared to the models used earlier, this 3H-ACK performs well in terms of delivery ratio, throughput and avoids packet loss as far as possible. Keywords: Acknowledgment, Nuclear Power Plants, Reliability, Sensor Networks, I. Introduction Wireless Sensor Networks (WSN) are used nowadays in Nuclear Power Plants (NPP). Sensors can be used to monitor the current state of the plant including emission of radioactive particles to air and water. Other parameters include neutron flux, monitoring pressure, temperature and water levels in circuits. If these levels exceed a particular threshold levels alarm is raised and information is passed on to the alerting unit whenever necessary. Daily more than 7, 00,000 data are to be collected and send to the base station. Manual maintenance of such data is a tedious task. The challenges posed by WSN in NPP are EMI/RFI, compatibility of WSN in harsh nuclear environment, energy concerns, security and reliability. From authors[1-4] it has been proven that WSN does not pose a threat to EMI/RFI. Moreover suitable test from [1] shows that WSN can withstand harsh conditions in nuclear environments. Fig. 1 Technical Components used in Nuclear Power Stations There are lots of factors that are to be considered when deploying a WSN for a Nuclear Power Plant [4]. First it is necessary to understand the measurement requirement. The purpose for which sensors are used should be known very clearly. Secondly appropriate wireless protocol such as IEEE 802.11 or IEEE 802.15 should be chosen. The chosen protocol must co-exist with other protocols. Finally, deployment of sensor nodes is yet another important issue that is to be considered properly. In this paper, Section II explains the reliability issues in Sensor Networks. Hop- by-Hop and 2H-ACK models are described. Section III explains 3H-ACK model. The architecture and algorithms are used explained. Section IV explains the simulation parameters and section V gives the conclusion. II. Reliability In Sensor Networks Reliability is a key aspect in wireless sensor networks. Reliability is the ratio of number of bits in error to the total number of bits transmitted. Bit error rate should be minimal in such applications. It has been shown that Transport Control Protocol does not work very well with sensors since the three -way handshake procedure causes overhead. TCP relies on end – end acknowledgment whereas wireless sensor networks use multi-hop Alarm Systems Central Database (Sink) Communication Server Nuclear Power Plant Client systems
  • 2. Performance Analysis of Three Hop Reliability Model for Wireless… DOI: 10.9790/0661-17422935 www.iosrjournals.org 30 | Page Node ID HopID Node ID HopID Buffer Size Battery level approach that relies on hop-hop reliability that lessens congestion and is more efficient in terms of energy savings [5]. Reliability also depends on other parameters like congestion, energy, throughput and delay. TCP provides good congestion control mechanism. On the other hand, UDP does not provide flow or error control. Packet size is another important factor that affects reliability as larger packets are subjected to loss whereas short packets suffer from overhead. So in many situations dynamic packet size is the best one. [6-8]. Packet size can be chosen depending on the link quality. If the chosen route is optimal then larger packet size can be chosen which will be free from packet loss. If the route is not optimal, then smaller packet size can be chosen so as to avoid packet loss. In case of lost packets, retransmission is the best method but it can cause delay. 2.1 Dynamic addressing scheme for wireless sensor networks Author [6] states very clearly that in Hop – by – Hop dynamic addressing based routing protocol, unique address namely HopID is assigned to every node based on its hop count from the sink. Thus the node that is closer to the sink is assigned smaller HopID and is used frequently to forward the data. In order to know the status of congestion and energy level, Inquiry Request and Inquiry response messages are used. The format is as follows: Fig. 2 Format of Inquiry Request Fig. 3 Format of Inquiry Reply 2.2 Single Hop Reliability Model Hop-by-Hop ACK(HbH-ACK) is most suitable only for stable environments. In this method, only two nodes are involved namely the source and the destination. The source node sends a data packet to the destination. On the receipt of data, the destination sends out an acknowledgment (ACK) to the source. Once the source receives the ACK, it discards the data packet. Now the current node holding the data packet is responsible for sending the data to the destination. It has to find the next suitable hop that will deliver the data along the path to the destination. Sometimes due to dynamic node movement, the current node may not find the next suitable hop or may die due to energy loss. In such case the actual data is lost since no other node maintains these backup copies. From the simulation conducted by the author [7 ] it is clear that there are no duplicate packets since only one node maintains the data copy, but the rate of packet loss was very high. 2.3 Two Hop Reliability Model From authors [8-10], Two Hop Acknowledgment (2H-ACK) provides a guaranteed delivery scheme. In this approach, two nodes maintain the copy of the same packet. The procedure is as follows: The source node that wants to send the data packet will send an Inquiry request message to all its neighbors using gossiping method. The neighbors will compare their hop id with the sender node‟s hop id and the node with the smallest hop id will respond with the Inquiry response method. Then the packet is transferred to the node with the smallest HopID. After receiving the data packet the receiving node does not immediately send an ACK to the source node. It will try to find the next hop node on the way to the destination and the same procedure is repeated. After the third node receives the data packet, it sends an ACK to the intermediate node. The intermediate node sends the ACK to the source node thereby the source node will delete the data packet as two copies of the data packet now exist. The same procedure is repeated till the data reaches the destination. The use of Inquiry request and Inquiry response packet solves the problem of congestion and energy usage. The nodes that are free from congestion and that have sufficient energy only replies with the Inquiry reply packet. From the simulation results conducted by the author [8], it is clear that duplicate data packets and packet losses are less in 2H-ACK. III. Three Hop Reliability Model From authors [11-12], it is clear that 3H-ACK is the most suitable for most time critical applications used nowadays in industries. 2H-ACK still suffers from packet loss because the intermediate node can die before it can send an ACK to the source node. The source node does not know whether the packet is on the way to its destination. It cannot delete the original data packet and it leads to buffer overflow. If after a stipulated amount of time, the source node once again finds a neighbor to deliver the same data packet, then replication occurs as the data packet has reached another node, but the source node is unaware of this happening since ACK
  • 3. Performance Analysis of Three Hop Reliability Model for Wireless… DOI: 10.9790/0661-17422935 www.iosrjournals.org 31 | Page from the intermediate node was lost. In this model three nodes will keep the copy of the same data packet. Here every node carries a step field along with the data. The step field will be incremented at every intermediate node until the value of step becomes three. This 3H-ACK is best implemented with zone routing protocol. Fig. 4 Three-Hop Reliability Model In this model, node A4 wants to send the data packet to the destination. It sends a Hello Packet to all the nodes within the zone. A3 is the next hop with smallest Id. So it responds with the Hello reply. The data packet is sent to node A3 and the step value is incremented from 0 to 1. Now the same procedure is repeated and the data packet is sent to node A2. The value of step now becomes 2. When the data packet reaches A1 then the value of step becomes 3. Now the copy of data packet is available in node A1, A2 and A3. When the value of step becomes 3, the original copy of data packet is removed from A4. Fig. 5 Architecture of 3H-ACK
  • 4. Performance Analysis of Three Hop Reliability Model for Wireless… DOI: 10.9790/0661-17422935 www.iosrjournals.org 32 | Page Node ID ClusterID Cluster IDNodeID Energy Level Priority Buffer Size Fig 6. Format of Hello Request Fig 7. Format of Hello Response Fig 8. Three Hop Final Message format Algorithm for 3 H-ACK Model: 1. Initialize the value of step = 0 2. Define the Zone limit 3. Send Hello Packet to find the nearest node 4. If Hello Packet is received then a. Send the data packet to the nearest node b. Save a copy of the data packet in the buffer 5. If the value of step <3 then a) Increment the value of step by 1else b) Set the value of step by 0 and send the final message to the third hop 6. If the final message reaches is received at the third node then a) Delete the copy of the saved message else b) Repeat from step 4 to 6 7. Stop By using zone routing protocol, the nodes inside the zone alone participates in packet forwarding. The rest of the nodes may remain to be inactive thereby saving energy. Though three copies of the data packet might exist leading to redundancy a times, loss of packet is avoided which in turn reduces retransmission which is very costly compared to this reduced redundancy. Moreover Inquiry reply packet guarantees no congestion and the energy level of node. Therefore problem of congestion and energy are alleviated. Every sensor node can hold 50 packets. The packet size specified by IEEE 802.11 can be upto 1000 byte long. But from author [7], it can be proven that the optimal packet size can be from 128 to 256 bytes. From the simulation results, it is very clear that 3H-ACK guarantees 90% of delivery ratios at various time intervals. The probability of duplication in 3H- ACK is very low compared to the packet loss. IV. Simulation Results The proposed algorithm is implemented using NS-2 simulator. Simulation is performed using Cygwin. Cygwin is free software that provides a Unix-like environment. NAM Editor is used to perform simulation operation. The scripting language used is TCL. Fig 6. Creation of Nodes Source Node ID First Forwarder ID N Second Forwarded ID Step value
  • 5. Performance Analysis of Three Hop Reliability Model for Wireless… DOI: 10.9790/0661-17422935 www.iosrjournals.org 33 | Page The output produced by NAM simulator is analyzed. The metrics used to measure the performance of the networks are Packet delivery ratio, Packet drop rate and Throughput. Fig 7. Source and Destination Nodes are selected to deliver messages Initially 15 nodes are created using NAM editor (Fig 6). The source and destination nodes are selected. The node with the shortest HOPID is selected and the data is delivered to the node. The same procedure is repeated until all three nodes have received the data. Then the data is delivered to the destination and after receiving an ACK, the data is removed from source node. Fig 8. Data is sent to different nodes with smallest HOPID Fig 9. Implementing 3 Hop Reliability Model
  • 6. Performance Analysis of Three Hop Reliability Model for Wireless… DOI: 10.9790/0661-17422935 www.iosrjournals.org 34 | Page Packet Delivery Ratio: Packet delivery ratio is the ratio of number of packets received at destination node to that of number of packets sent by source node. From the simulation results of author [ 9 ], It is shown that Packet delivery ratio and loss in packet for 2H-ACK is better than HbH-ACK. Here 3H-ACK shows the best delivery ratio of 90% thereby avoiding loss in packet. Fig 10. Packet Delivery Ratio of 3H-ACK Model Fig 11. Packet Loss Ratio in 3H-ACK Throughput: Network throughput is the amount of data that is received. Though there is a chance that multiple copies of the same data packet can be received at the sink nodes, the probability is very low compared to packet loss. Fig 12. Throughput of 3H-ACK Model
  • 7. Performance Analysis of Three Hop Reliability Model for Wireless… DOI: 10.9790/0661-17422935 www.iosrjournals.org 35 | Page V. Conclusion Sensors are resource constrained and the harsh environments in which they operate make them die very soon because energy gets replenished very easily. Congestion and weak link are also the main cause of loss in packets. From the studies it is clear that compared to Hop-by-Hop and 2H-ACK, 3H-ACK yields better results. It may be sometimes a time-consuming task or may be considered costly since it involves three copies of the data packets to be transferred between the source and destination, but reliability is sometimes given top priority when compared to cost involved in sending three copies of the packets. Energy consumption through various energy harvesting techniques could be considered as a future work. References [1]. L. Li*a, Q. Wangb, A. Barib, C. Dengc, D. Chenc, J. Jiangb, Q. Alexandera, and B. Sura , Field Test of Wireless Sensor Network in the Nuclear Environment, Atomic Energy of Canada Limited, Chalk River, ON K0J 1J0, Canada. [2]. H.M. Hashemian, 2011, Nuclear Power Plant Instrumentation and Control -In Nuclear Power – Control, Reliability and Human Factors, InTech, Chapter 3, pp. 49–66, Available from URL: 1051/InTech uclear_power_plant_instrumentation_and_control.pdf. [3]. A Kadri, R.K. Rao and J. Jiang, 2009, “Low-Power Chirp Spread SpectrumSignals for Wireless Communication within Nuclear Power Plants”, Nuclear Technology, 166(2), pp. 156–169. [4]. Muhammad Adeel Mahmood and Winston Seah, “Reliability in Wireless Sensor Networks: Survey and Challenges Ahead” Published in Elsevier February 8, 2012. [5]. Joseph V. Cordaro, Davis Shull, Mark Farrar, and George Reeve, Ultra Secure High Reliability Wireless Radiation Monitoring System, IEEE 2012. [6]. M Ayaz, M., Abdullah, A Hop-by-Hop Dynamic Addressing Based (H2-DAB) Routing Protocol for Underwater Wireless Sensor Networks. International Conference on Information and Multimedia Technology, 2009. ICIMT „09. vol., no., pp. 436–441, 16–18. [7]. P.R. Pereira, A.G., End-To-End Reliability in Wireless Sensor Networks, Survey and Research Challenges, In Euro FGI Workshop on IP Qos and Traffic Control 2007. [8]. Ayaz, M., Abdullah, A., Faye, I, . Hop-by-hop reliable data deliveries for underwater wireless sensor networks. In: Broadband, Wireless Computing, Communication and Applications (BWCCA), 2010 International Conference. [9]. S. Basagni, C. Petrioli, R. Petroccia, M. Stojanovic, Choosing the Packet Size in Multi-hop Underwater Networks , Northern University, Boston, MA, USA (2009). [10]. Ayaz, M, et al, Reliable data deliveries using packet optimization in multi-hop sensor networks , Journal of King Saud Univrsity – Computer and Information Sciences, 2012 . Pg 41-48. [11]. Praful P. Maktedar , Vivek S. Deshpande , J. B. Helonde, V.M. Wadha, Performance Analysis of Reliability in Wireless Sensor Network, International Journal of Innovative Technology and Exploring Engineering (IJITEE ), ISSN: 2278 - 3075, Volume 2 , Issue 4 March 2013. [12]. Ali T, Low Tang Jung , Faye, I., Three hop reliability model for Underwater Wireless Sensor Network, International Conference on Computer and Information Sciences (ICCOINS), 3-5 June 2014 , Kuala lampur.