Research Project / Applications SeminarSYST 798

STATUS REPORT 20 March 2008

Team: Brian BoyntonTom HareEric Ho Matt MaierAli Raza

Key Sponsor: Dr. Kuo-Chu Chang

Java: BSF Modeling Effort

• Significant updates since last report– Model now features Tier 1, 2, and 3 sensors– Movement of Tier 2 Sensors patterned in Grid overlays– Additional parameters and display options added– Cordon, Latency, Hop Count and Coverage are computed and displayed

• Analyses Planned for the future– Comparison of Algorithms (incorporation of more algorithms)– Latency, Hop Count, Coverage, Reliability, and Use of Power

• Parameters that affect analyses– Sensor Range– Communications Range– Sense & Communications Time/Power Used– Reliability/ False Positive Rates

Java: The Graphical User Interface (GUI)

Graphical Sensor Display with Chicago Map

Six Tabs of Input and Simulation

Parameters

Text and Numerical Results Output

GUI represents what a Biological Response

DHS Operations Center Might Use

Java: The GUI (cont.)

Shows Sensor Coverage and Communications

Paths

The DHS Ops Center is at the Chicago District 001

Fire Dept.

Java: The GUI (cont.)

Here, the ad-hoc communications Ranges have been increased, leading to increased network

connectivity “mesh”

Also, note the Tier I Point to Point communications links.

This models “small world network” communication.

Several communications algorithms are

available.

Java: GUI (cont.)

Tier II Sensors are mobile ad-hoc and

conform to city street and road grids.

Each type of sensor has it’s own parameters. Tier I are

fixed location backbone nodes, and Tier III are

stationary Ad-hoc nodes.

Java: How BSF Communications Works

• Nodes communicate to “neighbors” within their comms footprint• Communications are non-connection oriented (unlike TCP for

instance) multicast “bursts”• Local data aggregation is performed at each node• Nodes maintain a data buffer in case they become disconnected

from network

Sense Time Window Communications Time Window

Packet Burst

DestNode ID

SourceNode ID Detect LongitudeDetect Latitude

A Single Packet:

ChecksumLength

64 bits 64 bits 64 bits Lets say we have two sensors, A and B, in range of each other (i.e. neighbors). Sensor A senses a biological threat. Sensor B does not, but has 5 packets of data from other sensors already in it’s buffer.

Time required to transmit exactly one packet (commsTxTime)

Smallest time slot in window (minTimeStep)

… (repeats)time

Powerused

A B

Packet Receipt Over Time of 100 Biological Threat Instances in Chicago

0

10

20

30

40

50

60

70

80

90

100

0 200 400 600 800 1000 1200 1400

Latency (seconds)

Dat

a Pa

cket

Rec

eipt

Hop Count % of Total Packets Received

Java: Sample Analysis

• This depicts the fusion results of 100 detected Smallpox cases randomly distributed throughout Chicago District 001

Latency vs. Hop Count is roughly linear, 20

seconds communications window per hop

Packet receipt is nonlinear, due

to buffering

Java: Sample Analysis (cont.)

• Initial Conditions • Overall Results

Java: Realism

• Parameters were chosen based on information provided by Subject Matter Experts (SME) in Biological Sensors today

CPN Model

• CPN Model is utilized to analyze time in the simulation of Sensor Grid Communications

Backup Slides

Java: A Parametric Model

• Various Sensor and Communication Parameters Available for Analysis