Comp. Lab. Univ. Cambridge

Slides:



Advertisements
Similar presentations
Exploring User Social Behavior in Mobile Social Applications Konglin Zhu *, Pan Hui $, Yang Chen *, Xiaoming Fu *, Wenzhong Li + * University of Goettingen,
Advertisements

MSRC, Cambridge, UK Dec 7, 2007 The Network is the People or The People are the Network (les gens sont le reseau)
Are You moved by Your Social Network Application? Abderrahmen Mtibaa, Augustin Chaintreau, Jason LeBrun, Earl Oliver, Anna-Kaisa Pietilainen, Christophe.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Lessons from Haggle iMote Experiments Erik Nordström Haggle meeting 9-10 January 2007.
Imperial College LondonFebruary 2007 Bubble Rap: Forwarding in Small World DTNs in Ever Decreasing Circles Part 2 - People Are the Network Jon Crowcroft.
Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
Opportunistic Networking (aka Pocket Switched Networking)
Analysis of the Internet Topology Michalis Faloutsos, U.C. Riverside (PI) Christos Faloutsos, CMU (sub- contract, co-PI) DARPA NMS, no
Bubble Rap: Social-based Forwarding in DTNs Pan Hui, Jon Crowcroft, Eiko Yoneki University of Cambridge, Computer Laboratory Slides by Alex Papadimitriou.
How small labels create big improvements Pan Hui Jon Crowcroft Computer Laboratory University of Cambridge.
Bluenet a New Scatternet Formation Scheme * Huseyin Ozgur Tan * Zifang Wang,Robert J.Thomas, Zygmunt Haas ECE Cornell Univ*
CHINACOM 2006, Beijing, China26 Oct 2006 Osmosis in Pocket Switched Network Pan (Ben) Hui University of Cambridge Computer Laboratory
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
The Influence of Indirect Ties on Social Network Dynamics Xiang Zuo 1, Jeremy Blackburn 2, Nicolas Kourtellis 3, John Skvoretz 1 and Adriana Iamnitchi.
9. Demo Scenario #1 Behavioral profile upon discovering friends/enemies 1)No friends and enemies: search for friends.  Turn by 90 degree and go forward.
Detecting Node encounters through WiFi By: Karim Keramat Jahromi Supervisor: Prof Adriano Moreira Co-Supervisor: Prof Filipe Meneses Oct 2013.
© Y. Zhu and Y. University of North Carolina at Charlotte, USA 1 Chapter 1: Social-based Routing Protocols in Opportunistic Networks Ying Zhu and.
A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.
Pocket Switched Networks: Real-world Mobility and its Consequences for Opportunistic Forwarding Jon Crowcroft,Pan Hui (Ben) Augustin Chaintreau, James.
The FluPhone Study: Measuring Human Proximity using Mobile Phones Eiko Yoneki and Jon Crowcroft Systems Research Group University.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Sociological Orbit based Mobility Profiling Lab for Advanced Network Design, Evaluation and Research On Profiling Mobility and Predicting Locations of.
1 Contact Prediction, Routing and Fast Information Spreading in Social Networks Kazem Jahanbakhsh Computer Science Department University of Victoria August.
A Graph-based Friend Recommendation System Using Genetic Algorithm
How Small Labels create Big Improvements April Chan-Myung Kim
Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim
Predicting Positive and Negative Links in Online Social Networks
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
1/52 Overlapping Community Search Graph Data Management Lab, School of Computer Science
Peer Centrality in Socially-Informed P2P Topologies Nicolas Kourtellis, Adriana Iamnitchi Department of Computer Science & Engineering University of South.
Introduction to Computer Networks Dr. Sanjay P. Ahuja, Ph.D FIS Distinguished Professor of Computer Science School of Computing, UNF.
Network Community Behavior to Infer Human Activities.
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks 1 Wei Gao Guohong Cao Tom La Porta Jiawei Han Presented.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Scalable Learning of Collective Behavior Based on Sparse Social Dimensions Lei Tang, Huan Liu CIKM ’ 09 Speaker: Hsin-Lan, Wang Date: 2010/02/01.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
BUBBLE Rap: Social-based Forwarding in Delay Tolerant Networks April 2013 Yong-Jin Jeong
William Stallings Data and Computer Communications
SDN challenges Deployment challenges
Cohesive Subgraph Computation over Large Graphs
Delay-Tolerant Networks (DTNs)
University of Maryland College Park
SLAW: A Mobility Model for Human Walks
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
1 Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks Eyuphan Bulut, Student Member, IEEE, and Boleslaw K Szymanski, Fellow,
Biological networks CS 5263 Bioinformatics.
Applications of graph theory in complex systems research
Dynamic Routing Protocols part2
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Recognizing Exponential Inter-Contact Time in VANETs
Chao Zhang1, Yu Zheng2, Xiuli Ma3, Jiawei Han1
Wireless Epidemic The wireless epidemic (Nature 449, ; 2007) by Jon Kleinberg ‘Digital traffic flows not only over the wired backbone of the Internet,
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
Data and Computer Communications
Switch controller: Routing
Effectiveness of the 2-hop Routing Strategy in MANETS
Jiawei Han Department of Computer Science
Korea University of Technology and Education
(Social) Networks Analysis II
Discriminative Probabilistic Models for Relational Data
Affiliation Network Models of Clusters in Networks
Changing the paradigm in forwarding : How transform daemons to angels?
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Presentation transcript:

Comp. Lab. Univ. Cambridge Bubble Rap: Forwarding in Small World DTNs in Ever Decreasing Circles Pan Hui (Ben) Jon Crowcroft Eiko Yoneki Comp. Lab. Univ. Cambridge

Outline Pocket Switched Network Multiple levels human heterogeneity 6/11/2018 Pocket Switched Network Multiple levels human heterogeneity Power law inter-contact time distribution Local community structures Diversity of centrality in different scales Four categories of human relationship Heterogeneous forwarding algorithms Design space BUBBLE RAP (centrality meets community) Approximation and predictability Decentralized approximation of centrality Human predictability Distributed community detection 2

Pocket Switched Network Thank you but you are in the opposite direction! I can also carry for you! I have 100M bytes of data, who can carry for me? Give it to me, I have 1G bytes phone flash. Reach an access point. There is one in my pocket… Internet Search La Bonheme.mp3 for me Search La Bonheme.mp3 for me Search La Bonheme.mp3 for me Pocket Switched Network 3

People Are the Network (PAN)… 4

Understanding multiple levels of heterogeneity The first goal of this research is to move to a new generation of human mobility models, understanding heterogeneity at multiple levels of detail. 5

Experimental Setup iMotes ARM processor Bluetooth radio 64k flash memory Bluetooth Inquiries 5 seconds every 2 minutes Log {MAC address, start time, end time} tuple of each contact

Experimental devices

DataSets

PAIR WISE RELATIONSHIP Duration of the experiment a contact time an inter-contact t

EXAMPLE: A TYPICAL PAIR 6/11/2018 α cutoff

OTHER EXAMPLES

Social Structures Vs Network Structures 6/11/2018 Community structures Social communities, i.e. affiliations Topological cohesive groups or modules Centralities Social hubs, celebrities and postman Betweenness, closeness, inference power centrality 12

K-clique Community Definition Union of k-cliques reachable through a series of adjacent k-cliques [Palla et al] Adjacent k-cliques share k-1 nodes Members in a community reachable through well- connected well subsets Examples 2-clique (connected components) 3-clique (overlapping triangles) Overlapping feature 13

K-clique Communities in Cambridge Dataset 6/11/2018 14

K-clique Communities in Infocom06 Dataset 6/11/2018 Barcelona Group Paris Group A Paris Group B Lausanne Group Paris Groups K=3

K-clique Communities in Infocom06 Dataset Barcelona Group Paris Group A Paris Group B Lausanne Group Paris Groups 6/11/2018 K=4

K-clique Communities in Infocom06 Dataset 6/11/2018 Barcelona Group (Spanish) Paris Group A (French) Paris Group B (French) Italian K=5

Other Community Detection Methods 6/11/2018 Betweenness [Newman04] Modularity [Newman06] Information theory[Rosvall06] Statistical mechanics[Reichardt] Weighted Network Analysis[Newman05] Survey Papers[Danon05][Newman04] 18

Centrality in Temporal Network 6/11/2018 Large number of unlimited flooding Uniform sourced and temporal traffic distribution Number of times on shortest delay deliveries Analogue to Freeman centrality [Freeman] 19

Homogenous Centrality Reality Cambridge Infocom06 HK 20

Within Group Centrality Cambridge Dataset 6/11/2018 Group B Group A 21

Within Group Centrality Reality Dataset 6/11/2018 Group A Group B Group D Group C 22

Model Node Centrality 6/11/2018 Node centrality should be modelled in different levels of heterogeneity 23

Regularity and Familiarity 6/11/2018 I Correlation Coefficient = 0.9026 II III IV Familiarity I: Community II. Familiar Strangers III. Strangers IV. Friends 24

c: 0.6604 c: 0.5817 Infocom05 Infocom06 c: 0.8325 c: 0.7927 Reality HK

Heterogeneous Forwarding 6/11/2018 The second goal of this research is to devise efficient forwarding algorithms for PSNs which take advantage of both a priori and learned knowledge of the structure of human mobility. 26

Interaction and Forwarding Third generation human interaction model Categories of human contact patterns Clique and community Popularity/Centrality Dual natures of mobile network Social network Physical network Benchmark Forwarding strategies Flooding, Wait, and Multiple-copy-multiple-hop (MCP), PROPHET 27

Design Space Human Dimension Network Plane Explicit Social Structure Bubble Label Human Dimension Structure in Cohesive Group Clique Label Network Plane Rank, Degree Structure in Degree 28

Centrality meets Community 6/11/2018 Population divided into communities Node has a global and local ranking Global popular node like a postman, or politician in a city Local popular node like Prof. David Johnson in SIGMOBILE BUBBLE 29

Global Community Sub community Sub community Destination Ranking 6/11/2018 Destination Ranking Subsub community Sub community Sub community Source Global Community 30

Centrality meets Community 6/11/2018 Bubble Reality single group 31

Centrality meets Community

Making Centrality Practical 6/11/2018 How can each node know its own centrality in decentralised way? How well does past centrality predict the future? 33

Approximating Centrality Total degree, per-6-hour degree Correlation coefficients, 0.7401 and 0.9511 34

Approximating Centrality 6/11/2018 DEGREE S-Window A-Window (Exponential Smoothing) 35

Approximating Centrality

Predictability of Human Mobility 6/11/2018 Three sessions of Reality dataset Two sessions using the ranking calculated from the first session Almost same performance 37

Distributed Community Detection 6/11/2018 SIMPLE, K-CLIQUE, MODULARITY Terminology : Familiar Set (F), Local Community (C) Update and exchange local information during encounter Build up Familiar Set and Local Community CommunityAccept( ), MergeCommunities( ) 38

SIMPLE Vi Vi λ CommunityAccept ( vi)

SIMPLE γ MergeCommunities ( Co, Ci)

Results and Evaluations Data Set SIMPLE K-CLIQUE MODULARITY Reality 0.79/0.76 0.87 0.82 UCSD 0.47/0.56 0.55 0.40 Cambridge 0.85/0.85 0.85 Complexity O(n) O(n2) O(n4)/O(n2k2) Newman weighted analysis Palla et al, k-Clique

Distributed BUBBLE RAP (DiBuBB) Distributed Community Detection Data Out Data In Forwarding Module Approximating Centrality (e.g. C-Window)

Conclusion and Future Woks 6/11/2018 Improve forwarding efficient Data collection of million participants Community detection of giga-scale (e.g. mobile phone users, social networks) Characterise human social network Model human mobility in multi-level details Mobile social applications Forwarding in metropolitan scale 43