RESPONSE TIME OPTIMIZATION IN

WIRELESS SENSOR NETWORK FOR THE

ON-BOARD RAPID TRANSIT APPLICATIONS

Prepared By Supervisor

K.M.KARTHICK RAGHUNATH, Prof. Dr. N. RENGARAJAN,

REG.NO: 11250631024 PRINCIPAL,
NANDHA ENGINEERING COLLEGE, ERODE.

29/01/2018
 DOCTORAL COMMITTEE MEMBERS

Prof. Dr. M. Chandrasekaran Prof. Dr. M. Usha

Principal, Principal,
Govt. College of Engineering, Sona College of Technology,
Salem – 636 011 Salem – 636 005

29/01/2018
Agenda
Introduction
Objective
Literature Survey
Problem Identification
Proposed Research Work
Performance Evaluation
Conclusion & Future Enhancements
Reference

29/01/2018
Introduction
Onboard Rapid Transit Applications
- Features
- Emergency Broadcasting Response Time for critical events

Wireless Sensor Network (WSN)

- Characteristics
- Potential Faults

Fuzzy Logic Computations

- Low Cost Computation

29/01/2018
Objectives
 To enable collision-free traffic during data transmission across the
network and to utilize the bandwidth efficiently.
 To grant the optimization of broadcasting response time (within
0.02 seconds) with minimal energy consumption.
 To prevent master node fall against potential fault that mainly
happens due to battery depletion which has the potentiality to halt
the functionality of the entire network.

 To employ a regulated internal functional structure with least

computational cost using fuzzy logic concepts.
 To examine and assess the performance of proposed mechanism
concerning response time and energy consumption.

29/01/2018
 Literature Survey
Author Method / Mechanism /
Parameters Contributions Limitations
Name Technique
1. Low latency for event
1. Periodic, Event-Driven and notification,
Fails to reduce latency and
Query-Based Protocol 1. ConfigTable, 2. dynamic broken path
Boukerche A fast delivery of data
(PEQ) 2. RoutingTable reconfiguration,
et al (2004) especially for network with
2. subscribe or publish 3. SubscriptionTable 3. high reliability in the delivery of
high node density.
paradigm the events with low energy
dissipation.
1. a dynamic velocity Produces the degraded
assignment policy, Minimizes the energy performance on handling
Chipara O et Real-time Power-Aware
2. a delay estimator, consumed for transmitting packets the multiple numbers of
al (2006) Routing
3. a forwarding policy, under their deadline constraints. holes and abrupt
4. a neighborhood manager congestions.
1. Transmission lapse of the
1. Increase the ratio of successful
1. DynaMical jumping Real- current path,
transmission,
Wu G et al time Fault-tolerant (DMRF) 2. Jumping probability, Fails to manage energy
2. Lower the transmission delay,
(2010) routing protocol congestion range, conservation
3. Reduce the number of the
2. Jumping mode Technique 3. Deadline of the received
control packets
message fragments.
The mechanism tradeoff
1. Enhances the reliability of the
1. Fault-Tolerant and Energy- data transmission delay, as
network
Hezaveh M Aware Mechanism (FTEAM) Predetermined energy based the Neighbor Cluster
2. Provide optimal energy
et al (2015) 2. cluster-based routing threshold Head (NCH) takes time to
management strategy
algorithm activate the sleep node to
.
choose new CH
1. The position of the hub
1. Reliable and Energy
2. Amount of bytes to Optimization process of response Fails to concern over the
Torres C et Optimized WSN design
transmit per packet time to broadcast emergency possible failure status of
al (2011) (REO-WSN)
3. Number of slots between signals within a limited time span hub node
2. Data transmission algorithm
hub 29/01/2018
Problem Identification

REO-WSN
 Synchronized Flooding using DD-TDMA: Routing

 Single Hub : Network Controller

 Absence of preventive mechanism against potential faults

 Undesired energy consumption for slot adjustments

29/01/2018
Proposed Research Work
Integrated Fuzzy-logic based Synchronized Data Transmission (IFSDT)
algorithm

It facilitates

 Optimize emergency broadcasting response time

 Least energy consumption mechanism
 Identification of crisp routing neighbor node with low computational
cost
 Preventive mechanism against potential fault (battery depletion)

Figure 1. Low-Floor Light Rail Vehicle compartment interior blueprint

29/01/2018
Phases Involved in IFSDT

Master Node (MN)

Phase I
Selection Phase

Slot Assignment
IFSDT Design Phase II
Phase

Data Transmission
Phase Phase III

Synchronization-Communication Synchronization-Communication
phase of MN phase of Non-MNs

Figure 2. Three phases of IFSDT

29/01/2018
Data Flow Diagram
Constitution of
Network Model

Deployment of Sensor
Nodes in the Coaches
of RTS

Segmentation of
Network into four zone

Master Node (MN)

Selection

Assigning Rank IDs to Phase I

non-Master nodes

Deputy Node (DN) Phase II

Selection

Fuzzy Logic Allocation of Fuzzy Logic

Operation Transmission Time Operation Phase III
Slots to all Non-MN
nodes in kth zone

Synchronization and Neighbor node

Self Evaluation identification and
Communication between
on MN relay of data packets
MN and non-MN at ith slot
Sustainability (if required)
in kth zone
Figure 3. Data Flow diagram of IFSDT 29/01/2018
INITIAL MN SELECTION PHASE
Input Parameters: Number of nodes deployed & Zonal area (∆AMB or ∆DMC or ∆AMD or ∆BMC)
Output: MN Selection and Ranking ID of Non-MN
FOR kth Zone Do
Let X be a set of Sr Sensor nodes, X = {S1, S2, S3,…., Sr}
Probability of randomized selection of MN from X
| MN |
P(MN)  , where MN  X
| X |
FOR Sr-1 Do
Current MN broadcast its selection to Sr-1 in the zone
END FOR
Sr-1 sends Sigbea to MN.
UPON receiving Sigbea from Sr-1;
FOR Sr-1 Do
Sr-1 = {R1, R2,…, Rr} on FRFA basis
END FOR
END FOR

Acronyms: MN  Master Node ; Sigbea beacon signal ; FRFA  First Receive First Assign 29/01/2018
SLOT ASSIGNMENT PHASE
Input: Parameters: Number of nodes deployed
Output: Assigned Sloti of each node
Initialization: i = 1,2,3,…..,n
r = 1,2,3,…..,n

FOR kth Zone Do

MN chooses R1 as its DN
IF (i%2 = = 0)
Sloti MN, DN
ELSE
Sloti  Rr
r++;
END IF-ELSE
i++;
WHILE (r ≤ n)
END FOR

Figure 4. Slot Assignment Configuration Format

Acronyms: MN  Master Node ; DN  Deputy Node 29/01/2018

Synchronization-Communication phase of MN
FOR Fth Frame Do
WHILE (always)
SELECT CASE (current slot)
CASE “at slot 0”
MN identifies participating NN
BREAK
CASE “MN transmission slot”
MN runs FLA-II
IF (Sustainable)
FOR Rr’s Do
MN broadcast packetssync + ES
IF (MN has excess packets)
runs FLA-I
MN forwards packetsinfo to NN
END IF
END FOR
ELSE IF (unsustainable)
MN sends SigCtrl_HO to DN
MN = current DN
∀ Rr’s DO
New MN broadcast its replacement
New MN rearranges slot order
END
New DN = Next_Ranked Rr
Last_ranked Rr = MNprev
MN broadcast packetssync + ES
END ELSE-IF
Acronyms:
BREAK
MN  Master Node
CASE “sleep slot”
NN  Neighbor Node
MN and DN sleeps
FLA  Fuzzy Logic Algorithm
BREAK
END CASE
SigCtrl_info Control Handoff signal
Current slot = next slot ES  Emergency Signal
END WHILE packetsinfo  Information packets
END FOR packetssync Synchronization packets
MNprev  Previous MN 29/01/2018
Synchronization-Communication phase of non-MN
FOR Fth Frame Do
WHILE (always)
SELECT CASE (current slot)
CASE “at slot 0”
Rr identifies deployed NN
BREAK
CASE “Rr transmission slot”
Rr sends a packetssync + packetsinfo
IF (Rr has excess packets)
runs FLA-I
Rr forward packetsinfo to NN
END IF
BREAK
CASE “NN of Rr slot”
Rr listens for packets from its NN
BREAK
CASE “sleep slot”
Rr sleeps
BREAK
END CASE Acronyms:
Current slot = next slot MN  Master Node
END WHILE NN  Neighbor Node
FLA  Fuzzy Logic Algorithm
END FOR packetsinfo  Information packets
packetssync Synchronization packets

29/01/2018
Fuzzy Logic Computation: Identification Optimal NN
Fuzzification Membership Functions of Intra_Distance (Input 2)
Membership Functions of RE (Input 1)

Membership Functions to identify optimal NN (Output)

29/01/2018
Mamdani Fuzzy Inference System
Step 1: Evaluate the antecedent for each rule.
Step 2: Obtain each rule's conclusion.
Step 3: Aggregate conclusions.
Step 4: Defuzzification.

Rule Base
Rule No. RE Intra-distance Identification
Rule_1 α α Least_Preferred
Rule_2 α β Preferred
Rule_3 α γ Least_Preferred
Rule_4 β α Most_Preferred
Rule_5 β β Preferred
Rule_6 β γ Preferred
Rule_7 γ α Most_Preferred
Rule_8 γ β Most_preferred
Rule_9 γ γ Preferred

Defuzzification

00/12/2017
Self Evaluation of MN Sustainability
Fuzzification
Membership Functions for RE (joules at time t/5*100)

Rule Base
Rule No. RE LE As MN
Rule_1 Ψ Ψ Sustainable
Rule_2 Ω Ψ Unsustainable
Rule_3 Ψ Ω Unsustainable
Membership Functions for LE Ω Ω
Rule_4 Unsustainable

29/01/2018
Formulations of RE & LE
Excluding the energy consumption of MN from its initial energy gives its RE at
required time t and thus equation (1) implies the formulation to obtain RE.

From initial life expectancy period of MN eliminating the total time duration
spent for active communication against total time duration of its participated slots
D gives the remaining life expectancy which is depicted in (4). Here, D is
obtained by multiplying total number of assigned slots to MN with time duration
allotted per slot.

29/01/2018
Performance Evaluation

Figure 5. Response Time at each kth zone

Let at be the arrival time of Critical Signal, from Rr’s to MN and bt be the initial
time to transmit EBS to Rr’s. Thus, the waiting time, wt to respond to corresponding
Rr’s is

By summing up the waiting time obtained in (23) along with TDES (Time Duration
for broadcasting Emergency Signal to Rr’s), response time can be evaluated, which
is equated in (6)

29/01/2018
Performance Evaluation
Broadcasting Transmission Point-to-Point Transmission

REO-WSN

IFSDT Zone4

IFSDT Zone3

IFSDT Zone2

IFSDT Zone1

0 0.05 0.1 0.15 0.2 0.25

Energy Consumption (in joule)
Figure 6. Energy Consumption comparison between REO-WSN and IFSDT

Figure 7. Response Time comparison between REO-WSN and IFSDT

29/01/2018
Conclusion & Future Enhancements

 From the simulative resultant, IFSDT has been proved to be one of the
high prioritized novel methods especially for onboard applications of
RTS, to which it intends to provide uninterrupted monitoring and
dissipation of critical data in a limited time span (less than 0.02
seconds).

 The algorithm also expands the network reliability and fault-tolerant

capability by employing a preventive mechanism for MN against the
potential fault.

 The algorithm is rightfully referred as energy-aware since all the four

independent zones of the network consume less than 0.01 joules for
broadcasting transmission which is lower than the existing system.

29/01/2018
Reference
1. Torres, C & Glosekotter, P 2011, ‘Reliable and energy optimized WSN design for a train
application’, Journals of Systems Architecture, vol. 57, no. 10 pp. 896-904.

2. Hezaveh, M, Shirmohammdi, Z, Rohbani, N & Miremadi, SG 2015, ‘A fault-tolerant and energy-

aware mechanism for cluster-based routing algorithm of WSNs’, IFIP/IEEE International
Symposium on Integrated Network Management, pp. 659-664.

3. S70 Low-Floor Light Rail Vehicle Datasheet 2016, Siemens Industry, Inc. New York. Available
from: <https://www.siemens.com/content/dam/webassetpool/mam/tag-siemens-
com/smdb/mobility/rail/rolling-stock/trams-and-light-rail-
vehicles/s70/documents/brochures/portland-s70-data-sheet.pdf>.

4. Wang, Y & Henning, I 2007, ‘A deterministic distributed TDMA scheduling algorithm for Wireless
Sensor Networks’, IEEE International Conference on Wireless Communications, Networking and
Mobile Computing, pp. 2759-2762.

5. Chipara, O, He, Z, Xing, G, Chen, Q, Wang, X, Lu, C, Stankovic, J & Abdelzaher, T 2006, ‘Real-
time Power-Aware Routing in Sensor Networks’, IEEE International Workshop on Quality of
Service, pp. 83 -92.

6. Wu, G, Lin, C, Xia, F, Yao, L, Zhang, H & Liu, B 2010, ‘Dynamical Jumping Real-Time Fault-
Tolerant Routing Protocol for Wireless Sensor Networks’, Sensors Journal, vol. 10, no.3, pp. 2416-
2437.

7. Boukerche, A, Pazzi, RWN & Araujo, RB 2004, ‘A Fast and Reliable Protocol for Wireless Sensor
Networks in Critical Conditions Monitoring Applications’, Proceedings of the 7th ACM
international symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems,
pp. 157-164.
29/01/2018
List of Publication
1. Karthick Raghunath, K. M & Rengarajan, N 2017, “Response Time
Optimization with Enhanced Fault-Tolerant Wireless Sensor Network
design for On-Board Rapid Transit Applications”, Cluster Computing:
The Journal of Networks, Software Tools and Applications (Springer),
DOI: 10.1007/s10586-017-1473-4. (Annexure-I) Impact Factor:
2.040 (SCOPUS & SCI INDEXED)

2. Karthick Raghunath, K.,M & Rengarajan, N, 2016, “A Novel Fuzzy

Integrated Fault-Tolerant and Energy-Efficient Routing Protocol for
Wireless Sensor Network” in Asian Journal of Information Technology
(AJIT), Volume-15, Number-8, Pages: 1289-1296. (SCOPUS
INDEXED)

3. Karthick Raghunath, K.,M & Rengarajan, N, 2013, “Investigation of

Faults, Errors and Failures in Wireless Sensor Network: A Systematical
Survey” in International Journal of Advanced Computer Research
(IJACR), Volume-3, Number-3, Issue-12, Pages: 151-163.
Citation@2017: 03

29/01/2018
Thank you

29/01/2018