Methods for Coalition Formation in Adaptation-Based Social Networks Levi Barton, Vicki H. Allan Utah State University.

Slides:



Advertisements
Similar presentations
A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance Found in: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO.
Advertisements

Wireless Sensor Placement for Reliable and Efficient Data Collection Edo Biagioni and Galen Sasaki University of Hawaii at Manoa.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Five Reasons for the Collapse of a Civilization[1] [1] Collapse – How Societies Choose to Fail or Succeed. Jared Diamond. Penguin Books 2005.[1]
Mauro Sozio and Aristides Gionis Presented By:
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
MiLAN: Middleware to Support Sensor Network Applications Wendi B. Heinzelman, Amy L. Murphy, Hervaldo S. Carvalho, Mark A. Perillo University of Rochester.
IAT Heuristics for Dealing with a Shrinking Pie in Agent Coalition Formation Kevin Westwood – Utah State University Vicki Allan – Utah State University.
Software Diversity for Information Security Gaurav Kataria Carnegie Mellon University.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
0 Network Effects in Coordination Games Satellite symposium “Dynamics of Networks and Behavior” Vincent Buskens Jeroen Weesie ICS / Utrecht University.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Data Flow and Random Placement.
Behavioral Experiments in a Network Formation Game Prof. Michael Kearns Networked Life Spring 2010.
1 Tuesday, September 26, 2006 Wisdom consists of knowing when to avoid perfection. -Horowitz.
Continuum Crowds Adrien Treuille, Siggraph 王上文.
Agent-Organized Networks for Dynamic Team Formation Gaton, M.E. and desJardins, M., In Proceedings of AAMAS-2005, pp Seo, Young-Woo.
Cross-Layer Application-Specific WSN Design over SS-Trees -Prepared by Amy.
Establishing Pairwise Keys in Distributed Sensor Networks Donggang Liu, Peng Ning Jason Buckingham CSCI 7143: Secure Sensor Networks October 12, 2004.
“Multi-Agent Systems for Distributed Data Fusion in Peer-to-Peer Environment” Smirnova Vira ”Cheese Factory”/
Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems Artur Andrzejak, Sven Graupner,Vadim Kotov, Holger Trinks.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
SensIT PI Meeting, January 15-17, Self-Organizing Sensor Networks: Efficient Distributed Mechanisms Alvin S. Lim Computer Science and Software Engineering.
Collectively Cognitive Agents in Cooperative Teams Jacek Brzeziński, Piotr Dunin-Kęplicz Institute of Computer Science, Polish Academy of Sciences Barbara.
Distributed Asynchronous Bellman-Ford Algorithm
Cloud and Big Data Summer School, Stockholm, Aug., 2015 Jeffrey D. Ullman.
Trust-based Multi-Objective Optimization for Node-to-Task Assignment in Coalition Networks 1 Jin-Hee Cho, Ing-Ray Chen, Yating Wang, and Kevin S. Chan.
By: Steve Caswell Caitlin Anderson Leanne Heffernan Amy O’Connell.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Acknowledgments This material is based in part upon work supported by the National Science Foundation under grant number Methods  GOAL: determine.
Attila Kovács PhD candidate Corvinus University of Budapest Political networks in the European Parliament Network analysis of the 2013 CAP reform ‚MAKE’
FAR: Face-Aware Routing for Mobicast in Large-Scale Sensor Networks QINGFENG HUANG Palo Alto Research Center (PARC) Inc. and SANGEETA BHATTACHARYA, CHENYANG.
Neighborhood-Based Topology Recognition in Sensor Networks S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann Corby Ziesman.
Agent-Organized Networks for Dynamic Team Formation Multi-Agent Planning and Learning Laboratory (MAPLE) Department of Computer Science and EE University.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
1 A System for Outlier Detection and Cluster Repair Ying Liu Dr. Sprague Oct 21, 2005.
1 12/9/04 – Review TNO/TRAIL project #16 Jonne Zutt Delft University of Technology Information Technology and Systems Collective Agent Based Systems Group.
Computer Network Lab. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks SenSys ’ 03 Xiaorui Wang, Guoliang Xing, Yuanfang.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
C. Savarese, J. Beutel, J. Rabaey; UC BerkeleyICASSP Locationing in Distributed Ad-hoc Wireless Sensor Networks Chris Savarese, Jan Beutel, Jan Rabaey.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
Self-stabilizing energy-efficient multicast for MANETs.
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
Increased Reliability Through Failure Predictive Scheduling with Temperature Sensor Feedback Wesley Emeneker CSE 534 Dr. Sandeep Gupta.
Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang.
Making the Most of Your Life Objectives: 1.Describe characteristics of personality. 2.Distinguish between self-concept and self-esteem. 3.Suggest strategies.
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Distributed Algorithms for Dynamic Coverage in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver.
An Improved Acquaintance Immunization Strategy for Complex Network.
Power-Efficient Rendez- vous Schemes for Dense Wireless Sensor Networks En-Yi A. Lin, Jan M. Rabaey Berkeley Wireless Research Center University of California,
2006 IEEE International Conference On Networking, Sensing and Control Empirical Study on the Effects of Synthetic Social Structures on Teams of Autonomous.
Community Detection based on Distance Dynamics Reporter: Yi Liu Student ID: Department of Computer Science and Engineering Shanghai Jiao Tong.
Reliable Mobicast via Face- Aware Routing Qingfeng Huang,Chenyang Lu and Gruia-Catalin Roman Department of Computer Science and Engineering Washington.
 Attacks and threats  Security challenge & Solution  Communication Infrastructure  The CA hierarchy  Vehicular Public Key  Certificates.
Intelligent Agents: Technology and Applications Unit Five: Collaboration and Task Allocation IST 597B Spring 2003 John Yen.
SLEs Specialist Leaders in Education SLEs Specialist Leaders in Education How they can make a difference in your school.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
Wireless Network Dynamic Rate Adaptation and SS and DS mode in MIMO Advanced Computer Networks.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
ESRDC Overview for Load Management
Vineet Mittal Should more be added here Committee Members:
Why Social Graphs Are Different Communities Finding Triangles
Enhancing Attack Robustness of Scale-free Networks by Camouflage
Department of Computer Science University of York
Making Tens.
Making Tens.
Presentation transcript:

Methods for Coalition Formation in Adaptation-Based Social Networks Levi Barton, Vicki H. Allan Utah State University

Overview Optimal Coalitions Dynamic Environment Agent Organized Network Agent Types Results Conclusions Questions

Optimal Coalition Formation Requires Complete Information Substantial Computation Time May Not Be Feasible

Dynamic Environment Incomplete Information –Limited Sensor Capabilities –Damaged Sensors –Communication Failures

Dynamic Environment Agents –Limited View of Environment –Discovery of Environment Tasks –Periodic Creation –Decreasing Value –Time Sensitive

Agent Organized Network Agents in Charge –Choose Neighbors –Choose Tasks

Agent Organized Network Network Arcs –Physical Distance –Limited Communication –Trust –Potential Team Members

Agent Organized Network Initial Network Arcs –Random Agent Locations –Distance Between Agents d –Arcs Added When d < 100

Agent Organized Network Tasks –Require Specific Skills –Specified by Array skillCount[1,…,skillMax]

Agent Organized Network Agents Paired to Tasks in Teams –Agent Team Connected in Network –Teams Formed Using Set of Friends of a Friend (FOAF) –FOAF Agent Set of Preferred Neighbors

Agent Organized Network Agent Skills –One Skill Per Agent Neighborhood Skills –Skills Possessed by Neighbors and Neighbor’s Neighbors (FOAF)

Agent Organized Network Agent Flow of Control

Rewiring Strategies Performance –Rewire Based on Performance Estimate Structural –Rewire Based on Network Structure Diversity –Rewire Based on Skill Diversity

Task Selection Basic –Select First Available Task Strategic –Select Best Available Task (If Ratio of Skills Needed in Task and Skills Available in Neighborhood is > 0.34)

Task Patience Patient –Remain Committed To Task Until Task Either Succeeds or Fails Impatient –Abandon Task if Number of Uncommitted Agents in Neighborhood is < Number of Skills Unfilled in Task

Agent Types

Four Categories –Basic Task Selection and Task Patience –Basic Task Selection and Task Impatience –Strategic Task Selection and Task Patience –Strategic Task Selection and Task Impatience

No Adaptation Basic + Patient Strategic + Patient Basic + Impatient Strategic + Impatient

No Adaptation

Performance Agents

Structural Agents

Maximum Committed Four Time Steps

Maximum Committed Ten Time Steps

Two Tasks Per Time Step

Four Tasks Per Time Step

Degree Limit of Five

Degree Limit of Ten

Degree Limit of Twenty

Average Density Degree Limit of Five

Average Density Degree Limit of Ten

Average Density Degree Limit of Twenty

Conclusions Best Agent Type –StructuralStratImpatient Agent Impatience Under High Task Load Strategic Under High Task Load Degree Limit Feasible

Questions?