REAL TIME DISTRIBUTED

PROCESSING IN WIRELESS SENSOR

NETWORKS
INTRODUCTION

 Distributed Processing
 Wireless Sensor Networks
 Real Time Processing
REAL TIME PROCESSING

 General perception
 “A system that reacts in microseconds or nanoseconds, is real
time, and one taking minutes isn’t ”
 A Real time system is irrespective of duration
REAL TIME PROCESSING

 2 Types of Real Time Processing

 Time Triggered Processing
 Event Triggered Processing
ACHIEVING REAL TIME PROCESSING

 WEB (JavaScript)
 iOS
 ANDROID
REAL TIME PROCESSING

 At the very basic, there happens a dedicated long term

connection between client (in browser) and server.
 Any update on client is transmitted to server without initiating a
new connection as a connection already exists.
 Server pushes the update to other connected (and interested)
clients as the connection already exists.
 PROPOSED ALGORITHM

 Three Entities:-
 Node - Tasks entitled to a specific agent for completion
 Dispatcher - Assigns agents to nodes
 Agent - Performs tasks assigned by dispatcher
 Nodes equipped with sensors, continuously check for events in Realtime.
PROPOSED ALGORITHM

{ {
"tid": 1, “aid”: 1,
“desc”:”agent1”,
"desc": "Task 1",
“lng”:72.122222,
"lng": 72.7842683, “lat”:21.646489,
"lat": 21.1663988, “firebase_token”:”AizaIgyhK77…gg”
}
"status": "r“
}
NODE
AGENT
AGENT

 End Devices that take up job.

DISPATCHER
ANDROID

Green nodes have These nodes are of low

second priority. priority, and can wait for
an agent to arrive after
the Red and Blue nodes

Red nodes are the

most important,
and have to be
serviced first.
NEED FOR MST

 Agent has to find a way to visit all the allocated nodes for
completion of the task at each node optimally .
 Priority of Node for calculating MST is based on distance of the
node from other nodes , urgentness of the Node to complete its
task and some heuristics.
 Dispatcher performs MST considering priority of node as
weight(cost) of node in a graph and creates a way (tree) for
Agent which connects all the nodes of a particular
agent optimally .
 IMPLEMENTATION OF MST
 Prim’s Algorithm is used for constructing MST of nodes of each Agent
optimally.
 Prim’s algorithm is preferred rather than other algorithms because of its
efficiency to find MST in Dense graphs(i.e No of edges in graph =O(V^2)) .
 Priority Queue implemented through binary heaps is used in Prim’s
algorithm because it is efficient for real time data and minimal worst case
Time complexity.
FUTURE

 Algorithm for Scheduling Tasks to Agents

 Integrate Hardware and sensors.
THANK YOU