Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.

Slides:



Advertisements
Similar presentations
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
SensMax People Counting Solutions Visitors counting makes the most efficient use of resources - people, time and money, which leads to higher profits in.
Hao Ji, Lei Xie, Yafeng Yin, Sanglu Lu State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China Presenter: Dr. Lei Xie, Associate.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
Bayesian Piggyback Control for Improving Real-Time Communication Quality Wei-Cheng Xiao 1 and Kuan-Ta Chen Institute of Information Science, Academia Sinica.
SOCELLBOT: A New Botnet Design to Infect Smartphones via Online Social Networking th IEEE Canadian Conference on Electrical and Computer Engineering(CCECE)
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.
Viral Video Spread Over Human Space Maruf Hasan Zaber, Mehrab Bin Morshed, Md Habibullah Bin Ismail Department of Computer Science and Engineering (CSE),
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Presentation Topic : Modeling Human Vaccinating Behaviors On a Disease Diffusion Network PhD Student : Shang XIA Supervisor : Prof. Jiming LIU Department.
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.
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
Random Early Detection Gateways for Congestion Avoidance
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
PageRank Identifying key users in social networks Student : Ivan Todorović, 3231/2014 Mentor : Prof. Dr Veljko Milutinović.
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
Mobile Sensor Application Group 4. Introduction Modern smartphones are often equipped with quite a large number of sensors. The sensors data can be used.
An adaptive framework of multiple schemes for event and query distribution in wireless sensor networks Vincent Tam, Keng-Teck Ma, and King-Shan Lui IEEE.
© Y. Zhu and Y. University of North Carolina at Charlotte, USA 1 Chapter 1: Social-based Routing Protocols in Opportunistic Networks Ying Zhu and.
COCONET: Co-Operative Cache driven Overlay NETwork for p2p VoD streaming Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Secure Incremental Maintenance of Distributed Association Rules.
UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
Simulation Of A Cooperative Protocol For Common Control Channel Implementation Prepared by: Aishah Thaher Shymaa Khalaf Supervisor: Dr.Ahmed Al-Masri.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Prophet Address Allocation for Large Scale MANETs Matt W. Mutka Dept. of Computer Science & Engineering Michigan State University East Lansing, USA IEEE.
Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
Whitespace Measurement and Virtual Backbone Construction for Cognitive Radio Networks: From the Social Perspective Shouling Ji and Raheem Beyah Georgia.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Efficient k-Coverage Algorithms for Wireless Sensor Networks Mohamed Hefeeda.
Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets Lynne E. Parker Autonomous Robots, 2002 Yousuf Ahmad Distributed Information.
Stefanos Antaris A Socio-Aware Decentralized Topology Construction Protocol Stefanos Antaris *, Despina Stasi *, Mikael Högqvist † George Pallis *, Marios.
Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks 1 Wei Gao Guohong Cao Tom La Porta Jiawei Han Presented.
Data Dissemination Based on Ant Swarms for Wireless Sensor Networks S. Selvakennedy, S. Sinnappan, and Yi Shang IEEE 2006 CONSUMER COMMUNICATIONS and NETWORKING.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Dijkstra-Scholten and Shavit-Francez termination algorithms
Antidio Viguria Ann Krueger A Nonblocking Quorum Consensus Protocol for Replicated Data Divyakant Agrawal and Arthur J. Bernstein Paper Presentation: Dependable.
Location-Centric Storage for Wireless Sensor Networks Kai Xingn 1, Xiuzhen Cheng 1, and Jiang Li 2 1 Department of Computer Science, The George Washington.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
Real-time Transport for Assured Forwarding: An Architecture for both Unicast and Multicast Applications By Ashraf Matrawy and Ioannis Lambadaris From Carleton.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
Decentralized Trust Management for Ad-Hoc Peer-to-Peer Networks Thomas Repantis Vana Kalogeraki Department of Computer Science & Engineering University.
Efficient Opportunistic Sensing using Mobile Collaborative Platform MOSDEN.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Expediting Peer-to-Peer Simulation using GPU Di Niu, Zhengjun Feng Apr. 14 th, 2009.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
Salah A. Aly ,Moustafa Youssef, Hager S. Darwish ,Mahmoud Zidan
Distributed voting application for handheld devices
Epidemic Alerts EECS E6898: TOPICS – INFORMATION PROCESSING: From Data to Solutions Alexander Loh May 5, 2016.
Introduction Secondary Users (SUs) Primary Users (PUs)
Dijkstra-Scholten and Shavit-Francez termination algorithms
Ling-Jyh Chen and Ting-Kai Huang
By:- Rizwan Malik For Advanced OS Course 2007
Presentation transcript:

Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland MobiHoc ‘12 Presented by YongJoon Chung

Contents  Introduction  iWander  Controlling Infectious Diseases  Facilitating Information Dissemination  Conclusion 2

Introduction  Identifying influential users in mobile social networks.  Previous methods uses centralized algorithms on either friendship or social-contact graphs of all users High computational complexity  Proposes iWander, a lightweight and distributed protocol Extremely low message overhead 3

iWander - Intuition  If a small group of smartphones initialize random walks periodicaaly, influential mobile users may be visited by these random walks more frequently than average. 4

iWander - Protocol  Every ΔT hours, iWander generates probing message with a given probability q on each smartphone. Message only contains a pre-configured time-to-live (TTL) filed L.  When a smartphone receives a probing message, it decreases L by 1, stores it in its local queue, and passes the queued message when different peer is in contact. When L is 0, iWander discards the message.  iWander maintains a random-walk counter The higher the counter gets, the more influential the user is. 5

iWander - Protocol 6 1. Every ΔT hours, senses nearby device 2. With probability q, send length T random-walk message T = 2 Random walk count +1 Queue T = 1

Controlling Infectious Diseases  iWander can be used to control infectious diseases and perform early outbreak detection. Vaccinating people with high random-walk counters first can help to contain spread of flu. 7

Controlling Infectious Diseases  Simulation setup C based simulator on the SIR model for spread of infectious diseases simulation. Used Dartmouth dataset for individual social contact simulation.  Dartmouth dataset – records of association and disassociation events at WiFi access points Comparison with random immunization. 8

Controlling Infectious Diseases 9

10

Facilitating Information Dissemination  iWander can be used for target-set selection of information dissemination Can be used for opportunistic communications and social participation to facilitate information dissemination Use iWander to select target users without requiring global network structure Top k random-walk counters will receive data from server and disseminate to other users. 11

Facilitating Information Dissemination  Simulation setup C based simulator with the same Dartmouth data set for performance evaluation of random-walk based target-set selection Compare the performance with random selection. Also compare with hybrid method which uses 10% from 1-set random walks and 90% from low centrality. 12

Facilitating Information Dissemination 13

Facilitating Information Dissemination 14

Conclusion  The paper proposed a light weight and distributed protocol for identifying influential mobile users who have high centrality in their social-contact networks.  iWander was evaluated for two applications and outperformed the random approach. 15

Thank you! 16