Complex Contagions Models in Opportunistic Mobile Social Networks Yunsheng Wang Dept. of Computer Science, Kettering University Jie Wu Dept. of Computer.

Slides:



Advertisements
Similar presentations
Scalable Routing In Delay Tolerant Networks
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Supporting Cooperative Caching in Disruption Tolerant Networks
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Efficient Realization of Hypercube Algorithms on Optical Arrays* Hong Shen Department of Computing & Maths Manchester Metropolitan University, UK ( Joint.
1 Meshes of Trees (MoT) and Applications in Integer Arithmetic Panagiotis Voulgaris Petros Mol Course: Parallel Algorithms.
Information Networks Small World Networks Lecture 5.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,
1 Interconnection Networks Direct Indirect Shared Memory Distributed Memory (Message passing)
ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,
The Organic Grid: Self- Organizing Computation on a Peer-to-Peer Network Presented by : Xuan Lin.
1 Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E)
Advanced Topics in Algorithms and Data Structures An overview of the lecture 2 Models of parallel computation Characteristics of SIMD models Design issue.
1 Analyzing Kleinberg’s (and other) Small-world Models Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Interconnection Network PRAM Model is too simple Physically, PEs communicate through the network (either buses or switching networks) Cost depends on network.
Topology Control and Mobility Management in Mobile Ad Hoc Networks Fei Dai and JIe Wu Department of Electrical and Computer Engineering North Dakota State.
1 Tuesday, September 26, 2006 Wisdom consists of knowing when to avoid perfection. -Horowitz.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Models of Parallel Computation Advanced Algorithms & Data Structures Lecture Theme 12 Prof. Dr. Th. Ottmann Summer Semester 2006.
Examples Broadcasting and Gossiping. Broadcast on ring (Safe and Forward)
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
Social Media Mining Graph Essentials.
Network Topologies Topology – how nodes are connected – where there is a wire between 2 nodes. Routing – the path a message takes to get from one node.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Social Feature-based Multi-path Routing in Delay Tolerant Networks
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Socially-aware pub-sub system for human networks Yaxiong Zhao Jie Wu Department of Computer and Information Sciences Temple University Philadelphia
Energy Efficient Phone-to-Phone Communication Based on WiFi Hotspots in PSN En Wang 1,2, Yongjian Yang 1, and Jie Wu 2 1 Dept. of Computer Science and.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
Random Graph Generator University of CS 8910 – Final Research Project Presentation Professor: Dr. Zhu Presented: December 8, 2010 By: Hanh Tran.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Basic Linear Algebra Subroutines (BLAS) – 3 levels of operations Memory hierarchy efficiently exploited by higher level BLAS BLASMemor y Refs. FlopsFlops/
Data Structures and Algorithms in Parallel Computing Lecture 3.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
Miniconference on the Mathematics of Computation
Super computers Parallel Processing
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
ETH Zurich – Distributed Computing Group Stephan HolzerSODA Stephan Holzer Silvio Frischknecht Roger Wattenhofer Networks Cannot Compute Their Diameter.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Parallel Processing & Distributed Systems Thoai Nam Chapter 3.
1 Roie Melamed, Technion AT&T Labs Araneola: A Scalable Reliable Multicast System for Dynamic Wide Area Environments Roie Melamed, Idit Keidar Technion.
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
CIS 825 Lecture 9. Minimum Spanning tree construction Each node is a subtree/fragment by itself. Select the minimum outgoing edge of the fragment Send.
Interconnection Networks Communications Among Processors.
SmartGossip: A Reliable Broadcast Service for Wireless Sensor Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Topics In Social Computing (67810)
Chapter 15: Distributed Structures
Peer-to-Peer and Social Networks
Network Science: A Short Introduction i3 Workshop
The Watts-Strogatz model
En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2
Effective Social Network Quarantine with Minimal Isolation Costs
Department of Computer Science University of York
Introduction Wireless Ad-Hoc Network
High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub
On Constructing k-Connected k-Dominating Set in Wireless Networks
Presentation transcript:

Complex Contagions Models in Opportunistic Mobile Social Networks Yunsheng Wang Dept. of Computer Science, Kettering University Jie Wu Dept. of Computer and Info. Sciences, Temple University

Outline Opportunistic Mobile Social Networks Existing Complex Contagions Schemes Proposed Hierarchical Complex Contagions Schemes Simulation Conclusion

Opportunistic Mobile Social Networks New types of Delay Tolerant Networks (DTNs) Occasionally connected networks Frequent network partition

Information Dissemination Most of the recent work considers simple contagions in OMSNs  The disease infection or information propagation only requires one “activated” source to infect the opinion- free neighbors Spreading of beliefs or behaviors is slower, the willingness to participate may require independent affirmation or reinforcement from multiple sources.

Existing Complex Contagions Schemes Ring Lattice-based Complex Contagions (RLCC) Grid-based Complex Contagions (GCC)

Ring Lattice-based Complex Contagions (RLCC) Watts and Strogatz’s Small World Model n nodes are placed on a ring lattice, and nodes within ring distance 2 are connected by a local link (or strong tie). The long-range links (or weak ties) are the links randomly rewired in this ring lattice.

The Strength of Weak Ties Efficient in simple contagion Not efficient in complex contagions, simply due to the lack of multiple, collective contacts. Fast diffusion of complex contagion requires not only long bridges, but also “wide” ones.

Weakness of RLCC Complex contagions require more rewiring in order to benefit from randomization. The number of links that need to be randomly rewired increases exponentially with the number required to form a bridge.

Grid-based Complex Contagions (GCC) Kleinberg’s Small World Model A constant number of random additional long ties will be given to each node with the harmonic distribution.

Weakness of GCC When the contagion is merely minimally complex, it would require a substantially large number of random long-range outgoing edges to even create one single ‘bridge’ to diffuse the contagion. In the GCC, the additional long-range links may not be significant in helping diffusion of complex contagions.

Proposed Hierarchical Complex Contagions Schemes Tree-based Complex Contagions (TCC) Clique-based Complex Contagions (CCC) Hypercube-based Complex Contagions (HCC)

Tree-based Complex Contagions (TCC) Complex contagions is a complex broadcasting process. In network science, tree-based structure is one of the most intuitive representations to study the broadcast process.

TCC The children nodes under the same parent connect with each other, and the children nodes also connect with the cousin nodes of their parent nodes. The initial active nodes can be any two linked nodes in this binary tree.

Clique-based Complex Contagions (CCC) In social networks, there is a small amount of individuals, who are more popular than other people. K-clique: the set of the popular people. Star structure: other individuals connect to all nodes in this k-clique.

Hypercube-based Complex Contagions (HCC) In the social network, many pairs of nodes have multiple common friends. The matching pair property of the balanced hypercube. Balanced hypercube is a load-balanced graph.

Properties of HCC Property 1: In an m-dimensional balanced hypercube, nodes can be partitioned into a set of matching pairs v = (a 0, a 1,..., a m−1 ) and v′ = (a 0 + 2, a 1,..., a m−1 ). In order to active all nodes, it only needs one matching pair of nodes to be the initial activated nodes. Property 2: An m-dimensional balanced hypercube has 2 2m nodes, each of which has 2m adjacent nodes. Since, each node has 2m adjacent nodes, HCC is a fault-tolerant approach. HCC also does not have the bottleneck problem.

Analysis Number of links: connectivity of the network Diameter: communication delay Node Degree: the number of connections the node has to other nodes Bisection width: the minimum number of communication links that can be removed to break it into two equally-sized disconnected networks

Discussion TCC reduces the diameter compared with RLCC (increase the spread speed) CCC has a higher bisection width and lower diameter compared with RLCC and GCC. But, it increases the number of links and node degree dramatically (not suitable for sparse networks) HCC is a more balanced model, which has a higher bisection width and smaller diameter, while the number of links and node degree are not big (a congestion-free model: fault tolerant and load balancing)

Simulation One message 2-complex contagions Multiple messages 2-complex contagions 20%, 40%, 60%, 80%, and 100% nodes activated 1,024-node network with 1,048,576 contacts

Delivery Time

Delivery Ratio

Conclusion and Future Work Complex Contagions  RLCC  GCC  TCC  CCC  HCC Extend to a-complex contagions in directed networks

Thank you! Questions ?