Fuzzy Angle Fuzzy Distance + Angle AG = 90 DG = 1 Annual Conference of ITA ACITA 2009 Exact and Fuzzy Sensor Assignment Hosam Rowaih 1 Matthew P. Johnson.

Slides:



Advertisements
Similar presentations
Greening Backbone Networks Shutting Off Cables in Bundled Links Will Fisher, Martin Suchara, and Jennifer Rexford Princeton University.
Advertisements

L3S Research Center University of Hanover Germany
Cooperative Transmit Power Estimation under Wireless Fading Murtaza Zafer (IBM US), Bongjun Ko (IBM US), Ivan W. Ho (Imperial College, UK) and Chatschik.
Sensor-Mission Assignment: A Scenario-Driven Walkthrough
Reasoning and Resource Allocation for Sensor- Mission Assignment in a Coalition Context A. Preece, D. Pizzocaro, K. Borowiecki (Cardiff University, UK)
Annual Conference of ITA ACITA 2009 Knowledge-Driven Agile Sensor-Mission Assignment A. Preece*, D. Pizzocaro*, K. Borowiecki*, G. de Mel, W. Vasconcelos,
International Technology Alliance in Network & Information Sciences Dave Braines, John Ibbotson, Graham White (IBM UK) SPIE Defense Security & Sensing.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
Locating Congested Segments over the Internet Based on Multiple End-to-End Path Measurements Shigehiro Ano * Atsuo Tachibana * Toru Hasegawa * Masato Tsuru.
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Virtual Network Embedding with Coordinated Node and Link Mapping N. M. Mosharaf Kabir Chowdhury Muntasir Raihan Rahman and Raouf Boutaba University of.
Chapter 12 Capturing Surplus.
Ch 1.2: Functions. DEFINITIONS Relation: a set of ordered pairs or 2 quantities related by a rule Function: a relation in which an element of the domain.
Modelling uncertainty in 3APL Johan Kwisthout Master Thesis
Lab Module 02 Serial Manufacturing Line
Dynamic Location Discovery in Ad-Hoc Networks
Detecting Spam Zombies by Monitoring Outgoing Messages Zhenhai Duan Department of Computer Science Florida State University.
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
A System Architecture for Exploiting Mission Information Requirement and Resource Allocation Fangfei Chen a, Thomas La Porta a, Diego Pizzocaro b, Alun.
A Comparison of Rule-Based versus Exemplar-Based Categorization Using the ACT-R Architecture Matthew F. RUTLEDGE-TAYLOR, Christian LEBIERE, Robert THOMSON,
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Support Vector Machines
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
The Cat and The Mouse -- The Case of Mobile Sensors and Targets David K. Y. Yau Lab for Advanced Network Systems Dept of Computer Science Purdue University.
Approximate and online multi-issue negotiation S.S. Fatima Loughborough University, UK M. Wooldridge N.R. Jennings University of.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Mobility Improves Coverage of Sensor Networks Benyuan Liu*, Peter Brass, Olivier Dousse, Philippe Nain, Don Towsley * Department of Computer Science University.
Chapter 6 Continuous Random Variables and Probability Distributions
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Chapter 5 Continuous Random Variables and Probability Distributions
PCFG Based Synthetic Mobility Trace Generation S. C. Geyik, E. Bulut, and B. K. Szymanski Department of Computer Science, Rensselaer Polytechnic Institute.
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
Aeronautics & Astronautics Autonomous Flight Systems Laboratory All slides and material copyright of University of Washington Autonomous Flight Systems.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
Evolutionary Clustering and Analysis of Bibliographic Networks Manish Gupta (UIUC) Charu C. Aggarwal (IBM) Jiawei Han (UIUC) Yizhou Sun (UIUC) ASONAM 2011.
Baoxian Zhao Hakan Aydin Dakai Zhu Computer Science Department Computer Science Department George Mason University University of Texas at San Antonio DAC.
Planning Production of a Set of Semiconductor Components with Uncertain Wafer and Component Yield Frank W. Ciarallo Assistant Professor Biomedical, Industrial.
Semantic Information Fusion Shashi Phoha, PI Head, Information Science and Technology Division Applied Research Laboratory The Pennsylvania State.
Geo479/579: Geostatistics Ch12. Ordinary Kriging (1)
Mutual Exclusion in Wireless Sensor and Actor Networks IEEE SECON 2006 Ramanuja Vedantham, Zhenyun Zhuang and Raghupathy Sivakumar Presented.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Classification and Ranking Approaches to Discriminative Language Modeling for ASR Erinç Dikici, Murat Semerci, Murat Saraçlar, Ethem Alpaydın 報告者:郝柏翰 2013/01/28.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
1 A Bidding Protocol for Deploying Mobile Sensors GuilingWang, Guohong Cao, and Tom LaPorta Department of Computer Science & Engineering The Pennsylvania.
Detection, Classification and Tracking in a Distributed Wireless Sensor Network Presenter: Hui Cao.
A Cross-Sensor Evaluation of Three Commercial Iris Cameras for Iris Biometrics Ryan Connaughton and Amanda Sgroi June 20, 2011 CVPR Biometrics Workshop.
Tracking Irregularly Moving Objects based on Alert-enabling Sensor Model in Sensor Networks 1 Chao-Chun Chen & 2 Yu-Chi Chung Dept. of Information Management.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Cognitive Radio for Dynamic Spectrum Allocation Systems Xiaohua (Edward) Li and Juite Hwu Department of Electrical and Computer Engineering State University.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Presented by Yu-Shun Wang Advisor: Frank, Yeong-Sung Lin Near Optimal Defense Strategies to Minimize Attackers’ Success Probabilities for networks of Honeypots.
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
Prof. Yu-Chee Tseng Department of Computer Science
Presented by Prashant Duhoon
th IEEE International Conference on Sensing, Communication and Networking Online Incentive Mechanism for Mobile Crowdsourcing based on Two-tiered.
Distributed Learning of Multilingual DNN Feature Extractors using GPUs
LECTURE 05: THRESHOLD DECODING
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range
A Near-Optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks Authors : Frank Y. S. Lin and P. L. Chiu, Student.
LECTURE 05: THRESHOLD DECODING
March 2010 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [SFD Design for SUN FSK] Date Submitted: [March.
February 2010 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [SFD Design for SUN FSK] Date Submitted:
Presentation transcript:

Fuzzy Angle Fuzzy Distance + Angle AG = 90 DG = 1 Annual Conference of ITA ACITA 2009 Exact and Fuzzy Sensor Assignment Hosam Rowaih 1 Matthew P. Johnson 2 Diego Pizzocar 3 Amotz Bar-Noy 2 Lance Kaplan 4 Thomas La Porta 1 Alun Preece 3 1 Pennsylvania State University 2 City University of New York 3 Cardiff University (funded by ITA via IBM UK) 4 US Army Research Lab Acknowledgements Research was sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF The views and conclusions contained in this document are those of the author(s) and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon. Introduction Sensor network performing multiple simultaneous tasks, each requiring multiple sensors competition for limited sensing resources Directional sensors can only be assigned to one task at a time Problem: which sensors should be assigned to which tasks? Two NP-hard apps with nonlinear utility: n Event Detection n Target Localization Localization Task: choose two sensors that minimize location uncertainty: Network: maximize the sum of task utilities u j defined as: Fuzzy location: based on distance and a fuzzy angle divides the circle into sectors based on an angle granularity (AG) System Model Sensor types: imagery and acoustic Detection use: both imagery and acoustic Localization use: only acoustic Dynamic system tasks arrive and depart over time Tasks: different profits different locations Utility = function of assigned sensors Localization and high profit detection tasks can preempt low profit detection Fuzzy location benefits: Lower computational cost: fewer assignment choices to consider Privacy: sensors not disclosing their exact location Tradeoff between solution quality and computational cost / privacy 1000 sensors in 400m x 400m field 70% acoustic, 30% imagery Sensing range = 40m Detection probability: Acoustic SNR = 60 dB, Imagery SNR = 66 dB False detection probability PFA = Minimum required uncertainty for localization = 16 Corresponds to error area of 4m x 4m Poisson task arrival with rate = 10 tasks/hour 70% detection, 30% localization Lifetimes and profits vary uniformly: Detection: lifetime between 1 hour and 5 hours, profits in [0, 0.1] Localization: lifetime between 5 minutes and 30 minutes, profits in [0.1, 1] Compare results to upper bound on optimal Solve the problem by ignoring competition Event Detection Target Localization Sensors not assigned to localization tasks propose with exact locations Leader compare possible pairs: Determine θ: separating angle Use distances and θ to calculate uncertainty Choose best pair If number of proposing sensors is large: Set a threshold distance Dt Sensor further from this distance ignore advertisement Evaluation Finer granularity leads to better solution Fuzzy can achieve profits that are within 1% of exact Localization is affected more by competition Detection with Exact Location Task leaders advertise tasks and location requirements to nearby sensors Sensors propose to tasks Task: assign n sensors that maximize cumulative detection probability (CDP) Network: maximize the sum of task utilities (CDPs) weighted by profits: Tasks competing with arriving task (within distance 2Rs) compete in rounds: Sensors (re)calculate how much they can help tasks (marginally) and propose: Tasks accept the best proposals Detection with Fuzzy Location Detection probability depends on distance For fuzzy location, distance is discretized S2S2S2S2 S3S3S3S3 S1S1S1S1 x DG = 1