1 Contact Prediction, Routing and Fast Information Spreading in Social Networks Kazem Jahanbakhsh Computer Science Department University of Victoria August.

Slides:



Advertisements
Similar presentations
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
Advertisements

An Adaptive Compulsory Protocol for Basic Communication in Ad-hoc Mobile Networks Ioannis Chatzigiannakis Sotiris Nikoletseas April 2002.
An Interactive-Voting Based Map Matching Algorithm
LEARNING INFLUENCE PROBABILITIES IN SOCIAL NETWORKS Amit Goyal Francesco Bonchi Laks V. S. Lakshmanan University of British Columbia Yahoo! Research University.
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.
A Unified View to Greedy Routing Algorithms in Ad-Hoc Networks
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
Infocom'04Ossama Younis, Purdue University1 Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach Ossama Younis and Sonia.
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
Worm Origin Identification Using Random Moonwalks Yinglian Xie, V. Sekar, D. A. Maltz, M. K. Reiter, Hui Zhang 2005 IEEE Symposium on Security and Privacy.
SLAW: A Mobility Model for Human Walks Lee et al..
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Heiko Schröder, 2003 Parallel Architectures 1 Various communication networks State of the art technology Important aspects of routing schemes Known results.
Are You moved by Your Social Network Application? Abderrahmen Mtibaa, Augustin Chaintreau, Jason LeBrun, Earl Oliver, Anna-Kaisa Pietilainen, Christophe.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
SOCIAL-BASED FORWARDING SCHEMES Rance Fredericksen CMPE 257 Wireless Networks.
Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.
Distributed Token Circulation in Mobile Ad Hoc Networks Navneet Malpani, Intel Corp. Nitin Vaidya, Univ. Illinois Urbana-Champaign Jennifer Welch, Texas.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
Bubble Rap: Social-based Forwarding in DTNs Pan Hui, Jon Crowcroft, Eiko Yoneki University of Cambridge, Computer Laboratory Slides by Alex Papadimitriou.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
1 A DATA MINING APPROACH FOR LOCATION PREDICTION IN MOBILE ENVIRONMENTS* by Gökhan Yavaş Feb 22, 2005 *: To appear in Data and Knowledge Engineering, Elsevier.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)
Information Brokerage and Delivery to Mobile Sinks HyungJune Lee, Branislav Kusy, Martin Wicke.
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.
Social Feature-based Multi-path Routing in Delay Tolerant Networks
Primary Social Behavior aware Routing and Scheduling for Cognitive Radio Networks Shouling Ji and Raheem Beyah Georgia Institute of Technology Zhipeng.
Switch-and-Navigate: Controlling Data Ferry Mobility for Delay-Bounded Messages Liang Ma*, Ting He +, Ananthram Swami §, Kang-won Lee + and Kin K. Leung*
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
Lab for Advanced Network Design, Evaluation and Research Mobility Profile based Routing Within Intermittently Connected Mobile Ad hoc Networks (ICMAN)
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.
1 Mobile-Assisted Localization in Wireless Sensor Networks Nissanka B.Priyantha, Hari Balakrishnan, Eric D. Demaine, Seth Teller IEEE INFOCOM 2005 March.
Optimal Selection of Power Saving Classes in IEEE e Lei Kong, Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University.
Group 8: Denial Hess, Yun Zhang Project presentation.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Efficient k-Coverage Algorithms for Wireless Sensor Networks Mohamed Hefeeda.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
QoS Supported Clustered Query Processing in Large Collaboration of Heterogeneous Sensor Networks Debraj De and Lifeng Sang Ohio State University Workshop.
An Evaluation of Routing Reliability in Non-Collaborative Opportunistic Networks Ling-Jyh Chen, Che-Liang Chiou, and Yi-Chao Chen Institute of Information.
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
COSC 5341 High-Performance Computer Networks Presentation for By Linghai Zhang ID:
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
An Adaptive Zone-based Storage Architecture for Wireless Sensor Networks Thang Nam Le, Dong Xuan and *Wei Yu Department of Computer Science and Engineering,
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Supervised Random Walks: Predicting and Recommending Links in Social Networks Lars Backstrom (Facebook) & Jure Leskovec (Stanford) Proc. of WSDM 2011 Present.
Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Reliable Mobicast via Face- Aware Routing Qingfeng Huang,Chenyang Lu and Gruia-Catalin Roman Department of Computer Science and Engineering Washington.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Context-aware Adaptive Routing for Delay Tolerant Networking
SLAW: A Mobility Model for Human Walks
Introduction to Wireless Sensor Networks
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Korea University of Technology and Education
GANG: Detecting Fraudulent Users in OSNs
Presentation transcript:

1 Contact Prediction, Routing and Fast Information Spreading in Social Networks Kazem Jahanbakhsh Computer Science Department University of Victoria August 2012

2Outline Problem Definition and the Context Routing in Mobile Social Settings Human Mobility and Contact Event Collecting Contact Data Contact Prediction Hidden Contact Prediction Fast Information Spreading Conclusions, Major Contributions and Future Work

3 Problem Definition Message routing, human contact prediction and fast information spreading in the context of human social networks.

4 Routing in Mobile Social Settings Motivation : First empirical evaluation of Milgram's experiment in mobile settings Social Profile : Set of social characteristics for a user: o Affiliation, Hometown, Language, Nationality, Interests and so on Goal : Designing an efficient routing algorithm Efficiency : Minimizing message forwardings & Maximizing the probability of message delivery Assumptions & Constraints : Message delivery in physical proximity Sender knows the destination social profile

5 Social-Greedy Routing Algorithms Approach : a greedy strategy by computing similarities between people social profiles o Social-Greedy I : Sender forwards the message “m” to nodes socially closer to destination. o Social-Greedy II & III : Variations of Social-Greedy I. Our work is different from previous work because we only make use of social profiles of people for routing! Real Data : Infocom 2006 contact trace - 79 people - a brief version of social profiles

6 SDR & Cost Performance Results for Different Routing Schemes (TTL=9h)

7 Human Mobility & Contact Data Kenny Eric Eric Kenny 10:00AM 10:10AM Kenny Eric 10:00AM 10:10AM Contact Event: 10:00-10:10 AM 7

8 Contact Graphs Eric Butters Kenny Sara Katy Jack Kyle

9 Collecting Data from Different Social Settings

10 Real Data Descriptions DatasetInf 05Inf 06MITCambRoller Sensors Length3 days4 days246 days11 days3 hours Scanning Time120 sec 300 sec600 sec15 sec Ext. Nodes Total Cont Ext. Cont Ext. Cont. %25%20%64%74%55% DatasetNo. of NodesNo. of Edges Facebook

11 Contact Prediction: Problem Definition and Assumptions

12 Social Information & Small- World Network Properties Birds of a Feather (Homophily) Using Social Profiles: o Jacard Social Similarity (Jac) o Social Foci Similarity (Foci) o Max Social Similarity (Max) Using Contact Graphs: o Transitivity: Number of Common Neighbors (NCN) o Low Diameter : Shortest Path (SP) Random Walk (RW) How to reconstruct?

13 Contact Prediction Results Infocom 2006

14 Hidden Contact Prediction

15 Hidden Contact Prediction: Reconstruction Algorithm Methods : o Time-Spatial Locality : NCN, Jacard & MIN o Contact Rates : Popularity o Social Similarity : Foci & Jacard o Social Similarity-NCN : Foci-NCN Algorithm : For each compute and store quadruples in Sort in a descending order using similarity scores Output the first number of quadruples

16 Hidden Contact Prediction Results Infocom 2006

17 Supervised Learning Approach Techniques : o Logistic Regression o K-Nearest Neighbor (KNN) Extracted Features : o Contact Graph-based (Degree, Product of degrees, NCN) o Contact Duration o Social Profiles o Static Sensors Session TypeKeynoteLunch BreakCoffee Break TPR0.18/ / /0.43 FPR0.03/ / /0.02 Accuracy81%/78%84%/81%92%/92% RMSE0.42/ / /0.24 Prediction Results (Logistic Regression/KNN) 17

18 Input : social graph G=(V,E) & a unique message for each node Communication Model : synchronized Constraints : no global information & one contact per round Termination : when every node receives all messages Goal : analyzing running times of three information spreading algorithms Fast Information Spreading in Social Networks 18

19 Information Spreading Algorithms Random push-pull : o In each round, every node randomly chooses one of its neighbors for message exchange Doerr : o In each round, every node randomly chooses one of its neighbors except the one that has been just contacted Censor : Hybrid strategy: o Even rounds: each node runs random push-pull o Odd rounds: each node chooses one of its neighbors in a sequential manner from its Bottleneck List

20 Empirical Results from Facebook Graph Running Times Without 1-whiskers Running Times on Original Facebook Graph 20

21 Conclusions & Future Work Major Contributions: Social-Greedy Algorithm : o Suitable for bootstrapping wireless devices Contact Prediction : o Social Similarity methods, SP and RW outperform random o Foci-NCN provides the best precision results o Supervised learning is an effective technique for contact prediction Information spreading : o Censor performs well for spreading information in social networks Future Work : o Proposing more efficient predictors for large geographical spaces o Final Goal: Predicting where people go next and who they will meet there!

22 Hidden Contacts Prediction Results MIT Campus Performance Evaluation (no of external nodes = 73) log 2 Rank T h e P e r c e n t a g e o f T r u e P o s i t i v e s NCN Jac Min Pop Rand

23 Supervised Learning Results Session TypeKeynoteLunch BreakCoffee Break degree degree prod.336 ncn112 total overlap221 social564 ncsn643 Ranking Features 23

24 Examples of 1-Whiskers 24