Agent-based sensor-mission assignment for tasks sharing assets Thao Le Timothy J Norman WambertoVasconcelos www.usukita.org www.csd.abdn.ac.uk/research/ita.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Annual Conference of ITA ACITA 2009 Knowledge-Driven Agile Sensor-Mission Assignment A. Preece*, D. Pizzocaro*, K. Borowiecki*, G. de Mel, W. Vasconcelos,
Class-constrained Packing Problems with Application to Storage Management in Multimedia Systems Tami Tamir Department of Computer Science The Technion.
MBD and CSP Meir Kalech Partially based on slides of Jia You and Brian Williams.
Towards a Theoretic Understanding of DCEE Scott Alfeld, Matthew E
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Effective Coordination of Multiple Intelligent Agents for Command and Control The Robotics Institute Carnegie Mellon University PI: Katia Sycara
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
A Decentralised Coordination Algorithm for Maximising Sensor Coverage in Large Sensor Networks Ruben Stranders, Alex Rogers and Nicholas R. Jennings School.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
GridFlow: Workflow Management for Grid Computing Kavita Shinde.
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,
Wireless & Mobile Networking: Channel Allocation
Multi-Arm Manipulation Planning (1994) Yoshihito Koga Jean-Claude Latombe.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
1 A Shifting Strategy for Dynamic Channel Assignment under Spatially Varying Demand Harish Rathi Advisors: Prof. Karen Daniels, Prof. Kavitha Chandra Center.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
A Multi-Agent Learning Approach to Online Distributed Resource Allocation Chongjie Zhang Victor Lesser Prashant Shenoy Computer Science Department University.
Scheduling of Flexible Resources in Professional Service Firms Arun Singh CS 537- Dr. G.S. Young Dept. of Computer Science Cal Poly Pomona.
Data Selection In Ad-Hoc Wireless Sensor Networks Olawoye Oyeyele 11/24/2003.
1.1 Chapter 1: Introduction What is the course all about? Problems, instances and algorithms Running time v.s. computational complexity General description.
A1A1 A4A4 A2A2 A3A3 Context-Specific Multiagent Coordination and Planning with Factored MDPs Carlos Guestrin Shobha Venkataraman Daphne Koller Stanford.
Distributed Constraint Optimization Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
1 IEEE Trans. on Smart Grid, 3(1), pp , Optimal Power Allocation Under Communication Network Externalities --M.G. Kallitsis, G. Michailidis.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
An Autonomic Framework in Cloud Environment Jiedan Zhu Advisor: Prof. Gagan Agrawal.
ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Approximate Dynamic Programming Methods for Resource Constrained Sensor Management John W. Fisher III, Jason L. Williams and Alan S. Willsky MIT CSAIL.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
The Scientific Method. The Basic Steps l State the problem l Form a hypothesis l Test the hypothesis l Draw conclusions.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Spectrum Sensing In Cognitive Radio Networks
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Author Utility-Based Scheduling for Bulk Data Transfers between Distributed Computing Facilities Xin Wang, Wei Tang, Raj Kettimuthu,
Distributed Optimization Yen-Ling Kuo Der-Yeuan Yu May 27, 2010.
Smart Sleeping Policies for Wireless Sensor Networks Venu Veeravalli ECE Department & Coordinated Science Lab University of Illinois at Urbana-Champaign.
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
1 Hardware-Software Co-Synthesis of Low Power Real-Time Distributed Embedded Systems with Dynamically Reconfigurable FPGAs Li Shang and Niraj K.Jha Proceedings.
Load Balancing : The Goal Given a collection of tasks comprising a computation and a set of computers on which these tasks may be executed, find the mapping.
Optimization Models for Fixed Channel Assignment in Wireless Mesh Networks with Multiple Radios Arindam K. Das, Sumit Roy, SECON Kim Young.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
Formal Complexity Analysis of RoboFlag Drill & Communication and Computation in Distributed Negotiation Algorithms in Distributed Negotiation Algorithms.
Ashish Rauniyar, Soo Young Shin IT Convergence Engineering
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Introduction to Load Balancing:
Advanced Design and Analysis Techniques
System Control based Renewable Energy Resources in Smart Grid Consumer
A Novel Framework for Software Defined Wireless Body Area Network
Multi-Agent Exploration
Objective of This Course
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
The Coverage Problem in a Wireless Sensor Network
The End Of The Line For Static Cyclic Scheduling?
Presentation transcript:

Agent-based sensor-mission assignment for tasks sharing assets Thao Le Timothy J Norman WambertoVasconcelos

Structure Introduction & Motivation Problem description MSM & GAP-E Experimental results Discussion Conclusion

Introduction & Motivation  WSNs consist of a large number of sensing resources

Introduction & Motivation  WSNs consist of a large number of sensing resources  form an ad-hoc network  communicating with each other and with data processing centres using wireless links

Introduction & Motivation WSNs are required to support multiple missions  arriving at anytime  decomposing into many tasks

Introduction & Motivation WSNs are required to support multiple missions  arriving at anytime  decomposing into many tasks  may occur simultaneously

Introduction & Motivation WSNs are highly dynamic in terms of:  configuration: sensors move out of range or be damaged, changing weather conditions may interfere with communication, etc...  the environment: missions and phenomena occur frequently and simultaneously The problem: Sensor- Mission Allocation

Introduction & Motivation Motivations:  to be more applicable in realistic environments heterogeneous sensors & tasks

Introduction & Motivation Motivations:  to be more applicable in realistic environments: heterogeneous sensors & tasks  to save limited energy of sensor resources in real- world application allowing sensors to be shared between multiple tasks

Introduction & Motivation Motivations:  to be more applicable in realistic environments: heterogeneous sensors & tasks  to save limited energy of sensor resources in real- world application allowing sensors to be shared between multiple tasks

Introduction & Motivation Motivations:  to be more applicable in realistic environments: heterogeneous sensors & tasks  to save limited energy of sensor resources in real- world application allowing sensors to be shared between multiple tasks

Introduction & Motivation Motivations:  to be more applicable in realistic environments: heterogeneous sensors & tasks  to save limited energy of sensor resources in real- world application allowing sensors to be shared between multiple tasks

Introduction & Motivation Motivations:  to be more applicable in realistic environments: heterogeneous sensors & tasks  to save limited energy of sensor resources in real- world application allowing sensors to be shared between multiple tasks  to cope with the dynamic nature of WSNs considering the possibility of reassigning sensors

The Assignment Problem  In the network we have a set of sensors  Each sensor is defined by its:  type, location and sensing range,  the maximum utility it can provide, and  the cost of using the sensor.  Missions may arrive at anytime and are collections of tasks.  Each task is defined by its:  type, location and operational range, and  demand, budget and profit  Each sensor-task assignment has an associated utility (the utility provided to the task by the sensor).

The Assignment Problem  Constraints on possible solutions  All tasks within a mission must be satisfied for the mission to be satisfied  The utility achieved must greater than or equal to the threshold for each task within a mission  The total cost of an assignment must be within budget  The set of sensor types of the sensors assigned to must cover its information requirements  Sensors cannot be assigned to more than one type of task

Challenges A huge and dynamic number of constraints and variables  using SAM to reduce the search space The constraints form an instance of the Generalised Assignment Problem which is NP- Hard  our idea is to use a multi-round Knapsack- based algorithm since GAP can reduce to the Multiple Knapsack problem Finding solutions requires soft-real time; sensors are only partially observation about environment; the order of arrival of missions is unknown etc.  An agent-based approach is highly suited to the coordination of sensor resources in a decentralised and flexible manner

MSM MSM – Multiple Sensor Mode assignment mechanism Sensors are represented by agents Sensor agents are cooperative Each task is delegated to an agent within the operational range This agent acts as coordinator (not necessarily involved in the solution)

MSM MSM operates as follows: –Coordinator identifies candidate sensors in operational range and issues cfp –Each sensor makes independent decision whether and what utility to bid –Coordinator attempts to allocate sensors using GAP-E –If allocation fails, coord reports failure; mission fails –Coord informs agents of allocations

GAP-E Each task has a priority ordering over sensor types (info requirements) Each task has a budget, allocated over sensor types * Compute “cost matrix” for sensors on basis of bids from sensors and priority over types Run FPTAS algorithm If no solution, seek sensor that can be released from prior commitment to another task If solution found within budget for all types, return Recompute “cost matrix” and iterate from *

Experimental results Hypothesis 1: MSM performs well in comparison to the estimated optimum Mission success rate with 4 sensor types and 4 missions arriving per hour Mission success rate with 8 sensor types and 8 missions arriving per hour

Experimental results Hypothesis 2: The computational complexity (running time) of MSM is much less than that of other mechanisms Running time (ms) with 4 sensor types and 4 missions arriving per hour Running time (ms) with 8 sensor types and 8 missions arriving per hour

Experimental results Hypothesis 3: The computational complexity of MSM is increased in a steadily fashion with the number of missions (or tasks) Running time (ms) with 4 sensor types and 25 sensors per type

Future Work  Sensors are assumed to be static  Tasks are independent  Sensor agents are cooperative (will release a sensor even if utility for its task is lower)  We assume that tasks sharing a sensor require the same information

Conclusion A decentralised approach to solving the sensor- mission assignment problem for tasks sharing assets  Generic solution to the resource allocation problem (both sensors and tasks are heterogeneous)  Sensor sharing significantly improves the number of successfully allocated missions  Use of polynomial algorithm within GAP-E increases performance, and hence utility of solution in practical use  Allows sensors to be reassigned to reduce effect of mission arrival time on the solution