Distributed-In/Distributed-Out: Intelligent Sensor Networks for Coordination Constantine (Dean) Christakos Viral Communications

Slides:



Advertisements
Similar presentations
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Advertisements

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
Chapter 4 Distributed Bellman-Ford Routing
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
Trust relationships in sensor networks Ruben Torres October 2004.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
A Survey on Tracking Methods for a Wireless Sensor Network Taylor Flagg, Beau Hollis & Francisco J. Garcia-Ascanio.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin LECS – UCLA Modified and Presented by Sugata Hazarika.
March 13, 2006 Location Tracking System & Sensor Based Communications For Mining Response to RIN 1219-AB44.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
A Data Fusion Approach for Power Saving in Wireless Sensor Networks Reporter : Chi-You Chen.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
1 Emergency Navigation by Wireless Sensor Networks in 2D and 3D Indoor Environments Yu-Chee Tseng Deptment of Computer Science National Chiao Tung University.
Communication-Efficient Distributed Monitoring of Thresholded Counts Ram Keralapura, UC-Davis Graham Cormode, Bell Labs Jai Ramamirtham, Bell Labs.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
A Study of Mobile IP Kunal Ganguly Wichita State University CS843 – Distributed Computing.
CS 599 Intelligent Embedded Systems1 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks W.R.Heinzelman, J.kulik, H.Balakrishnan.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :
SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.
Nuttapon Boonpinon Advisor Dr. Attawith Sudsang Department of Computer Engineering,Chulalongkorn University Pattern Formation for Heterogeneous.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
HERO: Online Real-time Vehicle Tracking in Shanghai Xuejia Lu 11/17/2008.
Robot Autonomous Perception Model For Internet-Based Intelligent Robotic System By Sriram Sunnam.
COMP 410 Update. The Problems Story Time! Describe the Hurricane Problem Do this with pictures, lots of people, a hurricane, trucks, medicine all disconnected.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
Extending Traditional Algorithms for Cyber-Physical Systems Sumeet Gujrati and Gurdip Singh Kansas State University.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 7: Naming & Addressing Holger Karl.
A LOCALIZED SELF-HEALING ALGORITHM FOR NETWORKS OF MOVEABLE SENSOR NODES Mohamed Younis, Sookyoung Lee, Sheetal Gupta and Kevin Fisher Department of Computer.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Bus Detection Device For The Passenger Using GPS And Gsm Application Student Name USN NO Guide Name H.O.D Name Name Of The College & Dept.
Stretchable Architectures for Next Generation Cellular Networks Presented By Shashidhar Lakkavalli, Ansuya Negi and Dr. Suresh Singh Portland State University.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
“Wireless Sensor Network for Traffic Routing” Presented by Amr abd el fattah.
Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
A Key Management Scheme for Distributed Sensor Networks Laurent Eschaenauer and Virgil D. Gligor.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Mutual Exclusion Algorithms. Topics r Defining mutual exclusion r A centralized approach r A distributed approach r An approach assuming an organization.
ProgessFace: An Algorithm to Improve Routing Efficiency of GPSR-like Routing Protocols in Wireless Ad Hoc Networks Chia-Hung Lin, Shiao-An Yuan, Shih-Wei.
Networking (Cont’d). Congestion Control l Is achieved by informing nodes along a route that congestion has occurred and asking them to reduce their packet.
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Grid: Scalable Ad-Hoc Wireless Networking Douglas De Couto
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Lecture 8: Wireless Sensor Networks By: Dr. Najla Al-Nabhan.
Powerpoint Templates Data Communication Muhammad Waseem Iqbal Lecture # 07 Spring-2016.
The Network Layer UNIT-4 snistforum.com. Network Layer Design Issues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation.
Introduction to Wireless Sensor Networks
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
Intra-Domain Routing Jacob Strauss September 14, 2006.
Data Communication Networks
CS 4594 Broadband PNNI Signaling.
Erasmus Intensive Program
Research Issues in Middleware (Bhaskar)
Presentation transcript:

Distributed-In/Distributed-Out: Intelligent Sensor Networks for Coordination Constantine (Dean) Christakos Viral Communications

Introduction An everyday problem How sensor networks can be applied The concerns about current designs Our proposed solution Preliminary work Where do we go from here?

How Do We Find Our Way Around? We follow the signs! Getting out of lower Manhattan:

It Doesn’t Always Work Smoothly While following the signs, a driver could encounter: Congestion A car accident Construction If the driver is lucky, public works will have time to put up detour signs

Would Sensor Networks Help? Sensors monitor environmental conditions on remote islands and volcanoes. So why not in Manhattan?

Distributed Input of Sensor Data The sensors are placed all over the monitored area and record separate pieces of data. The responsibility for monitoring this wide area is distributed over dozens or even hundreds of tiny sensors.

Distributed Input, Centralized Output Normally, sensor networks are used to monitor an area and send that data back somewhere to be analyzed Why can’t observers within the sensor network get data directly?

Why is this a problem? Centralized Control leads to centralized failures. New York’s Office of Emergency Management was located in the World Trade Center. Re-coordination requires the global control center to be contacted even when the problem itself is localized.

Distributed Output Each sensor acts an output. Instead of acquiring data from a central point, each sensor node displays relevant local information to the observer.

No Central Control! Localized failures don’t interfere with the ability to find a solution to global problems. Intelligence moves away from a central coordinator and out to the individual nodes.

Using Local Information in Problem Solving Using just local information, we can get closer to our goal. Signs give us the next step to the tunnel or the bridge. Sensors can tell users the next step to a needed resource and can warn users of upcoming dangers.

Resource Discovery The sensors direct users towards resources, based on data they have acquired. Sensors can keep track of the direction of the nearest route to the exit

Danger Avoidance Nodes that can see a clear path to the destination guide users towards them Nodes that are informed of nearby danger guide users away from those areas

The Protocol – Finding the Nearest Exit Each node keeps track of which of its neighbors is closest to the exit and sends users in that direction. The next node keeps aware of which of its neighbors is next closest to the exit and sends users in that direction. And so forth, until the user arrives.

Disaster Recovery In the event of a blocked passageway, the protocol finds alternates. Only the next step in the process is important. Example: during building escape, nodes need to direct the users on upper floors to the ground floor. The nodes don’t need to know that users on the ground floor need to use the rear exit, rather than the front exit.

Local Recovery Scales As the network (or building or city) gets larger, disaster recovery will remain a function of communication within a constant radius. Briefly: the larger the graph, the more paths that exist

Simulation Using a sensor network simulator, we have implemented a simple path-finding algorithm and are currently testing. In this case, nodes trace a path to the center node:

Implementing These Cheaply Recently, the advent of inexpensive bluetooth devices has allowed us to make wireless multihop networks out of computers throughout the lab:

Future Uses Intelligent decision-making can be pushed outwards to the agents “in the field.” Examples: UPS drivers communicate and coordinate locally to makeup lost time due to canceled drop-offs by finding nearby drivers. “Pullers” on election day can coordinate with others while doing get out-the-vote All these are done without a central coordinator and by leveraging large numbers of sensors to find what people need.

Questions?