Research Project / Applications Seminar SYST 798 STATUS REPORT 20 March 2008 Team:Brian Boynton Tom Hare Eric Ho Matt Maier Ali Raza Key Sponsor: Dr. Kuo-Chu.

Slides:



Advertisements
Similar presentations
What Is an Ad Hoc Network?
Advertisements

Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
1 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen OR at Nokia Research Center Jukka K. Nurminen Nokia Research Center
Coverage Estimation in Heterogeneous Visual Sensor Networks Mahmut Karakaya and Hairong Qi Advanced Imaging & Collaborative Information Processing Laboratory.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Arsitektur Jaringan Terkini
Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.
More routing protocols Alec Woo June 18 th, 2002.
Distributed Sensing and Data Collection Via Broken Ad Hoc Wireless Connected Networks Mobile Robots By Alan FT Winfield Presented By Navpreet Bawa.
Architecture and Real Time Systems Lab University of Massachusetts, Amherst An Application Driven Reliability Measures and Evaluation Tool for Fault Tolerant.
Operating Systems Simulator Jessica Craddock Kelvin Whyms CPSC 410.
 Idit Keidar, Technion Intel Academic Seminars, February Octopus A Fault-Tolerant and Efficient Ad-hoc Routing Protocol Idit Keidar, Technion Joint.
Matnet – Matlab Network Simulator for TinyOS Alec WooTerence Tong July 31 st, 2002.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks CENTS Retreat – May 26, 2005 Jaein Jeong (1), David Culler (1),
Jadavpur University Centre for Mobile Computing & Communication Implementation of Ad-Hoc Mesh Network Presentation by: Sudipto Das Rajesh Roy.
A Vehicular Ad Hoc Networks Intrusion Detection System Based on BUSNet.
Research Project / Applications Seminar SYST 798 FINAL PRESENTATION 9 May 2008 Team: Tom Hare Ali Raza Brian Boynton Eric Ho Matt Maier.
Research Project / Applications Seminar SYST 798 FINAL REPORT Brief Dry-Run 3 April 2008 Team: Matt Maier Tom Hare Eric Ho Brian Boynton Ali Raza Key Sponsor:
Network Aware Resource Allocation in Distributed Clouds.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
Routing Protocol Evaluation David Holmer
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Distributed Location-aware Transmission for Ad-Hoc Networks Bey-Ling Su 1/29/2004.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
Shambhavi Srinivasa Carey Williamson Zongpeng Li Department of Computer Science University of Calgary Barrier Counting in Mixed Wireless Sensor Networks.
Heterogeneous Network Topology Generators Amer Zaheer 1.
1 Mobile ad hoc networking with a view of 4G wireless: Imperatives and challenges Myungchul Kim Tel:
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Multicast ad hoc networks Multicast in ad hoc nets Multicast in ad hoc nets Review of Multicasting in wired networks Review of Multicasting in wired networks.
An OLSR implementation, experience, and future design issues.
Simulation of the OLSRv2 Protocol First Report Presentation.
Research Project / Applications Seminar SYST 798 PROGRESS REPORT 6 March 2008 Team:Brian Boynton Tom Hare Eric Ho Matt Maier Ali Raza Key Sponsor: Dr.
SD1230 Unit 6 Desktop Applications. Course Objectives During this unit, we will cover the following course objectives: – Identify the characteristics.
Wiimote/Kinect Lab Midterm Update Senior Design December 2011, Group 16 Adviser: Dr. Tom Daniels Brenton Hankins Rick Hanton Harsh Goel Jeff Kramer.
1 Circuitscape Design Review Presentation Team Circuitscape Mike Schulte Sean Collins Katie Rankin Carl Reniker.
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Design of energy-efficient routing protocol in multicast ad-hoc mobile networks using directional antennas J. seetaram, Assoc.prof., Sree chaitanya college.
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Review of key networking techniques: –Reliable communication over unreliable channels –Error detection and correction –Medium access control –routing –Congestion.
CS 351/ IT 351 Modeling and Simulation Technologies HPC Architectures Dr. Jim Holten.
Research Project / Applications Seminar SYST 798 Sponsor: Dr. KuoChu Chang Team:Brian Boynton Tom Hare Eric Ho Matt Maier Ali Raza.
Self-stabilizing energy-efficient multicast for MANETs.
Research Project / Applications Seminar SYST 798 Sponsor: Dr. Kuo-Chu Chang Team:Brian Boynton Tom Hare Eric Ho Matt Maier Ali Raza.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Communications Range Analysis Simulation Set Up –Single Biological Threat placed in Soldier Field –Communication range varied from meters –Sensor.
1 Roie Melamed, Technion AT&T Labs Araneola: A Scalable Reliable Multicast System for Dynamic Wide Area Environments Roie Melamed, Idit Keidar Technion.
Wireless Sensor Network: A Promising Approach for Distributed Sensing Tasks.
Clustering In Mobile Networks Presented By: Assaf Mizrachi Shimrit Artzi Tutor: Dr. Michael Segal.
Salah A. Aly ,Moustafa Youssef, Hager S. Darwish ,Mahmoud Zidan
Chapter 5 The Network Layer.
Coverage and Connectivity in Sensor Networks
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
doc.: n Jeff Gilbert Atheros Communications
doc.: n Jeff Gilbert Atheros Communications
Presentation transcript:

Research Project / Applications Seminar SYST 798 STATUS REPORT 20 March 2008 Team:Brian Boynton Tom Hare Eric Ho Matt Maier Ali 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

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 ConditionsOverall 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